p x__TEXT,,__text__TEXT__stubs__TEXT@\C@__stub_helper__TEXTo__cstring__TEXTU__gcc_except_tab__TEXT0,X30,__const__TEXT;,;,__unwind_info__TEXTp=,Bp=,8__DATA_CONST,@,@__got__DATA_CONST,,: __mod_init_func__DATA_CONSTЀ,PЀ, __const__DATA_CONST ,` ,8__DATA,,__la_symbol_ptr__DATA,Y,T __data__DATA-1-__bss__DATAK1 H__LINKEDIT1 1  /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonDataModelPython310D-8.1.1.dylib"01.1 "1hp1m B4`3P41&]7P P_ `7"\ww<2   a* /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonTransformsPython310D-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonMiscPython310D-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonSystemPython310D-8.1.1.dylib x/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonDataModel-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonMathPython310D-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonCorePython310D-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkWrappingPython310Core-8.1.1.dylib /Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonTransforms-8.1.1.dylib x/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonMisc-8.1.1.dylib x/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonMath-8.1.1.dylib x/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonSystem-8.1.1.dylib x/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtkCommonCore-8.1.1.dylib p/Volumes/Data/workspace/med-macos-free/build/ExtProjs/VTK/lib/libvtksys-8.1.1.dylib 0/usr/lib/libc++.1.dylib 8< /usr/lib/libSystem.B.dylib&u4H*)ȟ4UHH=E,H5ޗ,H1p1zҖ,uƽH,H=,GH,]fDUHSPHH=,H5,Ho1%},uqHƖ,H=,H5oH,H肼t H ,tH[]H=,H[]vf.@UHAVSH0HuHqHEЋFEHEHEH}ȃu\Hu8t^H]H=oH3AtH=vHt HLLcڻHuL߻X1H0[A^]ÐUHAWAVSH(HuHqHED~D}HG]ԉ]؅y"HHLw(HEMA)AuQHuH}Qt|}L}tYH=,nLFAtOH=uL-tteH}Hu-tTH5rH}HUm}t:H}HuH袷HuHc觷H8[]þ1H8[]ÐUHH=,H5,Hr1誷,u H˓,H=Ē,wH,]fDUHSPHH=,H59,Hq1U-,u Hv,H=o,"H5qH\,H貶t H I,tH[]H=9,H[]馷f.@UHAVSH0HuHlHEЋFEHEHEH}ȃuoHuhtqH]H=qHcAt1H=@HJtH=pH7t HiLcHuLu1H0[A^]f.@UHAWAVSH(HuHkHED~D}HG]ԉ]؅y2HHLw(HEMA)AuhHuH}a}L}tlH=oLRAtbH=/L9tOH=oL&t}utBA9v`tAv`IL/Hu6H}豾1H([A^A_]ILhHuH+HfDUHAVSH HuHRtHEDvDuHG]]y THHt H(HtD9uEt"_`}Ht*11H}111 HpSHuHcXHHH [A^]UHAVSH HuHuHEDvDuHG]]y 褽HHt+H(Ht"D9u!Et-Hh­Ht(1.H}111FHx蚭HuH.+HHH [A^]f.DUHAVSH HuHuHEDvDuHG]]y HHt(H(HtD9uEt*H1hHt(1.H}111艼HݬHuHq+HHH [A^]fUHAWAVSH(HuHnvHED~D}HG]ԉ]؅y 2HHtaLw(MtXA)Au}utBA9v\tAv\IL/Hu6H}豻1H([A^A_]ILHuH+HfDUHAVSH HuHvHEDvDuHG]]y THHt H(HtD9uEt"_\}Ht*11H}111 HSHuHcXHHH [A^]UHAVSH HuH7wHEDvDuHG]]y 褺HHt+H(Ht"D9u!Et-HªHt(1.H}111FH蚪HuH.+HHH [A^]f.DUHAVSH HuHwHEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111艹HݩHuHq+HHH [A^]fUHAWAVSH(HuHxHED~D}HG]ԉ]؅y 2HHtaLw(MtXA)Au}utBA9vdtAvdIL/Hu6H}豸1H([A^A_]ILHuH+HfDUHAVSH HuHbxHEDvDuHG]]y THHt H(HtD9uEt"_d}Ht*11H}111 HSHuHcXHHH [A^]UHAVSH HuHxHEDvDuHG]]y 褷HHt+H(Ht"D9u!Et-H§Ht(1.H}111FH蚧HuH.+HHH [A^]f.DUHAVSH HuHOyHEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111艶HݦHuHq+HHH [A^]fUHAWAVSH(HuHyHED~D}HG]ԉ]؅y 2HHtaLw(MtXA)Au}utBA9vhtAvhIL/Hu6H}豵1H([A^A_]ILHuH+HfDUHAVSH HuHrzHEDvDuHG]]y THHt H(HtD9uEt"_h}Ht*11H}111 HSHuHcXHHH [A^]UHAVSH HuHC{HEDvDuHG]]y 褴HHt+H(Ht"D9u!Et-H¤Ht(1.H}111FH蚤HuH.+HHH [A^]f.DUHAVSH HuH{HEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111艳HݣHuHq+HHH [A^]fUHAWAVSH8H+HHEDNHGDDD)ЍHH Hc HH Hz|H(D048EyHHJH_(H=H`H H@H ӲH5H HUx}IH5H HUT}4~H`H@HLI~H5{wH Hi{H(D048EyݱHHH_(H,H H` H HuűH HH H˱H HurH HuUH LL腱aHpHP(`)@EEEEEEEEE4HH`HUHLELMHAVH HyH(D048EyHH H_(HCH H`#H HuܯH HH HH Hu良H HulH L L蜯xH LL蜯ZHpHP(`)@EEEEEEEEE4H`HUHLELMHAWAVH H{wH(D048EyHHH_(H>H H`H Hu׭H HH HݭH Hu脭H HugH L L藭sH LL藭UH5WH Hͬ.HpHP(`)@EEEEEEEEE4HH`HUHLELMHPAWAVH 1HG1H:1H-L H`H@HLIAHt 1H +H H;Mu&H8[A^A_]HcΛH +H H;MtHHH`HUHLELMHAVH`f.@u*z(hf.Huzpf.Pu{$4HuH H`1qEf.u$z"Ef.uzEf.u{$ݚHuH HU蹚HuH Ef.u$z"Ef.uzEf.u{$cHuH HU蠪Ef.u$z"Ef.uzEf.u{$ HuH HUIHH :HH`HUHLELMHAWAVH`f.@u*z(hf.Huzpf.Pu{$RHuH H`1菩Ef.u$z"Ef.uzEf.u{$HuH HU8טHuH %Ef.u$z"Ef.uzEf.u{$聘HuH HU辨Ef.u$z"Ef.uzEf.u{$*HuH HUgHu H \HHH NLHH`HUHLELMHPAWAVAH f)f.fUHAWAVSHH9+HHE^HG)ЃJHpH?uHx]UUy触HHH_(HwHpHu详ZHpHu蒦=HpHu%HpHu谦 HpHh胦E@EPE`E8EHEX}HuHUHMLELhHBHpHsHx]UUyfHHtH_(H6HpHunHpHuQH5}HpHU}IHpHu聥HpHuKHpLhLE@EPE`E8EHEX}L<$HuHULELMHLH5r1H J+H H;MHĸ[A^A_]1HZ1HHHuHUHMLELhHEf.@u$z"Ef.PuzEf.`u{!ʓHuHpHU1 Ef.8u$z"Ef.HuzEf.Xu{$vHuHpHU賣RHtHHt/>HAHUHp訢HuыUHprH]hHp?HL<$HuHULELMHLEf.@u$z"Ef.PuzEf.`u{!~HuHpHU1辢Ef.8u$z"Ef.HuzEf.Xu{$*HuHpHUgHtHt+HuX=HUHp`ёHuՋUHp*賑HuhHp萑H$H +HH f+H H;Mx@UHAWAVATSHH7+HHE؋^HG)ЃvHpHqHx]UUy蜠HHH_(HhHpHu褠KHpH0Š0HpHulHpHuHpHu芠HpHh]E@EPE`E8EHEX}0HuHUHMLELhHPHpHRpHx]UUy8HH7H_(HHpHu@HpH0aHpHuH54{HpHU譞}IHpHu8sHpHu[HpLhLҞ=HpL,LƞE@EPE`E8EHEX}0HuHULELMHLATAW衺HpHnHx]UUy菝HHH_(H[HpHu藝>HpH0踝#HpHu_H5yHpHU}IHpHu菝HpHuYHpLhL)E@EPE`E8EHEX}0HHuHULELMHLAWH5#m1H N+H H;MH[A\A^A_]1H1Hg1HMHHuHUHMLELhHHEf.@u$z"Ef.PuzEf.`u{!輋HuHpHU1Ef.8u$z"Ef.HuzEf.Xu{$hHuHpHU襛DHt:Ht/0HAHUHp蚚 HuыUHpdHhHpPHHHuHULELMHLAW HHEf.@u$z"Ef.PuzEf.`u{!gHuHpHU1觚Ef.8u$z"Ef.HuzEf.Xu{$HuHpHUPHtHt/ۉHpAHUHpE趉HuыUHp蘉H-hHpqHHHuHULELMHLATAW(HHEf.@u$z"Ef.PuzEf.`u{!HuHpHU1AEf.8u$z"Ef.HuzEf.Xu{$譈HuHpHU艈HtQHtfuHtzkH]HHdH 5+H H;MGHUHp託HuUHprHuhHpI؇Hm,Hp*資HCQDUHAWAVAUATSHhHuHvmHEFEHGMĉMȅyHH|L(H}E11膖AC6HcHxLxEIcI\IDME+EăH}LDՖH5sH}HU}}EEArKLH9J I91D)HHLHtfI|HI,H7M,H 0`-H,u H={G,`HoG,]f.UHAVSHtH 3IHH諞E1L[A^]HLHa UHSPHH=G,H5H,HL,H T`G,u H=F, `H5_HF,H_t H F,tH[]H=F,H[]`DUHSPHHHtHPHH[]_f.UH]_fDUHAWAVATSHAHHEHEL%$F,L9gteH5^HUoIHt^"c_uH+H8H5*`F^1H[A\A^A_]ÐUHAWAVAUATSH(HH+HHEHtNH]HtAH*+H8H5_]1Hʝ+HH;EHH([A\A]A^A_]Ë{HHxHc HH8Hs]H@HHDžLH8H1lAHcHmHHH߾lAHcHlHHH8NlAHcH}lHEHH8#lAHcH`lH`Dž\H+LH8HDtlH8HDhlH8HD8lH8HDlP;H}H8H\Cl ID\HHHHI?H=[L8\HO 語HH1H+HH;EH=n[HH([A\A]A^A_][HX+HH;EmH=H,1HH([A\A]A^A_]IxHH[HHDžDžHHujHH`j ĝHHuH`H.H=ZH[HH5zZ%jHHbZHHDžDžHHujeHH`mjJHH8Rj/HH7jHH\jHH4j 賜HËu`8DD\4$HH8i1H`HhH9t HtH}HEH9t HtHHH9t HtHHH9 Hś IL贛50IH裛I9I4IFIAIYITIH`HhH9t HtZH}HEH9t HtCHHH9t Ht&HHH9t Ht LCY tUHAVSH HuH ZHEDvDuHG]]y gHHt1HGHt(D9u'HHH(eR+@WHt1H}111 g H+HHH [A^]f.fUHAWAVSH(HuHYHEDvDuHG]ԉ]؅y fHHt^LMtUA)Au9HuH}/gt;HcEEtA\VHu#1D9@VH}Tf1H([A^A_]f.UHAWAVSHHH^CHH HcHHUHnYHE]HFAAD}D}yHHeHHjLvEMID)H}'Hu0f%H}HufH}HufH}HueH}HueH}HueM;M}H}HueEűUЋMDEDM܋]LPSfH;UHukHϔ+HaHHHH[A^A_]e)H=B,HH[A^A_]rHHHH[A^A_]'H5Wrdgd1HH[A^A_]E1EMސ~::f.fUHAWAVSHxH\+HHEFIHuH6YHEEHGEEycHHLMH}HucH}HuкcE)p]E)EDuHuHULѕ~Efvpf8%fPt t9]tsSHuH}HU1c~EfvEf8%fPtt D9u0SHH}HUоHuHWHEEHGEEybHHLwMH}Hubty(E)E]D}HuL躔foEfvEP<u 9]uD9}tiRHuH}HU1bKRHuHߑ+HH5$Wa1H +H H;Mu-Hx[A^A_]þaҾaUHAVSHPH+HHEFzHuHWHEEHGẺEЅy3aHHHHH;Q觓HQQHHXQHH&+HH;E6HuH WHEEHGẺEЅy`HHLwMH}Huغ`E)E]HuL~EfvEf8%fPt t9]txPHuH}HU1`ZPHu*H+HH4+HH;Et"KH5$V_1H+HH;Eu+HHP[A^]H}111_H+HH;Etv_UHAVSHPH+HHEFnHuHTVHEEHGẺEЅy#_HH<LwM/H}AHuغ8_ E)E]HuLp~EfvEf8%fPt t9]tNHuH}HU1L_NHHi+HH+HH;EHuH^UHEEHGẺEЅy -^HHtJHHtAxl蹐HWNHu+HbNHH0+HH;Et"\H5T]1H+HH;EuHGHt5D9u4Hɻ9H|H 9H| H19HJHt1H}111Y HIHHH [A^]f.@UHAVSH HuHTHEDvDuHG]]y DYHHt>HGHt5D9u4Hɻ9H|H 9H| H19HOIHt1H}111X H IHHH [A^]f.@UHAWAVAUATSHXF ;HuHSHEEHGM̉MЅyjXHHAH_H}E11WAC6HcH}QXHuHuH0E+ẼH}DOX H}HuXHuHUH薆'HHuHUH}1DdW HHuHUH}~WGHuHRHEEHGM̉MЅyjWHHHLH}E11VAC6HcH}WWLmEIcI\IDM%E+ẼH}LDGWEEArKDH9JI91HHLLHtfAt4HHuHOfDAL ALLALLAL L HI9uH5[Q7VE1lH}"V:H} V"1E1DHpHHH‰уHs1iHH)1ADALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpH HuHt)HHADALD H HuL9LL E~61DAL; u HI9ugEHuH}1LDULEHt,E1H}HEH9t HtLHX[A\A]A^A_]L%+I$H}HEH9uHH}HEH9t Ht跇HE f.UHAWAVAUATSH8HuHLQHEFEHGMMy@THHDLH}11SAC6HcH}(TLeMcMELDM/E+EH}LDTH}HueTDEA rII9IDI91HHHHHtfDA ALHHuH=@A ALALALALALALALHH9uH}R1H}HEH9;@E1؃HpHHH‰уH`s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt,HHDADA ADALH HuH9HULL\E~41A A:Lu HH9u5BHuH}1LDRBHt+1H}HEH9t Ht΄HH8[A\A]A^A_]H+HH}HEH9uHH}HEH9t Ht艄HB f.UHAWAVSH8HuHOHEDvDuHG]̉]ЅyQHHLHEMt]A)AuXH5AH}HUPHt.IH}HuGQtULLc@HtS1H}Hu$814H}iP1H}HtHuA HE1HH8[A^A_]r@HH}HuUHAWAVSH(HuHOHED~D}HG]ԉ]؅yOHHLwHEMtFA)AuAH5?H}HUOHtLH?HtS1H}Hu$814H}`O1H}HtHu@ HE1HH([A^A_]i?HH}Huf.DUHAWAVSH(HuHNHED~D}HG]ԉ]؅y NHHtWLwMtNA)Au2HuH}?Ot4uLJ}>HuH~+HH}kN1H([A^A_]fUHAWAVSH(HuHNHED~D}HG]ԉ]؅y 2NHHtWLwMtNA)Au2HuH}Nt4uL|C>HuH}+HH}M1H([A^A_]fUHAWAVSH(HuHNHED~D}HG]ԉ]؅y MHHtWLwMtNA)Au2HuH}Mt4uL{=HuH'}+HH} M1H([A^A_]fUHAWAVSH(HuHMHED~D}HG]ԉ]؅y LHHtWLwMtNA)Au2HuH}/Mt4uL4{<HuHw|+HH}[L1H([A^A_]fUHAVSH@H|+HHEF(HuH+MHEEHGẺEЅyLHH7LwMH}HuXLH}HuCLH}Hu.Lu܋UMLzkHuHLHEEHGẺEЅy [KHHtSLwMtJxrHuH}|Kt0HuLyk;HuHz+HH5LJ1H 3{+H H;Mu=H@[A^]þJH}JE1M ~UHAWAVSH(HuH'LHED~D}HG]ԉ]؅ybJHHLwHEMtFA)AuAH5g:H}HU.JHtLHx]:HtS1H}Hu$814H}I1H}HtHu'; HE1HH([A^A_]9HH}Huf.DUHAVSH0HHzHUHKHEEHFEԉE؅yHH4IHHLvMH}HuItiH}HuyItXH}HuhItGuUML{9Hu*8"H=n&,H0[A^]VH51K{H1H0[A^]þgHE1MVf.UHAWAVSHxHx+HHEHxHKHED~D}HG]]yHHHLwMA)HxAHu_HHxHuHHEHE(E)EuHULzE;Eu(E;Eu E;EuE;EuE;EuE;Et$7HuHxHUG7HuHw+HG1H Qw+H H;MuHx[A^A_]E1MNzf.UHAWAVSH(HuHKHED~D}HG]ԉ]؅y FHHtWLwMtNA)Au2HuH}Ft4uLt6HuHGv+HH}+F1H([A^A_]fUHSH(HuHgKHEFEHEtH}111E@6Ht1 E6HHH([]UHSHXHv+HHEHuHKHEFEHEHEH55H}HUEHHH}HuEH}HuEH}HuEH}HufEEEHEHE؋űUЋMLEHgsËE;EuE;EuE;Et! 5HuH}HUrE4Hu Hc5HH}vD1H}Ht Hu5Ht+HH;Eu HHX[]wfDUHSHH}t+HHEH(H6,H0F8HDž<HDžH^H5(4H(HHCHQHH(HuкC1H(HuCH(HuC(E(M(U)p)`)PHuHUHMHqEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$,3HuH(HUiC3Hu.Hr+HHHHu&.H(qB1HHHt Hu3Hr+HH;Eu HH[]uf.UHSHHmr+HHEHHHJHPFXHDž\HDžhH52HHHhAH HHHHuкAHHHuAHHHuAHEHE(E)pHuHUHMHoEf.pu!zEf.xuzEf.Eu{$`1HuHHHUA<1Hu.Hp+HHhHu&.HH@1HhHt Hu1Hp+HH;Eu HHĸ[]sf.DUHSHHp+HHEHuHJHEFEHEHEH5W0H}HU@HHH}Huк0@H}Hu@H}Hp:@tvH}Hx&@tbH}Hu@tQpxUHuHUHn/Hu /HH}6?1H}Ht Hu0Hno+HH;Eu HHĈ[]wrUHSHH=o+HHEH HIH(F0HDž4HDžH5.H H>HHH Huк>H Hu>zH Hu~>]H Hus>@H H`A> EEHEHx(`)@HpHPHuHUHMLEL`H1lËE;xuE;|uE;Et$-HuH HU->`f.@u*z(hf.Huzpf.Pu{'~-HuH H`=W-Hu#Hc\-HH <1HHt Hu.Hm+HH;Eu HH[] pDUHAWAVSHHHl+HHEHuH/HED~D}HG]]yT<HHLwEMA)AH}AuoHuԺ]<tlH}HuȺG<tVE;E}H}Hue<t8MHuHUL,j,HuHk+H;1H k+H H;Mu HH[A^A_]E1EMAnf.UHAWAVSHXHk+HHEHuH.HED~D}HG]]y;HHLwEMAArH}:`HuH} ;tJE;E}HuH}(;t,UHuLh*HuHlj+H E1H j+H H;Mu HX[A^A_]mf.@UHAWAVSH8Hlj+HHEHuH<HED~D}HG]ĉ]ȅy 9HHtpLwMtgA)AuKHuH}:tHHuLpl)Hu0)H i+H H;Mt*lH}d91H i+H H;MuH8[A^A_]f.UHAWAVSH(HuH;HED~D}HG]ԉ]؅y9HHLwHEMtFA)AuAH5)H}HU8HtLHk )HtS1H}Hu$814H}81H}HtHu) HE1HH([A^A_](HH}Huf.DUHAVSH0HuH`(HEЋFEHEHEuQH5:(H}HU8HtKHÿ 1kIHHfH=(L(HH}Hu (H}Ⱦ71H}Ht Hu(HH0[A^]HLjH( UHAVSH@Hg+HHEHuH'HEFEHEH}uOHuкo7tL ajHHuHeH=5'H'H 0g+H H;Mt&Fj61H g+H H;MuH@[A^]IHiL ( UHH=,H5N,H?C1*'B,uv'H,H=,&Hx,]fDUHSPHH=`,H5,HB1&,u!'H6,H=/,&H5BH,H2&t H ,tH[]H=,H[]&'f.@UHAVSH0HuHHEЋFEHEHEH}ȃu\Hu5t^H]H='BHhAtH=;Hht H3Lc%HuL%51H0[A^]ÐUHAWAVSH(HuH\HED~D}HG]ԉ]؅y4HHLw(HEMA)AuQHuH}5t|}L}tYH=:ALgAtOH=NLgtHPE1LE3Hu+H}Ⱦ+1H0[A^]E1HuL,UHAVSH HuHHEDvDuHG]]yd+HHH(HD9u3HPxHt9HHH5>HPE1LEfHucH}111*RE1FHuCL+Ht6HHt)HHH1Q@H߾l1HH [A^]UHAWAVSH(HuH@HED~D}HG]ԉ]؅y b*HHtaLw(MtXA)Au}utBA9vdtAvdIL_Hu6H})1H([A^A_]IL'HuHY+HfDUHAVSH HuHVAHEDvDuHG]]y )HHt1H(Ht(D9u'H11HuH}utBA9vptAvpILHu6H}q!1H([A^A_]IL@HuHKQ+HfDUHAVSH HuHCHEDvDuHG]]y !HHt H(HtD9uEt"_p=Ht*11H}111  HHHuHcHHH [A^]UHAWAVSH(HuH6CHED~D}HG]ԉ]؅y b HHtYLw(MtPA)Au4HuH} t6EL(+qHuHP+HH}1H([A^A_]UHAWAVSH(HuHCHED~D}HG]ԉ]؅y HHtSLw(MtJA)Au.HuH} t0}ut4Lb*Hu6H}?1H([A^A_]ILHuHO+H@UHAVSH HuHBHEDvDuHG]]y HHtHG(HtD9uHcXtHt1H}111 HHHH [A^]UHH=5,H5,HBH 0,uZH,H=,H,]ÐUH]fDUHSPHH=,H5i,HoBH X,uZH,H=,}H5;BH,H t H t,tH[]H=d,H[]fUHAVSH0HuHuHEЋFEHEHEH}ȃuoHutqH]H=AHPAt1H=LHPtH=HPt HLcW HuL\ 1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=@LOAtbH=KLOtOH=LOtHPE1LE HucH}111<RE1 HuCL-Ht6HH t)H HH1Q@H߾ 1HH [A^]UHAVSH HuH}@HEDvDuHG]]y HHt!H(HtD9uEt#H_P Ht+12H}111`!H8H HuHHHHH [A^]DUHAWAVSH(HuH`@HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5oHH}HU}t0}t7LHo Hu9H}1H([A^A_]ILH@HuH]H+HUHHHztuHH]]H=,]%H5@ 1]UHSH(HuHAHEFEHEtH}111!H(Ht1 HHHH([]f.UHSH(HuHAHEFEHEtH}111c!>HHt1 HKHHH([]f.UHSH(HuHiAHEFEHEtH}111!HHHt1 HHHH([]f.UHSH(HuHAHEFEHEtH}111!4HHt1 HkHHH([]f.UHSH(HuHAHEFEHEtH}111!HhHt1 HHHH([]f.UHSH(HuHBHEFEHEtH}111!xHHt1 HHHH([]f.UHSH(HuHBHEFEHEtH}1113!HHt1 HHHH([]f.UHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$ZHt(1.H}111HHuHgD+HHH [A^]UHAWAVSH(HuHAHED~D}HG]ԉ]؅y "HHt\Lw(MtSA)Au7H5CH}HU}t0}t7LH$Hu9H}1H([A^A_]ILHHuH}C+HUHAWAVSH(HuHAHED~D}HG]ԉ]؅y BHHt\Lw(MtSA)Au7H5BH}HU}t0}t7LHDHu9H}1H([A^A_]ILH HuHB+HUHAVSH HuHAHEDvDuHG]]y dHHt%H(HtD9uEt'8HHt+1>H}111 -HH]HuHHx]bHHH [A^]DUHSH(HuH9HE؋FEHEEȃrH}о1[H5hAH}HUH1}tH5@H}HU}t7H HHu"HH([]H}о1H([]ÐUHH=+H5.+Hf@H 0+uLHf+H=_+HS+]ÐUH]x#fDUHSPHH=0+H5+H@H +uLH+H=+}H5?H+H t H +tH[]H=+H[]fUHAVSH0HuHuHEЋFEHEHEH}ȃuoHutqH]H=>?HBAt1H=>HBtH=HBt H LcWHuL\1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=->LAAtbH==LAtOH=LAtHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5/H}HU~ }t0}t7LHHu9H}6 1H([A^A_]ILH8yHuH ;+HUHAVSH HuH >HEDvDuHG]]y HHt!H(HtD9uEt#H_XHt+12H}111 !H@HHuHh HHH [A^]DUHAWAVSH(HuH >HED~D}HG]ԉ]؅y " HHt\Lw(MtSA)Au7H59H}HU }t0}t7LH $Hu9H} 1H([A^A_]ILHHHuH}9+HUHAVSH HuH>HEDvDuHG]]y D HHt%H(HtD9uEt'JHhHt+12H}111!HPH=HuH HHH [A^]ÐUHAVSH HuH\>HEDvDuHG]]y HHtH(HtD9uHt1H}111B HHH [A^]f.@UHAWAVSH(HuHO>HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}Ut5uLHHuHH}z1H([A^A_]ÐUHAWAVSH(HuH.>HED~D}HG]ԉ]؅y BHHt`Lw(MtWA)Au;H5z+H}HU}t4LHJHuH6+HH}1H([A^A_]fUHAWAVSH(HuH=HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5*H}HUN}t4LHcHuH6+HH}1H([A^A_]fUHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111oHHuHW5+HHH [A^]UHAWAVSH(HuH2HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5q4H}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHm4+HUHAWAVSH(HuH2HED~D}HG]ԉ]؅y 2HHt\Lw(MtSA)Au7H53H}HU}t0}t7LH=4Hu9H}1H([A^A_]ILHHuH3+HUHHHztuHH]H=V+]H50+:1]UHAVSH HuHR2HEDvDuHG]]y HHt%H(HtD9uEt'JH8Ht+1>H}111-HH HuHHx HHH [A^]DUHSH(HuHS*HE؋FEHEEȃrH}о51[H52H}HU/H1}tH5i1H}HU}t7HHHu"HbH([]H}о@1H([]ÐUHH=+H5+HT<H 0 +u=HV+H=O+HC+]ÐUH]fDUHSPHH= +H5+H;H `+u8=H+H=+-H5;H+Ht H +tH[]H=+H[]fUHAVSH0HuH%HEЋFEHEHEH}ȃuoHuxtqH]H=,;Hs3At1H=j/HZ3tH=HG3t HyLcHuL 1H0[A^]f.@UHAWAVSH(HuH̥HED~D}HG]ԉ]؅yBHHLw(HEMA)AuhHuH}q}L}tlH=:Lb2AtbH=Y.LI2tOH=L62tH5I%H}HUo}t7HHHu"HBH([]H}о 1H([]ÐUH]ÐUHAVSHR/HH=$+L5lHL3(H+/HFH=$+HL[A^](UHH=+H5N+Hq8H 05=+uH+H=+Hs+]ÐUH]$fDUHSPHH=P+H5+H 8H +uHH!+H=+H57H+H-t H +tH[]H=+H[]!fUHAVSH0HuHHEЋFEHEHEH}ȃuoHutqH]H=I7H&At1H=eHH&tH=(H&t HLcwHuL|1H0[A^]f.@UHAWAVSH(HuH<HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=86L%AtbH=TGL%tOH=L%tEH}HLLHMEȃ}~?1HMAf.uzHH9puiHuH}1LHM}~?1ADf.uzHH9xu'HuH}LHMi}~?1HMfA.u z HI9u HuH}HUHM$HsEIH(H0H9ejHH(H0H9tHt AHHHH9tHt HHHH9t HtH3 UHH=+H5^+H0H 0EM+u譝 H+H=+H+]ÐUH]hfDUHSPHH=`+H5+Hr0H +uH H1+H=*+H5>0H+H=t H +tH[]H=+H[]1fUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H=/H AtDH=SH t1H=SH tH=H t HLclHuLq1H0[A^]UHAWAVSH(HuH<HED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=.L AtuH=RL tbH=RL tOH=L t<tHLHUHpLM!IHLHUHpLM(HuLH(1]Ef.EuzEf.EuzEf.Eu{$輴HuH(HUpf.Pu'z%xf.XuzEf.`u{'_HuH(HpE~>1AfA.Du z HH9u!HuH(LDVHzH*HHHH9nsHHHH9t HtsH譴 UHAWAVSH(HuH(HEDvDuHG]ԉ]؅yHHL(MA)AumHuH}WtoH5RH}HU}tUIH5+H}HU}t8}utH}H1H([A^A_]ILLHH膲HuHc苲UHAWAVAUATSHHE*HHEHPH)HXF`HGdhyHHHG(HpLPL)AC6HcHHE1EIcHLELAH]C?HcHLHE1EIcHIDHpHI͋`+dHPHHpHPHuHPHuDHPHLtiHPLDtSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht*HHH9t Ht H$*HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMEHpHHUHMMPEf.EuzEf.EuzEf.Eu{$}HuHPHU躼E~E1HMfA.uzHH9xu"1HuHPHUDpE~>1ADf.u z HH9Eu!HuHPLD-̫HKL-\*IEHHH9?DHHHH9tHt IHHHH9t Ht%H_ fUHAVSH HuH&HEDvDuHG]]y 贺HHt%H(HtD9uEt1HتHt51H}111\HH [A^]HpH裪HuHtH5ȣH(HЪHH*H뱐UHAWAVAUATSHXHuH(HEDvDuHG]ĉ]ȅy޹HHLo(MA)A HuH}H583H}HU艹}aIH5$3H}HUh}@IH5^dH}HUG}IH5=dH}HU&}HH5dH}HU}HEH52H}HU}HEH52H}HU}HEH52H}HU蟸}t{HEHuH}0tfH5T2H}HUp}tL}ELUtNHLLLLILMPARuuuCRH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0(HuH*HUHAWAVAUATSHXHuH?*HEDvDuHG]]y~HHLo(MnA)H}A NHu轷LH50H}HU)}.IH50H}HU} IH5aH}HU}IH50H}HUƶ}HH5|0H}HU襶}HEH5g0H}HU胶}HEH}HutsH540H}HUP}tYHEH}HuötD}ELUЋEtQLLLLILMPuARu U ߵ1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H HuH*HUHAWAVSHHH*HHEHH~HDvDHGy2HHL(MA)HAaHu-ZHHu=HH1"HHHH@躴HH蚴HLLʴHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn}1H *H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!QHuHHU1葳Ef.`u$z"Ef.huzEf.pu{$HuHHU:٢HuH'@f. u*z(Hf.(uzPf.0u{'zHuHH@贲f.u*z(f.uzf.u{'HuHHQHuHFϡHHcСH *H H;MDUHAWAVSHhH|*HHEHuHp'HED~D}HG]]yHHLw(MA)H}AuTHuHEHE(E)E}t9(Ǜ*)EHEÛ*1f.EuRzP2ceIHuLXHcEf.EuzEf.EuzEf.Eu{胠HuH}HU1ưeHt1H G*H H;Mu#Hh[A^A_]HMH $*H H;Mt:fDUHAWAVSHH*HHEHH&HD~DHGyrHH Lw(MA)HAHumHHP MHEHE(E)E(P(`(p(]))) )0HEH@tiH}HP螿Ef.Efg1H *H H;MH[A^A_]E1MIHuHPLxEf.EuzEf.EuzEf.Eu{!SHuHHU1蓮Pf.Xf.`f.uqzohf.u]z[pf. uIzGxf.(u5z3Ef.0u$z"Ef.8uzEf.@u{'wHuHHP 豭PH|H*HH &*H H;Mt8@UHAWAVSHH*HHEH`H%HhD~DpHGtxyrHHLw(MA)H`AHumH`HMthHEHE(E)EHHQttiH}HļEf.Ef蓫1H *H H;MHĈ[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!HuH`HU1迫f.f.| f.f`(f.JD0f..(8f. @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'誙HuH`H胙HH*HH Y*H H;M{kUHH=+H5+H"H 0腙 +uj HV+H=O+RHC+]ÐUH]fDUHSPHH= +H5+Hc"H +uj H+H=+H5/"Hע+H}t H Ģ+tH[]H=+H[]qfUHAVSH0HuHMHEЋFEHEHEH}ȃHu4H]H=!H+AtDH=%!Ht1H=#!HtH=]RHt HLc謗HuL豗*1H0[A^]UHAWAVSH(HuH|MHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}!}L}tH= LAtuH= LtbH= LtOH=DQLt<tHLHUHpLM!IHLHUHpLM(HuLH(1-Ef.EuzEf.EuzEf.Eu{$HuH(HUɏpf.Pu'z%xf.XuzEf.`u{'/HuH(HpiE~>1AfA.Du z HH9u!~HuH(LD&~HzHU*HHHH9nsHHHH9t HtCH} UHAWAVSH(HuHYHEDvDuHG]ԉ]؅yҍHHL(MA)AumHuH}'toH5"jH}HU腍}tUIH5iH}HUh}t8}utH}1H([A^A_]ILLHHV}HuHc[}UHAWAVAUATSHH*HHEHPHHXF`HGdhy萌HHHG(HpLPLAC6HcH[HE1EIcHLEL辋AH]C?HcHHE1EIcHIDHpHI͋`+dHPHH@HPHuՋHPHuD躋HPHLtiHPLD艋tSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t HtHHH9t HtݽH*HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM}HpHHUHMMPEf.EuzEf.EuzEf.Eu{$MwHuHPHU芇E~E1HMfA.uzHH9xu"wHuHPHUD@E~>1ADf.u z HH9Eu!vHuHPLDvHKL-,*IEHHH9?D{HHHH9tHt HHHH9t HtH/w fUHAVSH HuHHEDvDuHG]]y 脅HHt%H(HtD9uEt1ĬHuHt51H}111,HH [A^]HpHsuHuHtH5nHHuHH*H뱐UHAWAVAUATSHXHuHoHEDvDuHG]]y讄HHLo(MnA)H}A NHuLH5H}HUY}.IH5H}HU8} IH5./H}HU}IH5H}HU}HH5H}HUՃ}HEH5H}HU賃}HEH}Hu@tsH5dH}HU考}tYHEH}HutD}ELUЋEtQLLLLILMPuARu谪U 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H $sHuH*HUHAWAVSHHH*HHEHHLHDvDHGybHHL(MA)HAaHu]ZHHu@=HHa"HHFHH@HHʁHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL0n譀1H *H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!pHuHHU1Ef.`u$z"Ef.huzEf.pu{$-pHuHHUj pHuHW@f. u*z(Hf.(uzPf.0u{'oHuHH@f.u*z(f.uzf.u{'GoHuHH oHuHv~nHHcoH ׮*H H;MDUHSHH*HHEHHHF HDž$HVHuкY~OHH9~/HEHE(E)EH0HH6H}H0Ef.EuzEf.EuzEf.Eu{!mHuHHU1!~f.082f.8f.@f.Hf.Pf.X f.`(f.htn0f.pXR8f.x<6@f. Hf.Pf.Xf.`f.hf.pf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'rkHuHH{KkHu.Hߪ*HH %*H H;Mt&;z1H *H H;MuH[]f.fUHSHHͪ*HHEHHHF HDž$H!HuкyzHHpHYzHEHE(E)EH0Hp@HVH}HJEf.EuzEf.EuzEf.Eu{!jHuHHU1AzXf.u{zy`f. uezchf.(uOzMpf.0u9z7HHKuR y1H T*H H;MuUH[]LiHuHHpHy%iHuH*HH *H H;MtUHAWAVSHH٨*HHEHHHD~DHGyRxHHLw(MA)HAHuMxHH-xthHEHE(E)EH H1tiH}HEf.Efsw1H *H H;M-H[A^A_]E1M"IHuHLxEf.EuzEf.EuzEf.Eu{!_gHuHHU1wf. F@f.(*$f.0f.8f.@f.Hf.Pf.X| f.`f`(f.hJD0f.p.(8f.x @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'dHuHHudHHK*HH *H H;M裧f.DUHAWAVSHHY*HHEHHsHD~DHGysHHLw(MA)HAHusHH`HsthHEHE(E)EH H`@豦tiH}H`蘚Ef.Efr1H >*H H;MHH[A^A_]E1M"IHuH`LEf.EuzEf.EuzEf.Eu{!bHuHHU1sf.@Hf.uPzNPf.u:z8Xf.u$z"`f. uz HHKu'GbHuHH`Hr bHH*HH *H H;M@UHSH(HuH<HE؋FEHEH}ЃuEHuqtG}袘HaHu2Ht6H5ZH)rHaH([]þ q1H([]H*HH([]UHSH(HuHoHE؋FEHEH}ЃuEHuPqtG}HaHu2Ht6H5)ZHqH1aH([]þip1H([]H]*HH([]ÐUHH=o+H5^q+HH 0`Mp+uM2 Hp+H=o+`Ho+]ÐUH]fDUHSPHH=`o+H5p+H8H `o+u1 H1p+H=*o+M`H5Ho+H_t H o+tH[]H=n+H[]`fUHAVSH0HuHEHEЋFEHEHEH}ȃHuoH]H=mH苢AtDH=Hrt1H=H_tH=HLt H~mLc _HuL_n1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yRnHHLw(HEMA)Au{HuH}n}L}tH=TLrAtuH=lLYtbH=jLFtOH=L3tX1HHH9t HtUHl*HH;EyHH[A\A]A^A_]E1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9><tHLHUHpLM{!IHLHUHpLM(4GHuLH(1VEf.EuzEf.EuzEf.Eu{$FHuH(HU)Wpf.Pu'z%xf.XuzEf.`u{'FHuH(HpVE~>1AfA.Du z HH9u!FFHuH(LDV%FHzH*HHHH9nsHHHH9t Ht裈HF UHAWAVSH(HuHHEDvDuHG]ԉ]؅y2UHHL(MA)AumHuH}UtoH51H}HUT}tUIH5[1H}HUT}t8}utH}xT1H([A^A_]ILLHHDHuHcDUHAWAVAUATSHHu*HHEHPH.HXF`HGdhySHHHG(HpLPLYSAC6HcHSHE1EIcHLELSAH]C?HcH|SHE1EIcHIDHpHI͋`+dHPHHSHPHu5SHPHuDSHPHLMStiHPLDRtSHEHEf(Ef)EDHxE#A1HxzHPDRE1HHH9t HtZHHH9t Ht=HT*HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMOsHpHHUHMMPEf.EuzEf.EuzEf.Eu{$>HuHPHUNE~E1HMfA.uzHH9xu"a>HuHPHUDNE~>1ADf.u z HH9Eu!>HuHPLD]N=HKL-}*IEHHH9?DۀHHHH9tHt yHHHH9t HtUH> fUHAVSH HuHHEDvDuHG]]y LHHt%H(HtD9uEt1qH=Ht51H}111LHH [A^]HpH<HuHtH55HXMH=HHF|*H뱐UHAWAVAUATSHXHuHϾHEDvDuHG]]yLHHLo(MnA)H}A NHuMLLH5hH}HUK}.IH5TH}HUK} IH5H}HUwK}IH5-H}HUVK}HH5 H}HU5K}HEH5H}HUK}HEH}HuKtsH5H}HUJ}tYHEH}HuSKtD}ELUЋEtQLLLLILMPuARuoU oJ1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H :HuHz*HUHAWAVSHHHIz*HHEHH`HDvDHGyIHHL(MA)HAaHuIZHHuI=HHI"HHIHH@JIHH*IHLLZIHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLmn H1H Xx*H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!7HuHHU1!HEf.`u$z"Ef.huzEf.pu{$7HuHHUGi7HuHF@f. u*z(Hf.(uzPf.0u{' 7HuHH@DGf.u*z(f.uzf.u{'6HuHHF6HuHE_6HHc`6H 7v*H H;MIyDUHAWAVSHhH v*HHEHuHHED~D}HG]]yEHHLw(MA)H}AuZHuEHEHE(E)E}t?(w0*)EH?HEm0*1f.EuRzP2DeIHuLXHcEf.EuzEf.EuzEf.Eu{ 5HuH}HU1PE4Ht1H t*H H;Mu#Hh[A^A_]H4H t*H H;MtwUHH`Ht*HHEHHHFHDžHHu:DHH@D}HEHE(E)E(@(P(`(p))))(E)(E)(E) HEH0H}H@6hEf.EuzEf.EuzEf.Eu{!u3HuHHU1C@f.93Hf.Pf.Xf.`f.hf.pf.xf.uyzwEf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef. u$z"Ef.(uzEf.0u{'2HuHH@?B1Hu.Hrq*HH q*H H;Mt&tGA1H q*H H;MuH`]UHSHHHmq*HHEHH:HFHDžHbHuкA[HH@-@;HEHE(E)EHH@hHsH}H\eEf.EuzEf.EuzEf.Eu{!0HuHHU1@@f.D>Hf.("Pf. Xf.`f.hf.pf.xf.zf.d^f.HBf. ,&f.( f.0f.8f.@f.Hf.P~f.Xhbf.`LFf.h0*f.pf.xf.f.f.f.f.lff.PJ f.4.(f.0f.8f.@f.Hf.Pf.Xf.utzr`f.u`z^hf.uLzJpf.u8z6xf.u$z"Ef.uzEf.u{{&,HuHH@-`<+Hu.Hk*HH k*H H;Mt&nh;1H k*H H;MuHH[]Ef. rlEf.(YSEf.0@:\UHAWAVSHhH9k*HHEHHHD~DHGy:HH5Lw(MA)HAHu:HH :HEHE(E)E( (0(@(P))))(`)(p)(E)HEHtiH}H ^Ef.Ef}91H i*H H;M4Hh[A^A_]E1MIHuH LxEf.EuzEf.EuzEf.Eu{!i)HuHHU19 f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf.u{''HuHH 8'HHNg*HH g*H H;MjfUHAWAVSHHHig*HHEHHHD~DHGy6HHLw(MA)HAHu6HH0-6thHEHE(E)EHH0hitiH}H0[Ef.Ef61H Nf*H H;M|HH[A^A_]E1M"IHuH0LEf.EuzEf.EuzEf.Eu{!%HuHHU1/60f.8f.ys@f.]WHf.A;Pf.%Xf. `f.hf.pf.xf.f.}wf.a[f. E?f.()#f.0 f.8f.@f.Hf.Pf.X{f.`e_f.hICf.p-'f.x f.f.f.f.f.f.ic f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf. u{'#!HuHH0-]1 HH`*HH `*H H;McUHSH(HuHHE؋FEHEH}ЃuEHu0tG}TH Hu2Ht6H5H 1H H([]þ/1H([]H_*HH([]UHSH(HuHOHE؋FEHEH}ЃuEHu00tG}ZTHHu2Ht6H5 Hi0H H([]þI/1H([]H=_*HH([]ÐUHH=3+H5>5+HH 0-4+u- Hv4+H=o3+Hc3+]ÐUH]$LfDUHSPHH=@3+H54+HnH `3+u H4+H= 3+-H5:H2+Ht H 2+tH[]H=2+H[]fUHAVSH0HuH%HEЋFEHEHEH}ȃHut.H]H=HkaAtDH=eHRat1H=cH?atH=H,at H^,LcHuLj-1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y2-HHLw(HEMA)Au{HuH}a-}L}tH=LR`AtuH=LL9`tbH=JL&`tOH=L`t<tHLHUHpLM3!IHLHUHpLM($HuLH(1}Ef.EuzEf.EuzEf.Eu{$HuH(HUpf.Pu'z%xf.XuzEf.`u{'HuH(HpE~>1AfA.Du z HH9u!6HuH(LDvHzHD*HHHH9nsGHHHH9t HtGH UHAWAVSH(HuHyHEDvDuHG]ԉ]؅y"HHL(MA)AumHuH}wtoH5rH}HU}tUIH5KH}HU}t8}utH}h1H([A^A_]ILLHHHuHcUHAWAVAUATSHHeC*HHEHPH{HXF`HGdhyHHHG(HpLPLIAC6HcHHE1EIcHLELAH]C?HcHlHE1EIcHIDHpHI͋`+dHPHHHPHu%HPHuD HPHL=tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHP4E1HHH9t HtJDHHH9t Ht-DHDA*HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM*HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU E~E1HMfA.uzHH9xu"QHuHPHUD E~>1ADf.u z HH9Eu! HuHPLDM HKL-|<*IEHHH9?D?HHHH9tHt i?HHHH9t HtE?H fUHAVSH HuHwHEDvDuHG]]y HHt%H(HtD9uEt1(HHt51H}111| HH [A^]HpHHuHtH5HH HHH6;*H뱐UHAWAVAUATSHXHuH}HEDvDuHG]]y HHLo(MnA)H}A NHu= LH5XH}HU }.IH5DH}HU } IH5~H}HUg }IH5H}HUF }HH5H}HU% }HEH5H}HU }HEH}Hu tsH5H}HU }tYHEH}HuC tD}ELUЋEtQLLLLILMPuARu&U _ 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H tHuH9*HUHAWAVSHHH99*HHEHHPHDvDHGyHHL(MA)HAaHuZHHu=HH"HHHH@:HHHLLJHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLB$n1H H7*H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1Ef.`u$z"Ef.huzEf.pu{$}HuHHUYHuH@f. u*z(Hf.(uzPf.0u{'HuHH@4f.u*z(f.uzf.u{'HuHHpHuHOHHcPH '5*H H;M98DUHAWAVSHhH4*HHEHuHzHED~D}HG]]yHHLw(MA)H}AuTHuHEHE(E)E}t9(g))EHEc)1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU1FHt1H 3*H H;Mu#Hh[A^A_]HH 3*H H;Mt6fDUHAWAVSHxH|3*HHEHxHYHED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuL!wjIHuL`EEf.EuzEf.EuzEf.Eu{!HuHxHU1tHt1H V2*H H;Mu%Hx[A^A_]ETH 12*H H;MtG5UHHH2*HHEH H*H(F0HDž4H HuH HugHEHE(E)E(E(M(U)@)P)`HEHpH}HuJEf.EuzEf.EuzEf.Eu{!3HuH HU1sEf.@uhzfEf.HuWzUEf.PuFzDEf.Xu5z3Ef.`u$z"Ef.huzEf.pu{$HuH HUwHu.H 0*HH Q0*H H;Mt&g31H +0*H H;MuH]fUHH@H/*HHEHHˆHFHDžHwHupHHPPHEHE(E)E(P(`(p(]))))(E) (E)0(E)@H}HPEf.EuzEf.EuzEf.Eu{!HuHHU13Pf.Xf.`f.hf.pf.xf.Ef.uyzwEf.uhzfEf. uWzUEf.(uFzDEf.0u5z3Ef.8u$z"Ef.@uzEf.Hu{'HuHHP{Hu.H-*HH U-*H H;Mt&k01H /-*H H;MuH@]f.UHAWAVSHH,*HHEHHsHD~DHGyrHHLw(MA)HAHumHH`MHEHE(E)E(`(p(U) )0)@HEHPtiH}H`Ef.Efu1H +*H H;MTH[A^A_]E1MIHuH`LxEf.EuzEf.EuzEf.Eu{!aHuHHU1`f. uqzohf.(u]z[pf.0uIzGxf.8u5z3Ef.@u$z"Ef.HuzEf.Pu{'HuHH`HH&**HH l**H H;M~-f.UHAWAVSHHH9**HHEHHSrHD~DHGyHH'Lw(MA)HAHuHH0HEHE(E)E(0(@(P(`))))(p)(E)(E) tiH}H0Ef.Ef1H (*H H;MHH[A^A_]E1MIHuH0LEf.EuzEf.EuzEf.Eu{!wHuHHU10f..(8f. @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef. uzEf.(u{'HuHH0LHH{&*HH &*H H;M)UHH=*H5>+HH 0-+uMtHv+H=o*Hc*]ÐUH]ZfDUHSPHH=@*H5+HH *usH+H= *MH5{H*Ht H *tH[]H=*H[]fUHAVSH0HuHEHEЋFEHEHEH}ȃuoHutqH]H=H(At1H=/Hz(tH=؟Hg(t HLc'HuL,1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅ybHHLw(HEMA)AuhHuH}}L}tlH=ۡL'AtbH=Li'tOH=ǞLV'tHuEH}!H{EH}qHucUHSHH*HHE^HG)ЃPHuHHEȉ]ЉUԉU؅yAHHMH_(H$H}HuH}HxuH}Hu`H}HuKH}Hu6H}Hu!ExU]emH THuHHE]UUy [HHtOH_(HtFHuH}nt0HuH oHuH*HH51H 7*H H;MuHĈ[]1H6fUHAVSHH*HHEDvHGD)PHuHHEDu]ĉ]ȅyfHHH_(HH}HpH}HuH}Hu|H}HupgH}Hu[RH}LXL@7L4$HpHUHMLELMH) HXHkH~HHHHuHIHEDu]ĉ]ȅy(HHH(HD9HEHaH߾_HH*HH;EOxHpHHxDu]]yHHH_(HHpHu(E)0(E)@E`EhHuHf(@fMf(0fEfkPu"Ef.`uzEf.hu{!+HuHpHU1k Hu*H*HH*HH;Et"NH5q1H*HH;Eu.HH[A^]H}111GH*HH;Et1HpH}1qHEH}PHEH}/HoEH}H\EH}^HXH}:fUHAWAVSHXH *HHEHuHOHED~D}HG]]y $HHtpLw(MtgA)AuKHuH}.tHHuLb/Hu2H *HH *H H;Mt*H}1H *H H;MuHX[A^A_]f.UHSHXH *HHEHHHFHDžHHuYHHp9HH0HHHH(E(M(U)U)M)E(p)PHEH`(0)H@H ()HHH}HpH0HLDEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{!HuHHU1Cpf.Pu'z%xf.XuzEf.`u{'HuHHp0f.u*z(8f.uz@f. u{'FHuHH0f.u*z(f.uzf.u{'HuHHHuH Hu*ƅH1H Q *H H;Mu HX[]] fUHAWAVSH8H *HHEHH0HFHDžH HuHHuHHpiHHNHH3HHP2HHH޺HLL?HLL!H`H@(P)0()H HHH}HuHpHLLPAWAVSoH lHt^bHtwPf.0 1H *H H;MH8[A^A_]H\HuH9Pf.0u*z(Xf.8uz`f.@u{'HuHHPf.u*z(f.uz f.u{')HuHHcHtHt1HFH>HuϋHHpHcH ~*H H;Mjf.fUHSHHM*HHEHHHFHDžHHuHHpHH0(E(M(U)U)M)E(p)PHEH`(0)H@H H}HpH0aEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{!HuHHU1Hpf.Pu'z%xf.XuzEf.`u{'HuHHp0f.u*z(8f.uz@f. u{'KHuHH0$Hu,Hc)H *H H;Mt&1H *H H;MuH[]ÐUHH=*H5*HH 0 *uHV*H=O*HC*]ÐUH]fDUHSPHH= *H5*H?H *uxH*H=*mH5 H*Ht H *tH[]H=*H[]fUHAVSH0HuHewHEЋFEHEHEH}ȃuoHutqH]H=|HAt1H=HtH={Ht HLcGHuLL1H0[A^]f.@UHAWAVSH(HuH wHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=kLAtbH=LtOH=zLvtH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uHpHHH‰уH s1H}H@mHH)1H}H@LLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHH9LMLH}DHEAs1H HMHHHHH9sHH9s 1HHpHHH‰уHs1H}HHmHH)1H}HHLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuHH9LMLH}tzHHHHtH}HH44HHu H}HHHLMHHLH}Lr' LLLLL L HI9uDHEAs1H HMHHHPH9sHH9s1HpHHH‰уH s1H}HPmHH)1H}HPLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHH9LMLH})HHHHtH}HPH4H4HHu H}HPHLMHHLH}LrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uHHs1H HMHHHXH9sHH9s 1HHpHHH‰уHs1H}HXmHH)1H}HXLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuHH9LMLH}tzHHHHtH}HX44HHu H}HXHLMHHLH}Lr' LLLLL L HI9uHH s1H HMH HH`H9sHH9s 1HHpHHH‰уHs1H}H`mHH)1H}H`LLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuH H9LMLH}tzHHHHtH}H`44HHu H}H`HLMHHLH}L r' LLLLL L HI9uHH(s1H( HMH(HHhH9sHH9s1HpHHH‰уH s1H}HhmHH)1H}HhLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuH(H9LMLH})HHHHtH}HhH4H4HHu H}HhHLMHHLH}L(rWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDH0EAs1H0H0HHpH9sHH9s1HpHHH‰уH s1H}HpmHH)1H}HpLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuH0H9L)HHHHtHpH4H4HHuHpHHLH0rWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9uHH8Ts1H8H8HI9sIH9s1ЃHpHHH‰уHs 1LLhHH)1LLLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuH8H9tTHHHLHt44HHuHH8r' LLLLL L HH9uًH\$HEHD$HEHD$HEH$HHuHMLELMoHE~D1HMH@f.u z HH9u HuHx1HUDOE~E1HHHM ; uHH9u"ƩHuHxHUDE~K1HMHPf.uzHH9u"vHuHxHUD赹~I1HXHM ; uHH9u&(HuHxHUHu~I1H`HM ; uHH9 u&֨HuHxHUH#~O1HMHhf.uzHH9(u&~HuHxHUH蹸}~L1HMHpf.uzHH90u#)HuHxHUHMg~>1 A; uHH98u%HuHxHH2迧HL=O)IHxHH9HHxHH9tHt BHHHH9tHt HHpHxH9tHt HHXH`H9tHt HH8H@H9t HtHHH9t HtHH H9t HtxHHH9t Ht[H蕧 HHHHHH뻐UHAVSH HuHDHEDvDuHG]]y ԵHHtHG(HtD9uHXPHt1H}111腵 H胶HHH [A^]UHAVSH HuHtHEDvDuHG]]y DHHt H(HtD9uEt"_XmHt*11H}111 H8CHuHcHHHH [A^]UHAWAVAUATSH8HxHHEFEHGMMy芴HH2HG(HELxLAC$HcHhjLh1EIcIHEL輳AH@C6HcHH1EIcHHEHHHxpAL}H]CD-HcH۳H1EIcHMHHEHPHxAC?HcH蒳H1EIcHMHHEHXHxղÍHcH9H1҅HHcHMHHEH`Hx舲ÍHcH0H01҅HHcHMHHEHhHx;ÍHcH豲HH1ۅHHHHDHpH}6HHMЋE+EHxH轲HHxHuD_HxHuD2HxHuD)HxHuDHxHuHݱtuHxHuH±tZHxHuЉ辱tDIDHEA 1HHx1HHH9t Ht-H0H8H9t HtHHH9t HtHHH9t HtHHH9t HtHHH9t HtHhHpH9t HtHH8[A\A]A^A_]1HMHHH@H9sHH9s 1HHpHHH‰уHs1H}H@mHH)1H}H@LLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuHH9tiHHHHtH}H@44HHu H}H@HHr' LLLLL L HH9uDHEAs1HHMHHHHH9sHH9s1HpHHH‰уH s1H}HHmHH)1H}HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHH9)HHHHtH}HHH4H4HHu H}HHHHrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9uDHE~As1HHMHHHPH9sHH9s 1HHpHHH‰уHs1H}HPmHH)1H}HPLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuHH9tiHHHHtH}HP44HHu H}HPHHr' LLLLL L HH9uDH E~As1H HMH HHXH9sHH9s 1HHpHHH‰уHs1H}HXmHH)1H}HXLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuH H9tiHHHHtH}HX44HHu H}HXHH r' LLLLL L HH9uHH(s1H(HMH(HH`H9sHH9s1HpHHH‰уH s1H}H`mHH)1H}H`LLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuH(H9)HHHHtH}H`H4H4HHu H}H`HH(rWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9uHH0s1H0HMH0HHhH9sHH9s1HpHHHAAH s1H}HhmLH)1H}HhLLD L0D L0D@LPD@LPfD`LpfD`LpHHuMt(HIfD fD H IuH0H9)HHHHtH}HhH4H4HHu H}HhHH0rWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9uLȉH8s1H8HMH8HHpH9sHH9s1HpHHH‰уHs1H}HpmHH)1H}HpLLD L0D L0D@LPD@LPfD`LpfD`LpH HuHt(HHfD fD H HuH8H9tlHHHHHtH}Hp44HHu H}HpHH8r' LLLLL L HH9uك}t8HEHD$HEHD$H]H$H}HUHMLELM)E6HEHD$HEHD$H]H$H}HUHMLELMEE~E1H@HM ; uHH9u"_HuHxHUD谤E~K1HMHHf.uzHH9u"HuHxHUDNE~E1HPHM ; uHH9u"œHuHxHUDE~E1HXHM ; uHH9 u"{HuHxHUḌ~J1H`f.uzHH9(u%+HuHxHHg~O1HMHhf.uzHH90u&ԒHuHxHUH~I1HpHMЋ ; uHH98u&肒HuHxHUHϢ\HHc}\HHHH9HHHH9tHt HH0H8H9tHt HHHH9tHt HHHH9tHt oHHHH9t HtKHHH9t Ht.HhHpH9t HtHK HHHHŐUHAWAVSH8HuHmHEDvDuHG]̉]Ѕy蒠HHL(HEMAArH};gH5cH}HU7}tMIƋEW;E}HuH}莠t.ELL螑MHuHcR HE1H8[A^A_]fUHAVSH HuHmHEDvDuHG]]y 蔟HHtH(HtD9u-Ht1H}111D H?)HHH [A^]UHAVSH HuHFmHEDvDuHG]]y HHtH(HtD9um0Ht1H}111贞 H)HHH [A^]UHHHztuHH]H=6*]H5PZ1]UHAVSH HuH[HEDvDuHG]]y 4HHt"H(HtD9uEt$蒏[Ht(1.H}111ߝH3HuH)HHH [A^]UHAWAVSH(HuH@HED~D}HG]ԉ]؅y 肝HHt\Lw(MtSA)Au7H5H}HUN}t0}t7LHǎ脍Hu9H}1H([A^A_]ILHIHuH)HUHAWAVSH(HuH"HED~D}HG]ԉ]؅y 袜HHt\Lw(MtSA)Au7H5H}HUn}t0}t7LH褌Hu9H}&1H([A^A_]ILHiHuH)HUHSH(HuHHE؋FEHEEȃrH}о襛1[H5H}HU蟛H1}tH5H}HU}t7H蓌H;Hu"HқH([]H}о谚1H([]ÐUHH=*H5N*HkH 05=*u聋H*H=*Hs*]ÐUH] fDUHSPHH=P*H5*H4kH Њث*uH!*H=*蝊H5kH*H-t H *tH[]H=*H[]!fUHAVSH0HuH?HEЋFEHEHEH}ȃu\Hut^H]H=qjHAtH=;DHt HLc芉HuL菉1H0[A^]ÐUHAWAVSH(HuH\?HED~D}HG]ԉ]؅yҘHHLw(HEMA)AuQHuH}t|}L}tYH=iLAtOH=NCLtHEЋFEHEuGH5BH}HU轗}t@HHtCHH5hHPE1LEHu+H}Ⱦe1H0[A^]E1趇HuLMUHAVSH HuH>HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5gHPE1LEHucH}111蜖RE1HuCL荗Ht6HH9t)H3HH1Q@H߾1HH [A^]UHAWAVSH(HuHiHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5*YH}HUޕ}t4LH艩HuH)HH}蒕1H([A^A_]fUHAVSH HuHhiHEDvDuHG]]y THHt!H(HtD9uEt#H_`|Ht+12H}111!HHQHuHHHH [A^]DUHAWAVAUATSHXHuH|HEFEHGM̉MЅy蠔HHYL(H}E11AC6HcH}{LmEIcI\IDMqE+ẼH}LDkEEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H}<E1H}HEH9kpE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]}t LL LLAE~F1f.DADf.u z HI9uQHuH}1LD藒6Ht,E1H}HEH9t HtLHX[A\A]A^A_]IcIH}HEH9uHH}HEH9t HtHۂ DUHAVSH HuH8fHEDvDuHG]]y 4HHtH(HtD9u諤^Ht1H}111 HcNHHH [A^]f.UHAWAVSHH)HHEHXH fH`D~DhHGlpyrHH9Lw(M A)HXAH|轐HXHuR(E(M(U)U)M)E|HULjEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$HuHXHUHuHc51H )H H;MuHĘ[A^A_]E1MzfDUHAWAVSHH9)HHEHXH0eH`D~DhHGlpy貎HH9Lw(M A)HXAH|HXHu蒎(E(M(U)U)M)E|HUL¡Ef.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$~HuHXHUX}HuHc}u1H )H H;MuHĘ[A^A_]E1MfDUHAWAVAUATSHDNHGDDD)ЍHHHc HHuHodHEDMȉỦUEyHHL(H}]AC6HcHx迌LxE1EIcIIDME+ẼH}HH}LD蒌|EE&ArKH9#JI91D)HHLHtI4H4HHuHI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uzHxHbHEDMUUEyvHH9H_(HjHxHX΋OHxHu褋7HxH艋HxH`nHxH@SHxHH8HxHPXE`@HPH֝zHeHczIHuHaHEDMȉỦUEy%HHHG(HEL}E1L1蔉ÍHcH HIHcH0HLELUL(HcHx貉LxE1HhHcM1AfA.u z HI9u"qHuH}LHhqHHc}qIHxHEH9DHpHHH‰уHs1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt*HHADA ADA H HuL9}<`@HPXt LLU LLHADž~31A A; u HI9upHuHx1LfoHIcoIH}HEH9*/3HHxHE?HHxHEH9tHthHH}HEHHHH9t Ht7Hqp  p(f.fUHAWAVAUATSHh^HG)ЃzHuHXHE]ȉỦUЅy~HHH_(HNH}Hu~9H}Hp~!H}Hu~ H}Hu~H}Hu~upMU]Ho(nHHc)nHHuHWHE]ȉỦUЅy}HHL(H}11}AC$HcHp}LpEIcM,LDMGE+Ẽ#H}LD{}H}Hu} H}Hu{}H}Huf}H}HuQ}H}Hu<}DEArII9IDI91HHHHHtA4AtHHuHlA ALALALALALAL AL HH9u7H5NV|12H}{1HpHxH9t Ht HHh[A\A]A^A_]1H_E14؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADA ADALH HuH9g}UEMU]t LLX LLKAE~21A A;Lu HH9ujHuH}1LDE{jHqIcjHHpHxH9diHHpHxH9t HtRHk fDUHHHHGzttu%HH]HH]H=Ȏ*]2H5Uy1]fUHAVSH HuHWHEDvDuHG]]y yHHt#H(HtD9uEt%iHt*11H}111.y HiHuHciHHH [A^]@UHAWAVSH(HuHXHED~D}HG]ԉ]؅y xHHtWLw(MtNA)Au2HuH}/yt4uLFhHuHw)HH}[x1H([A^A_]fUHAVSH HuHXHEDvDuHG]]y $xHHtH(HtD9u觋PhHt1H}111w Hϧ)HHH [A^]UHAVSH HuHXHEDvDuHG]]y wHHtH(HtD9ugHt1H}111Dw H?)HHH [A^]UHAWAVSH8HuH4SHEDvDuHG]̉]ЅywHHL(EMtvA)AAumHuH}PwtXH5UH}HUv}t>IƋEй;E}HuH}wtMuLLfHt/1 H}Av1 E1H8[A^A_]HcfUHAWAVAUATSHXHuH RHEFEHGMĉMȅyuHHuL(H}11guAC6HcH}uLmEIcMdLDEMuE+EărH}duMH}LDu6H}Huu!H5H}HU1u}HËE;E}H}HuuHDEcArIDI9II9sz1HHHHHtfAtA4HHuHDATAATATATATAT AT HH9uE1؃HpHHH‰׃Hs1qHH)1ADALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADALADA H HuH9}UDEt LL LLAE~:1ALA; u HH9ucHuH}1LDs{cHt+1H}HEH9t Ht/HHX[A\A]A^A_]IcUcHH}HEH9uHH}HEH9t HtH!d UHH=*H5*H.T1:c*u>Hˈ*H=ć*cH*]fDUHSPHH=*H59*HS1b-*u=Hv*H=o*bH5SH\*HBbt H I*tH[]H=9*H[]6cf.@UHAVSH0HuHHEЋFEHEHEH}ȃuoHuqtqH]H=SHAt1H=HڤtH=8HǤt HoLcaHuLaq1H0[A^]f.@UHAWAVSH(HuHLHED~D}HG]ԉ]؅ypHHLw(HEMA)AuhHuH}p}L}tlH=RLAtbH=LɣtOH='L趣tH}HU'j}IH5H}HUj}HH5H}HUi}HEH5H}HUi}HEH5xH}HUi}HEH5cH}HUi}t{HEHuH}jtfH54H}HUPi}tL}ELUtNHLLLLILMPARuuuRH} h1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0YHuH)HUHAWAVAUATSHXHuHHEDvDuHG]]y^hHHLo(MnA)H}A NHuhLH5H}HU h}.IH5H}HUg} IH5H}HUg}IH5}H}HUg}HH5\H}HUg}HEH5GH}HUcg}HEH}HugtsH5H}HU0g}tYHEH}HugtD}ELUЋEtQLLLLILMPuARuȕU f1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H VHuHh)HUHAWAVSH(HuHHED~D}HG]܉]y 2fHHt#H(HtD9uAEtXVHt+12H}111e!HLc-VHuL2VHHH([A^A_]f.DUHAWAVSH(HuHlQHED~D}HG]ԉ]؅yreHHLw(MA)AuqHuH}ets}EtuANxzP)]vP)f(fUfTfVf.u{AFxIL2UHu6H}d1H([A^A_]ILTHuH)HfUHAVSH0HuHeQHEDvDuHG]܉]y TdHHt*H(Ht!D9u Et,O)EsTHt-16H}111c%HEFTHuECTHHH0[A^]UHAVSH0HuHQHEDvDuHG]܉]y cHHt*H(Ht!D9u Et,N)ESHt-16H}1117c%HESHuESHHH0[A^]UHAVSH0HuH9RHEDvDuHG]܉]y bHHt'H(HtD9uEt)GxERHt-16H}111zb%HERHuERHHH0[A^]ÐUHH=].H5z*H? H 0R-^.u!SHv^.H=o].RHc].]ÐUH]YfDUHSPHH=@].H5z*H H pR].uRH^.H= ].=RH5 H\.HQt H \.tH[]H=\.H[]RfUHAVSH0HuH5HEЋFEHEHEH}ȃu\Huat^H]H= H胔AtH= Hjt H_Lc*QHuL/Q`1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅yr`HHLw(HEMA)AuQHuH}`t|}L}tYH=* L薓AtOH= L}tH5PW1,H}W1H}HEH9t HtˊHHh[A^A_]E1Hx IO@H9~HEE110HqIw@HH@0HHEvIHEIG@GHuHUH}1WxGHuMH}LVZGH?H[GHH}HEH927HH}HEH9t HtH H f.UHAVSH HuHPHEDvDuHG]]y tVHHt HG(HtD9uH@HHX0FHt1H}111!V HFHHH [A^]f.fUHAVSH HuHPHEDvDuHG]]y UHHt HG(HtD9uH@HHX8EHt1H}111UHHEHHH [A^]fUHAWAVSHh^HG)ЃVHuH QHE]ȉỦUЅyUHHL(H}TÍHcH}UME+ẼLuH}HuhUH}HuSUmH}LTWHuHIHH;w0yHH@0HHHEsHDHuHUH}TDHuMH}HSgDHH)HH}HEH9HuHOHE]UUy SHHtvH_(HtmHuH}UTt\H520H}HUS}tBHuHxHKHH;q0}uHHOKCHuHR)H>H51O5S1,H}$S1H}HEH9t HtAHHh[A^A_]E1H=^RH=^RHH}HEH9t HtH/D fUHAWAVATSH`HHJHG)ǃHUH=\OH}ȉMЉEԉE؅yHH`RHHLf(H}QLcH}LaRME+EԃmL}H}HuRgH}LRRQHMH}LQ4H]I|$HHw8HLs}GLpHHHrHHIH9HLI9E1D)LHHHtH1IIHHHHH9uI)H6L)1IHTITHTITHTITHT IT HT(IT(HT0IT0HT8IT8HT@HH9uH=ym*H`[A\A^A_]^H5MP1,H}P1H}HEH9t Ht螃HH`[A\A^A_]E1LoHHTHrHHIH9HLI9E1D)LHHHtH1IIHHHHH9uI)HL)1IHTITHTITHTITHT IT HT(IT(HT0IT0HT8IT8HT@HH9uIIIpHHHljH s21IIIpHHHljH 1 H)1AALDLAD AL0D(L8AD@ALPDHLXAD`ALpDhLxHHuHt%HHA7AL7D0L0H HuL9JO<"H)1AALDLAD AL0D(L8AD@ALPDHLXAD`ALpDhLxHHuHt%HHA7AL7D0L0H HuL9uBI\$0HCID$0Mt$84>HFH;>HH}HEH99>JO<HH}HEH9t Ht賀H> UHAWAVAUATSH(HuHKHEDvDuHG]ĉ]ȅy>MHHLg(MA)AHuH}ML}I\$8Mt$HHCID$8IcN@HHHIV8H9ILLHx@HHLiL9}I9N0}ILHXtMn8Mf8IH@0L<<HuHh|)HH}LL1H([A\A]A^A_]f.DUHAWAVSH(HuHVKHEDvDuHG]ԉ]؅y LHHtmL(MtdA)AuHHuH}_LtJHcEHHIO8IWHHHR0H;HuH{)HH}uK1H([A^A_]f.fUHAWAVSH(HuHMKHEDvDuHG]ԉ]؅y 2KHHtYL(MtPA)Au4HuH}Kt6]Mw8G;Hu%HcILJ;H}J1H([A^A_]UHAVSH0DvHGD)؃t\HuHKKHEDu]]yrJHHHG(HD9HX@:Huy\HuHJHEDu]]y JHHtMH_(HtDHuH}Jt3LuH[@;:Hu!ILH@:HH5JI1HH0[A^]H}111IfDUHAWAVSH(HuH*KHEDvDuHG]ԉ]؅y bIHHtTL(MtKA)Au/HuH}It1HEIG@v9HuH y)HH}H1H([A^A_]DUHAWAVSH(HuHJHEDvDuHG]ԉ]؅yHHHL(MA)AujHuH}%ItlHuHxpIHH;w0}fHH@0L4HgILH?LHAALHHu41rH}G1H([A^A_]H=SG1HpJ|MI)1ҐH^H HNHHH\HHLHHI9uHMtH HHIJ4H4J 7HuHmw)HhDUHAWAVATSHpHuHJHEFEHGM̉MЅy2GHHLg(H}FLcHxL0GM6E+ẼLxH}HuvG H}HuCGH}L GHcMH}LzFHuHI|$HH;w0]HerI H9H I91HHHHHtI4HHH [A^]f.UHAVSH HuHcHHEDvDuHG]]y CHHtIHG(Ht@D9u?HxH11bI3Hu4Mt;H5,L*DH3H1H}111CHH [A^]Hr)H@UHAWAVSH8HuH HHED~D}HG]̉]ЅyBHHLw(MA)AuyHuH}5Ct{HuH}$CtjHEHUIF0IF8IF@I~H11aI2Hu6Mt?H5+LCH2HH}A1HH8[A^A_]Hq)H@UHAWAVSH8HuH.HHED~D}HG]̉]Ѕy AHHtuLw(MtlA)AuPHuH}-BtRH5SMH}HUmA}t8HuLHB91HuH9q)HH}A1H8[A^A_]@UHAWAVSH(HuHboHED~D}HG]ԉ]؅y @HHt`Lw(MtWA)Au;H5H}HU@}t4LH80HuH~p)HH}b@1H([A^A_]fUHAVSH HuH!hHEDvDuHG]]y $@HHtHG(HtD9uHXHQ0Ht1H}111? H@HHH [A^]UHAVSH HuHIHEDvDuHG]]y ?HHtEHG(HtHHt%HG(HtD9uHxHHP.Ht1H}111|> Hwn)HHH [A^]UHAVSH HuHBHHEDvDuHG]]y 4>HHt H(HtD9u5H].Ht1(H}111=HHxH.M.HHH [A^]UHAWAVATSH0HuH:HEDvDuHG]̉]Ѕy=HH+L(MA)A#H5H}HUP=}H@8L`0HX@IHHw8HMt$Lx\L MIrHHJH9JLH9E1DD)LHLHt%H1fDH HHHHHH9uI)H=M)1HHTHTHTHTHTHTHT HT HT(HT(HT0HT0HT8HT8HT@HI9uH}<MIIpHHHljH s1`H)1fLDLD L0D(L8D@LPDHLXD`LpDhLxHHuHt.HHf.3L3D0L0H HuM9u3I_0HCIG0Mw8+Ht1H0[A\A^A_]H+JJ?f.DUHAWAVATSH0HuH7HEDvDuHG]̉]Ѕy:HH+L(MA)A#H5=H}HU:}L`0HX@IHHw8HMt$LYL MIrHHJH9JLH9E1DD)LHLHt)H1f.H HHHHHH9uI)H=M)1HHTHTHTHTHTHTHT HT HT(HT(HT0HT0HT8HT8HT@HI9uH}l9MIIpHHHljH s1`H)1fLDLD L0D(L8D@LPDHLXD`LpDhLxHHuHt.HHf.3L3D0L0H HuM9u3I_0HCIG0Mw8(Ht1H0[A\A^A_]H(JJ;f.DUHAWAVAUATSH8HuH85HEDvDuHG]]y.8HHLg(MA)AHuH}8Hc]M|$HIO0Mo8MuI9|EIcw@LHHHx4HHHVI9}$H9}ILHHUXHUȅtIW8Mw8IH@0J\IMl$8Mt$0IFID$0'HuL'H}*71H8[A\A]A^A_]ÐUHAVSHj2.H"PH=g)L5|HLCjHC2.HV]H=f)HL"jH%2.Hnf)H2.H2.H&H2.HfHn 2.HEf)H2.H 2.H2.H2.H2.H#f)H1.H1.H1.H1.H1.H1.He)H1.He)H1.He)H1.He)H1.H1.DH:&H1.He)H1.H1.H1.H1.H1.H1.H1.H1.H"e)H1.H1.H1.H1.H1.H1.H1.H1.Hd)H1.Hd)H1.H1.H1.H1.H~1.H{1.Hx1.Hu1.s1.Hx1.He1.[A^]ÐUHH=Q*H5.S*H1$"R*uF%HkR*H=dQ*$HXQ*]fDUHAVSIH=?Q*H5R*H1$Q*u$HR*H=Q*q$H5jHP*L$t H P*t3$Ht?HH5?LH#H u%H$H=P*$#Hu)#HtHH5@?LH#H t[A^]H[A^]$f.UHAVSH0HuHHEЋFEHEHEH}ȃu\HuH3t^H]H=gHCfAtH=H*ft H\1Lc"HuL"h21H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y22HHLw(HEMA)AuQHuH}a2t|}L}tYH=zLVeAtOH=L=etHuH}?tNEx;IO8H9A0~1HI@H Hu+H #H}_ H=O]E1H([A^A_]UHAWAVSH(HuH>yHED~D}HGEԉE؅y HHthLw(Mt_x=AuBHuH}ntDuILH Hu(H H}H}1H([A^A_]ÐUHAWAVSH(HuHxHED~D}HGEԉE؅y RHHthLw(Mt_x=AuBHuH}tDuILH[ Hu(H H}H}1H([A^A_]ÐUHAWAVSHxHK)HHEHxHxHED~D}HGEEyHHLw(MHxAHuHxHu_H5HxHU}HMHM(E)EuIHULHEf.EuzEf.EuzEf.Eu{$ HuHxHU2 Hu.Hc &eH E1M1H J)H H;Mu Hx[A^A_]Mf.fUHAWAVAUATSHXHEJ)HHEHHxHFHG yHHHG(H0LL)ACD-HcHHE1EIcHLELAHHC?HcHHHE1EIcH@HIDH0,tHHHu L@HHHDHH,HHpHHtnHLDxtXHEHE(E)EDH8E.A1H81LHE1HHH9t HtJHHH9t HtJHG)HH;EhLHX[A\A]A^A_]HHH8HI9sIH9s1HpHHH‰уH s 1HHoHH)1HHLAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuH8H9)HHHHtHHH4I4HHuHHHH8rWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uHEH`f(pf)PMEEAr!H@JH9JH91D)HHLHtL@I4H4HHuL@H/I H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uDHpHHH‰уH s 1L@qHH)1L@AALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt*HHfADA fD H HuL9H0HH L$HuH,LpLHHЉ0Ef.EuzEf.EuzEf.Eu{! HuHHU1ME~K1HHfA.uzHH98u%HuHHHDHu,Hpf.Pu'z%xf.XuzEf.`u{'BHuHHp|HuHiE~F1H@f.u z HI9u%HuHH@DHrHc0IHHH9bgEHHHH9tHt $EHHHH9t HtEH: @UHAWAVAUATSHHA)HHEH(H|uH0F8HG<@ypHHL(H(AC$HcHEL1EIcM,LDM<tH(8_H(HLcZH(Hu=H(HpH(LDHEHE(E)Ef(pf)PHEH`DEArII9IDI91)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u6E13H(e1HHH9t Ht|BH?)HH;EIHH[A\A]A^A_]É؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9?IHLHUHpLM(HuLH(1 Ef.EuzEf.EuzEf.Eu{$CHuH(HUpf.Pu'z%xf.XuzEf.`u{'HuH(Hp E~>1AfA.Du z HH9u!HuH(LD |HH =)HHHH9\@HHHH9t Ht?H4 f.@UHAWAVAUATSHXHuHzHEDvDuHGEĉEȅy~ HHLo(MA HuH} H5ӅH}HU$ }IH5H}HU }hIH5H}HU }GIH5ضH}HU }&HH5H}HU }HEH5UH}HU~ }HEH53H}HU\ }HEH5H}HU: }HEHuH} H5H}HU }tlEMUHLLLLILMPuuuuA0H0Hu*H:)H H} H}  1HX[A\A]A^A_]fUHAWAVAUATSHXHuH|HEDvDuHGEEy> HHLo(MH}uA rHux ~H5H}HU }`IH5H}HU }?IH5H}HU }IH5XH}HU }HH57H}HU` }HEH5"H}HU> }HEH}Hu H5H}HU }HEH}Huv tnEEMULLLLILMPuuuA8H Hu0H8)H& v E1M[1HX[A\A]A^A_]f.UHAWAVSHHH8)HHEHHHDvDHGyHHZL(MYH&A#Hu*HHu HHHHHH@HHeHLLyHEHE(E)E(E)`HEHp(@) HPH0HH()IL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1Ef.`u$z"Ef.huzEf.pu{$=HuHHUzHuHg@f. u*z(Hf.(uzPf.0u{'HuHH@f.u*z(f.uzf.u{'WHuHH0HuHHu.Hc& E1M1H 4)H H;MuHH[A^A_]7UHAWAVSH(HuHiHEDvDuHGEԉE؅y"HHL(MAHuH}nH5eH}HU}tfIH5>H}HU}tIuILLHHHu(Hc H}kH}J1H([A^A_]ÐUHAWAVAUATSHHu3)HHEH`H.kHhFpHGtxyHHHG(HXL`LYAC6HcHHE1EIcHLELAH]C?HcH|HE1EIcHMHIDHXttH`%p^H`HPYH`Hu%<H`HuD !H`HT=H`HuDHEHEf(Ef)EEEH}ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uH1H`E1HHH9t Ht3HHH9t Ht3H0)HH;ELH[A\A]A^A_]DHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9.LHEELMArHMJH9JH91D)HHLHtLMI4H4HHuLMH)I H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uDHpHHH‰уH s1LMnHH)1LMAALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt*HHfADA fD H HuL9PDTHXHHUHMPEf.EuzEf.EuzEf.Eu{$HuH`HUE~E1HMfA.uzHH9Hu"HuH`HUDE~@1HMf.u z HI9u"IHuH`HUD'H'L-,)IEHHH9 0HHHH9tHt /HHHH9t Ht/H @UHAVSHH{,)HHEDvHGD)&HuHHEDu]]yHHiH_(H\H}HuB(E)`(E)pEEEEHuH~$f(pfMf(`fEfkPuEf.EuzEf.Eu{HuH}HU1lHH*)HHB+)HH;EHuHHEDu]ĉ]ȅy HHtPH(HtGD9uc#HHu0H߾HH*)HH;Et"NH5\1H*)HH;Eu.HHĐ[A^]H}1112H*)HH;Et-UHAVSH0HuHL1HEDvDuHG]܉]y HHt"H(HtD9u"EHt1H}111 EHHH0[A^]UHAWAVSHhH))HHEHuHoHED~D}HG]]yDHHLw(MA)H}Au:HuFHEHE(E)E}tHuL!!dIHuLXEf.EuzEf.EuzEf.Eu{HuH}HU1!Ht1H ()H H;Mu#Hh[A^A_]HcH ()H H;Mt+UHAWAVSHxH\()HHEHxH9HED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuLl !WjIHuL`EEf.EuzEf.EuzEf.Eu{!uHuHxHU1THt1H 6')H H;Mu%Hx[A^A_]E4H ')H H;Mt'*UHAWAVSH(HuH}1HED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111,!HhLc}HuLHHH([A^A_]f.DUHAVSH HuHaHEDvDuHG]]y HHt%H(HtD9uEt1HHt51H}111lHH [A^]HpHHuHtH5H8HHH&%)H뱐UHAWAVAUATSHHU%)HHEHpHlHxFEHGMMyHHL(HpLAC6HcH8L81EIcM,LDME+E HpHuHpLDzHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp91H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}uIHuLLxEf.EuzEf.EuzEf.Eu{!]HuHpHU1E~H1f.AfA.Du z HH9u!HuHpLDPHtD1H8H@H9t Ht$H!)HH;Eu4HHĨ[A\A]A^A_]H?!)HH8H@H9u$HH8H@H9t Ht4$Hn UHAWAVAUATSHH%!)HHEHpH?iHxFEHGMMyHHL(HpAC6HcH8~L81EIcM,LDME+E HpHudHpLDJHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}uIHuLLEf.EuzEf.EuzEf.Eu{!-HuHpHU1mE~H1f.AfA.Du z HH9u!HuHpLD HtD1H8H@H9t Htm H)HH;Eu4HHĨ[A\A]A^A_]H)HH8H@H9uf HH8H@H9t Ht H> UHH=*H5.*HfH 0U*u͆Hf*H=_*"HS*]ÐUH]\fDUHSPHH=0*H5*H'fH *uhH*H=*H5eH*HMt H *tH[]H=*H[]AfUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H=\eHAtDH=.Ht1H=.HtH=-Ht HLc|HuL1H0[A^]UHAWAVSH(HuHLHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=CdLAtuH=,LtbH=,LtOH=LtHpH0H#HpHuH5HpHU蔪}IHpHuHpHuHpLhL蹪E@EPE`E8EHEX}0HHuHULELMHLAWH5z荩1H (H H;M,H[A\A^A_]1H1Hg1HMHHuHUHMLELhHHEf.@u$z"Ef.PuzEf.`u{!LHuHpHU1茩Ef.8u$z"Ef.HuzEf.Xu{$HuHpHU5ԘHtʘHt/HAHUHp*蛘HuыUHp}HhHpǧVHVwHHHuHULELMHLAW HHEf.@u$z"Ef.PuzEf.`u{!HuHpHU1$Ef.8u$z"Ef.HuzEf.Xu{$萗HuHpHUͧlHtbHt/XHpAHUHp¦3HuыUHp茦H-hHp_HHHuHULELMHLATAW(HHEf.@u$z"Ef.PuzEf.`u{!~HuHpHU1辦Ef.8u$z"Ef.HuzEf.Xu{$*HuHpHUgHtQHtfHtzHڕHHH (H H;MHUHp%薕HuUHpxHuhHpƤUHm,Hp觤0H0QfUHAWAVSH(HuHHED~D}HG]ԉ]؅y 蒤HHtVLw(MtMA)Au1HuH}t3}ut7LH蚔Hu9H}1H([A^A_]ILhH_HuHUHAVSH HuHHEDvDuHG]]y ģHHt$H(HtD9uEt& Ht*11H}111m Hp迓HuHcēHHH [A^]UHAWAVAUATSHHu(HHEЋ^HG)Ѓ>HhH||Hpx|UyݢHH L(HhPACD-HcH豢L1EIcM$LDMyx+|LHhHu葢EHhH貢*H5~HhHU} HHhHu5HhLDHEPE`E@EXE8EHDEArII94II9'1)HHHHtI4I4HHuHI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9ufHHGzHy 襠HHtuH_(HtlHHu赠tSEPEXE`HuH-H5y 15Hh1HHH9t Ht H$(HH;EHH[A\A]A^A_]E1HHuH@HEf.Pu$z"Ef.XuzEf.`u{!迏HuHHU1螏H!H襏HJ؃HpHHHljH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*H4HAD6A 6AD4A 4H HuH9|tHuHMLMIHuHMLMHIEf.Pu$z"Ef.`uzEf.@u{!CHuHhHU1胞Ef.Xu$z"Ef.8uzEf.Hu{$HuHhHU,E~=1AfA.u z HH9u!認HuHhLD艍H&L萍HHHH9hHHHH9t HtH> UHAWAVAUATSHhHuHrHEFEHGMĉMȅy萜HH|L(H}E11AC6HcHxhLxEIcI\IDME+EăH}LDUH5xH}HU}EEArKLH9J I91D)HHLHtfI|H}t[HMHM(E)E(E)`HMHpT8tVHuHULHVX˗1H (H H;MHĸ[A^A_]E1MIHuHULH8Ef.EuzEf.EuzEf.Eu{!跇HuH@HU1Ef.`u$z"Ef.huzEf.pu{$cHuH@HU蠗?HH(HH (H H;M'UHAVSH HuHAHEDvDuHG]]y 脖HHt"H(HtD9uEt$җ諆Ht(1.H}111/H0胆HuH(HHH [A^]UHAVSH HuHHEDvDuHG]]y ԕHHt"H(HtD9uEt$Ht(1.H}111H(ӅHuHg(HHH [A^]UHAVSH HuHHEDvDuHG]]y $HHt"H(HtD9uEt$xKHt(1.H}111ϔHx#HuH(HHH [A^]UHAVSH HuHHEDvDuHG]]y tHHt"H(HtD9uEt$誕蛄Ht(1.H}111HsHuH(HHH [A^]UHAVSH HuHaHEDvDuHG]]y ēHHt"H(HtD9uEt$Ht(1.H}111oHÃHuHW(HHH [A^]UHAWAVSH(HuH/HED~D}HG]ԉ]؅y HHtpLw(MtgA)AuKHuH}otMH5H}HU͒}t3}ut7LH?Hu9H}肒1H([A^A_]ILH8łHuHY(HАUHH=U-H5~)HH 0ݏ-u1H&-H=-貂H-]ÐUH]ZfDUHSPHH=-H5)HH 耂x-ûH-H=-MH5gH-H݁t H -tH[]H=-H[]тfUHAVSH0HuHE7HEЋFEHEHEH}ȃu\Hu蘑t^H]H=HAtH=;Hzt H謏Lc:HuL?踐1H0[A^]ÐUHAWAVSH(HuH 7HED~D}HG]ԉ]؅y肐HHLw(HEMA)AuQHuH}豐t|}L}tYH=LAtOH=:LtHEIO8HHI0HzHuHzH}11H([A^A_]UHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtcL(MtZA)Au>HuH}mt@HEIO0HHI0yHuH(HH}o1H([A^A_]fDUHAVSH HuH@HEDvDuHG]]y 4HHtHG(HtD9uHXHayHt1H}111HHTyHHH [A^]f.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y 蒈HHtnL(MteA)H}AuIHutKIGHHxOMIW0HHR0H118 2t>HH9u~xHu91H([A^A_]1TxHuCxHuHHx@UHAWAVSH(HuHHED~D}HG]ԉ]؅y 袇HHt\Lw(MtSA)H}Au7Hut9uLHHwHuHw&1H([A^A_]f.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtaL(MtXA)AuHEIO0HHI0vHuHvH}a1H([A^A_]UHAVSH HuHHEDvDuHG]]y $HHtH(HtD9ue~PvHt1H}111ԅ Hϵ(HHH [A^]UHAVSH HuHHEDvDuHG]]y 蔅HHtH(HtD9u}uHt1H}111D H?(HHH [A^]UHAVSH HuHHEDvDuHG]]y HHt H(HtD9u'}H-uHt1(H}111豄HHxuuHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHt`Lw(MtWA)Au;H5H}HU.}t4LH|jtHuH(HH}1H([A^A_]fUHAVSH0HuH[HEЋFEHEH}ȃuTHu.tV}{HsHuAHtGHIHHtHu#sHLs81H0[A^]H*(HDUHSH(HuHHE؋FEHEHEH}Ѓu1HuZt3H}1{,sHuHc1sH([]þ襂1H([]UHSH(HuHFHE؋FEHEH}Ѓu:Hut<]rHu/׀rH([]þ$1H([]f.DUHAWAVSH8HuH` HEDvDuHG]ԉ]؅yHHL(MA)AupHuH}UtrH5SH}HU蕁}tXIH5^H}HUx}t;HuLLHyqHuHA(HH}%1H8[A^A_]f.fUHAWAVSH8HuH` HEDvDuHG]ԉ]؅yHHL(MA)AupHuH}UtrH5SH}HU蕀}tXIH5KH}HUx}t;HuLLHxpHuHA(HH}%1H8[A^A_]ÐUHAVSH }-H"H=(L5|/HLCH|-HVH=(HL"H|-Hn(H|-H|-HkH|-HfHn|-HE(H|-H|-H|-H|-H|-H#(H|-H|-H|-H|-H|-H|-H(H|-H(H|-H(H{|-H(Hu|-Hr|-DHHl|-H(Hf|-Hk|-HX|-H]|-Hr|-H_|-HL|-H9|-H"(HK|-H`|-HM|-H:|-H'|-H<|-HA|-H.|-Hϭ(H0|-H(H*|-H'|-H$|-H!|-H|-H|-H|-H|-|-H|-H|-[A^]ÐUHH=)H5N)H'1mB)uҹH)H=)mHx)]fDUHSPHH=`)H5)H1m)u}H6)H=/)rmH5H)Hmt H )tH[]H=)H[]mf.@UHAVSH0HuHe"HEЋFEHEHEH}ȃuoHu|tqH]H=H賯At1H=H蚯tH=&H臯t HzLcGlHuLLl{1H0[A^]f.@UHAWAVSH(HuH "HED~D}HG]ԉ]؅y{HHLw(HEMA)AuhHuH}{}L}tlH=L袮AtbH=L艮tOH=%LvtH}111t-HHmdHuHHxmdrdHHH [A^]DUHHHztuHH]H=)] H5s1]UHAVSH HuHaHEDvDuHG]]y tsHHt"H(HtD9uEt$cHt(1.H}111sHscHuH(HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y rHHt\Lw(MtSA)Au7H5!H}HUr}t0}t7LHEbHu9H}Fr1H([A^A_]ILHbHuH(HUHAWAVSH(HuHbHED~D}HG]ԉ]؅y qHHt\Lw(MtSA)Au7H5AH}HUq}t0}t7LH菅aHu9H}fq1H([A^A_]ILHaHuH=(HUHAVSH HuHHEDvDuHG]]y qHHt%H(HtD9uEt'貄H(aHt+12H}111p!HXH`HuHaHHH [A^]ÐUHSH(HuHHEFEHEtH}111Cp!4H`Ht1 H+qHHH([]f.UHSH(HuHHEFEHEtH}111o!较H(`Ht1 HpHHH([]f.UHSH(HuHsHE؋FEHEEȃrH}оUo1[H58H}HUOoH1}tH5H}HUn}t7H荂H^Hu"HoH([]H}о`n1H([]ÐUHH=)H5~)H1^r)u6_H)H=)^H)]fDUHSPHH=)H5))H1^)u^Hf)H=_)b^H5\HL)H]t H 9)tH[]H=))H[]^f.@UHAVSH0HuHUHEЋFEHEHEH}ȃu\Humt^H]H=H裠AtH=H芠t HkLcJ]HuLO]l1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅ylHHLw(HEMA)AuQHuH}lt|}L}tYH=L趟AtOH=L蝟t}utBA9v0tAv0ILRHu6H}Ab1H([A^A_]ILRHuH(HfDUHAVSH HuHHEDvDuHG]]y aHHt H(HtD9uEt"_0 RHt*11H}111a HQHuHcQHHH [A^]UHAVSH HuHHEDvDuHG]]y 4aHHt+H(Ht"D9u!Et-HRQHt(1.H}111`H*QHuH(HHH [A^]f.DUHAVSH HuHcHEDvDuHG]]y t`HHt(H(HtD9uEt*H1PHt(1.H}111`HmPHuH(HHH [A^]fUHAVSH HuHVHEDvDuHGEEy _HHtCH(Ht:xEtH}111_"H}_HOHt1HH [A^]ÉOHf.UHAVSH HuHUHEDvDuHG]]y _HHt H(HtD9uEt"_4=OHt*11H}111^ HOHuHcOHHH [A^]ÐUHH=e)H5)HH 0%O)uH6)H=/)NH#)]ÐUH]ZfDUHSPHH=)H5)HH N)u(Hќ)H=ʛ)NH5xH)HNt H )tH[]H=)H[]OfUHAVSH0HuHHEЋFEHEHEH}ȃuoHu]tqH]H= HӐAt1H=o H躐tH=H觐t H[LcgMHuLlM\1H0[A^]f.@UHAWAVSH(HuH,HED~D}HG]ԉ]؅y\HHLw(HEMA)AuhHuH}\}L}tlH= LAtbH=^L詏tOH=L薏t\fDUHSPHH=)H5))HTH PA)uHa)H=Z)AH5 HG)H@t H 4)tH[]H=$)H[]AfUHAVSH0HuHHEЋFEHEHEH}ȃHudPH]H=H[AtDH=e1HBt1H=SH/tH=Ht HNNLc?HuL?ZO1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y"OHHLw(HEMA)Au{HuH}QO}L}tH=pLBAtuH=L0L)tbH=:LtOH=tLtHt 1H([A^A_]Ic>fDUHAVSH0HuHHEЋFEHEuGH5H}HUM}t@HHtCHH5iHPE1LE>Hu+H}ȾM1H0[A^]E1=HuLmNUHAVSH HuHHEDvDuHG]]y4MHHH(HD9u3HPxHt9HHH5HPE1LE6=HucH}111LRE1=HuCLMHt6HHY=t)HS=HH1Q@H߾<=1HH [A^]UHAVSH HuHHEDvDuHG]]y 4LHHtH(HtD9uEt!1^<Ht+12H}111K!HHc3<HuH8<HHH [A^]UHAWAVSHXHuHd/HEȋFEHGMԉM؅yKHHL(H}JAC6HcH}qKH]H]ME+EԃH}HuKH}HDWKtn}uuIHUL9;HuHUH}DyJ;Hu,Hz(HH}HEH9u$,H}J1H}HEH9t Ht}HHX[A^A_]E1HH}HEH9t Htr}H; fDUHAWAVSHXHuH/HEȋFEHGMԉM؅yJHHL(H}zIAC6HcH}IH]H]ME+EԃH}Hu*JH}HDItn}uuIHUL9HuHUH}DH9Hu,H.y(HH}HEH9u$,H}I1H}HEH9t Ht"|HHX[A^A_]E1HH}HEH9t Ht{H,: fDUHAVSH HuHHEDvDuHG]]y HHHt%H(HtD9uEt1SH8Ht51H}111,HHH [A^]HpHs8HuHtH51HHH8HHw(H뱐UHAWAVSH(HuHHED~D}HG]܉]y GHHt#H(HtD9uA)Et7Ht+12H}111\G!HLc7HuL7HHH([A^A_]f.DUHAWAVSH(HuH[HED~D}HG]܉]y FHHt#H(HtD9uAEt7Ht+12H}111F!HLc6HuL6HHH([A^A_]f.DUHAVSH HuH[4HEDvDuHG]]y 4FHHt"H(HtD9uEt$6Q[6Ht(1.H}111EH36HuHu(HHH [A^]UHAVSH HuHHEDvDuHG]]y EHHtH(HtD9uEt!15Ht+12H}1112E!HHc5HuH5HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y DHHtJLw(MtAA)Au%HuH}/Et'}t.14Hu}tYHEH}Huc?tD}ELUЋEtQLLLLILMPuARuJU >1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H .HuH(n(HUHAWAVAUATSHXHUn(HHEHHHF HG$(y=HHHG(H@LL9=ACD-HcH=HE1EIcHLEL<AH0C?HcHX=HE1EIcHHHIDH@ +$HHu+=LHsHH0D=UHH<9=:HHp<HH<HLD<HEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDH[;E1HHH9t HtqnHHH9t HtTnHkk(HH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLM=!IHLHUHpLM("HuLH(11Ef.EuzEf.EuzEf.Eu{$<"HuH(HUy2pf.Pu'z%xf.XuzEf.`u{'!HuH(Hp2E~>1AfA.Du z HH9u!!HuH(LD1u!HzHa(HHHH9nsUdHHHH9t HtcH-" UHAWAVSHHH`(HHEHHHDvDHGyb0HHL(MA)HAaHu]0ZHHu@0=HHa0"HHF0HH@/HH/HLL/HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL(:n.1H ^(H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1.Ef.`u$z"Ef.huzEf.pu{$-HuHHUj. HuHW-@f. u*z(Hf.(uzPf.0u{'HuHH@-f.u*z(f.uzf.u{'GHuHH- HuHv,HHcH \(H H;M_DUHAWAVSH(HuHɑHEDvDuHG]ԉ]؅yB,HHL(MA)AumHuH},toH5H}HU+}tUIH5kH}HU+}t8}utH}+1H([A^A_]ILLHHHuHcUHAWAVAUATSHH[(HHEHPH>HXF`HGdhy+HHHG(HpLPLi*AC6HcH*HE1EIcHLEL.*AH]C?HcH*HE1EIcHIDHpHI͋`+dHPHH*HPHuE*HPHuD**HPHL]*tiHPLD)tSHEHEf(Ef)EDHxE#A1HxzHPT)E1HHH9t Htj\HHH9t HtM\HdY(HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM0HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU%E~E1HMfA.uzHH9xu"qHuHPHUD%E~>1ADf.u z HH9Eu!-HuHPLDm% HKL-T(IEHHH9?DWHHHH9tHt WHHHH9t HteWH fUHAWAVSHxH\T(HHEHxHHED~D}HG]]y#HHLw(MA)HxAumHu3$toHxHu#tVH5HxHUu#}t9HMHM(E)E}utOHULH.Q$#1H oS(H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$HuHxHUR#H`HcH R(H H;MZUUHAWAVSHhHR(HHEHuHHED~D}HG]]y$"HHLw(MA)H}AuZHu&"HEHE(E)E}t?H?HE( ()E (1f.EuRzP2}!eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU1!Ht1H aQ(H H;Mu#Hh[A^A_]HgH >Q(H H;MtTTUHAVSH HuH[HEDvDuHG]]y HHtH(HtD9uEt!1Ht+12H}111b !HhHcHuHHHH [A^]UHAWAVAUATSHHeP(HHEHpHHxFEHGMMyHHL(Hp\AC6HcH8L81EIcM,LDME+E HpHuHpLDHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpI1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL(IHuLLxEf.EuzEf.EuzEf.Eu{!\ HuHpHU1E~G1fAfA.Du z HH9u! HuHpLDP HtD1H8H@H9t HtOHL(HH;Eu4HHĨ[A\A]A^A_]H?L(HH8H@H9uOHH8H@H9t Ht4OHn  UHAWAVAUATSHH%L(HHEHpH?HxFEHGMMyHHL(HpAC6HcH8~L81EIcM,LDME+E HpHudHpLDJHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL`$IHuLLEf.EuzEf.EuzEf.Eu{! HuHpHU1\E~G1fAfA.Du z HH9u!HuHpLDHtD1H8H@H9t Ht]KHtH(HH;Eu4HHĨ[A\A]A^A_]HG(HH8H@H9uVKHH8H@H9t HtJH.  UHH=])H5>_)HH 0E-^)u Hv^)H=o])Hc])]ÐUH]fDUHSPHH=@])H5^)HFH ])uH H^)H= ])H5H\)H=t H \)tH[]H=\)H[]1fUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H={HIAtDH=HIt1H=HItH=HIt HLclHuLq1H0[A^]UHAWAVSH(HuH<HED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=bLHAtuH=̎LHtbH=ʎLHtOH=LHt(HHEHxHSkHED~D}HG]]y1HHLw(MA)HxAumHutoHxHutVH5eHxHU }t9HMHM(E)E}utOHULHQt 1H =(H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$eHuHxHU AH`HcBH =(H H;MZ+@UHAWAVAUATSHXHuHzHEDvDuHG]ĉ]ȅy~ HHLo(MA)A HuH} H5؅H}HU) }aIH5ąH}HU }@IH5H}HU }IH5ݶH}HU }HH5H}HU }HEH5ZH}HU }HEH58H}HUa }HEH5#H}HU? }t{HEHuH} tfH5H}HU }tL}ELUtNHLLLLILMPARuuuRH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0HuH\:(HUHAWAVAUATSHXH:(HHEHHiHF HG$(y HHHG(H@LLi ACD-HcH HE1EIcHLEL- AH0C?HcH HE1EIcHHHIDH@ +$HHu[ LHsHH0D6 UHH<tHLHUHpLM!IHLHUHpLM(HuLH(1 Ef.EuzEf.EuzEf.Eu{$lHuH(HUpf.Pu'z%xf.XuzEf.`u{'HuH(HpIE~>1AfA.Du z HH9u!HuH(LDHzH5-(HHHH9ns0HHHH9t Ht#0H] UHAWAVSH(HuH9bHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}toH5H}HUe}tUIH5H}HUH}t8}utH}1H([A^A_]ILLHH6HuHc;UHAWAVAUATSHH+(HHEHPHcHXF`HGdhypHHHG(HpLPLAC6HcH;HE1EIcHLELAH]C?HcHHE1EIcHIDHpHI͋`+dHPHH HPHuHPHuDHPHLtiHPLDitSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht,HHH9t Ht,H)(HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$-HuHPHUjE~E1HMfA.uzHH9xu"HuHPHUD E~>1ADf.u z HH9Eu!HuHPLD|HKL- %(IEHHH9?D[(HHHH9tHt 'HHHH9t Ht'H fUHAVSH HuHj`HEDvDuHG]]y dHHt%H(HtD9uEt1HHt51H}111 HH [A^]HpHSHuHtH5xHHHH#(H뱐UHAWAVSHxH#(HHEHxHٛHED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuL!jIHuL`EEf.EuzEf.EuzEf.Eu{!HuHxHU1UHt1H "(H H;Mu%Hx[A^A_]EH "(H H;Mt%UHAWAVAUATSHXHuHdHEDvDuHG]]yHHLo(MnA)H}A NHu]LH5xkH}HU}.IH5dkH}HU} IH5H}HU}IH5=kH}HUf}HH5kH}HUE}HEH5kH}HU#}HEH}HutsH5jH}HU}tYHEH}HuctD}ELUЋEtQLLLLILMPuARuXU 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H HuH( (HUHAWAVSHhH\ (HHEHuHPfHED~D}HG]]yHHLw(MA)H}AuPHuHEHEf(Ef)E}t3fWf)EHEfW1f.EuRzP2GeIHuLXHcEf.EuzEf.EuzEf.Eu{gHuH}HU1IHt1H +(H H;Mu#Hh[A^A_]H1H (H H;Mt"f.UHAWAVSHHH(HHEHHHDvDHGyRHHL(MA)HAaHuMZHHu0=HHQ"HH6HH@HHHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLRn1H (H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!qHuHHU1Ef.`u$z"Ef.huzEf.pu{$HuHHUZHuHG@f. u*z(Hf.(uzPf.0u{'HuHH@f.u*z(f.uzf.u{'7HuHHqHuHfHHcH (H H;MDUHHH(HHEH`HoHhFpHDžtH`0HuJ)H`Hu- HEHE(E)E(E(M)E)MH}HufEf.EuzEf.EuzEf.Eu{!HuH`HU1Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$HuH`HUbHu.H(HH <(H H;Mt&R1H (H H;MuHĠ]@UHHH(HHEH`HoHhFpHDžtH`0Hu)H`Hu} HEHE(E)E(E(M)E)MH}HuEf.EuzEf.EuzEf.Eu{!/HuH`HU1oEf.Eu,z*Ef.EuzEf.EuzEf.Eu{$HuH`HUHu.HF(HH (H H;Mt&1H f(H H;MuHĠ]@UHAWAVSHH9(HHEH@H]HHD~DPHGTXyHHLw(MA)H@AuHut|H@HutcHEHE(E)E(E(M)`)pTtfH}HuEf.Ec1H .(H H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{!HuH@HU1Ef.`u5z3Ef.hu$z"Ef.puzEf.xu{$mHuH@HUIHH(HH (H H;M1f.UHAWAVSHH(HHEH@H]HHD~DPHGTXybHHLw(MA)H@AuHuat|H@HuHtcHEHE(E)E(E(M)`)pTtfH}HujEf.Ec1H (H H;MHĨ[A^A_]E1M2IHuHULEf.EuzEf.EuzEf.Eu{!HuH@HU1Ef.`u5z3Ef.hu$z"Ef.puzEf.xu{$HuH@HUZHH(HH (H H;MUHH=5-)H5.)HH 0-)u]`H.)H=,)H,)]ÐUH]fDUHSPHH=,)H5i.)H H X-)u_H-)H=,)]H5H,)Ht H t,)tH[]H=d,)H[]fUHAVSH0HuHUHEЋFEHEHEH}ȃuoHutqH]H=]HAt1H=?HtH=Hwt HLc7HuL<1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yrHHLw(HEMA)AuhHuH}}L}tlH=LLAtbH=.LytOH=׊Lft)HH 0襻-)uٻHv)H=o)rHc)]ÐUH]8fDUHSPHH=@)H5)HH @)utH)H= ) H5mH)H蝺t H )tH[]H=)H[]鑻fUHAVSH0HuHpHEЋFEHEHEH}ȃuoHuXtqH]H=HSAt1H=4H:tH=tH't HYLcHuLe1H0[A^]f.@UHAWAVSH(HuHoHED~D}HG]ԉ]؅y"HHLw(HEMA)AuhHuH}Q}L}tlH=LBAtbH=#L)tOH=sLtcLtH}111-HHmHuHHxmrHHH [A^]DUHAVSH HuHۡHEDvDuHG]]y 贳HHt"H(HtD9uEt$蠰ۣHt(1.H}111_H賣HuHG'HHH [A^]UHAVSH HuHWHEDvDuHG]]y HHtH(HtD9u 0Ht1H}111贲 H'HHH [A^]UHAVSH HuHHEDvDuHG]]y tHHt H(HtD9uEt"_8蝢Ht*11H}111! HsHuHcxHHH [A^]UHH0HuHwHEFEHEH}؃u'HuQt}諯Ht1H0]þ舱1H0]H}'HH0]@UHAVSH HuH÷HEDvDuHG]]y DHHt H(tD9umHt1H}111 H'HHH [A^]f.UHAVSH HuH޷HEDvDuHG]]y 褰HHt+H(t$D9u#11qΠHuHb'H1H}111FHH [A^]f.@UHSH(HuHHEFEHEtH}111 IHt1 HcJHHH([]f.UHAWAVSH(HuHUHED~D}HG]ԉ]؅y 蒯HHt\Lw(MtSA)Au7H5H}HU^}t0}t7LH艬蔟Hu9H}1H([A^A_]ILHYHuH'HUHAVSH HuHHEDvDuHG]]y 贮HHt!H(HtD9uEt#H_0ܞHt+12H}111`!HH豞HuHHHHH [A^]DUHAWAVSH(HuH HED~D}HG]܉]y HHt#H(HtD9uAEt(Ht+12H}111謭!HLcHuLHHH([A^A_]f.DUHAVSH HuHQHEDvDuHG]]y DHHt H(HtD9uqHmHt1(H}111HHxX]HHH [A^]UHAVSH HuHHEDvDuHG]]y 褬HHt%H(HtD9uEt'&HȜHt+1>H}111L-HH蝜HuHHx蝜袜HHH [A^]DUHAWAVSH(HuH)HED~D}HG]ԉ]؅y HHtQLw(MtHA)Au,H5H}HU讫}t%}t,Hu9H}q1H([A^A_]ILH贛HuHH'HUHAWAVSH(HuHdHED~D}HG]ԉ]؅y HHtQLw(MtHA)Au,H5H}HUު}t%}t,Hu9H}衪1H([A^A_]ILHHuHx'HUHSH(HuHHE؋FEHEuiH5H}HU?}tbHH}Hu質tNH}Hu袪t=uUHHPHu"HH([]H}оũ1H([]UHSH8HuHHEЋFEHEHEujH5aH}HU臩}tcHH}HutOH}Hu̩t>uHUH7H藙Hu"H.H8[]H}Ⱦ 1H8[]UHSH8HuHHEЋFEHEHEuiH5H}HUǨ}tbHH}Hu;tNH}Hu t=uHUH蛦ژHu$Hn'HH8[]H}ȾM1H8[]UHSH8HuHHEЋFEHEHEu~H5H}HU}twHH}Hu{tcH}HuLtRH}HuYtAuHUMHUHHu"H蚨H8[]H}Ⱦx1H8[]UHSHHHuHGHEFEHEHEH5 H}HU3}HH}Hu裧H}Hu莧H}Hu[H}HudtpH}HuSt_H}HuBtNuUHMDEDME$HfHu$Hu'HHH[]H}T1HH[]f.DUHSH(HuHHE؋FEHEuhH5H}HU}taHH}Hu胦tMH}HurtH5H}HU}t7H9HKHu"HH([]H}о1H([]ÐUHH=%(H5(HZH 0E(uH(H=(H(]ÐUH]队fDUHSPHH=(H5Y(HH ~H(u,H(H=(~H5Hw(H=~t H d(tH[]H=T(H[]1fUHAVSH0HuH3HEЋFEHEHEH}ȃu\Hut^H]H=2HAtH=K8Ht H Lc}HuL}1H0[A^]ÐUHAWAVSH(HuHl3HED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}t|}L}tYH=ELAtOH=^7LtH}111{-HHkHuHHxklHHH [A^]DUHAVSH HuHkiHEDvDuHG]]y D{HHt"H(HtD9uEt$覆kkHt(1.H}111zHCkHuHת'HHH [A^]UHAWAVSH(HuHPHED~D}HG]ԉ]؅y zHHt\Lw(MtSA)Au7H5H}HU^z}t0}t7LHjHu9H}z1H([A^A_]ILHYjHuH'HUHAWAVSH(HuH2HED~D}HG]ԉ]؅y yHHt\Lw(MtSA)Au7H5H}HU~y}t0}t7LHIiHu9H}6y1H([A^A_]ILHyiHuH 'HUHAVSH HuHHEDvDuHG]]y xHHt%H(HtD9uEt'xHhHt+12H}111|x!HXHhHuHhHHH [A^]ÐUHHHztuHH]H=(]鐅H5 x1]UHSH(HuHHE؋FEHEEȃrH}оw1[H5H}HUwH1}tH5H}HUw}t7HH[gHu"HwH([]H}оv1H([]ÐUHH=(H5.(H4H 0Ug(u=Hf(H=_("gHS(]ÐUH]lfDUHSPHH=0(H5(HH f(uH(H=(fH5H(HMft H (tH[]H=(H[]AgfUHAVSH0HuHHEЋFEHEHEH}ȃuoHuvtqH]H= HAt1H=HtH=H Hרt H tLceHuLeu1H0[A^]f.@UHAWAVSH(HuH\HED~D}HG]ԉ]؅ytHHLw(HEMA)AuhHuH}u}L}tlH=LAtbH=L٧tOH=7LƧt^Ht*11H}111-n H^HuHc^HHH [A^]UHAVSH HuHfHEDvDuHG]]y mHHt$H(HtD9uEt&蔐]Ht*10H}111}mH]Hu։]HHH [A^]@UHAWAVSH(HuH[HED~D}HG]ԉ]؅y "mHHtaLw(MtXA)Au}utBA9vTtAvTIL]Hu6H}l1H([A^A_]IL \HuH{'HfDUHAVSH HuHHEDvDuHG]]y DlHHt H(HtD9uEt"_Tm\Ht*11H}111k H(C\HuHcH\HHH [A^]UHAVSH HuHzHEDvDuHG]]y kHHt+H(Ht"D9u!Et-H [Ht(1.H}1116kH0[HuH'HHH [A^]f.DUHAVSH HuHHEDvDuHG]]y jHHt(H(HtD9uEt*H1 ZHt(1.H}111yjH8ZHuHa'HHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y "jHHtaLw(MtXA)Au}utBA9vPtAvPILZHu6H}i1H([A^A_]IL@YHuH{'HfDUHAVSH HuHHEDvDuHG]]y DiHHt H(HtD9uEt"_PmYHt*11H}111h HHCYHuHcHYHHH [A^]UHAVSH HuHHEDvDuHG]]y hHHt+H(Ht"D9u!Et-H@XHt(1.H}1116hHPXHuH'HHH [A^]f.DUHAVSH HuH4HEDvDuHG]]y gHHt(H(HtD9uEt*H1@WHt(1.H}111ygHXWHuHa'HHH [A^]ÐUHAVSH=)z1)XHHϖ'H=((H18IH uHuXL[A^]DUHAVSH=y1WHH'H=p(H18IH uH%XL[A^]DUHAVSH=y1WHH/'H=(H18IH uHWL[A^]DUHAVSH=9y19WHHߕ'H=(H18IH uHWL[A^]DUHAVSH=x1VHH'H=H(H18IH uH5WL[A^]DUHAWAVAUATSPH=(H54(HCH FKV+(Hp(Hq(L5j(L VH(LGfH5`H]HLUtH .(u H=%(VH(HUH(HeH52H}H9UtH x(u H=o(:VH(HkUH (HeH5H}HTtH (u H=(UHE(HUHj(HZeH5H}HTtH (u H=(UH(HTH(H eH5{H}HOTtH V(u H=M(PUAL='L%(fIItqC4>H=v1THLH1H?'8IH tMuf.HTMtKt>H}LSIMuLTH=4v112THH=(H1H̒'8IH uH~TMt H5H}LLSIuLYTH=u1SHH=l(H1Hh'8IH uHTMt H5H}LRIuLSH=ou1jSHH=(H1H'8IH uHSMt H5(H}LRIuLSH= u1SHH=<(H1H'8IH uHRSMt H5H}L RIuL-SH=t1RHH=(H1H<'8IH uHRMt H5vH}LQIuLRH=Ct1>RHH=t(H1Hؐ'8IH uHRMt H5'H}LXQIuLeRH=s1QHH=(H1Ht'8IH uH&RMt H5H}LPIuLRH={s1vQHH=(H1H'8IH uHQMt H5H}LPIuLQH=s 1QHH=H(H1H'8IH uH^QMt H5(H}L,PIuL9QH=r1PHH=|(H1HH'8IH uHPMt H5ϿH}LOIuLPH=Or1JPHH=(H1H'8IH uHPMt H5zH}LdOIuLqPH=q11OHH=O(H1H'8IH uH5PMt H5%H}LOIuLPH=q1OHH=(H1H'8IH uHOMt H5˾H}LNIuLOH=&q1!OHH=(H1H'8IH uHmOMt H5sH}L;NIuLHOH=p1NHH=#(H1HW'8IH uH OMt H5H}LMIuLNH=m(NHa(H[A\A]A^A_]f.UH]8vfDUHSPHrH5џH(HjMt H (tH[]H=(H[]^NfDUHAVSH0HuHHEЋFEHEHEH}ȃuoHu(]tqH]H=EH#At1H=AH tH=hHt H)[LcLHuLL5\1H0[A^]f.@UHAWAVSH(HuH|HED~D}HG]ԉ]؅y[HHLw(HEMA)AuhHuH}!\}L}tlH=4LAtbH=0LtOH=WLtH([A^A_]fUHAVSH0DvHGD)؃tdHuHɽHEDu؉]܉]y"NHHH(HD9eeH?>HeHuHmHEDu؉]܉]y MHHtuH_(HEHtEHuH}Nt4HuHdH=HuHkNHH5JM1HH0[A^]H}1113MHEf.UHAWAVSH(HuHfHED~D}HG]ԉ]؅y LHHt`Lw(MtWA)Au;H5mH}HUL}t4LHed<HuHc<H}rL1H([A^A_]fUHAWAVSH(HuH HED~D}HG]ԉ]؅y 2LHHt^Lw(HEMt2A)Au-HuH}iLtHuLed8<Ht'1+H}K1HE1Hc<H([A^A_]fUHAVSH0DvHGD)؃tdHuHHEDu؉]܉]yRKHHH(HD9bHo;HeHuHWHEDu؉]܉]y JHHtuH_(HEHtEHuH}6Kt4HuHHHtWLw(MtNA)Au2HuH}>t4uLVa.HuHcf.H}=1H([A^A_]fUHAWAVSH(HuHHEDvDuHG]ԉ]؅y =HHtwL(MtnA)AuRH5tH}HUn=}tKIHuH}=t7ULL4U-HuHc-H} =1H([A^A_]fUHAWAVSH(HuHݼHED~D}HG]ԉ]؅y <HHtXLw(MtOA)Au3HuH}/=t5uLrTH,HuHw=H}Z<1H([A^A_]ÐUHAWAVSH(HuH`HED~D}HG]ԉ]؅y "<HHtXLw(MtOA)Au3HuH}<t5uLTH0,HuH<H};1H([A^A_]ÐUHHHHGzu H=ʽ(]HH5.^;1]@UHAVSH0HuHܾHEЋFEHEH}ȃuTHu;tV}THr+HuAHtGHnIHH+Hu#B+HL%+:1H0[A^]Hj'HDUHAVSH0HuH:HEЋFEHEH}ȃuTHu;tV}VSH*HuAHtGHmIHH*Hu#*HLu*:1H0[A^]H j'HDUHAWAVSH8HuHHED~D}HG]̉]Ѕy9HHLw(EMA)AH}AucHu:teH}Hu :tTEй;E}H}Hu9t6Mu܋ULQ)HuH/i'H91H8[A^A_]E1EM]fUHAWAVSH(HuHhHED~D}HG]ԉ]؅y 8HHtkLw(MtbA)AuFHuH}9tHHuH}9t7uULP(HuHc(H}781H([A^A_]f.@UHAWAVSH(HuH=HED~D}HG]ԉ]؅y7HHLw(EMtzAArH}7ZHuH}-8tIEغ;E}HuH}8t+UuLO'HuHTg'H E1H([A^A_]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y 7HHtdLw(EMtPD)؃rH}116LD9}HuH}97tuLN&Ht1E1 Hc&HHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y $6HHt,H(Ht#D9u"Et.$NA&Ht(1.H}1115H&HuHe'HHH [A^]f.@UHAVSH HuH HEDvDuHG]]y d5HHt)H(Ht D9uEt+1gM%Ht(1.H}1115H\%HuHd'HHH [A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y4HHLw(EMtzAArH}`4ZHuH}4tIEغ;E}HuH}4t+UuLuL$HuHd'H E1H([A^A_]f.UHAWAVSH(HuH]HED~D}HG]ԉ]؅y 3HHtdLw(EMtPD)؃rH}11v3LD9}HuH}3tuLxK#Ht1E1 Hc#HHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y 2HHt,H(Ht#D9u"Et.J#Ht(1.H}1112H"HuHmb'HHH [A^]f.@UHAVSH HuHrHEDvDuHG]]y $2HHt)H(Ht D9uEt+19JD"Ht(1.H}1111H"HuHa'HHH [A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅yr1HHLw(EMtzAArH} 1ZHuH}1tIEغ;E}HuH}1t+UuLI@!HuH`'H E1H([A^A_]f.UHAWAVSH(HuH¾HED~D}HG]ԉ]؅y 0HHtdLw(EMtPD)؃rH}1160LD9}HuH}0tuL Hk Ht1E1 Hca HHH([A^A_]f.@UHAVSH HuHSHEDvDuHG]]y /HHt,H(Ht#D9u"Et.GHt(1.H}111E/HHuH-_'HHH [A^]f.@UHAVSH HuH׽HEDvDuHG]]y .HHt)H(Ht D9uEt+1FHt(1.H}111.H HuHp^'HHH [A^]ÐUHAWAVSH(HuHlHED~D}HG]ԉ]؅y2.HHLw(EMtzAArH}-ZHuH}m.tIEغ;E}HuH}O.t+UuLEHuH]'H E1H([A^A_]f.UHAWAVSH(HuH'HED~D}HG]ԉ]؅y B-HHtdLw(EMtPD)؃rH}11,LD9}HuH}y-tuLD+Ht1E1 Hc!HHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y d,HHt,H(Ht#D9u"Et.jDHt(1.H}111,H(YHuH['HHH [A^]f.@UHAVSH HuH<HEDvDuHG]]y +HHt)H(Ht D9uEt+1CHt(1.H}111H+H0HuH0['HHH [A^]ÐUHAWAVSH(HuHѻHED~D}HG]ԉ]؅y*HHLw(EMtzAArH}*ZHuH}-+tIEغ;E}HuH}+t+UuLBHuHTZ'H E1H([A^A_]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y *HHtdLw(EMtPD)؃rH}11)LD9}HuH}9*tuLAHt1E1 HcHHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y $)HHt,H(Ht#D9u"Et.0AAHt(1.H}111(H8HuHX'HHH [A^]f.@UHAVSH HuHHEDvDuHG]]y d(HHt)H(Ht D9uEt+1s@Ht(1.H}111(H@\HuHW'HHH [A^]ÐUHAWAVSH(HuH6HED~D}HG]ԉ]؅y'HHLw(EMtzAArH}`'ZHuH}'tIEغ;E}HuH}'t+UuL?HuHW'H E1H([A^A_]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y &HHtdLw(EMtPD)؃rH}11v&LD9}HuH}&tuL>Ht1E1 HcHHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y %HHt,H(Ht#D9u"Et.D>Ht(1.H}111%HHHuHmU'HHH [A^]f.@UHAVSH HuHHEDvDuHG]]y $%HHt)H(Ht D9uEt+1=DHt(1.H}111$HPHuHT'HHH [A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅yr$HHLw(EMtzAArH} $ZHuH}$tIEغ;E}HuH}$t+UuL<@HuHS'H E1H([A^A_]f.UHAWAVSH(HuHzHED~D}HG]ԉ]؅y #HHtdLw(EMtPD)؃rH}116#LD9}HuH}#tuL;kHt1E1 HcaHHH([A^A_]f.@UHAVSH HuHHEDvDuHG]]y "HHt,H(Ht#D9u"Et..;Ht(1.H}111E"HXHuH-R'HHH [A^]f.@UHAVSH HuHHEDvDuHG]]y !HHt)H(Ht D9uEt+1q:Ht(1.H}111!H`HuHpQ'HHH [A^]ÐUHAWAVSH(HuHMHED~D}HG]ԉ]؅y 2!HHtiLw(EMtUD)؃rH}11 fD9}HuH}i!t]ԋut!L9Ht%1+E1 ILHuHP'HHH([A^A_]@UHAWAVSH(HuHHED~D}HG]ԉ]؅y B HHtiLw(EMtUD)؃rH}11fD9}HuH}y t]ԋut!L17&Ht%1+E1 ILHuHO'HHH([A^A_]@UHAWAVSH(HuHHED~D}HG]ԉ]؅y RHHt\Lw(MtSA)Au7H5aH}HU}t0}t7LH 8THu9H}1H([A^A_]ILHHuHN'HUHAWAVSH8D~HGD)؍PsqHuHHED}ȉ]̉]ЅyeHHLw(HEHEMDH}HuHHED}ȉ]̉]ЅyHHMH_(HKH5]`H}HU}-IH}HuFH}Hu1H}HuHUHMDEHL+5 HH5WH5_H}HU}INjEȋM9}H}HutrEȋM9}H}HutWHUHM1LLE14 Hu7HL'H+E1HEHEMX 1H1HH8[A^A_]UHAWAVSH(HuHHED~D}HG]ԉ]؅y 2HHt`Lw(MtWA)Au;H5^H}HU}t4LH3: HuHK'HH}1H([A^A_]fUHAWAVAUATSHxHuHZHEFEHGMĉMȅypHHSLo(H]H߾AHcHh[HhHEH߾AHcH}4L}EME+EărH}H5j]H}HU}tlHH}HuDtUH}LDtBMȰ;M}H}Hut'}DLHHUL2 HtP1H}HEH9t Ht^MHhHpH9t HtAMHHx[A\A]A^A_]E1HI'HH}HEH9uHHH}HEH9t HtLHhHpH9t HtLH  @UHAVSH@HHJHG)ǃHUH=$H}ЉM؉E܉EyHHDHHH^(HH5[H}HU}IH}HutoH}Hut^H}Hu}tMHUHMLEHL1 Hu,HH'H"H=?(H@[A^]%H5Sl1H@[A^]1HIf.@UHAWAVATSH@HuHHEDvDuHG]̉]Ѕy HHLg(MA)AH5NH}HU}IH5pNH}HU}tdIHuH}QtPHuH}@t?HMLELLL0HuH_G'HH}C1H@[A\A^A_]UHAWAVATSH@^HG)ЃHuHHE]ȉỦUЅyHHH_(HH5jMH}HU}sIH5IMH}HU}RIH5H}HUw}1IH5H}HUV}HLLLI-HHuHHE]ȉỦUЅy HHH_(HH5LH}HU}IH5gLH}HU}ttIH}HuHt`H}Hu7tOH}Hu&t>HMLELMHLL,HuHAE'HH5E$1H@[A\A^A_]1H7fUHAWAVSH8D~HGD)؍PsqHuHHED}ȉ]̉]ЅyHHLw(HEHEMDH}sHuH HED}ȉ]̉]Ѕy[HHMH_(HKH5VH}HU(}-IH}HuH}HuH}HunHUHMDEHL,HH5IH50VH}HU}INjEȋM9}H}HutrEȋM9}H}HutWHUHM1LLE1+}Hu7HC'H+E1HEHEMX 1H1HH8[A^A_]UHAWAVAUATSHxHuHڼHEFEHGMĉMȅyHHL(H}AC6HcHhxLh1EIcMdLDMYE+Eă5H5TH}HU"}*HH}HuH5H}HUHE}H}LD HDEArIDI9II91)HHHHt@I|I'HH} 1HH[A^A_]E1M0UHAWAVATSH@HuHHEDvDuHG]̉]Ѕy HHLg(MA)AH5PH}HUp }IH5OH}HUO }teIHuH} tQHuH} t@HMELLLa%ZHuH<'HH} 1H@[A\A^A_]UHAWAVSH8HuH HED~D}HG]̉]Ѕy HHtrLw(HEMtFA)AuAHuH} t,HuH} tHuUL$Ht01!H} 1 HE1H8[A^A_]HcYDUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtkLw(MtbA)AuFHuH} tHHuH} t7uUL$HuHcH}' 1H([A^A_]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtSLw(MtJA)Au.HuH}? t0}ut4Lj"Hu6H}o 1H([A^A_]ILHuHI:'H@UHAWAVSH(HuHHED~D}HG]ԉ]؅y  HHtbLw(HEMt6A)Au1HuH}I t}Hut9LHt=1CH} 1,HE1 ILHuHk9'HH([A^A_]f.UHAWAVSH8HuHHEDvDuHG]ԉ]؅y" HHL(MA)AuhH5KH}HU}taIHuH}x tMHuH}g tEf.E_-1H x'H H;MHĘ[A^A_]E1ML1EIcM$LDM#|jHhH5m1 xHhHuH5B_HhHU}HHhH HhH(jHhHuRHhHud5HhLDJE8EHEXE@EPE`DEHA1H#xHhHuH5]HhHUT}_HH5HhHU0H0}4HhH HhH(iHhHucHhHuHhLDE@EPE`EHEXEDEHA1HME1*E1HhHh1HHH9t HtH'HH;EHH[A\A]A^A_]HII9s,II9s#1HII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHH9)HHHHtI4I4HHuHHrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH0H (IHL4$HuLELMLHH0IEf.8u$z"Ef.HuzEf.Xu{!HuHhHU1HuUHhEf.@u$z"Ef.PuzEf.`u{$UHuHhHUE~=1AfA.u z HH9u!HuHhLDPHLHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHH9)HHHHtI4I4HHuHHrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH8L (IHLt$HMH $HuLMLHH0H8IEf.@u$z"Ef.PuzEf.`u{!%HuHhHU1eHuUHh]Ef.Hu$z"Ef.XuzEf.u{$HuHhHUE~=1AfA.u z HH9u!nHuHhLDMHLTHHHH9,HHHH9t HtH UHAWAVAUATSHH 'HHEH HH(F0HG48y0HHL(H ACD-HcHL1EIcM$LDMG0+4H HuH53UH HOOHH H H HH HHH HpIt|H LD3tfHEHE(E)E(p)PHEH`DH@EAst1H@WH {1HHH9t Ht H 'HH;EBHH[A\A]A^A_]E1#H@II9sII9s1HpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH@H9)HHHHtI4I4HHuHH@rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u4Ht#L4$HuLHLpLHp(IHL4$HuLHLpLHIEf.EuzEf.EuzEf.Eu{!HuH HU1aHuHH pf.Pu'z%xf.XuzEf.`u{'HuH HpAE~A1AfA.uzHH9@u!HuH LDHL-HHHH9y HHHH9t Ht HO fUHAVSH HuHHEDvDuHG]]y HHt%H(HtD9uEt'HHt+1>H}111L-HHHuHHxHHH [A^]DUHAVSH HuHYHEDvDuHG]]y HHtHG(HtD9uHXPHt1H}111 HHHH [A^]UHAVSH HuH_HEDvDuHG]]y THHtHG(HtD9uHXXHt1H}111 HHHH [A^]UHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111oHHuHW'HHH [A^]UHAVSH HuH2HEDvDuHG]]y HHt"H(HtD9uEt$;Ht(1.H}111HHuH'HHH [A^]UHAVSHH'HHEDvHGD)؃HuH^HEDu]ĉ]ȅy=HHuH(HhD9HZHIH߾tHH*'HH;E7`HuHۺHEDu]]yHHH_(HH}Hu(E)`(E)pEEEEHuHf(pfMf(`fEfkPuEf.EuzEf.Eu{UHuH}HU17Hu*H'HH'HH;Et"NH5͹1H'HH;Eu.HHĐ[A^]H}111tH'HH;EtUHAVSH`H'HHEDvHGD)؃pHuHHEDu]ĉ]ȅyHHPH(HCD9XcH-H$H߾GHH'HH;E8HuHFHEDu]ĉ]ȅyHHH_(HH}HuкEEEEEEHuHEf.EuzEf.EuzEf.Eu{MHuH}HU1/Hu*H&HH 'HH;Et"KH5]1H&HH;Eu+HH`[A^]H}111oH&HH;Etf.@UHAVSH0HuHקHEDvDuHG]܉]y $HHt"H(HtD9uEKHt1H}111 E3HHH0[A^]UHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$諾Ht(1.H}111/H胾HuH&HHH [A^]UHAVSHPH>&HHEDvHGD)HuHHEDu]ĉ]ȅyHHH_(HH}HuкEEEE}HuH9Ef.EHuHHEDu]ĉ]ȅy HHt@H(Ht7D9uTHAHu H߾_HH51H&HH;EHHP[A^]H}111HHuHEf.EuzEf.Eu{踼HuH}HU1蚼HuH*&Hhf.UHAVSH HuH$HEDvDuHGEEy HHtCH(Ht:xEtH}111"H}HHt1HH [A^]HcHf.UHAVSH HuHBHEDvDuHG]]y 4HHt%H(HtD9uEt'4HXHt+1>H}111-HH-HuHHx-2HHH [A^]DUHAWAVSH(HuH HED~D}HG]܉]y rHHt#H(HtD9uAEt蘺Ht+12H}111!HLcmHuLrHHH([A^A_]f.DUHAWAVSH(HuHpHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HU~}t0}t7LH-费Hu9H}61H([A^A_]ILHyHuH &HUHAWAVSH(HuHRHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H51H}HU}t0}t7LHԸHu9H}V1H([A^A_]ILH虸HuH-&HUHAVSH HuHtHEDvDuHG]]y HHtH(HtD9uɹHt1H}111 HcHHH [A^]f.UHAWAVSHhH&HHE^HG)ЃHuH8HE]UUy0HHkH_(H^H}HuMD(E)ED}Duԃ}HHuH1HuHHE]UUy HHtzH_(EHH}HuH}Hu(E)ED}Duԃ}Et9HuHO;H5$ pEjHHuHH HuHfoEfvEP<u D9}uD9ut(HuH}HU1} Ht1H &H H;Mu%Hh[A^A_]H&HH &H H;MtfUHHHztuHH]= H=T(]H51]UHAWAVSH(HuH;HED~D}HG]ԉ]؅y HHtVLw(MtMA)Au1HuH}Ot3}ut7LHHu9H}|1H([A^A_]IL H迴HuHVUHAWAVSH(HuH+HED~D}HG]ԉ]؅y "HHtVLw(MtMA)Au1HuH}t3}ut7L H*Hu9H}1H([A^A_]IL0HHuHUHAVSH HuHJHEDvDuHG]]y THHtH(HtD9u;~Ht1H}111 8HHH [A^]f.UHAVSH HuH+HEDvDuHG]]y HHtH(HtD9u觴޲Ht1H}111b 蘲HHH [A^]f.UHAVSH HuHHEDvDuHG]]y HHtH(HtD9uEt!1>Ht+12H}111!HHuHHHH [A^]UHAVSH HuH0HEDvDuHG]]y dHHtH(HtD9uEt!1莱Ht+12H}111!HcHuH2HHH [A^]UHAVSH HuHTHEDvDuHG]]y HHt H(HtD9u賲HݰHt1H}111a H_HHH [A^]f.fUHAVSH HuHHEDvDuHG]]y HHtH(HtD9u=@Ht1H}111Ŀ H&HHH [A^]UHAVSH HuHHEDvDuHG]]y 脿HHt H(HtD9u蛱H譯Ht1H}1111 H/HHH [A^]f.fUHAVSH HuHHEDvDuHG]]y HHt H(HtD9uѰH Ht1H}111葾 H菿HHH [A^]f.fUHAVSH HuHHEDvDuHG]]y DHHtH(HtD9ugpHt1H}111 H&HHH [A^]UHAVSH HuH HEDvDuHG]]y 贽HHt H(HtD9uůHݭHt1H}111a H_HHH [A^]f.fUHAVSH IUH]HH5HHǾsH5<HMt=LH}HH5HHLH5HH5H}pH5\HaMt0H5LtH}H5LHvH}HH}H1QH}1H [A^]HH}H{ DUHSH(HuHHE؋FEHEEȃrH}о赻1[H5H}HU读H1}tH5H}HU}t7HQHKHu"HH([]H}о1H([]ÐUHH=J(H5L(H"H 0E K(uHVK(H=OJ(HCJ(]ÐUH]fDUHSPHH= J(H5K(HH J(uXHJ(H=I(譪H5HI(H=t H I(tH[]H=I(H[]1fUHSH(HuH_HE؋FEHEHEH}Ѓu1Hut3H}̩HuHcѩH([]þE1H([]UHAWAVSH(HuH_HED~D}HG]ԉ]؅y HHtdLw(HEMt8A)Au3HuH}It}Hut;HHt<1@H}蒸1)HE1ILP֨HuHcۨH([A^A_]f.@UHAVSH0HuH_HEЋFEHEuGH5cH}HU}t@HHtCHH5HPE1LECHu+H}Ⱦŷ1H0[A^]E1HuL譸UHAVSH HuH_HEDvDuHG]]ytHHH(HD9u3HPxHt9HHH5HPE1LEvHucH}111RE1VHuCLHt6HH虧t)H蓧HH1Q@H߾|1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y rHHt#H(HtD9uAEt蘦Ht+12H}111!HLcmHuLrHHH([A^A_]f.DUHHHztuHH]H=H(] H5蚵1]UHSPHH=HtZH= HtGH=Ht4H=Ht!H=9`HtHH[]H[]f.@UHSH(HuHHE؋FEHEEȃrH}оŴ1[H5H}HU迴H1}tH5H}HU}t7HH[Hu"HH([]H}ог1H([]ÐUHH=uF(H5H(H5H 0UF(uHFG(H=?F("H3F(]ÐUH]fDUHSPHH=F(H5G(HЧH F(uxHF(H=E(轣H5HE(HMt H E(tH[]H=E(H[]AfUHAVSH0HuHXHEЋFEHEHEH}ȃHuH]H=HAtDH=Ht1H=HtH=-]Ht HLc|HuL聢1H0[A^]UHAWAVSH(HuHLXHED~D}HG]ԉ]؅y±HHLw(HEMA)Au{HuH}}L}tH=LAtuH=LtbH=LtOH=\LtH5 H}HU/}t7H诱HkHu"HH([]H}о1H([]ÐUHH=A(H5C(Hc1jB(u趜H[B(H=TA(7HHA(]fDUHSPHH=0A(H5B(H1A(uaHB(H=@(H5ߤH@(Hrt H @(tH[]H=@(H[]ff.@UHAVSH0HuHPHEЋFEHEHEH}ȃu\Hu(t^H]H=KH#AtH={UH t H<LcʚHuLϚH1H0[A^]ÐUHAWAVSH(HuHPHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}At|}L}tYH=^L6AtOH=TLt|HuH|UHAVSH HuHHEDvDuHG]]y HHtH(HtD9u@|Ht1H}111ċ H&HHH [A^]UHAWAVSH8HuH&HED~D}HG]܉]y肋HHLw(MtuA)H}AuYHut[H}HutJH}Hu׋t9HuHUHMLd{HuH&H1H8[A^A_]E1MrfUHAWAVSHHuH3HED~D}HG]ԉ]؅y菊HHLw(HEW)E)E)E)p)`MtaA)H}Au}HutGH}HuЊt6H}HuH`tHuHUHMLƂEzHtN1Hht H` zHHĈ[A^A_]þ褉1HhuE1'H&HHhu봐UHH=e)(H5*(HNH 0z)(uTH6*(H=/)(yH#)(]ÐUH]RfDUHSPHH=)(H5*(HH y)(uxTH)(H=((myH5H((Hxt H ((tH[]H=((H[]yfUHAVSH0HuHe.HEЋFEHEHEH}ȃuoHu踈tqH]H=&H賻At1H=H蚻tH=2H臻t H蹆LcGxHuLLxŇ1H0[A^]f.@UHAWAVSH(HuH .HED~D}HG]ԉ]؅y肇HHLw(HEMA)AuhHuH}豇}L}tlH=L袺AtbH=L艺tOH=1Lvt<tHLHUHpLMvg!IHLHUHpLM(^HuLH(1mEf.EuzEf.EuzEf.Eu{$<^HuH(HUynpf.Pu'z%xf.XuzEf.`u{']HuH(HpnE~>1AfA.Du z HH9u!]HuH(LDmu]HzH&HHHH9nsUHHHH9t HtH-^ UHAWAVSHHH&HHEHH6HDvDHGyblHHL(MA)HAaHu]lZHHu@l=HHal"HHFlHH@kHHkHLLkHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLcnj1H &H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!ZHuHHU1jEf.`u$z"Ef.huzEf.pu{$-ZHuHHUjj ZHuHWi@f. u*z(Hf.(uzPf.0u{'YHuHH@if.u*z(f.uzf.u{'GYHuHHi YHuHvhXHHcYH ט&H H;MDUHAWAVSH(HuHHEDvDuHG]ԉ]؅yBhHHL(MA)AumHuH}htoH5DH}HUg}tUIH5kDH}HUg}t8}utH}g1H([A^A_]ILLHHWHuHcWUHAWAVAUATSHH&HHEHPH>HXF`HGdhygHHHG(HpLPLifAC6HcHfHE1EIcHLEL.fAH]C?HcHfHE1EIcHIDHpHI͋`+dHPHHfHPHuEfHPHuD*fHPHL]ftiHPLDetSHEHEf(Ef)EDHxE#A1HxzHPTeE1HHH9t HtjHHH9t HtMHd&HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMZHpHHUHMMPEf.EuzEf.EuzEf.Eu{$QHuHPHUaE~E1HMfA.uzHH9xu"qQHuHPHUDaE~>1ADf.u z HH9Eu!-QHuHPLDma QHKL-&IEHHH9?DHHHH9tHt 艓HHHH9t HteHQ UHH=(H5(HqH 0P(uQH(H=(PH(]ÐUH]fDUHSPHH=(H5I(H H PP8(uPH(H=z(PH5؄Hg(HOt H T(tH[]H=D(H[]PfUHAVSH0HuHHEЋFEHEHEH}ȃu\Huh_t^H]H=IHcAtH= HJt H|]Lc OHuLO^1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅yR^HHLw(HEMA)AuQHuH}^t|}L}tYH=\LvAtOH=L]t[)ILIKHuLZHHH([A^A_]fUHAWAVSHH9&HHEH HHH(D~D0HG48yZHHBLw(ƅGMA)H AHuZH HuZH HT{ZH HGZHEHE(E)E(E)`HEHpHTHH\PDGHuHUHTLE;Eu(E;Eu E;EuE;EuE;EuE;Et!IHuH HU1ZE;`u7E;du,E;hu!E;luE;pu E;tt$eIHuH HUYT;HuX;Lu\;Pt'IHuH HTcYHHuH&HlX1H &H H;Mu#H[A^A_]E1ƅGM誋fDUHAVSH HuHHEDvDuHG]]y XHHtH(HtD9u5.HHt1H}111W GHHH [A^]f.UHAWAVSH(HuHQHED~D}HG]ԉ]؅y bWHHtWLw(MtNA)Au2HuH}Wt4uLr}qGHuHcvGH}V1H([A^A_]fUHAWAVSH(HuHbHED~D}HG]ԉ]؅y VHHtkLw(MtbA)AuFHuH}WtHHuH}Vt7uULx|FHuHcFH}'V1H([A^A_]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y UHHtkLw(MtbA)AuFHuH}?VtHHuH}.Vt7uUL{EHuHcEH}WU1H([A^A_]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y UHHtkLw(MtbA)AuFHuH}oUtHHuH}^Ut7uULz EHuHcEH}T1H([A^A_]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y BTHHtkLw(MtbA)AuFHuH}TtHHuH}Tt7uUL,z=DHuHcBDH}S1H([A^A_]f.@UHAWAVSHHك&HHEHHmHD~D HG$(yRSHHLw(M}A)HAZHu_SSHHuBS6HHT"SHH<SHEHE(E)E(E)`HEHpHTHH\PHHuH0HU1NOp;Pu@t;Tu2x;Xu$|;\uE;`u E;dt'>HuH0HpNf>HuH}&HM1H -~&H H;Mu Hĸ[A\A]A^A_]E1M#f.DUHAWAVSHH}&HHEH@HنHHDvDPHGTXyRMHHL(MA)H@AHu_MzH@HuBM]H5H@HUL}<IH5H@HUL}HMHM(E)E(E)`HMHpHuHULLI{rE;Eu(E;Eu E;EuE;EuE;EuE;Et!<HuH@HU1LE;`u7E;du,E;hu!E;luE;pu E;tt$%<HuH@HUtL<HuH{&H}K1H {&H H;MuHĨ[A^A_]E1M0~f.@UHHH~{&HHEHHH2HPFXHDž\ƅoHH-Hu5K&HHHuK HHHuJHHHoKHHHuJHEHE(E)poH}HuHULEZpE;pu1E;tu&E;xuE;|uE;EuE;Et$O:HuHHHUJ+:HuHy&HI1H y&H H;Mu H]|f.UHHHy&HHEH(HeH0F8HDž<ƅOH(pHuuIiH(HuXILH(Hu;I/H(HuIH(HO'IH(HpHHEH`(p)PDOH}HuHUHMLpnp;Pu@t;Tu2x;Xu$|;\uE;`u E;dt'O8HuH(HpH(8HuHw&HG1H w&H H;Mu H]zUHH=U'H5'H"H 08'ua8H&'H='7H']ÐUH]@fDUHSPHH='H5'HH 7x'u7H'H='}7H5H'H 7t H 'tH[]H='H[]8fUHAVSH0HuHuHEЋFEHEHEH}ȃu\HuFt^H]H=HyAtH=Hyt HDLcj6HuLo6E1H0[A^]ÐUHAWAVSH(HuH<HED~D}HG]ԉ]؅yEHHLw(HEMA)AuQHuH}Et|}L}tYH= LxAtOH=.Lxt1H([A^A_]fUHHHHGzu H=z']LH5N~>1]@UHSH8HHJHG)ǃHUH=+H}ЉM؉E܉EyHH6>HHH^(HEHHuH}n>tqHuH}{>t`HuHUH7H'.HuUH}Ⱦ= .Hu(H> H='H8[]JH5q~u=1H8[]HEf.fUHSH8HHJHG)ǃHUH=H}ЉM؉E܉EyHH=HHH^(HEHHuH}N=tqHuH}[=t`HuHUH96H-HuUH}Ⱦc<,Hu(H= H='H8[]IH5U<1H8[]HEf.fUHAWAVSH8HuHHED~D}HG]̉]Ѕy <HHtcLw(HEMt7A)Au2HuH}I<tHuHULE5H,Ht'11H};1HE11H@+H8[A^A_]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y 2;HHtaLw(MtXA)AuuLx4Ht;HHH/+Hu,H}:1H([A^A_]1+HuHt-H!nIHH5+Hu*HL*Hcj&Hf.@UHAWAVSH(HuHtHED~D}HG]ԉ]؅y ":HHt\Lw(MtSA)Au7H5|H}HU9}t0}t7LH3$*Hu9H}91H([A^A_]ILH)HuH}i&HUHAWAVSH(HuH HED~D}HG]ԉ]؅y B9HHtaLw(HEMt5A)Au0HuH}y9tHuLh2E)Ht'1-H}81HE1 Hh&HH([A^A_]@UHAWAVSH(HuHHEDvDuHG]ԉ]؅y r8HHtgL(HEMt^A)Au8HuH}8tDHuE1L11u(Hu,L5 h&I H}7HEE1LH([A^A_]fDUHAWAVSH(HuHHED~D}HG]ԉ]؅y 7HHtfLw(EMtRD)؃rH}11V7c1D9}HuH}7t]ԋut!L*1'Ht%1+E1 ILd'HuHf&HHH([A^A_]UHAWAVSH(HuHgHED~D}HG]ԉ]؅y 6HHtfLw(EMtRD)؃rH}11f6c1D9}HuH}6t]ԋut!L/&Ht%1+E1 ILt&HuHf&HHH([A^A_]UHAWAVSH(HuHBdHED~D}HG]ԉ]؅y 5HHt\Lw(MtSA)Au7H5HxH}HU5}t0}t7LH;/%Hu9H}F51H([A^A_]ILH%HuHe&HUHAWAVSH(HuHbHED~D}HG]ԉ]؅y 4HHt\Lw(MtSA)Au7H5hwH}HU4}t0}t7LH-$Hu9H}f41H([A^A_]ILH$HuH=d&HUHAVSH HuH=HEDvDuHG]]y 4HHtH(HtD9u-0$Ht1H}1113 Hc&HHH [A^]UHAVSH HuH<HEDvDuHG]]y t3HHtH(HtD9u,#Ht1H}111$3 Hc&HHH [A^]UHAVSH HuH<HEDvDuHG]]y 2HHt%H(HtD9uEt'R,H#Ht+1>H}1112-HH"HuHHx""HHH [A^]DUHAVSH HuHbaHEDvDuHG]]y $2HHt%H(HtD9uEt'+HH"Ht+1>H}1111-HH"HuHHx"""HHH [A^]DUHAWAVSH(HuHHEDvDuHG]ԉ]؅yb1HHL(MtwA)Au[H5 H}HU*1}tTIH5sH}HU 1}t7LLH*F!HuH`&HH}01H([A^A_]DUHAWAVSH(HuHHED~D}HG]ԉ]؅y0HHLw(Mt~A)AubHuH}0tdHuH}0tSuHUL)x HuUH}/] HuHcb H}/1H([A^A_]f.@UHAVSH HuHUHEDvDuHG]]y /HHtH(HtD9u )Ht1H}111B/ HcHHH [A^]f.UHAVSH HuHHEDvDuHG]]y .HHt H(HtD9u[(HHt1H}111. HHHH [A^]f.fUHAWAVSH(HuH HED~D}HG]ԉ]؅y R.HHtXLw(MtOA)Au3HuH}.t5HuL'bHuH]&HH}-1H([A^A_]ÐUHAWAVSH8HuHHED~D}HG]ԉ]؅y-HHLw(MA)AueHuH}.tgHuH}.tVH5oH}HUD-}tH(HL|#H(HpH(H /HEHE(E)EDEArII9IDI91)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u2E13H(1HHH9t HtAH>&HH;EHH[A\A]A^A_]É؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9CHEH`f(pf)PIHuHLLpL LL0AEf.EuzEf.EuzEf.Eu{!HuH(HU1 E~>1AfA.Du z HH9u!MHuH(LD ,HuLH( pf.Pu'z%xf.XuzEf.`u{'HuH(Hp Hu H( HfIcHHHH9Y^g?HHHH9t Ht?H= UHAWAVSHH;&HHEH8HoH@D~DHHGLPyr HHLw(MH8SAPH\ YH8HuM <H8Hu0 HEHE(E)E(E)`HEHp\IHUHML8Ef.EuzEf.EuzEf.Eu{$HuH8HU Ef.`u$z"Ef.huzEf.pu{$xHuH8HU THu0H9&H&   E1Mz1H :&H H;MuHĸ[A^A_]=f.UHHHHGzu H=']H5N 1]@UHAWAVAUATSHhHuHCwHEDvDuHG]ĉ]ȅy HHLo(M A)A H5QH}HU}IH5H}HU}IH5xH}HU}IH5H}HU{}~HH5H}HUZ}]HpH5LH}HU5}8HxH5'H}HU}HEH5H}HU}HEH5H}HU}HEH5H}HU}HEH5_H}HU}HEH5=H}HUf}tmHEH5,H}HUH}tO}tZLLLLILpPuuuuuux!^H} 1Hh[A\A]A^A_]MULLLLILpPuuuuuuxAPH@HuH6&HUHAWAVAUATSHhHuHyHEDvDuHG]ĉ]ȅyNHHLo(MA)A HxH}H5.H}HU}IH5H}HU}eIH58H}HU}DIHuH}$,H5:H}HU~}HH5tH}HU]}HEH5H}HU;}HEH5~H}HU}HEH5~H}HU}HEH5~H}HU}tiHEH5~H}HU}tK}xDEtJLLLLIPuuuuuiNH} T1Hh[A\A]A^A_]MULLLLIPuuuuuAXH0tHuH4&HUHAWAVSHHH94&HHEHHPHDvDHGyHHZL(MYH&A#Hu*HHu HHHHHH@5HHHLLEyHEHE(E)E(E)`HEHp(@) HPH0HH()IL4$HuHUHL@LL`Ef.EuzEf.EuzEf.Eu{!AHuHHU1Ef.`u$z"Ef.huzEf.pu{$HuHHU*HuH@f. u*z(Hf.(uzPf.0u{'jHuHH@f.u*z(f.uzf.u{'HuHHAHuH6Hu.Hc&S6 E1M1H s0&H H;MuHH[A^A_]{3UHAWAVAUATSHH50&HHEHhHgHpFxHG|MyHHL(Hh&ACD-HcH(L(1EIcM$LDM|tHh:mxJHhHdEHhHu:(H5HhHU}HHhLDIHEHEf(Ef)EDEArII9II91)HHHHtI4I4HHuHI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u4E1GHh1H(H0H9t Ht0H-&HH;EHHĸ[A\A]A^A_]É؃HpHHH‰уH s1rHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt,HHfADA fADA H HuH9CdIHULLMhEf.EuzEf.EuzEf.Eu{$HuHhHUE~=1AfA.u z HH9u!zHuHhLDYH0H+&HH(H0H9$)9/HH(H0H9t Ht.H f.UHAWAVATSHH+&HHED~HGDDD)(qHuHZHED}]]Ey8HHPLw(MCH}EpAmHu0(E)P(E)`EpExIHuLpf(`fMf(PfEfkPu"Ef.puzEf.xu{HuH}HU1HueHuH;HED}]]Ey HHt5H(Ht,D9uPEttH=HuvH51H*&HH;EHHĐ[A\A^A_]H}111뿾tHxHHuHtH5HJHHvH5)&Hg,UHAVSH0HuHL0HEDvDuHG]܉]y HHt'H(HtD9uEt)EHt-16H}111%HEHuEHHH0[A^]f.UHAWAVSHhH(&HHEHuHnHED~D}HGEEy$HHLw(MH}AHuHEHE(E)EIHuLEf.EuzEf.EuzEf.Eu{HuH}HU1Hu3HcH '&H H;Mt-*= 1H k'&H H;MuHh[A^A_]UHAWAVSHxH<'&HHEHuHHED~D}HGEEyHHLw(MH}AHuHEHE(E)EIHuLxEf.EuzEf.EuzEf.Eu{tHuH}HU1VHu8xPH -&&H H;Mt-C)1H &&H H;MuHx[A^A_]f.fUHAVSH HuHjaHEDvDuHGEEy dHHtDH(Ht;xEtH}111##H}$HHiHt1HH [A^]HtH5HHHH$&HfUHAWAVAUATSHHHuHHEDvDuHG]ĉ]ȅyHHuLo(MhA)A HH5*H}HUN}=IH5H}HU-}IH5H}HU }IH5mH}HU}HH5H}HU}HEH5mH}HU}HEH5]mH}HU}tyHEH5LmH}HUh}t[HEH5H}HUJ}t=}tHLLLLILMPuuu LH} 1HH[A\A]A^A_]MULLLLILMPuuuAH HuH"&HfDUHAWAVSH(HuH`HED~D}HGEԉE؅y rHHthLw(Mt_x=AuBHuH}tDHuIL{Hu(Hc H} H}1H([A^A_]ÐUHAVSH HuHuHEDvDuHGEEy HHtCH(Ht:xEtH}111s"H}tHHt1HH [A^]HcHf.UHAWAVAUATSHXHuH HEFEHGM̉MЅyHHL(H}11wAC6HcH}LeEIcM,LDM-}tH}}H}LDDEArII9IDI91HHHHHtf.I4ItHHuH9DI ILILILILILILILHH9uE1H}1H}HEH96;؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9ILLE~81fDI I;Lu HH9uHuH}1LD`Ht+1H}HEH9t Ht!HHX[A\A]A^A_]HD&HH}HEH9uHH}HEH9t HtJ!H f.@UHAWAVAUATSHHHuHHEDvDuHG]ĉ]ȅyHHgLo(MZA)A :H5jH}HU}/IH5H}HUm}IHuH}H5H}HU7}IH5fH}HU}HH5 H}HU}HEH5fH}HU}txHEH5fH}HU}tZHEH5{fH}HU}t<}MtDLLLMIPuuu@HH} C1HH[A\A]A^A_]MULLLMIPuuuAH iHuH&HUHAWAVSH(HuHk{HED~D}HGEԉE؅y HHt|Lw(MtsxQAuVHuH}tXuILHHutCuILHu(Hc H}|H}[1H([A^A_]fUHAWAVSH(HuHxHED~D}HGEԉE؅y "HHt|Lw(MtsxQAuVHuH}~tXuILH+Hu1ADfA.u z HH9u!HuHhLD:H6Hi&HH0H8H9*/HH0H8H9t HtWH f.UHAWAVAUATSHHE&HHEHhHtHpFxHG|MyHHL(Hh6AC6HcH0L01EIcMdLDM|tHhJcx@H5HhHU'}5HHhHuAHhLD'HHEHEf(Ef)EDEArIDI9II91)HHHHtf.@I|I1ADfA.u z HH9u!HuHhLDyH6H &HH0H8H9*/YHH0H8H9t HtH1 UHH=%'H5'HtH 0E'uH'H='H']ÐUH]fDUHSPHH='H5Y'HH H'u,H'H='H5۝Hw'H=t H d'tH[]H=T'H[]1fUHAVSH0HuHHEЋFEHEHEH}ȃu\Hut^H]H=LHAtH=KHt H LcHuL1H0[A^]ÐUHAWAVSH(HuHlHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}t|}L}tYH=_LAtOH=^LtHHH [A^]f.UHAVSH HuHE>HEDvDuHG]]y HHtH(HtD9uHt1H}1112 HcHHH [A^]f.UHAVSH HuHHEDvDuHG]]y HHtH(HtD9u+Ht1H}111 HcHHH [A^]f.UHAVSH HuHHEDvDuHG]]y DHHtH(HtD9usnHt1H}111 Hc^HHH [A^]f.UHAVSH HuHHEDvDuHG]]y HHt H(HtD9uHHt1(H}111QHHxHHH [A^]UHAVSH HuHȟHEDvDuHG]]y HHtH(HtD9u].Ht1H}111 HcHHH [A^]f.UHAWAVSH(HuHmXHED~D}HG]ԉ]؅y bHHtXLw(MtOA)Au3HuH}t5uL4HpHuHH}1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt^Lw(HEMt2A)Au-HuH}tHuLHt'1+H}81HE1HcH([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}?t4uLHuHcH}k1H([A^A_]fUHAWAVSH(HuH"HED~D}HG]ԉ]؅y 2HHt`Lw(MtWA)Au;H5ƓH}HU}t4LH+:HuH&HH}1H([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y rHHttLw(MtkA)AuOHuH}tQH5H}HU-}t7uLH9fHuH&HH}1H([A^A_]DUHAWAVSH(HuHJHED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4uLHuHG&HH}+1H([A^A_]fUHAVSH HuHrHEDvDuHG]]y HHtH(HtD9uG Ht1H}111 H&HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHt`Lw(MtWA)Au;H5 H}HU.}t4LHjHuH&HH}1H([A^A_]fUHAWAVSH(HuH`HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5JH}HUn}t4LHeHuH>&HH}"1H([A^A_]fUHAVSH HuH"HEDvDuHG]]y HHt%H(HtD9uEt'DHHt+1>H}111-HHHuHHxHHH [A^]DUHAVSH HuH(HEDvDuHG]]y $HHt H(HtD9uEt"_@MHt*11H}111 H#HuHc(HHH [A^]UHAVSH HuHmHEDvDuHG]]y tHHt H(HtD9uEt"_DHt*11H}111! HsHuHcxHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(EMt{AArH}p[HuH}1tHM;M}HuH}t-EuLt菿HuH#%H E1H([A^A_]f.UHAVSH HuHHEDvDuHG]]y HHt H(HtD9uEt"_HHt*11H}111 HӾHuHcؾHHH [A^]UHAVSH HuHHEDvDuHG]]y $HHt H(HtD9uYHMHt1H}111HH [A^]HtH5SHH[HH%Hf.fUHAWAVAUATSHHHuH HEFEHGMĉMȅy`HHsL(H}AC6HcH}MLe1EIcM,LDME+EăH}HuzH}LD'H}HuNDEArII9IDI91HHHHHtf.A4AtHHuHLDA ALALALALALAL AL HH9uH}1H}HEH9t HtHHH[A\A]A^A_]E1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADA ADALH HuH9z}uЋMt LL LLAE~@1f.A A;Lu HH9uHuH}LD[HIcHH}HEH9zHH}HEH9t HttH讻 UHAWAVAUATSHHHuHHEFEHGMĉMȅyHH@L(H}vAC6HcH}Le1EIcM,LDM-E+EăH}HuH}LDDEArII9IDI91HHHHHtfA4AtHHuH>DA ALALALALALAL AL HH9uH}1H}HEH9AFE1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt0HHDADA ADALH HuH9uLL#E~71fA A;Lu HH9uHuH}LDKطHt+1H}HEH9t HtHHH[A\A]A^A_]HA%HH}HEH9uHH}HEH9t HtGH聸 f.UHAVSH HuHwHEDvDuHG]]y HHtH(HtD9uHt1H}111 H%HHH [A^]UHH=%'H5'H 1 'uVH'H='׶H']fDUHAVSIH=ρ'H5h'Hʃ1贶\'uH'H='聶H5H'Lt H x't01!HtH}Hu訷<H5uH}HU}HH}LD"HDEArIDI9II91)HHHHtItI4HHuHILI ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uEHxHxE1H}ȵ1HxHEH9t HtHHh[A\A]A^A_]É؃HpHHHljH s1sHH)1ADALAALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-H4HfAD5AL5fAD4A 4H HuH90uILL E~;1ADfA.u z HH9uHuH}LD8פHHg%HHxHEH9HHxHEH9t Ht`H蚥 @UHAWAVSH(HuHrHED~D}HGEԉE؅y HHtpLw(MtgxEAuJH5qH}HU轳}tCILH0Hu*H%H H}胳H}b1H([A^A_]fUHAWAVSH(HuHHED~D}HGEԉE؅y "HHtpLw(MtgxEAuJH5pH}HU}tCILH8%Hu*H%H H}賲H}蒲1H([A^A_]fUHAWAVSH(HuHHED~D}HGEԉE؅yRHHLw(Mt~xZAuaH5~H}HU}tZILHHNHu>HtFH5sHӲH{"H}ʱ1H}觱1H([A^A_]H%HfUHAWAVAUATSHhHuHHEFEHGMĉMȅy`HHmL(H}ְAC6HcHx8Lx1EIcMdLDMA}tH}+}H58H}HUӰ}HH}LDHDEArIDI9II91)HHHHtf.fI|IHtFH5HSH"H}J1H}'1H([A^A_]H%HfUHAWAVAUATSHhHuHyHEFEHGMĉMȅyHHmL(H}VAC6HcHx踬Lx1EIcMdLDMA}tH}p+}H5ejH}HUS}HH}LDsHDEArIDI9II91)HHHHtf.fI|IHtFH5sHөH{"H}ʨ1H}觨1H([A^A_]H%HfUHAWAVAUATSHhHuHHEFEHGMĉMȅy`HHmL(H}֧AC6HcHx8Lx1EIcMdLDMA}tH}+}H5eH}HUӧ}HH}LDHDEArIDI9II91)HHHHtf.fI|I}t4LHzHuH%HH}1H([A^A_]fUHAWAVSH(HuHpHED~D}HG]ԉ]؅y 貞HHt\Lw(MtSA)Au7H5%H}HU~}t0}t7LH/贎Hu9H}61H([A^A_]ILHyHuH %HUHAWAVSH(HuHRHED~D}HG]ԉ]؅y ҝHHt\Lw(MtSA)Au7H5EH}HU螝}t0}t7LHӟԍHu9H}V1H([A^A_]ILH虍HuH-%HUHAVSH HuHHEDvDuHG]]y HHt$H(HtD9uEt&脞Ht*11H}111蝜 HHuHcHHH [A^]UHAVSH HuHHEDvDuHG]]y DHHt$H(HtD9uEt&iHt*11H}111 H?HuHcDHHH [A^]UHAVSH HuHdHEDvDuHG]]y 蔛HHt$H(HtD9uEt&Ɲ蹋Ht*11H}111= H菋HuHc蔋HHH [A^]UHAVSH HuHHEDvDuHG]]y HHt$H(HtD9uEt& Ht*11H}111荚 HߊHuHcHHH [A^]UHAVSH HuH[HEDvDuHG]]y 4HHt"H(HtD9uEt$踛[Ht(1.H}111ߙH3HuH%HHH [A^]UHAVSH HuHHEDvDuHG]]y 脙HHt$H(HtD9uEt&膛詉Ht*11H}111- HHuHc脉HHH [A^]UHAWAVAUATSHXHuH{HEFEHGM̉MЅyИHH1L(H}E11FAC6HcH}ϘLmEIcI\IDM<E+ẼH}LDŘEEArKDH9JI91HHLLHtItH4HHuHLDILH ILHLILHLILHLHI9uH}蔗E1H}HEH9^cE1DHpHHH‰уH s1uHH)1f.fADALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt8HHf.DADALD H HuL9}t LLILLE~21ILH; u HI9u趆HuH}1LD 蛆Ht,E1H}HEH9t HtNLHX[A\A]A^A_]L%%I$H}HEH9uHH}HEH9t HtHB f.fUHAVSH HuHHEDvDuHG]]y 蔕HHt%H(HtD9uEt1H踅Ht51H}111<HH [A^]HH胅HuHtH5~HH谅HH%H뱐UHAVSH HuHHEDvDuHG]]y ĔHHt$H(HtD9uEt&薖Ht*11H}111m H迄HuHcĄHHH [A^]UHAVSH HuHHEDvDuHG]]y HHt$H(HtD9uEt&9Ht*11H}111轓 HHuHcHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHtVLw(MtMA)Au1HuH}迓t3}ut7L`HjHu9H}1H([A^A_]ILH/HuHƓUHAWAVSH(HuH9HED~D}HG]ԉ]؅y 蒒HHtVLw(MtMA)Au1HuH}t3}ut7L薔H蚂Hu9H}1H([A^A_]ILH_HuHUHAWAVSHxH,%HHEHxHHED~D}HG]]y豑HHLw(MA)HxAumHutoHxHu蜑tVH5mHxHUE}t9HMHM(E)E}utOHULHQ1H ?%H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$HuHxHU"H`Hc€H %H H;MZUHAWAVAUATSHXHe%HHEHHHF HG$(yHHHG(H@LLIACD-HcH誏HE1EIcHLEL AH0C?HcHhHE1EIcHHHIDH@ +$HHu;LHsHH0DUHH<tHLHUHpLMP!IHLHUHpLM(tHuLH(1Ef.EuzEf.EuzEf.Eu{$LtHuH(HU艄pf.Pu'z%xf.XuzEf.`u{'sHuH(Hp)E~>1AfA.Du z HH9u!sHuH(LDsHzH%HHHH9nseHHHH9t HtH=t UHAWAVAUATSHXHuHHEDvDuHG]ĉ]ȅy莂HHLo(MA)A HuH}͂H5H}HU9}aIH5H}HU}@IH5-H}HU}IH5,H}HUց}HH5,H}HU赁}HEH5jH}HU蓁}HEH5HH}HUq}HEH53H}HUO}t{HEHuH}tfH5H}HU }tL}ELUtNHLLLLILMPARuuuRH} 輀1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0pHuHl%HUHAWAVAUATSHXHuHHEDvDuHG]]y.HHLo(MnA)H}A NHumLH5H}HU}.IH5tH}HU} IH5*H}HU}IH5MH}HUv}HH5,H}HUU}HEH5H}HU3}HEH}HutsH5H}HU}tYHEH}HustD}ELUЋEtQLLLLILMPuARuU ~1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H nHuH8%HUHAWAVSHHHi%HHEHHGHDvDHGy}HHL(MA)HAaHu}ZHHu}=HH}"HH}HH@j}HHJ}HLLz}HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLZ~n-|1H x%H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!lHuHHU1A|Ef.`u$z"Ef.huzEf.pu{$kHuHHU{kHuHz@f. u*z(Hf.(uzPf.0u{'*kHuHH@d{f.u*z(f.uzf.u{'jHuHH{jHuHyjHHcjH W%H H;MiDUHAWAVSH(HuHIHEDvDuHG]ԉ]؅yyHHL(MA)AumHuH}ztoH5VH}HUuy}tUIH5UH}HUXy}t8}utH}y1H([A^A_]ILLHHFiHuHcKiUHAWAVAUATSHH%HHEHPHHXF`HGdhyxHHHG(HpLPLwAC6HcHKxHE1EIcHLELwAH]C?HcH xHE1EIcHIDHpHI͋`+dHPHH0xHPHuwHPHuDwHPHLwtiHPLDywtSHEHEf(Ef)EDHxE#A1HxzHPvE1HHH9t HtHHH9t HtͩH%HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMtHpHHUHMMPEf.EuzEf.EuzEf.Eu{$=cHuHPHUzsE~E1HMfA.uzHH9xu"bHuHPHUD0sE~>1ADf.u z HH9Eu!bHuHPLDrbHKL-%IEHHH9?DkHHHH9tHt HHHH9t HtHc fUHAWAVSHhHܡ%HHEHuHHED~D}HG]]ydqHHLw(MA)H}Au:HufqHEHE(E)E}tHuLs!pdIHuLXEf.EuzEf.EuzEf.Eu{`HuH}HU1Aq`Ht1H  %H H;Mu#Hh[A^A_]Hc`H %H H;Mt赣UHAVSH HuHHEDvDuHG]]y pHHt%H(HtD9uEt1rH8`Ht51H}111oHH [A^]HpH`HuHtH5(YHpH0`HHv%H뱐UHAVSH HuH?HEDvDuHG]]y DoHHt$H(HtD9uEt&pi_Ht*11H}111n Hh?_HuHcD_HHH [A^]UHAWAVAUATSHH%HHEHpHHxFEHGMMyynHHL(HpmAC6HcH8NnL81EIcM,LDME+E HpHu4nHpLDnHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpl1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLmIHuLLxEf.EuzEf.EuzEf.Eu{![HuHpHU1,lE~G1fAfA.Du z HH9u![HuHpLDk[HtD1H8H@H9t Ht-HD%HH;Eu4HHĨ[A\A]A^A_]HϚ%HH8H@H9u&HH8H@H9t HtĝH[ UHAWAVAUATSHH%HHEHpHHxFEHGMMy9jHHL(HpiAC6HcH8jL81EIcM,LDME+E HpHuiHpLDiHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHph1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLiIHuLLEf.EuzEf.EuzEf.Eu{!WHuHpHU1gE~G1fAfA.Du z HH9u!`WHuHpLDg?WHtD1H8H@H9t HtH%HH;Eu4HHĨ[A\A]A^A_]H%HH8H@H9uHH8H@H9t Ht脙HW UHAWAVSH(HuHfHED~D}HG]ԉ]؅y fHHtWLw(MtNA)Au2HuH}oft4uLg#VHuH%HH}e1H([A^A_]fUHAVSH HuHfHEDvDuHG]]y deHHt-H(Ht$D9u#11fUHuH %H1H}111eHH [A^]f.fUHAVSH HuHfHEDvDuHG]]y dHHt"H(HtD9uZfTHt1H}111od Hj%HHH [A^]f.UHAVSH HuH1fHEDvDuHG]]y $dHHt"H(HtD9ueKTHt1H}111c Hʓ%HHH [A^]f.UHAVSH HuHeHEDvDuHG]]y cHHt"H(HtD9ueSHt1H}111/c H*%HHH [A^]f.UHAVSH HuHeHEDvDuHG]]y bHHt"H(HtD9uzd SHt1H}111b H%HHH [A^]f.UHAVSH HuHGeHEDvDuHG]]y DbHHt"H(HtD9uckRHt1H}111a H%HHH [A^]f.UHAVSH HuHdHEDvDuHG]]y aHHt"H(HtD9u:cQHt1H}111Oa HJ%HHH [A^]f.UHAVSH HuHdHEDvDuHG]]y aHHt"H(HtD9ub+QHt1H}111` H%HHH [A^]f.UHAVSH HuHodHEDvDuHG]]y d`HHt"H(HtD9uaPHt1H}111` H %HHH [A^]f.UHAVSH HuHdHEDvDuHG]]y _HHt"H(HtD9u ZaOHt1H}111o_ Hj%HHH [A^]f.UHAVSH HuHcHEDvDuHG]]y $_HHt"H(HtD9u `KOHt1H}111^ Hʎ%HHH [A^]f.UHAVSH HuHmcHEDvDuHG]]y ^HHt"H(HtD9u `NHt1H}111/^ H*%HHH [A^]f.UHAVSH HuHcHEDvDuHG]]y ]HHt"H(HtD9u z_ NHt1H}111] H%HHH [A^]f.UHAVSH HuHbHEDvDuHG]]y D]HHt"H(HtD9u ^kMHt1H}111\ H%HHH [A^]f.UHAVSH HuH}bHEDvDuHG]]y \HHt"H(HtD9u:^LHt1H}111O\ HJ%HHH [A^]f.UHAVSH HuH.bHEDvDuHG]]y \HHt"H(HtD9u]+LHt1H}111[ H%HHH [A^]f.UHAVSH HuHaHEDvDuHG]]y d[HHt"H(HtD9u\KHt1H}111[ H %HHH [A^]f.UHAVSH HuHaHEDvDuHG]]y ZHHt"H(HtD9u*Z\JHt1H}111oZ Hj%HHH [A^]f.UHAVSH HuHwaHEDvDuHG]]y $ZHHt"H(HtD9u)[KJHt1H}111Y Hʉ%HHH [A^]f.UHAVSH HuH=aHEDvDuHG]]y YHHt"H(HtD9u[IHt1H}111/Y H*%HHH [A^]f.UHAVSH HuHaHEDvDuHG]]y XHHt"H(HtD9u#zZ IHt1H}111X H%HHH [A^]f.UHAVSH HuH`HEDvDuHG]]y DXHHt"H(HtD9uYkHHt1H}111W H%HHH [A^]f.UHAVSH HuH`HEDvDuHG]]y WHHt"H(HtD9u":YGHt1H}111OW HJ%HHH [A^]f.UHAVSH HuH[`HEDvDuHG]]y WHHt"H(HtD9uX+GHt1H}111V H%HHH [A^]f.UHAVSH HuH`HEDvDuHG]]y dVHHt"H(HtD9u$WFHt1H}111V H %HHH [A^]f.UHAVSH HuH_HEDvDuHG]]y UHHt"H(HtD9uZWEHt1H}111oU Hj%HHH [A^]f.UHAVSH HuH_HEDvDuHG]]y $UHHt"H(HtD9uVKEHt1H}111T Hʄ%HHH [A^]f.UHAVSH HuH_HEDvDuHG]]y THHt"H(HtD9uVDHt1H}111/T H*%HHH [A^]f.UHAVSH HuHK_HEDvDuHG]]y SHHt"H(HtD9uzU DHt1H}111S H%HHH [A^]f.UHAVSH HuH_HEDvDuHG]]y DSHHt"H(HtD9uTkCHt1H}111R H%HHH [A^]f.UHAVSH HuH^HEDvDuHG]]y RHHt"H(HtD9u:TBHt1H}111OR HJ%HHH [A^]f.UHAVSH HuH^HEDvDuHG]]y RHHt"H(HtD9uS+BHt1H}111Q H%HHH [A^]f.UHAVSH HuH^HEDvDuHG]]y dQHHt"H(HtD9u RAHt1H}111Q H %HHH [A^]f.UHAVSH HuHt^HEDvDuHG]]y PHHt"H(HtD9uZR@Ht1H}111oP Hj%HHH [A^]f.UHAVSH HuHR^HEDvDuHG]]y $PHHt"H(HtD9u!QK@Ht1H}111O H%HHH [A^]f.UHAVSH HuHH^HEDvDuHG]]y OHHt"H(HtD9uEQ?Ht1H}111/O H*%HHH [A^]f.UHAVSH HuH^HEDvDuHG]]y NHHt"H(HtD9uGzP ?Ht1H}111N H~%HHH [A^]f.UHAVSH HuH]HEDvDuHG]]y DNHHt"H(HtD9uDOk>Ht1H}111M H}%HHH [A^]f.UHAVSH HuH]HEDvDuHG]]y MHHt"H(HtD9uF:O=Ht1H}111OM HJ}%HHH [A^]f.UHAVSH HuHu]HEDvDuHG]]y MHHt"H(HtD9uHN+=Ht1H}111L H|%HHH [A^]f.UHAVSH HuHG]HEDvDuHG]]y dLHHt"H(HtD9uIM<Ht1H}111L H |%HHH [A^]f.UHSH(HuH ]HE؋FEHEH}Ѓu1HuPLt3}MH<HuHLH([]þ}K1H([]UHAVSH HuH)]HEDvDuHG]]y DKHHtHG(HtD9uHXpq;Ht1H}111J HKHHH [A^]UHH='H5N'H1z;B'u;H'H='G;Hx']fDUHSPHH=`'H5'H1%;'uq;H6'H=/':H5VH'H:t H 'tH[]H='H[]v;f.@UHAVSH0HuHHEЋFEHEHEH}ȃu\Hu8Jt^H]H=H3}AtH=H}t HLHLc9HuL9XI1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y"IHHLw(HEMA)AuQHuH}QIt|}L}tYH=LF|AtOH=L-|tDHHLw(MAH5^H}HUC}ILH-4HHs%HHuH?HED}ЉMԉM؅y CHHtiH(Ht`x&EtAH}111fCHH5L?PC6H}WC+H}6CHH3Ht1HH([A^A_]HDHDUHAVSH HuH~2HEDvDuHGEEy BHHtAH(Ht8xEtH}111B H}BH2Ht1HH [A^]Hbr%H萐UHH='H5'H12'u63H'H='2H']fDUHSPHH='H5I'Hg12='u2H'H='b2H58Hl'H1t H Y'tH[]H=I'H[]2f.@UHAVSH0HuHUHEЋFEHEHEH}ȃu\HuAt^H]H=HtAtH=Htt H?LcJ1HuLO1@1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y@HHLw(HEMA)AuQHuH}@t|}L}tYH=LsAtOH=Lst/H}?1'HE1ILLPA,0Ht 1H([A^A_]Ic$0UHAVSH0HuH{HEЋFEHEuGH5{H}HU}?}t@HHtCHH5HPE1LE/Hu+H}Ⱦ%?1H0[A^]E1v/HuL @UHAVSH HuHrHEDvDuHG]]y>HHH(HD9u3HPxHt9HHH5HPE1LE.HucH}111\>RE1.HuCLM?Ht6HH.t)H.HH1Q@H߾.1HH [A^]UHAWAVAUATSH8HuH\HEDvDuHGEĉEȅy=HH$Lo(MAH5H}HU=}IH5DH}HUh=}IHuH}=H5iH}HU2=}IH5(H}HU=}tsHH5˶H}HU<}tVHMMUH$LLLMIA-Hu*Hl%H H}<H}<1H8[A\A]A^A_]fUHAWAVAUATSH(HuHHEDvDuHGEĉEȅy><HH Lo(MAH5^H}HU;}IH5H}HU;}IH52hH}HU;}IH5H}HU;}tnHH5PH}HUy;}tQMULLLLIIA+Hu*H7k%H H}1;H};1H([A\A]A^A_]UHAWAVAUATSH(HuHUHEDvDuHGEĉEȅy:HH Lo(MAH5H}HU:}IH5DH}HUh:}IH5fH}HUG:}IH5=H}HU&:}tnHH5H}HU :}tQMULLLLIIA3*Hu*Hi%H H}9H}91H([A\A]A^A_]UHAWAVSH(HuH`HED~D}HG]ԉ]؅y b9HHt\Lw(MtSA)Au7H54H}HU.9}t0}t7LH3\d)Hu9H}81H([A^A_]ILH))HuHh%HUHAVSH HuH`HEDvDuHG]]y 8HHt!H(HtD9uEt#H_0(Ht+12H}11108!HH(HuH9HHH [A^]DUHAWAVSH(HuH%HED~D}HGEԉE؅y 7HHtpLw(MtgxEAuJH5'dH}HU7}tCILH'Hu*Hig%H H}c7H}B71H([A^A_]fUHAWAVSH(HuH`HED~D}HG]ԉ]؅y 7HHt`Lw(MtWA)Au;H5XcH}HU6}t4LHY 'HuHf%HH}61H([A^A_]fUHAVSH HuH`HEDvDuHG]]y D6HHt H(HtD9uEt"_@m&Ht*11H}1115 HC&HuHcH&HHH [A^]UHAWAVSH(HuH`HED~D}HG]ԉ]؅y 5HHtaLw(MtXA)Au}utBA9v@tAv@IL%Hu6H}51H([A^A_]ILW%HuHd%HfDUHAWAVAUATSHXHuHH`HEFEHGM̉MЅy4HHYL(H}E11&4AC6HcH}4LmEIcI\IDMQE+ẼH}LD{4EEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H}L3E1H}HEH9KPE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]LLpUE~<1DADf.u z HI9u"HuH}1LD2f"Ht,E1H}HEH9t HteLHX[A\A]A^A_]L%a%I$H}HEH9uHH}HEH9t HtdH # UHH='H5^'H^1*"R'unH'H='!H']fDUHSPHH=p'H5 'H]1!'umHF'H=?'!H5~]H,'H2!t H 'tH[]H= 'H[]&"f.@UHAVSH0HuHHEЋFEHEHEH}ȃuoHu0tqH]H=\HcAt1H=_HctH=(Hct H.Lcw HuL| /1H0[A^]f.@UHAWAVSH(HuH<HED~D}HG]ԉ]؅y/HHLw(HEMA)AuhHuH}/}L}tlH=[LbAtbH=^LbtOH=LbtH}111 %-HH]HuHHx]bHHH [A^]DUHAVSH HuHHEDvDuHGEEy $HHtAH(Ht8xEtH}111c$ H}d$HHt1HH [A^]H2T%Hf.UHAVSHH[T%HHEDvHGD)؃tpHuH HEDu]ĉ]ȅy#HHH(HD9E/HHHuH HEDu]]y i#HHtrH_(HtiH}Hu|#tS(E)`(E)pEEEE}HuH/H5 "1H"S%HH;EHHĐ[A^]H}111"HHHuHH5 Hu#HHHHuHf(`fEf(pfMfkPuEf.EuzEf.Eu{rHuH}HU1"THHQ%HKUUHAVSH`HR%HHEDvHGD)؃tpHuH=HEDu]ĉ]ȅy!HHH(HD9Er-HHHuHHEDu]ĉ]ȅy !HHt|H_(HtsH}Huк/!t]EEEEEE}HuH,Ef.EH5Az 1HP%HH;EHH`[A^]H}111O HHHuHH5 H!!HHHHuHEf.EuzEf.EuzEf.Eu{7HuH}HU1z H,HO%HSf.fUHAVSH0HuHHEDvDuHG]܉]y dHHt'H(HtD9uEt)h+EHt-16H}111 %HEYHuEVHHH0[A^]f.UHAVSH0DvHGD)؃tlHuHe>HEDu؉]܉]yHHH(HD9EH_PHHuH>HEDu؉]܉]y .HHtqH_(HthHuH}tW}ut\H=H?Hu9^H5='H}111HHHt'1HH0[A^]HHH HuHvHf.UHAWAVSH(HuHdHED~D}HG]ԉ]؅y 2HHt\Lw(MtSA)Au7H5H}HU}t0}t7LH(4 Hu9H}1H([A^A_]ILH HuHL%HUHAVSH HuHdHEDvDuHG]]y THHt!H(HtD9uEt#H_X| Ht+12H}111!HHQ HuHHHH [A^]DUHAVSH HuH%HEDvDuHG]]y HHt%H(HtD9uEt'x'H Ht+1>H}111L-HH HuHHx  HHH [A^]DUHAVSH HuH]HEDvDuHG]]y HHt$H(HtD9uEt&& Ht*11H}111 H HuHc HHH [A^]UHAVSH HuHdHEDvDuHGEEy 4HHtDH(Ht;xEtH}111#H}HH9 Ht1HH [A^]H6 HfUHHHztuHH]H=&]&H5`Aj1]UHSH(HuHCAHE؋FEHEEȃrH}о%1[H5IH}HUH1}tH5YHH}HU}t7Hq$HHu"HRH([]H}о01H([]ÐUHH=u&H5&HHdH 0&u HF&H=?&H3&]ÐUH]J,fDUHSPHH=&H5&HcH P&uH&H=&H5cH&Ht H &tH[]H=&H[]fUHAVSH0HuHHEЋFEHEHEH}ȃu\Huht^H]H= cHcJAtH=HJJt H|Lc HuL1H0[A^]ÐUHAWAVSH(HuHܼHED~D}HG]ԉ]؅yRHHLw(HEMA)AuQHuH}t|}L}tYH=3bLvIAtOH=L]It}utBA9v`tAv`ILHu6H}A1H([A^A_]ILHuH%HfDUHAVSH HuHUHEDvDuHG]]y HHt+H(Ht"D9u!Et-HHt(1.H}111HHuHn%HHH [A^]f.DUHAVSH HuH!UHEDvDuHG]]y $HHt(H(HtD9uEt*H1EHt(1.H}111HHuH%HHH [A^]fUHAVSH HuHTHEDvDuHG]]y tHHt H(HtD9uEt"_XHt*11H}111! HsHuHcxHHH [A^]UHAVSH HuHiTHEDvDuHG]]y HHt H(HtD9uEt"_\Ht*11H}111q HHuHcHHH [A^]UHAWAVSH(HuHTHEDvDuHG]܉]y HHt!H(HtD9uEt/Lwp:Ht71H}111HH([A^A_]HIHuMt3L#ILH7HHuLLHH_%Hf.UHAWAVSH(HuHTHED~D}HG]ԉ]؅y "HHt`Lw(HEMt4A)Au/HuH}YtHuIL&Ht'1-H}1HE1 H%HH([A^A_]DUHAVSH HuH1H8[]f.DUHSH(HuH%HE؋FEHEHEuQH5e%H}HUHtKHÿ3H HSHHPH=1%H蒈HH}Hu (H}о蕗1H}Ht HuHH([]f.UHSPHHHtHH[]f.UH]҇fDUHSH8HHt(HkHtH$H8H5^b{t<t'4H=HH8[]雇1HH8[]H]HHEHEEH}Hu>t`H}Hu-tOH}Hut>HMHUHuH0HHHPH={H H5j1H8[]f.UHSH(HuH=HE؋FEHEHEuYH5H}HUHtSHÿH HSHHPHKHHH=ۡHjHH}Hu (H}оm1H}Ht HuĆHH([]fUHAVSH0HuH5;HEЋFEHEHEH}ȃuoHu舕tqH]H=<HAt1H=zHjtH=?HWt H艓LcHuL蕔1H0[A^]f.@UHAWAVSH(HuH:HED~D}HG]ԉ]؅yRHHLw(HEMA)AuhHuH}联}L}tlH=+LrAtbH=iLYtOH=>LFtH}HU}t@HHtCHH54HPE1LECHu+H}ȾŒ1H0[A^]E1HuL譓UHAVSH HuH:HEDvDuHG]]ytHHH(HD9u3HPxHt9HHH5gHPE1LEvHucH}111RE1VHuCLHt6HH虂t)H蓂HH1Q@H߾|1HH [A^]UHAVSH HuH JHEDvDuHG]]y tHHt!H(HtD9uEt#H_h蜁Ht+12H}111 !H8HqHuHHHH [A^]DUHAVSH HuHIHEDvDuHG]]y ĐHHt!H(HtD9uEt#H_pHt+12H}111p!H@HHuHXHHH [A^]DUHAWAVSH(HuH0HED~D}HG]܉]y HHt#H(HtD9uAEt8Ht+12H}111輏!HLc HuLHHH([A^A_]f.DUHAVSH HuH{}HEDvDuHG]]y THHt"H(HtD9uEt$蠹{Ht(1.H}111HSHuH$HHH [A^]UHSHhH$HHE^HG)ЃHuHnMHE]UĉUȅy脎HHjH_(H]HuH}HHuH謹H~H+HH5wH H~HuHLHE]UĉUȅyHHH_(HHuH}oH}HuкEEEEEEHuHUHEf.EuzEf.EuzEf.Eu{!}HuH}HUоڍy}HuH $HH5K1H A$H H;MuHh[]Pf.fUHAVSH HuHHEDvDuHG]]y 褌HHt H(HtD9uH|Ht1H}111Q HOHHH [A^]f.fUHAWAVSH(HuHSHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5ahH}HU΋}t0}t7LHU|Hu9H}膋1H([A^A_]ILHH{HuH]$HUHAVSH HuHBaHEDvDuHG]]y $HHtH(HtD9u諵P{Ht1H}111Ԋ HϺ$HHH [A^]UHAVSHH$HHEDvHGD)؃HuHrHEDu]ĉ]ȅymHHH(H{D9躵HzH\H)H5sHHzHHG$HH;E7`HuHqHEDu]]y׉HHH_(HH}Hu(E)`(E)pEEEEHuHܴf(pfMf(`fEfkPuEf.EuzEf.Eu{ryHuH}HU1赉TyHu*H$HH.$HH;Et"NH5p軈1H $HH;Eu.HHĐ[A^]H}111葈H޸$HH;EtUHAVSH HuHHEDvDuHG]]y THHt%H(HtD9uEt'萳HxxHt+1>H}111-HHMxHuHHxMxRxHHH [A^]DUHAWAVSH8HuHGHED~D}HG]ԉ]؅y 蒇HHtqLw(MthA)AuLHuH} tNH5qH}HUM}t4}Hut7LH谱wHu9H}1H8[A^A_]ILHPDwHuHض$HUHAWAVSH(HuHGHED~D}HG]ԉ]؅y 袆HHtWLw(MtNA)Au2HuH}t4}Hut7L߱HvHu9H}+1H([A^A_]ILXHnvHuHyvf.DUHAWAVSH(HuH'HHED~D}HG]ԉ]؅y …HHtWLw(MtNA)Au2HuH}=t4}Hut7LHuHu9H}K1H([A^A_]IL`HuHuHuf.DUHSHH^HG)Ѓ HuH(HHE]UUy҄HHH_(HHuH}NHuH}9}HuHUHծHuHGHE]UUy OHHtnH_(HteHuH}ӄtTHuH}„tCH5YnH}HU}t)}HuHUtYHHO\H5 G軃1HH[]HHhHEHUtHuH=Hu`tHH[]LHHApsHuHf$HHH[]f.fUHAWAVSH8HuHGHED~D}HG]ԉ]؅y "HHtqLw(MthA)AuLHuH}蝃tNH5AmH}HU݂}t4}Hut7LH"sHu9H}葂1H8[A^A_]ILHxrHuHh$HUHAWAVSH(HuHHHED~D}HG]ԉ]؅y 2HHtWLw(MtNA)Au2HuH}譂t4}Hut7LgH9rHu9H}軁1H([A^A_]ILHqHuH rf.DUHSHH^HG)Ѓ HuHHHE]UUyBHHH_(HHuH}辁HuH}詁}HuHUHkHuHGHE]UUy 迀HHtnH_(HteHuH}CtTHuH}2tCH5jH}HUr}t)}HuHUtYHH\H5G+1HH[]HHHEHUspHuH=v HupHH[]LHHABpHuH֯$HHH[]f.fUHAWAVSH8HuHGHED~D}HG]ԉ]؅y HHtqLw(MthA)AuLHuH} tNH5hH}HUM}t4}Hut7LH@oHu9H}1H8[A^A_]ILHDoHuHخ$HUHAWAVSH(HuH*HHED~D}HG]ԉ]؅y ~HHt\Lw(MtSA)Au7H5rH}HUn~}t0}t7LH賩nHu9H}&~1H([A^A_]ILHinHuH$HUHAVSH HuHHEDvDuHG]]y }HHt%H(HtD9uEt'舨HmHt+12H}111l}!HHmHuHmHHH [A^]ÐUHAWAVSH(HuHvHHED~D}HG]ԉ]؅y }HHt\Lw(MtSA)Au7H5TgH}HU|}t0}t7LHKmHu9H}|1H([A^A_]ILHlHuHm$HUHAVSH HuHHHEDvDuHG]]y 4|HHt%H(HtD9uEt'(HXlHt+12H}111{!HH-lHuH8lHHH [A^]ÐUHAWAVSH(HuHHHED~D}HG]ԉ]؅y {HHt`Lw(MtWA)Au;H5tH}HUN{}t4LHukHuH$HH}{1H([A^A_]fUHAVSH HuH%IHEDvDuHG]]y zHHt H(HtD9uեHjHt1H}111qz Ho{HHH [A^]f.fUHAWAVSH(HuHLIHED~D}HG]ԉ]؅y"zHHLw(HEMtGA)AuBH5ۀH}HUyHtLH,HjHtS1H}Hu$814H}y1H}HtHuj HE1HH([A^A_]HiHH}Huf.@UHAWAVSH(HuHЦHED~D}HG]ԉ]؅y yHHt\Lw(MtSA)Au7H5qH}HUx}t0}t7LHQiHu9H}x1H([A^A_]ILHhHuHm$HUHAWAVSH(HuHHED~D}HG]ԉ]؅y 2xHHt\Lw(MtSA)Au7H5H}HUw}t0}t7LH=4hHu9H}w1H([A^A_]ILHgHuH$HUHAWAVSH(HuHHED~D}HG]ԉ]؅y RwHHt\Lw(MtSA)Au7H5ZgH}HUw}t0}t7LH赡TgHu9H}v1H([A^A_]ILHgHuH$HUHAWAVSH(HuHQIHED~D}HG]ԉ]؅y rvHHt^Lw(MtUA)Au9H5zfH}HU>v}t2}t9LH#rfHu;H}u1H([A^A_]ILH5fHuffDUHAWAVSH(HuHYIHED~D}HG]ԉ]؅y uHHt^Lw(MtUA)Au9H5eH}HU^u}t2}t9LHeHu;H}u1H([A^A_]ILHUeHu$efDUHAVSH HuH~~HEDvDuHG]]y tHHt"H(HtD9uEt$ޟdHt(1.H}111_tHdHuHG$HHH [A^]UHHHztuHH]H=l&]pH5s1]UHAWAVSH8HuHIHED~D}HG]̉]Ѕy sHHtuLw(MtlA)AuPHuH}=ttRH5cH}HU}s}t8HuLHpcHuHI$HH}-s1H8[A^A_]@UHAWAVSH(HuHRJHED~D}HG]ԉ]؅y rHHt`Lw(MtWA)Au;H5bH}HUr}t4LH苝bHubH}rr1H([A^A_]fUHAWAVSH(HuHrJHED~D}HG]ԉ]؅y 2rHHtYLw(MtPA)Au4HuH}rt6HuLǜH?bHuHJbH}q1H([A^A_]UHAWAVSH(HuHKHED~D}HG]ԉ]؅y qHHtYLw(MtPA)Au4HuH}qt6HuLHaHuHaH} q1H([A^A_]UHAWAVAUATSHhHuHLHEFEHGM̉MЅypHHL(H}FpAC6HcHppLp1EIcM,LDM*E+ẼH}HuqH}HupH}LDjpDEArII9IDI91)HHHHtfDI4ItHHuH~DI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}L(H}ȾlAC6HcHxmHxH]ME+E܃H}HumH}HummH}HDlHuHUHMLF\HuHUH}ȾRl\HuHUH}ȾDk\Hu/H8$HHxHEH9u'/H}Ⱦ l1HxHEH9t Ht&HHx[A^A_]E1HHxHEH9t HtH-] UHAWAVSH(HuHIHED~D}HG]ԉ]؅y kHHtYLw(MtPA)Au4HuH}kt6HuLeH[HuH[H} k1H([A^A_]UHAWAVSH8HuHIHED~D}HG]̉]Ѕy jHHtsLw(MtjA)AuNHuH}MktPHuH}Ef.Eu"z Ef.EuzEf.EuXHH}HUоhHuH#HHE]UĉUȅy)hHHH_(HH}HuhH}HuhH}HpHht{H}Hx4htgH}Hu#htVHuHUHpHxH}HEHMH}HMHWHuHV$HH5BG9g1H $H H;Mu$HĈ[]1H1H|UHSHH=$HHE^HG)ЃHuH(HHE]UĉUȅyfHHH_(HHuH}-gtH}HuкfZEEEEEEHuHUHŐEf.Eu"z Ef.EuzEf.EuTVHH}HUоfHuH9GHE]UĉUȅyeHHH_(HH}Hu>fH}HxetqH}Huet`H}HuetOHuHxHMHUHEHMHUHUH轏zUHuH$HH5wFd1H B$H H;MuHĈ[]1H?Af.UHAWAVSH(HuH:GHED~D}HG]ԉ]؅y dHHt`Lw(MtWA)Au;H5TH}HU^d}t4LHsTHuH.$HH}d1H([A^A_]fUHAWAVSH(HuHWGHED~D}HG]ԉ]؅y cHHt`Lw(MtWA)Au;H5SH}HUc}t4LH菎SHuHn$HH}Rc1H([A^A_]fUHAWAVSH(HuHkGHED~D}HG]ԉ]؅y cHHtWLw(EMt3A)H}Au*HuSctuLHSHt1#b1E1HcH([A^A_]@UHAWAVSH(HuHGHEDvDuHG]ԉ]؅yRbHHL(MtwA)Au[H5nH}HUb}tTIH5mH}HUa}t7LLH赌6RHuHʑ$HH}a1H([A^A_]DUHAWAVSH(HuHHED~D}HG]ԉ]؅y raHHtVLw(MtMA)Au1HuH}at3}ut7L\HzQHu9H}`1H([A^A_]IL H?QHuHaUHAWAVSH(HuHHED~D}HG]ԉ]؅y `HHtVLw(MtMA)Au1HuH}`t3}ut7LtHPHu9H},`1H([A^A_]IL0HoPHuHzPUHAVSH HuHFHEDvDuHG]]y _HHtH(HtD9uPHt1H}111_ H$HHH [A^]UHAWAVSH8HuHFHED~D}HG]̉]Ѕy B_HHtnLw(MteA)AuIHuH}_tKHuH}_t:HuHULvH:OHuHEOH}^1H8[A^A_]f.UHAWAVSH(HuHGHED~D}HG]ԉ]؅y r^HHt`Lw(MtWA)Au;H5RH}HU>^}t4LHxNHuGNH}]1H([A^A_]fUHAWAVSH(HuHlGHED~D}HG]ԉ]؅y ]HHt`Lw(MtWA)Au;H5 HH}HU~]}t4LHcMHuMH}2]1H([A^A_]fUHSH(HuHHE؋FEHEEȃrH}о\1[H5H}HU\H1}tH5 H}HU/\}t7HeHkLHu"H]H([]H}о[1H([]ÐUHH=T&H5NV&HFH 0eL=U&uLHU&H=T&2LHsT&]ÐUH]xUfDUHSPHH=PT&H5U&HEH LT&uLLH!U&H=T&KH5vEHT&H]Kt H S&tH[]H=S&H[]QLfUHAVSH0HuHHEЋFEHEHEH}ȃu\Hu[t^H]H=DHAtH=kHt H,YLcJHuLJ8Z1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅yZHHLw(HEMA)AuQHuH}1Zt|}L}tYH=CL&AtOH=~L tGHu6H}V1H([A^A_]ILGHuH$HDUHAVSH HuHqCHEDvDuHG]]y dVHHt!H(HtD9uEt#H_0FHt+12H}111V!HHaFHuHlFHHH [A^]DUHAWAVSH(HuHCHED~D}HG]ԉ]؅y UHHtbLw(MtYA)Au=HuH}-Vt?}HutBI9v8tIv8ILEHu6H}0U1H([A^A_]ILvEHuH $HDUHAVSH HuHBHEDvDuHG]]y THHt!H(HtD9uEt#H_8DHt+12H}111T!HHDHuHDHHH [A^]DUHAWAVSH(HuHHBHED~D}HG]ԉ]؅y "THHtbLw(MtYA)Au=HuH}Tt?}HutBI9v@tIv@ILDHu6H}S1H([A^A_]ILCHuHz$HDUHAVSH HuHHEDvDuHG]]y DSHHt!H(HtD9uEt#H_@lCHt+12H}111R!HHACHuHLCHHH [A^]ÐUHH=N&H5Q)H7P&H 0yC-O&u H={N&.CHoN&]f.UHAVSHtH0賅IHHiE1L[A^]HLiHC UHH=O&H5~Q&H@H 0BmP&uCHP&H=O&BHO&]ÐUH]^fDUHSPHH=M&H5P)H2O&H +tB(N&u H=vM&)BH53@HcM&HAtH PM&u H=GM&BH=O&H5P&H?H fAO&u7BHO&H=N&AH5?HN&HHAt H N&tH[]H=N&H[]HH[]@1HH[]#H5>O1H[]f.@UHAVSH0HuHS>HEЋFEHEHEuQH5->H}HUOHtKHÿ0豂IHHgH==L@HH}Hu (H}ȾO1H}Ht Huj@HH0[A^]HL#HW@ UHAWAVAUATSPIIIHGHGHH~H+>tKHHL9IIGIHHI_I6I^H)H~LH؁IMgIG(IG IGI~ I+~tMMgHHL9wV|IIG IGHHI_(IvI^ H)H~LHiIMo H[A\A]A^A_]L̀LÀ II<$Ht I L=II?Ht IʀL> UHAVSH0HuHeHEЋFEHEHEH}ȃu\HuMt^H]H=;H賀AtH= H蚀t HKLcZ=HuL_=L1H0[A^]ÐUHAWAVSH(HuH,HED~D}HG]ԉ]؅yLHHLw(HEMA)AuQHuH}Lt|}L}tYH=:LAtOH=LtGLc8HuL8JH1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHHLw(HEMA)Au{HuH}AH}L}tH=8L2{AtuH=<)L{tbH=*L{tOH=dLzt1H([A^A_]ILH.HuH?UHAWAVSH(HuHHED~D}HG]ԉ]؅y R>HHtVLw(MtMA)Au1HuH}>t3}ut7LJHZ.Hu9H}=1H([A^A_]ILH.HuH>UHAWAVSHxHm$HHEHxHHED~D}HG]]yq=HHLw(MA)HxAumHu=toHxHu\=tVH5HxHU=}t9HMHM(E)E}utOHULHIQ<1H l$H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$,HuHxHU<,H`Hc,H Yl$H H;MZkoUHAWAVAUATSHXH%l$HHEHHHF HG$(y;HHHG(H@LL ;ACD-HcHj;HE1EIcHLEL:AH0C?HcH(;HE1EIcHHHIDH@ +$HHu:LHsHH0D:UHH< ;:HHp:HH:HLDf:HEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDH+9E1HHH9t HtAlHHH9t Ht$lH;i$HH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLM<!IHLHUHpLM(T HuLH(1/Ef.EuzEf.EuzEf.Eu{$ HuH(HUI0pf.Pu'z%xf.XuzEf.`u{'HuH(Hp/E~>1AfA.Du z HH9u!fHuH(LD/EHzH^$HHHH9ns%bHHHH9t HtaH UHAWAVSHHH^$HHEHHHDvDHGy2.HHL(MA)HAaHu-.ZHHu.=HH1."HH.HH@-HH-HLL-HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL 9n},1H \$H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!QHuHHU1,Ef.`u$z"Ef.huzEf.pu{$HuHHU:,HuH'+@f. u*z(Hf.(uzPf.0u{'zHuHH@+f.u*z(f.uzf.u{'HuHHQ+HuHF*HHcH Z$H H;M]DUHAWAVSH(HuHHEDvDuHG]ԉ]؅y*HHL(MA)AumHuH}g*toH5bH}HU)}tUIH5;H}HU)}t8}utH}X)1H([A^A_]ILLHHHuHcUHAWAVAUATSHHUY$HHEHPHHXF`HGdhy(HHHG(HpLPL9(AC6HcH(HE1EIcHLEL'AH]C?HcH\(HE1EIcHIDHpHI͋`+dHPHH(HPHu(HPHuD'HPHL-(tiHPLD'tSHEHEf(Ef)EDHxE#A1HxzHP$'E1HHH9t Ht:ZHHH9t HtZH4W$HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM/HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU#E~E1HMfA.uzHH9xu"AHuHPHUD#E~>1ADf.u z HH9Eu!HuHPLD=#HKL-lR$IEHHH9?DUHHHH9tHt YUHHHH9t Ht5UHo fUHAVSH HuHʍHEDvDuHG]]y !HHt%H(HtD9uEt1.HHt51H}111l!HH [A^]HpHHuHtH5 H8"HHH&Q$H뱐UHAWAVSHhH\Q$HHEHuHPHED~D}HG]]y HHLw(MA)H}AuZHu HEHE(E)E}t?( $)EH?HE $1f.EuRzP2= eIHuLXHcEf.EuzEf.EuzEf.Eu{]HuH}HU1 ?Ht1H !P$H H;Mu#Hh[A^A_]H'H O$H H;MtSUHH HO$HHEHHHFHDžH1Hu*HH` j HEHE(E)E(`(p(U(]))) )0(E)@(E)PH}H`<+Ef.EuzEf.EuzEf.Eu{!HuHHU1!`f.hf.pf.xf.Ef. uyzwEf.(uhzfEf.0uWzUEf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{' HuHH`  Hu.H5M$HH {M$H H;Mt&P 1H UM$H H;MuH ]UHSHH-M$HHEHPHHXF`HDždHPHuкHPH$HEHE(E)EHpH HOH}H(Ef.EuzEf.EuzEf.Eu{!a HuHPHU1f.pf.xlff.PJf.4.f.f.f.f.f.f.f.pjf.TNf.82f.f.f.f.f. f.(f.tn0f.XR8f.<6@f.  Hf.(Pf.0Xf.8`f.@hf.Hpf.Pu|zzxf.XuhzfEf.`uWzUEf.huFzDEf.pu5z3Ef.xu$z"Ef.uzEf.u{'HuHPH${Hu.HH$HH UH$H H;Mt&kK1H /H$H H;MuHĨ[]f.fUHAWAVSH(HG$HHEHHHD~DHGyrHHLw(MA)HAHumHH@ MHEHE(E)E(@(P(`(p))))(E) (E)0tiH}H@#Ef.EfY1H F$H H;MH([A^A_]E1MIHuH@LxEf.EuzEf.EuzEf.Eu{!EHuHHU1@f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf. u5z3Ef.(u$z"Ef.0uzEf.8u{'HuHH@ RH+HD$HH D$H H;M#GDUHAWAVSHHD$HHEH@HHHD~DPHGTXyHHLw(MA)H@AHu H@H$thHEHE(E)EH`H FTtiH}HEf.Ef31H ~C$H H;M}HĨ[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!HuH@HU1_f.`f.hztf.p^Xf.xB<f.& f. f.f.f.f.f.~xf.b\f.F@f.*$f.f.f.f.f.f.| f.f`(f.JD0f..(8f. @f. Hf.(Pf.0Xf.8`f.@hf.Hunzlpf.PuZzXxf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{'RHuH@H$+HH>$HH ?$H H;MBf.DUHSH(HuH<HE؋FEHEH}ЃuEHutG}HHu2Ht6H5H)HH([]þ 1H([]H=$HH([]UHSH(HuHoHE؋FEHEH}ЃuEHuPtG}HHu2Ht6H5)HH1H([]þi 1H([]H]=$HH([]ÐUHH=U&H5&H H 0&u}H&&H=&H&]ÐUH] fDUHSPHH=&H5&HT H x&uH&H=&MH5 H&Ht H &tH[]H=&H[]fUHAVSH0HuHEHEЋFEHEHEH}ȃHu H]H=H?AtDH=Hr?t1H=H_?tH=HL?t H~ Lc HuL 1H0[A^]UHAWAVSH(HuHܱHED~D}HG]ԉ]؅yR HHLw(HEMA)Au{HuH} }L}tH=pLr>AtuH=|LY>tbH=jLF>tOH=L3>tH}HU'}IH5H}HU}HH5H}HU}HEH5xH}HU}HEH5xxH}HU}HEH5cxH}HU}t{HEHuH}tfH54xH}HUP}tL}ELUtNHLLLLILMPARuuuRH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0HuH-$HUHAWAVAUATSHXH-$HHEHHV\HF HG$(y@HHHG(H@LLACD-HcH HE1EIcHLELmAH0C?HcHHE1EIcHHHIDH@ +$HHuLHsHH0DvUHH<:HHp;HH\HLDHEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHE1HHH9t Ht-HHH9t Ht-H*$HH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLMJ!IHLHUHpLM(HuLH(1MEf.EuzEf.EuzEf.Eu{$HuH(HUpf.Pu'z%xf.XuzEf.`u{'OHuH(HpE~>1AfA.Du z HH9u!HuH(LDFHzHu $HHHH9ns#HHHH9t Htc#H UHAWAVSHHHY $HHEHHpHDvDHGyHHL(MA)HAaHuZHHu=HH"HHHH@ZHH:HLLjHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn1H h$H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU11Ef.`u$z"Ef.huzEf.pu{$HuHHUyHuH@f. u*z(Hf.(uzPf.0u{'HuHH@Tf.u*z(f.uzf.u{'HuHHHuHoHHcpH G$H H;MYDUHAWAVSH(HuH9QHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}toH5H}HUe}tUIH5H}HUH}t8}utH}1H([A^A_]ILLHH6HuHc;UHAWAVAUATSHH$HHEHPHRHXF`HGdhypHHHG(HpLPLAC6HcH;HE1EIcHLELAH]C?HcHHE1EIcHIDHpHI͋`+dHPHH HPHuHPHuDHPHLtiHPLDitSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t HtHHH9t HtH$HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM}HpHHUHMMPEf.EuzEf.EuzEf.Eu{$-HuHPHUjE~E1HMfA.uzHH9xu"HuHPHUD E~>1ADf.u z HH9Eu!HuHPLD|HKL- $IEHHH9?D[HHHH9tHt HHHH9t HtH fUHAVSH HuHjOHEDvDuHG]]y dHHt%H(HtD9uEt1HHt51H}111 HH [A^]HpHSHuHtH5xHHHH$H뱐UHHH$HHEH HhH(F0HDž4H HuH HuxHEHE(E)E(E(M(U(])@)P)`)pH}HuEf.EuzEf.EuzEf.Eu{!#HuH HU1cEf.@uyzwEf.HuhzfEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$zHuH HUVHu.H$HH 0$H H;Mt&F1H $H H;MuH]UHSHH$HHEHHgHF HDž$HVHuкOHHi/HEHE(E)EH0HHfH}HEf.EuzEf.EuzEf.Eu{!HuHHU1Qf.082f.8f.@f.Hf.Pf.X f.`(f.htn0f.pXR8f.x<6@f. Hf.Pf.Xf.`f.hf.pf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'HuHH{Hu.H $HH U $H H;Mt&k1H / $H H;MuH[]f.fUHAWAVSHH $HHEHHSHD~DHGyrHHLw(MA)HAHumHH`MHEHE(E)E(`(p(U(]) )0)@)PtiH}H`LEf.Efu1H $H H;MmH[A^A_]E1MIHuH`LxEf.EuzEf.EuzEf.Eu{!aHuHHU1`f. hf.(unzlpf.0uZzXxf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'HuHH`}HH $HH S $H H;Me UHAWAVSHH) $HHEHHCRHD~DHGyHHLw(MA)HAHuHH}thHEHE(E)EH H tiH}HEf.Ef1H  $H H;M-H[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!HuHHU1f. F@f.(*$f.0f.8f.@f.Hf.Pf.X| f.`f`(f.hJD0f.p.(8f.x @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'2HuHHl HH$HH $H H;Mf.DUHSH(HuHdHE؋FEHEH}Ѓu6Hut8}HHu#H߾H([]þ1H([]UHSH(HuHodHE؋FEHEH}Ѓu6HuPt8}(HHu#H߾(H([]þx1H([]ÐUHH=U%H5%HH 0%uKH&%H=%H%]ÐUH]vfDUHSPHH=%H5%H^H x%uKH%H=%mH5*H%Ht H %tH[]H=%H[]fUHAVSH0HuHeyHEЋFEHEHEH}ȃHuH]H=HAtDH=BHt1H=vHtH=}Hlt HLc,HuL11H0[A^]UHAWAVSH(HuHxHED~D}HG]ԉ]؅yrHHLw(HEMA)Au{HuH}}L}tH=zLAtuH=)LytbH=uLftOH=|LStH5H}HU}t7HHHu"HH([]H}о1H([]ÐUHH=%H5>%H12%ufH{%H=t%Hh%]fDUHSPHH=P%H5%Hk1ŷ%uH&%H=%蒷H5<H %H"t H %tH[]H=%H[]f.@UHAVSH0HuHlHEЋFEHEHEH}ȃu\Hut^H]H=HAtH=+qHt HLczHuL1H0[A^]ÐUHAWAVSH(HuHLlHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}t|}L}tYH=LAtOH=>pLtAuCHuH}ltEHuIL0HHu(H H}芴H}i1H([A^A_]UHAWAVSHhH#HHEHuHjHED~D}HGEEy$HHLw(MH}AHuHEHE(E)EIHuLEf.EuzEf.EuzEf.Eu{ܣHuH}HU1辣Hu5HR#HH #H H;Mt-= 1H k#H H;MuHh[A^A_]UHAWAVSH8HuHHED~D}HGẺEЅy ҲHHtlLw(MtcxAAuFHuH}4tHuILE٢Hu*E֢ H}gH}F1H8[A^A_]ÐUHH=U%H5%H1ʢ%uH+%H=$%藢H%]fDUHSPHH=%H5%H1u%uH%H=%BH5PH%Hҡt H %tH[]H=%H[]Ƣf.@UHAVSH0HuH5WHEЋFEHEHEH}ȃu\Hu舱t^H]H=HAtH=[Hjt H蜯Lc*HuL/訰1H0[A^]ÐUHAWAVSH(HuHVHED~D}HG]ԉ]؅yrHHLw(HEMA)AuQHuH}衰t|}L}tYH=LAtOH=ZL}tɔ1+E1#IL8 HuH#HH([A^A_]UHAVSH HuHuHEDvDuHG]]y dHHt'H(HtD9uEt)膄Ht*11H}111  H@\Hu+HHH [A^]UHAVSH HuHHEDvDuHG]]y 贓HHt1H(Ht(D9u'H118؃HuHl#H1H}111PHH [A^]UHAVSH HuH HEDvDuHG]]y HHt&H(HtD9uH87Ht1H}111軒 H#HHH [A^]UHAWAVSH(HuHNHED~D}HG]ԉ]؅y rHHtWLw(MtNA)Au2HuH}Ւt4uL胂HuH#HH}1H([A^A_]fUHAVSH HuHHEDvDuHG]]y đHHt#H(HtD9uEt%Ht*10H}111nHHHu։ƁHHH [A^]DUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtSLw(MtJA)Au.HuH}ut0}ut4L֖Hu6H}蟐1H([A^A_]ILPHuHy#H@UHAVSH HuHHEDvDuHG]]y DHHt#H(HtD9uEt%jHt*10H}111HX@Hu։FHHH [A^]DUHAWAVSH(HuH!HED~D}HG]ԉ]؅y 蒏HHtWLw(MtNA)Au2HuH}t4uLhHuH7#HH}1H([A^A_]fUHAVSH HuHBHEDvDuHG]]y HHt#H(HtD9uEt% Ht*10H}111莎H`~Hu։~HHH [A^]DUHAVSH HuHHEDvDuHG]]y 4HHt H(HtD9uOH]~Ht1H}111 HS~HHH [A^]f.fUHAVSH HuHYHEDvDuHG]]y 蔍HHt H(HtD9uߓH}Ht1H}111A H}HHH [A^]f.fUHAVSH HuHƨHEDvDuHG]]y HHt H(HtD9uH}Ht1H}111行 H}HHH [A^]f.fUHAVSH HuHHEDvDuHG]]y THHt%H(HtD9uEt'dHx|Ht+12H}111!HPHM|HuHX|HHH [A^]ÐUHAVSH HuHTHEDvDuHG]]y 褋HHt%H(HtD9uEt'ؑH{Ht+12H}111L!HHH{HuH{HHH [A^]ÐUHAVSH0DvHGD)ttHuH-HEDu]]yHHH_(HHuH}`HuHHzHugJHuH¤HEDu]]y yHHt;H(Ht2D9u;覐HzHuHzHH5o1HH0[A^]H}111UHAWAVSH(HuHHED~D}HG]ԉ]؅y ҉HHt`Lw(MtWA)Au;H5MH}HU螉}t4LH諏yHuHn#HH}R1H([A^A_]fUHAVSH HuHnHEDvDuHG]]y HHt$H(HtD9uEt&HP9yHt+12H}111轈!HhHyHuH襉HHH [A^]fUHAWAVSH(HuHPHED~D}HG]ԉ]؅y bHHt`Lw(MtWA)Au;H5H}HU.}t4LHAjxHuH#HH}1H([A^A_]fUHAVSH HuHHEDvDuHG]]y 複HHt$H(HtD9uEt&HXwHt+12H}111M!HpHwHuH5HHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5mH}HU辆}t4LH׌vHuH#HH}r1H([A^A_]fUHAVSH HuHHEDvDuHG]]y 4HHt$H(HtD9uEt&H`YvHt+12H}111݅!HxH.vHuHņHHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y 肅HHt`Lw(MtWA)Au;H5H}HUN}t4LHUuHuH#HH}1H([A^A_]fUHAVSH HuH}HEDvDuHG]]y ĄHHt$H(HtD9uEt&H tHt+12H}111m!HHtHuHUHHH [A^]fUHAVSH HuH]HEDvDuHG]]y HHtH(HtD9u>tHt1H}111ƒ sHHH [A^]f.UHAWAVSH(HuH5HED~D}HG]ԉ]؅y rHHt\Lw(MtSA)Au7H5$H}HU>}t0}t7LH襉tsHu9H}1H([A^A_]ILH9sHuHͲ#HUHAVSH HuHHEDvDuHG]]y 蔂HHt$H(HtD9uEt&H0rHt+12H}111=!HHrHuH%HHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtmLw(EMtIA)H}Au@Hu#t/}EtEA89tA9ILqHt81>Y1+E1#ILqHuH1#HH([A^A_]UHAVSH HuHHEDvDuHG]]y HHt'H(HtD9uEt)9qHt*11H}111蚀 HpHupHHH [A^]UHAVSH HuHQHEDvDuHG]]y DHHt+H(Ht"D9u!Et-HbpHt(1.H}111H:pHuHί#HHH [A^]f.DUHAVSH HuHHEDvDuHG]]y HHt(H(HtD9uEt*H1oHt(1.H}111)H}oHuH#HHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y~HHLw(HEMA)AHuH}~}H]M@HL HtMtLHѱMtLbHH豱IILaI@I 4J ;H9s J 8H9LHHyHHHƉH`sd1H}}1+HE1ILHmH\1H([A^A_]Idž@%HH)13L30L0D3 L30D0 L00D3@L3PD0@L0PD3`L3pD0`L0pHHuHt"HHD3 3D0 0H HuI9AHHILHt'1f.  HH9uI)HHHrQ1 T TT TT TT TT TT TT THI9uILlHH #HUHAWAVSH(HuH{HEDvDuHG]܉]y {HHt$H(HtD9uEt2L@lHt71H}111{HH([A^A_]HIkHuMt3LILHlHHukLLkHH,#HUHAWAVSH(HuH)HED~D}HG]ԉ]؅yzHHLw(HEMA)AHuH}{}H]MHHL HtMtLHMtL肭HHѭIIL聭IHI 4J ;H9s J 8H9LHHyHHHƉH`sd1H}y1+HE1ILH jH\1H([A^A_]IdžH%HH)13L30L0D3 L30D0 L00D3@L3PD0@L0PD3`L3pD0`L0pHHuHt"HHD3 3D0 0H HuI9AHHILHt'1f.  HH9uI)HHHrQ1 T TT TT TT TT TT TT THI9uILhHH@#HUHAWAVSH(HuHHEDvDuHG]܉]y xHHt$H(HtD9uEt2LH'hHt71H}111wHH([A^A_]HIgHuMt3LILH$hHHugLLgHHL#HUHAVSH HuHHEDvDuHG]]y wHHt"H(HtD9uEt$|;gHt(1.H}111vHgHuH#HHH [A^]UHAWAVSH8HuH)HED~D}HG]ԉ]؅y bvHHt`Lw(EMtyAArH}vYHuH}vtHE;E}"H}Husvt/} E1 1HuL|H%fHt 1H8[A^A_]HvfUHAWAVSH8HuHHED~D}HG]ԉ]؅y ruHHt`Lw(EMtyAArH}'uYHuH}utHE;E}"H}Huut/} E1 1HuLzH5eHt 1H8[A^A_]HufUHAWAVSH8HuHOHED~D}HG]ԉ]؅y tHHt`Lw(EMtyAArH}7tYHuH}ttHE;E}"H}Hutt/} E1 1HuL[zHEdHt 1H8[A^A_]HtfUHAWAVSH8HuHHED~D}HG]ԉ]؅y sHHt`Lw(EMtyAArH}GsYHuH}stHE;E}"H}Hust/} E1 1HuLyHUcHt 1H8[A^A_]HsfUHAWAVSH8HuH9HED~D}HG]ԉ]؅y rHHt`Lw(EMtyAArH}WrYHuH}stHE;E}"H}Hurt/} E1 1HuLxHebHt 1H8[A^A_]HrfUHAWAVSH8HuH HEDvDuHG]̉]Ѕy qHHtxL(MtoA)AuSH5:H}HU~q}tLIHuH}rt8HULLOwaHuH6#HH}q1H8[A^A_]ÐUHSHhHP#HHE^HG)Ѓ HuH/HE]UĉUȅypHHH_(HHuH}@q}HuHdwH`HHuH3/HE]UĉUȅy IpHHttH_(HtkHuH}ptZH}HuкKptDEEEEEE}HuttHUHvvH5.o1H #H H;MHh[]HHXH_HuHH5 YHipH`HHUH`Ef.EuzEf.EuzEf.Eu{!_HuH}HUоoa_H?H#H2X@UHSH8^HG)Ѓ.HuHjHEЉ]؉U܉UynHHH_(HwHuH}ob}HujHuH^H;HuH jHEЉ]؉U܉UynHHH_(HH}Hu|nH}HugnH}HuRn}uUMHWH]HHuHaiHEЉ]؉U܉Uy tmHHtcH_(HtZHuH}mtIH5IH}HU8m}t/}HutVHHsj]HuXH5hl1H8[]1HHHpH+]HuCH HH]HuH#HH8[]HHxH\HuH}mH8[]fUHAWAVSH(HuHIHED~D}HG]ԉ]؅y BlHHtVLw(MtMA)Au1HuH}lt3}Hut6LqJ\Hu8H}k1H([A^A_]IL\HuHc\ӐUHAWAVSHx^HG)ЃHxH2HE]UUy[kHHH_(HHuHxkyH5GHxHU k}X}HuHHp7[H1HuHA2HEȉ]ЉUԉU؅yjHH@L(H}2jAC6HcHxjHxH]ME+EԃH}HujH}HujH}HDjHuHUHMLoWZHuHUH}i;ZHuHUH}DiZHu1H#H'H5'1i1/H}i1HxHEH9t Ht蜜HHx[A^A_]E1H HHYHuH4#HHHxHEH9t HtDH~Z UHAWAVSH8HuHt1HED~D}HG]ԉ]؅y hHHtqLw(MthA)AuLHuH}MitNH5*EH}HUh}t4}Hut7LHTnXHu9H}Ah1H8[A^A_]ILHXHuH#HUHAWAVSH8HuH1HEDvDuHG]ԉ]؅ygHHL(MA)AulHuH}UhtnH52DH}HUg}tTIH5DH}HUxg}t7}Hut:LLHmWHuHpx|Uy-eHH)L(HhdACD-HcHeL1EIcM$LDMx+|RHhHudcH50HhHUd}BHHhH e$HhH(d HhHudHhHuRdHhLD8dEXE8EHE0E@EPDH`EuA1H`HhH<Hpx|UyTcHHXL(HhbACD-HcH(cL1EIcM$LDMx+|HhHucH5WHhHUb}iHH5?HhHUbH`}>HhH c#HhH(bHhHubHhHuQbHhLD7bE0E@EPE8EHEDHXE.A1HXH5:Ta1MHh@aHh(a1HHH9t Ht?HV#HH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLHe"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{!NHuHhHU1_NHuUHh^Ef.0u$z"Ef.@uzEf.Pu{$lNHuHhHU^E~A1AfA.uzHH9`u!#NHuHhLDc^NHmL NHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`c.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{! LHuHhHU1L\KHuUHhD[Ef.8u$z"Ef.HuzEf.u{$KHuHhHU[E~A1AfA.uzHH9Xu!QKHuHhLD[0KHL7KHHHH9HHHH9t Ht觍HK f.UHAVSH HuH[HHEDvDuHG]]y 4ZHHt"H(HtD9uEt$_[JHt(1.H}111YH3JHuHlj#HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y YHHtYLw(MtPA)Au4HuH}Yt6HuL`HIHuH&ZH} Y1H([A^A_]UHAWAVSH8HuHHED~D}HG]̉]Ѕy XHHtuLw(MtlA)AuPHuH}MYtRH5dH}HUX}t8HuLHJ_HHuHY#HH}=X1H8[A^A_]@UHAVSH HuHD\HEDvDuHG]]y XHHt$H(HtD9uEt&])HHt*11H}111W HGHuHcHHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y RWHHt\Lw(MtSA)Au7H5H}HUW}t0}t7LH\TGHu9H}V1H([A^A_]ILHGHuH#HUHAWAVSH(HuHHED~D}HG]ԉ]؅y rVHHt\Lw(MtSA)Au7H5хH}HU>V}t0}t7LH\tFHu9H}U1H([A^A_]ILH9FHuHͅ#HUHAWAVSH(HuHsHED~D}HG]܉]y UHHt#H(HtD9uAEtEHt+12H}111H}111|T-HHDHuHHxDDHHH [A^]DUHAVSH HuHDqHEDvDuHG]]y THHt#H(HtD9uEt%:DHt*10H}111SHDHu։DHHH [A^]DUHAWAVSH(HuHHED~D}HG]ԉ]؅y bSHHt`Lw(MtWA)Au;H5~H}HU.S}t4LHYhCHu7CH}R1H([A^A_]fUHAVSH HuHHEDvDuHG]]y RHHt H(HtD9uXHBHt1H}111QR HOSHHH [A^]f.fUHAWAVSH(HuHHED~D}HG]ԉ]؅y RHHtVLw(MtMA)Au1HuH}eRt3uLWBHuBH}Q1H([A^A_]UHAWAVSH8HuH;HED~D}HG]̉]ЅyRQHHLw(MA)H}AHuQH}HuQtsH}HuQtbH}HurQtQHuHUHMLEL\WAHtJ AHt[@Htl@Hu{{P1H8[A^A_]E1MAUH}+P@HuUH}P@HuUH}Ox@HuH #HUHAWAVSH8HuHHED~D}HG]ĉ]ȅyOHHLw(MA)H}AHuAPH}HuPtvH}HuPteH}HuOtTU܋MDEHuLU?HuHUH}1 O|?HuH#HN1H8[A^A_]E1M>UHAWAVSH8HuHHED~D}HG]̉]ЅyNHHLw(MA)H}AukHu%OtmH}HuNt\H}HuNtKH}HuNt:HuU܋MDELT{>Hu>M1H8[A^A_]E1M`UHHHztuHH]H=q%] [H5uM1]UHSH(HuHsuHE؋FEHEEȃrH}оUM1[H58}H}HUOMH1}tH5|H}HUL}t7HaSH<Hu"HMH([]H}о`L1H([]ÐUHH=p%H5Nr%HH 0<=q%uHq%H=p%<Hsp%]ÐUH]ifDUHSPHH=Pp%H5q%H#H <p%u舙H!q%H=p%M<H5Hp%H;t H o%tH[]H=o%H[]<fUHAVSH0HuHEHEЋFEHEHEH}ȃuoHuKtqH]H=`H~At1H=qHz~tH=Hg~t HILc';HuL,;J1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅ybJHHLw(HEMA)AuhHuH}J}L}tlH=OL}AtbH=pLi}tOH=LV}tF1H8[A^A_]ILL 6HuHv#HUHAWAVSH(HuHHED~D}HG]ԉ]؅y EHHt\Lw(MtSA)Au7H5yH}HUE}t0}t7LHCc5Hu9H}fE1H([A^A_]ILH(5HuH=u#HUHAVSH HuHHEDvDuHG]]y EHHt!H(HtD9uEt#H_0,5Ht+12H}111D!H0H5HuHEHHH [A^]DUHAWAVSH(HuHhnHED~D}HG]ԉ]؅y RDHHt\Lw(MtSA)Au7H5vPH}HUD}t0}t7LHaT4Hu9H}C1H([A^A_]ILH4HuHs#HUHAVSH HuH nHEDvDuHG]]y tCHHt!H(HtD9uEt#H_83Ht+12H}111 C!HHq3HuHDHHH [A^]DUHAVSH HuHmHEDvDuHG]]y BHHt%H(HtD9uEt'`H2Ht+12H}111lB!HH2HuH2HHH [A^]ÐUHAVSH HuHHEDvDuHG]]y BHHt%H(HtD9uEt'p_H82Ht+12H}111A!H8H 2HuH2HHH [A^]ÐUHAVSH HuHlHEDvDuHG]]y dAHHt$H(HtD9uEt&^1Ht*11H}111 A H_1Hu.1HHH [A^]UHAVSH HuHlHEDvDuHG]]y @HHt$H(HtD9uEt&.^0Ht*11H}111]@ H0Hu~0HHH [A^]UHAVSH HuHDlHEDvDuHG]]y @HHt H(HtD9uEt"_@-0Ht*10H}111?H0Hu։ 0HHH [A^]UHAVSH HuH/lHEDvDuHG]]y T?HHt$H(HtD9uEt&\y/Ht*11H}111> HO/HuHcT/HHH [A^]UHAVSH HuHflHEDvDuHG]]y >HHt"H(HtD9uEt$$\.Ht(1.H}111O>H.HuH7n#HHH [A^]UHAVSH HuH2lHEDvDuHG]]y =HHt"H(HtD9uEt$[.Ht(1.H}111=H-HuHm#HHH [A^]UHAWAVSH(HuHlHED~D}HG]ԉ]؅y B=HHtSLw(MtJA)Au.HuH}=t0}ut4LZM-Hu6H}<1H([A^A_]IL-HuHl#H@UHAWAVSH(HuHlHED~D}HG]ԉ]؅y r<HHtQLw(MtHA)Au,H5bH}HU><}t%}t,,Hu9H}<1H([A^A_]ILHD,HuHk#HUHAWAVSH(HuH?lHED~D}HG]ԉ]؅y ;HHtSLw(MtJA)Au.H5*bH}HUn;}t'}t.1+Hu+UHAWAVSH(HuHlHED~D}HG]ԉ]؅y :HHtSLw(MtJA)Au.H5ZaH}HU:}t'}t.1*Hu,}t0}t7LHK&tHu9H}+1H([A^A_]ILH89HuH[#HUHAWAVSH(HuHmHED~D}HG]܉]y +HHt#H(HtD9uAEtHt+12H}111<+!HLcHuLHHH([A^A_]f.DUHAVSH HuHHhH #HhH(HhHuHhHu1HhLDE0E@EPE8EHEDHXE.A1HXH541MHh Hh1HHH9t HtOH6L#HH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLHo"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{! HuHhHU1 HuUHhEf.0u$z"Ef.@uzEf.Pu{$L HuHhHUE~A1AfA.uzHH9`u! HuHhLDCHmLHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{!HuHhHU1,HuUHh$Ef.8u$z"Ef.HuzEf.u{$zHuHhHUE~A1AfA.uzHH9Xu!1HuHhLDqHLHHHH9HHHHH9t HtHH f.UHAWAVAUATSHHuE#HHEH HFH(F0HG48yHHL(H cACD-HcHL1EIcM$LDMG0+4H HuH5H HOFOHH HH HH HHwH Hp t|H LDtfHEHE(E)E(p)PHEH`DH@EAst1H@WH ;1HHH9t HtRFHiC#HH;EBHH[A\A]A^A_]E1#H@II9sII9s1HpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH@H9)HHHHtI4I4HHuHH@rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u4Ht#L4$HuLHLpLH (IHL4$HuLHLpLHIEf.EuzEf.EuzEf.Eu{!BHuH HU1!HuHH wpf.Pu'z%xf.XuzEf.`u{'HuH HpE~A1AfA.uzHH9@u!{HuH LDZHLHHHH99CHHHH9t HtBH fUHAWAVSH(HuHiiHED~D}HG]ԉ]؅y bHHtVLw(MtMA)Au1HuH}t3}Hut6L1 jHu8H}1H([A^A_]IL0HuHc5ӐUHAWAVAUATSH8HuH'HEDvDuHG]ĉ]ȅyHHLo(MA)AuiHuH}tkH5H}HUA}tQIƃ}L}tUEIEL8LLDH=VHuAH} 1H8[A\A]A^A_]IELLLHuH=#HfUHAWAVATSH0HuHHEDvDuHG]̉]Ѕyp HHLg(Mt{A)Au_HuH} taH5H}HU' }tGIƃ}L}tII$L8LLH3FHu?H} 1H0[A\A^A_]I$LLLHuH<#H@UHAVSH HuHHEDvDuHG]]y d HHt"H(HtD9uEt$\Ht(1.H}111 HcHuH;#HHH [A^]UHAWAVSH(HuHHED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111\ !HLcHuLHHH([A^A_]f.DUHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111 HHuH:#HHH [A^]UHSHHH:#HHE^HG)Ѓ HuHHEȉ]ЉUԉU؅y$ HHH_(HH}Hu H}Hum H}HuX }uUMH/HuyHuHHEȉ]ЉUԉU؅y HHtKH_(HtBHuH} t,}tLHuHHufH5 1H a9#H H;Mu`HH[]1HHHuH0?HuHH('HuH8#HH 9#H H;Mt<UHAVSHPH8#HHEDvHGD)؃tlHuHHEDuȉ]̉]ЅyTHHH(HD9ETHhHu}HuHDHEDuȉ]̉]Ѕy HHtNH_(HtEH}Huغt/E)EDu}twHuHyH5|1H7#HH;EHHP[A^]H}111QH8HHuH߾HHHuH@~EfvEf8%fPt tD9utUHuH}HU17HHH6#H;.:f.UHAWAVAUATSHH6#HHEЋF!HHzH Dž(HG,0yJHHL(MHmHuJHHu?jHHuME)DuEpExE,HuHUHMLHPHbHXHDž`DžhHPH߾AHcHCHHpH߾AHcHHHHPmAHcHHHHHPCAHcH`+dHHxHPHu HPHuHPHuaHPHpDUHPHD%HPHD yHPHxD[E)DuEEEHxH$H}HuHUHpLI~Efvf8%fPt tD9ut$lHuHPHUEf.u$z"Ef.uzEf.u{$HuHPHURHuLHcHAH5 g1H2#HH;EHP<1HHH9t HtS5HHHPH9t Ht65HH H9t Ht5HHH9t Ht4H2#HH;E HHĘ[A\A]A^A_]þE1Md IHuHUHMLH~Efvf8%fPt tD9ut$HuHHUEf.pu$z"Ef.xuzEf.u{$BHuHHUHDHcHH0#HH;E4H9H4HLHGH_HZHHHH9t Ht3HHHPH9t Htf3HH H9t HtI3HHH9t Ht,3Hf UHAWAVSH8HuHtHEDvDuHG]̉]ЅyHHL(MA)H}AHuH}HutvH}HuteH5xH}HUK}tKIH5xH}HU.}t.}u؋U܋Mt:LMI<1H8[A^A_]E1M>ILMIPHuH.#HfUHAWAVSHxH.#HHEHpHHxDvDuHG]]y^HHL(MA)HpAHuHpHuHpHu|txH5wHpHU}t[IHpHut?HEHE(E})EuUMtOLMLM;Qd1H -#H H;MHx[A^A_]E1M ILMLMXEf.EuzEf.EuzEf.Eu{$WHuHpHU3HbH,#HH -#H H;MZ0UHAVSH HuHHEDvDuHG]]y tHHt*H(Ht!D9u Et, Ht*11H}111 H`iHuHcnHHH [A^]f.UHAWAVSHHH,#HHEHuH-HED~D}HG]]yHH Lw(MA)H}AHuԺE܉EHEHEȃ}toA8A<)ADIc@)McH]ԉ)HcMH)Hc}L)HcHHHcHLcI;]t.<SIHuLhIƋ];]uE;EuE;EtHuH}HU1RHt1H *#H H;Mu#HH[A^A_]LH *#H H;Mt-UHAWAVSHHH|*#HHEHuHBHED~D}HG]]yHH&Lw(MA)H}AHuԺE܉EHEHEȃ}A8A<)ADIc@)McH]ԉ)HcUH)Hc}L)ǃAANɃANHcHHHcHLcI;]t.<SIHuLpIƋ];]uE;EuE;EtAHuH}HU1#Ht1H )#H H;Mu#HH[A^A_]LH (#H H;Mt+@UHAWAVAUATSHHuH:HEFEHGMMyMHHHG(HEH]H߾AHcHX4HXHEH߾ACD-HcHxLxE1EIcIIDH}E+EH}Hu,H}HuH}HuH}HuDH}LDEEArKH9JI91HHLLHtA44HHuHZA ALLALLAL L HI9u*H}E1HxHEH9t Ht)HXH`H9t Ht)LHĈ[A\A]A^A_]1DHpHHH‰уHs1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpH HuHt(HHADA D H HuL9{}uUMtH}LEMqH}HLEMxE~31A ; u HI9uHuH}LDnHnL%$#I$HxHEH9bgHHxHEH9tHt 'HHXH`H9t Ht'H  fDUHAWAVSHXHuH@HEȋFEHGMԉM؅ydHHL(H}HcH}VME+EԃugLuH}HuteH}HutTH}HuutCH}L't1}utWHUHMLMYH}1H}HEH9t Ht&HHX[A^A_]E1'IHUHMLMHuUH}HuUH}uHvH##HH}HEH9joHH}HEH9t Ht&H> UHAWAVSHH"#HHE^HG)ЃbHuHHE]UUymHHCH_(H6H}Hu(E)pD}Duԃ}0HuH/HuHHE]UUyHHH_(HH}HuIH}Hu4H}HutyH}HuthH}HutWH}HutF}uUMDEDME$HHuH51H Q!#H H;MHĈ[A^A_]1HHHuHfopfvEP<u D9}uD9utHuH}HU1YHsHv #HH #H H;Mk#L$HAH2f.UHAWAVSH(HuHhHED~D}HG]܉]y HHt$Lw(MtD9uEt&I8'Ht.1:H}111)ILIHuLHHH([A^A_]fDUHAVSH0DvHGD)HuHբHEDuЉ]ԉ]؅y0HHH_(H H5H}HU}}HHE&HHuHOHEDuЉ]ԉ]؅yHHH(HD9u+EtdZEHuh?H5EVH}111:GH HHEHu'EHHE\Ht1HH0[A^]fUHAVSH0DvHGD)HuHcHEDuЉ]ԉ]؅yHHH_(H H5GH}HUm}}HHEHHuHݡHEDuЉ]ԉ]؅yHHH(HD9u+EtdE4Huh?H5VH}111GH HHEHu'EHHEHt1HH0[A^]fUHAVSH0DvHGD)HuHHEDu؉]܉]yHHH_(HH5H}HU}}HH HHuHnHEDu؉]܉]yHHH(Ht{D9u(Et\Hu`H}HuV)(E)pD}Duԃ}IHuHUHMLEHHHuH˞HE]UUyQHHH_(HH5]H}HU}IH}HuMt~H}HutmH}Hut\H}HuttK(E)pDeD}ԃ}7HUHMLELMHL6H5e1H #H H;MHp[A\A^A_]1HP1HHHuHUHMLEHfopfvEP<u D9}uD9utQHuH}HU13Ht)Ht,HH}111 -HH]HuHHx]bHHH [A^]DUHSHXH#HHE^HG)ЃrHuHfHE]UĉUȅyHHlH_(HFH}Hu1H}HuH}Hu}EMU f.u&z$(f.uz0f.u (0HHHHuHiHE]UĉUȅy HHtZH_(HtQHuH}t;}t[EMUHHHuNH51H X#H H;MuHHX[]1HHHuH6HuH"HH #H H;Mt&fUHAWAVSH(HuHHED~D}HG]܉]y HHt$Lw(MtD9uEt&I 觿Ht.1:H}111+)ILIyHuLHHH([A^A_]fDUHSHXH0"HHE^HG)ЃrHuHwHE]UĉUȅyHHlH_(HFH}Hu1H}HuH}Hu}EMUf.u&z$f.uzf.uHH"HHuHzHE]UĉUȅy HHtZH_(HtQHuH}t;}t[EMUHH覽HuNH5 '1H x"H H;MuHHX[]1HHHuHVHuH"HH 0"H H;MtFfUHAWAVSH(HuHZHED~D}HG]܉]y HHt$Lw(MtD9uEt&IǼHt.1:H}111K)ILI虼HuLHHH([A^A_]fDUHH0HuHHEFEHEH}؃uDHuqt/H5H}HU}t}HH Ht1H0]þ1H0]H"HH0]UHSH(HHztquHUHnHEEHFEEyHH/HHtIH~(Ht@xHZHu+Hc_H H=$H([]FH51HH([]H}111f.UHSH(HuHRHE؋FEHEu=H5IH}HUo}t6H謺Hu"{H([]H}о!1H([]f.fUHAWAVSH(HuH0HEDvDuHG]܉]y HHt H(HtD9u3I Ht!1H}111HH([A^A_]Mt3L ILHHHu跹LL蚹HHF"H뮐UHH0HuHʕHEFEHEH}؃uDHut/H5H}HU}t}H>;Ht1H0]þ1H0]H"HH0]UHSH(HHztquHUH/HEEHFEEyHH_HHtIH~(Ht@xH芸Hu+Hc菸H H=!$H([]vH51HH([]H}111f.UHSH(HuHҖHE؋FEHEu=H5yH}HU}t6HܷHu"諷H([]H}оQ1H([]f.fUHAWAVSH(HuHYHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HU}t0}t7LHHu9H}1H([A^A_]ILHٶHuHm"HUHAWAVSH(HuHHED~D}HG]ԉ]؅y 2HHt\Lw(MtSA)Au7H5H}HU}t0}t7LH4Hu9H}1H([A^A_]ILHHuH"HUHAVSH HuH|HEDvDuHG]]y THHt"H(HtD9uEt${Ht(1.H}111HSHuH"HHH [A^]UHAWAVSH(HuH`HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HUn}t0}t7LHo褴Hu9H}&1H([A^A_]ILHiHuH"HUHAWAVSH(HuHBHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5!H}HU}t0}t7LHijHu9H}F1H([A^A_]ILH艳HuH"HUHAWAVSHxHL"HHEHxH7HEDvDuHG]]yHHL(MA)AH5@<HxHU}IHxHuHEHE(E)EHULL_HËE;Eu(E;Eu E;EuE;EuE;EuE;Et$_HuHxHU;HuDHt\H5`HHhH "H H;Mt*MHx1H "H H;Mu%Hx[A^A_]Hn"HH "H H;MtfDUHAWAVSHHH"HHEHuHԕHEDvDuHG]]yHHL(MA)AH5:H}HU}IH}HuԺE܉EHEHEHULL8HËE;EuE;EuE;Et!°HuH}HUԾ衰HuAHtYH5ƩH&HΰH i"H H;Mt'JH}1H B"H H;Mu%HH[A^A_]H"HH "H H;Mt3f.DUHAWAVSHxH"HHEHxHaHEDvDuHG]]yqHHL(MA)AH58HxHU.}IHxHurHEHE(E)EHULLչHEH;EuHEH;Eu HEH;Et$HuHxHUuHu5H"HH "H H;Mt-HxR1H "H H;MuHx[A^A_]fUHAWAVAUATSHHuHHEFEHGMMyHH_HG(HELuE1L1lÍHcHLH]HcILEL3L}HcH8襽L8E1IHcILEH}L}HcHXeHXE1H]HcHIDH}#HHMЋE+EH}HuHUBLmȄH}HuHU%H}HuHU HEAŅLEH}}rJI9KH91HHLLHtf.4A4HHuH A LALLALL AL HI9uJH}E1HXH`H9t HtH8H@H9t HtHH H9t HtLH[A\A]A^A_]1DHpHHH‰уHs1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpH HuHt(HHD ADA H HuL9GHEȉDžV}rII9s}II9st1HHHHHtf.fA4A4HHuHfDA A ALALALALAL AL HH9uHpHHH‰уHs1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt*HHADA ADA H HuH9HxHEADžHMC}rHMJH9sqJH9sh1HHLLHtHM@44HHuHMHfTTTTT T HI9uDHpHHH‰׃Hs1HMdHH)1HMLLD L0D L0D@LPD@LPD`LpD`LpH HuHt&HHD D H HuL9H}HuHU}~B1f.fHM A; u HI9uHuH}1HUHMj}~A1@HM A; uHH9xu ЧHuH}HUHM#}~E1f.HMЋ ; u HI9u 腧HuH}HUHMطeHL="IHXH`H9 HHXH`H9tHt HH8H@H9tHt HHH H9t HtHڧ @UHAWAVSH(HuHHED~D}HG]܉]y 2HHt#H(HtD9uAEtXHt+12H}111ܵ!HLc-HuL2HHH([A^A_]f.DUHHHztuHH]H=$]H5PZ1]UHAWAVSHhH"HHEHuHkHED~D}HG]]y$HHLw(MA)H}AuDHuPHEHE(E)E}t)HuLHEH;Et-?蓴VIHuLHEH;EuHEH;Eu HEH;Et¤HuH}HU1)褤Ht1H "H H;Mu%Hh[A^A_]H"HH a"H H;MtwUHAWAVSH(HuHjHED~D}HG]ԉ]؅y ҳHHt_Lw(MtVA)Au:H5M-H}HU螳}t3}t:LHíHѣHuH5yH}HU蟮}t7HH۞Hu"HrH([]H}оP1H([]ÐUH]ÐUHAVSH= 1 HH"H=$H18IH uHUL[A^]DUHAWAVATSH=$H5$HH n$+H$L5$H=$H-Hb$HjH5LLH讝tH $u H=$诞H=)11'HL%"H=$H1A$8IH uHqMtH5LL@IuLMH=ǿ1HH=x$H1A$8IH uHMtH5LLIuLH=i1dHH=$H1A$8IH uH赝MtH5KLL脜IuL葝H= 1HH=$H1A$8IH uHWMtH5LL&IuL3H= $gH$[A\A^A_]f.DUH]fDUHSPHH5IH$H躛t H $tH[]H=$H[]鮜fDUHAVSH0HuH%QHEЋFEHEHEH}ȃuoHuxtqH]H=HsAt1H=nHZtH=UHGt HyLcHuL 腪1H0[A^]f.@UHAWAVSH(HuHPHED~D}HG]ԉ]؅yBHHLw(HEMA)AuhHuH}q}L}tlH=LbAtbH=lLItOH=TL6tH}111茡-HHݑHuHHxݑHHH [A^]DUHAWAVSH(HuHHED~D}HG]ԉ]؅y "HHt`Lw(MtWA)Au;H5&dH}HU}t4LH*HuH"HH}袠1H([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHt`Lw(MtWA)Au;H5fcH}HU.}t4LH]jHuH"HH}1H([A^A_]fUHAVSH HuHHEDvDuHG]]y 褟HHtHG(HtD9uHXPяHt1H}111U HSHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtsLw(MtjA)AuNHuH}otP}utTL1IA9FXtAFXILHu6H}1H([A^A_]ILŎHuHY"H@UHAVSH HuHHEDvDuHG]]y $HHtH(HtD9uEt!1NHt+12H}111ҝ!HHc#HuH(HHH [A^]UHAWAVSH(HuH`HED~D}HG]܉]y rHHt#H(HtD9uAEt蘍Ht+12H}111!HLcmHuLrHHH([A^A_]f.DUHAVSH HuH4HEDvDuHG]]y 贜HHt H(HtD9uEt"_X݌Ht*11H}111a H賌HuHc踌HHH [A^]UHAVSH HuHHEDvDuHG]]y HHt1H(Ht(D9u'H11(HuH"H1H}111蠛HH [A^]UHAVSH HuH߂HEDvDuHG]]y dHHt&H(HtD9uH臋Ht1H}111  H"HHH [A^]UHAVSH HuHՂHEDvDuHG]]y ĚHHt&H(HtD9uHHt1H}111k Hf"HHH [A^]UHAVSH HuHłHEDvDuHG]]y $HHt&H(HtD9uHGHt1H}111˙ H"HHH [A^]UHAWAVSH(HuHȂHEDvDuHG]܉]y 肙HHt-HG(Ht$D9u#Hc@XHw6H "L4螉Ht21H}111"HH([A^A_]L5lHuLILH襉HHu>LL!H뮐UHH=%$H5$HH 0e$uH$H=$2H$]ÐUH]fDUHSPHH=$H5Y$HGH H$uhH$H=$͈H5Hw$H]t H d$tH[]H=T$H[]QfUHAVSH0HuH=HEЋFEHEHEH}ȃuoHutqH]H=HAt1H=ZHtH=XBHt HLc觇HuL謇%1H0[A^]f.@UHAWAVSH(HuHl=HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=sLAtbH=YLtOH=GALtH}111謓-HHHuHHxHHH [A^]DUHAVSHH"HHE^HG)ЃRHuHDHE]UĉUȅyHHH_(HH}Huк!EEEEEE}HuH HuHCHE]UĉUȅy艒HHOH_(H H}HxҒH}Hu轒H}Hu訒}xMUEMUHHuHHuHBHE]UĉUȅy ͑HHtuH_(HtlH5Q H}HU袑}tRIH54 H}HU腑}t5}HLH贁HuH59B21H "H H;MHĀ[A^]1HHHuHEEf.EuzEf.EuzEf.Eu{)HuH}HU1l HfEYH HLH܀H7Hl"H*HHE讀H E觀UHAWAVSHHi"HHEH@H3CHHD~DPHGTXyHHLw(MA)H@AHuݏtH@HuďtfHEHE(E)E(E)`HEHpTtiHuHUL诠Ef.Ec 1H W"H H;MHĨ[A^A_]E1M+IHuHULEf.EuzEf.EuzEf.Eu{!~HuH@HU1;Ef.`u$z"Ef.huzEf.pu{$~HuH@HU~H H"HH Y"H H;MkUHAWAVSH(HuH^(HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H58H}HU莍}t0}t7LH՞}Hu9H}F1H([A^A_]ILH}HuH"HUHAVSH HuH(HEDvDuHG]]y HHt!H(HtD9uEt#H_P }Ht+12H}111萌!HH|HuHxHHH [A^]DUHAWAVSH(HuH~HED~D}HG]ԉ]؅y 2HHtmLw(MtdA)AuHHuH}}tJ}EtLANXf.u{AFXIL#|Hu6H}襋1H([A^A_]IL{HuH"Hf.UHAVSH0HuHh~HEDvDuHG]܉]y DHHt'H(HtD9uEt)GXEf{Ht-16H}111%HE9{HuE6{HHH0[A^]f.UHSHXH"HHE^HG)Ѓ`HuH~HE]UĉUȅydHHZH_(H4H}Hu谊H}Hu蛊 H}Hu膊}EMU[`f.u z[hf.uz[pf.uC`KhSpHHyHHuH}HE]UĉUȅy yHHtZH_(HtQHuH}茉t;}t[EMUHHxyHuNH5|1H J"H H;MuHHX[]1HHHuH(yHuH"HH "H H;Mt@UHAWAVSH(HuH|HED~D}HG]܉]y rHHt!Lw(MtD9uEt#I`xHt.1:H}111)ILIlxHuL芇HHH([A^A_]ÐUHH=$H5.$Hv|H 0ux$uxHf$H=_$BxHS$]ÐUH] fDUHSPHH=0$H5$H|H x$uDxH$H=$wH5{H$Hmwt H $tH[]H=$H[]axfUHAVSH0HuH,HEЋFEHEHEH}ȃuoHu(tqH]H=N{H#At1H=H tH=h1Ht H)LcvHuLv51H0[A^]f.@UHAWAVSH(HuH|,HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}!}L}tlH==zLAtbH=LtOH=W0LtH}111|-HHMmHuHHxMmRmHHH [A^]DUHAVSH`H"HHE^HG)ЃHuH,|HE]UĉUȅyi|HHH_(HH5H}HU6|}oIH5H}HU|}N}lHLH臐@lH(gHuH{HE]UĉUȅy{HHH_(HHuH}{HuH/{HE]UĉUȅyl{HHH_(HH}Hu{tH}Hu{tnH}Hu{t]HEHMHUHEHMHUHuH萏E>kHu*E;kH "H H;Mt"lH5wzz1H "H H;MuLH`[A^]1HJH HLHjHuHd"HH "H H;Mtf.fUHAVSHH{"HHE^HG)Ѓl$HuHh{HE]UUyyHHH_(HHuH}yH}HuкyExEEEEHuHUHEf.xuzEf.EuzEf.Eu{!iHuH}HUоyaiH7H"H*HuH^zHE]UUyxHHH_(HHuH}xHuHzHE]UUyxHHH_(HH}HuxH}HhxtlH}HpxtXHEHhHpHEHMHUHuLs8HL蜌ChHuLawH5Hyw1H "H H;MuHĐ[A^]1HBUHHHHGzu H=ʻ$]ԄH5zNw1]@UHAVSH HuHA|HEDvDuHG]]y $wHHt!H(HtD9uEt#H_0LgHt+12H}111v!HH!gHuHwHHH [A^]DUHAWAVSHH٦"HHED~HGD)ȃRHuH:'HED}MMyAvHH2Lw(M%H}=A:Hu:vEEEEEEIHuLEEf.EuzEf.EuzEf.Eu{eHuH}HU1)veHpEecHuH;&HED}MMyBuHHoH_(H&H}HhuH}HpsuH}Hx[u}hpx-EMUHHuHHuHr%HED}MMy ytHHtnH_(HteH5H}HUNt}tKIH5H}HU1t}t.}tqHLH跈ddHusH5$s1H 6"H H;MHĈ[A^A_]sվs1HH HLHcHuH"HHHEcHpEcc迦f.UHAWAVSHHy"HHEH@HC&HHD~DPHGTXyrHHvLw(MuH@BA?HurFH@Hur)HEHE(E)E(E)`HEHpIHuHULEf.EuzEf.EuzEf.Eu{!pbHuH@HU1rEf.`u$z"Ef.huzEf.pu{$bHuH@HUYraHuCH"HH ҡ"H H;Mt;wqZq E1M1H "H H;MuHĨ[A^A_]UHAWAVSH(HuHtHED~D}HG]ԉ]؅y qHHt\Lw(MtSA)Au7H50zH}HUp}t0}t7LH?aHu9H}p1H([A^A_]ILH`HuH]"HUHAWAVSHH"HHEH@HsHHD~DPHGTXy pHHthLw(Mt_A)Au@H`H@pt:TtQH`L<_HuSH@zo1H ş"H H;MuEHĨ[A^A_]IH`L_HuH:"HH "H H;Mt薢UHH=ճ$H5n$HxH 0_]$uH$H=$_H$]ÐUH]sfDUHSPHH=p$H5 $HxH P_$uHA$H=:$_H5wH'$H^t H $tH[]H=$H[]_fUHAVSH0HuHHEЋFEHEHEH}ȃuoHuhntqH]H=WwHcAt1H=0HJtH=H7t HilLc]HuL]um1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y2mHHLw(HEMA)AuhHuH}am}L}tlH=FvLRAtbH=/L9tOH=L&t}utBA9vptAvpILBHu6H}qR1H([A^A_]ILBHuHK"HfDUHAVSH HuH4pHEDvDuHG]]y RHHt H(HtD9uEt"_p=BHt*11H}111Q HBHuHcBHHH [A^]UHAVSH HuHpHEDvDuHG]]y dQHHt+H(Ht"D9u!Et-HAHt(1.H}111QHZAHuH"HHH [A^]f.DUHAVSH HuHpHEDvDuHG]]y PHHt(H(HtD9uEt*H1@Ht(1.H}111IPH@HuH1"HHH [A^]fUHSHXH`"HHE^HG)Ѓ`HuH%qHE]UĉUȅyOHHZH_(H4H}Hu PH}Hu P H}HuO}EMU[Xf.u z[`f.uz[hf.uCXK`ShHHd?HHuH:pHE]UĉUȅy NHHtZH_(HtQHuH}Nt;}t[EMUHH>HuNH5oiN1H ~"H H;MuHHX[]1HHHuH>HuH,~"HH r~"H H;Mt舁@UHAWAVSH(HuHoHED~D}HG]܉]y MHHt!Lw(MtD9uEt#IX >Ht.1:H}111M)IL I=HuLLHHH([A^A_]fUHAVSH HuHb|HEDvDuHG]]y $MHHt%H(HtD9uEt'nHH=Ht+1>H}111L-HH=HuHHx="=HHH [A^]ÐUHH=%$H5$H~oH 0%=$uH$H=$<H$]ÐUH]OfDUHSPHH=$H5Y$HoH <H$u(H$H=$<H5nHw$H<t H d$tH[]H=T$H[]=fUHAVSH0HuHHEЋFEHEHEH}ȃuoHuKtqH]H=VnH~At1H=oH~tH=H~t HILcg;HuLl;J1H0[A^]f.@UHAWAVSH(HuH,HED~D}HG]ԉ]؅yJHHLw(HEMA)AuhHuH}J}L}tlH=EmL}AtbH=^ L}tOH=L}tH}111A-HH=2HuHHx=2B2HHH [A^]DUHAVSH0^HG)ЃHuHX$HEȉ]ЉUԉU؅ypAHHH_(HH5uH}HU=A}IHuH}AEHLDX1HiHuH#HEȉ]ЉUԉU؅y @HHtZH_(HtQH5H}HU@}t7,"HHD0HuH}p"HH5W#`@1H0[A^]f.DUHAVSH HuHbiHEDvDuHG]]y $@HHtH(HtD9uCP0Ht1H}111? Ho"HHH [A^]UHAWAVSH8HuH?iHEDvDuHG]̉]Ѕy ?HHtyL(MtpA)AuTH5H}HU^?}tMIHuH}?t9ELLB/HuHo"HH}>1H8[A^A_]UHAWAVSH(HuH7iHED~D}HG]ԉ]؅y >HHtaLw(MtXA)Au}utBA9vhtAvhIL.Hu6H}A>1H([A^A_]IL.HuHn"HfDUHAVSH HuHiHEDvDuHG]]y =HHt H(HtD9uEt"_h .Ht*11H}111= H-HuHc-HHH [A^]UHAVSH HuHjHEDvDuHG]]y 4=HHt+H(Ht"D9u!Et-HR-Ht(1.H}111<H*-HuHl"HHH [A^]f.DUHAVSH HuHVkHEDvDuHG]]y t<HHt(H(HtD9uEt*H1,Ht(1.H}111<Hm,HuHl"HHH [A^]ÐUHH=$H5$HlH 0,$uH֋$H=ϊ$R,HÊ$]ÐUH]FHfDUHSPHH=$H59$HkH ,($u船Hq$H=j$+H5kHW$H}+t H D$tH[]H=4$H[]q,fUHAVSH0HuHHEЋFEHEHEH}ȃuoHu8;tqH]H=jH3nAt1H=HntH=xHnt H99Lc*HuL*E:1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y:HHLw(HEMA)AuhHuH}1:}L}tlH=iL"mAtbH=L mtOH=gLltH}1116-HH'HuHHx'"'HHH [A^]DUHAVSHHf"HHE^HG)ЃRHuH.HE]UĉUȅy66HHH_(HH}HuкA6EEEEEE}HuH_BHuHHE]UĉUȅy5HHOH_(H H}Hx5H}Hu5H}Hu5}xMUEMUHHuHHuHHE]UĉUȅy 4HHtuH_(HtlH5qH}HU4}tRIH5TH}HU4}t5}HLH'I$HuH5YR41H d"H H;MHĀ[A^]1HHHuHEEf.EuzEf.EuzEf.Eu{I$HuH}HU14+$HfE$$YH HLH#H7Hc"H*HHE#H E#fUHAWAVSHHc"HHEH@HSHHD~DPHGTXy3HHLw(MA)H@AHu2tH@Hu2tfHEHE(E)E(E)`HEHpTtiHuHUL?Ef.Ec,21H wb"H H;MHĨ[A^A_]E1M+IHuHULEf.EuzEf.EuzEf.Eu{!"HuH@HU1[2Ef.`u$z"Ef.huzEf.pu{$!HuH@HU2!H H3a"HH ya"H H;MdUHAWAVSH(HuH9iHED~D}HG]ԉ]؅y 0HHt\Lw(MtSA)Au7H5H}HU0}t0}t7LHE= Hu9H}f01H([A^A_]ILH HuH=`"HUHAVSH HuHhHEDvDuHG]]y 0HHt!H(HtD9uEt#H_P, Ht+12H}111/!HH HuH0HHH [A^]DUHAWAVSH(HuH!HED~D}HG]ԉ]؅y R/HHtmLw(MtdA)AuHHuH}/tJ}EtLANXf.u{AFXILCHu6H}.1H([A^A_]IL HuH^"Hf.UHAVSH0HuH!HEDvDuHG]܉]y d.HHt'H(HtD9uEt)GXEHt-16H}111 .%HEYHuEVHHH0[A^]f.UHSHXH^"HHE^HG)Ѓ`HuH$!HE]UĉUȅy-HHZH_(H4H}Hu-H}Hu- H}Hu-}EMU[`f.u z[hf.uz[pf.uC`KhSpHHHHuH9 HE]UĉUȅy ,HHtZH_(HtQHuH},t;}t[EMUHHHuNH5,1H j\"H H;MuHHX[]1HHHuHHHuH["HH "\"H H;Mt8_@UHAWAVSH(HuHHED~D}HG]܉]y +HHt!Lw(MtD9uEt#I`Ht.1:H}111>+)ILIHuL*HHH([A^A_]ÐUHH=u}$H5$H(eH 0}$uHF~$H=?}$bH3}$]ÐUH]NfDUHSPHH=}$H5~$HdH 0}$u蘨H}$H=|$H5dH|$Ht H |$tH[]H=|$H[]fUHAVSH0HuHHEЋFEHEHEH}ȃuoHuH*tqH]H=dHC]At1H=H*]tH=H]t HI(LcHuLU)1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y)HHLw(HEMA)AuhHuH}A)}L}tlH=bL2\AtbH=L\tOH=wL\t)ILI HuLHHH([A^A_]fUHSHHH@M"HHE^HG)ЃHuH_HEȉ]ЉUԉU؅yHHH_(HHuH}HuH}}EMShf.uz Spf.u{vChKpHH^HuH^HEȉ]ЉUԉU؅y HHtYH_(HtPHuH}t:EMHH HuHK"HH5z^1H K"H H;MuHH[]NUHAWAVSH(HuH^HED~D}HG]܉]y BHHt!Lw(MtD9uEt#Ihj Ht.1:H}111)ILI< HuLZHHH([A^A_]fUHAVSH HuHIHEDvDuHG]]y HHt%H(HtD9uEt'=H Ht+1>H}111,-HH} HuHHx}  HHH [A^]ÐUHH=o$H5^q$HF^H 0 Mp$u Hp$H=o$R Ho$]ÐUH]:fDUHSPHH=`o$H5p$H]H o$ul H1p$H=*o$ H5]Ho$H} t H o$tH[]H=n$H[]q fUHAVSH0HuHHEЋFEHEHEH}ȃu\Hu8t^H]H=]H3LAtH=HLt HLLcHuLX1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y"HHLw(HEMA)AuQHuH}Qt|}L}tYH=1\LFKAtOH=L-KtHHH([A^A_]f.DUHAWAVSH(HuHaHEDvDuHG]܉]y BHHtL(MtD9uA_0oHt19H}111 (IGPILDH5vLH~HHH([A^A_]f.DUHAVSH HuH9HEDvDuHG]]y HHtHG(HtD9uHHt1"H}1112 1H@HHH [A^]UHAWAVSHxHL="HHEHpH9HxDvDuHG]]y HHL(MA)AHuHp EEEEIH@PE@XEEE@`EHue1Ef.E1Ef.E1Ef.EHAH<_H 6<"H H;Mt-L?Hp 1H <"H H;MuHx[A^A_]DUHAWAVSH(HuH`HEDvDuHG]ԉ]؅y r HHtYL(MtPA)Au4HuH} t6HcEIHHuH H} 1H([A^A_]UHAWAVSHHH,;"HHEHuHaHED~D}HG]]y HHLw(MA)AufHuH} tqEfA.F8vXANPf.rLEfA.F@v?ANXf.r3EfA.FHv&AN`1f.H}  1\Ht1H >:"H H;Mu#HH[A^A_]HDH :"H H;Mt1=f.UHAWAVSHHH9"HHEHuH`HED~D}HG]]yt HHLw(MA)AHuH}r EfA.Fhr8Af.r)EfA.FprAf.r EfA.FxsY14Hu0H9H 9"H H;Mt*&<H}1H 8"H H;MuHH[A^A_]A1f.Hu@UHAWAVAUATSHH8"HHEHuH_HEFEHGMMyHHFL(H}ACD-HcH@L@1EIcM$LDME+EH54H}HU}HH}HutoH}Hxt[H}LDtHH}H|t4DHEEAsn1HUJH}1H@HHH9t Ht:H+7"HH;EHHĘ[A\A]A^A_]E1HUII9sII9s1ЃHpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHUH9tXHHHHtI4I4HHuHHUr/I I ILILILILILILHH9uу}xD|tHULHMg&HULHMS&AE~51I I; u HH9EuuHuH}LDWHIcXHH@HHH968HH@HHH9t Ht7H  fDUHAWAVSHXH4"HHEHuHD`HED~D}HG]]y THHtLw(MtvA)AuZHuH}^tWH5xHH}HU }t=HuLH%E=HuE:H}1H 4"H H;Mu HX[A^A_] 7UHAVSHH3"HHE^HG)ЃHuH`HE]UUy?HHH_(HHuH}JH5`GH}HU}IHuH}bHuЋMHL#EHnEaHuH_HE]UUyHHPH_(H%H}Huк H}HurH5FH}HU}IH}HuEEEhEpDEHuHUHL"xEf.Eu$z"Ef.huzEf.pu{!HuH}HUHuxH5^%1H v1"H H;MuHĐ[A^]1Hs4f.DUHAWAVSH(HuH`HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5+H}HU}t4LH!HuH^0"HH}B1H([A^A_]fUHAWAVAUATSHhHuH aHEFEHGMĉMȅyHHSL(H}11wAC6HcHxLxEIcM,LDMGE+EăH}LDH5 H}HUo}DEArI I9ILI91HHHHHtfDI HHuHcHHH [A^]@UHAVSH HuH!jHEDvDuHG]]y HHt+H(Ht"D9u!Et-HHt(1.H}111HHuHn#"HHH [A^]f.DUHAVSH HuHiHEDvDuHG]]y $HHt(H(HtD9uEt*H1EHt(1.H}111HHuH""HHH [A^]fUHAVSH HuHiHEDvDuHG]]y tHHt$H(HtD9uEt&HHt+12H}111!HHnHuHHHH [A^]fUHAVSH HuHHEDvDuHG]]y HHt&H(HtD9uHEt%0Ht%1+H}111k HuHV!"HHH [A^]UHAVSH HuHrHEDvDuHG]]y HHt"H(HtD9uEt$;Ht(1.H}111H0HuH "HHH [A^]UHAWAVAUATSHXDvHGD)^HuHkHEDuȉ]̉]ЅyJHHL(H}E11AC6HcH}%LmEIcI\IDM E+ẼFH}LDEEiArKDH9JI91D)HHLHtItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uHuHHEDu]]y HHt=H(Ht4D9uOEtgHH_XHpHuaH5E1H}}H}E111hE19HhHHuHtH5H3HI^L%"I$NDHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9}t LLoILLpE~<1DADf.u z HI9uaHuH}1LDFHt,E1H}HEH9t HtLHX[A\A]A^A_]L%"I$H}HEH9uHH}HEH9t HtH UHAVSH HuHHEDvDuHG]]y DHHtH(HtD9unHt1H}111 Hc^HHH [A^]f.UHAWAVSHHH "HHEHuHeHED~D}HG]]y HHt\Lw(MtSA)Au7HuH}t4}tKHuLLHHuMH}1H c"H H;Mu@HH[A^A_]IHuLHGHuHRH #"H H;Mt9DUHAWAVSH(HuHnHED~D}HG]ԉ]؅y HHtpLw(MtgA)AuKHuH}tMH5 oH}HUM}t3}ut7LH-Hu9H}1H([A^A_]ILH8EHuH"H@UHAVSH HuHkHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111OH(HuH7"HHH [A^]UHAWAVAUATSHHU"HHEЋ^HGDD)ЍHXH7Hc HHPHOHX`dhEyHHH_(H HuHPdvHuHHuHͶHE]UUEy7HHL(H}AC6HcHPLP1EIcM,LDME+EPH}Hu^H}LDGDEArII9IDI91)HHHHtI4ItHHuHaI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHPHZHX`dhEyHHH_(HHPHuHPHuHPHudEMUYH XHuHHE]UUEy HHL(H}AC6HcHPLP1EIcM,LDM^E+E:H}Hu8H}Hu#H}HH H}LDDEArII9IDI91)HHHHtI4ItHHuH|I ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH5j1GH}YH}D1HPHXH9t Ht[Hr"HH;EDHHĘ[A\A]A^A_]E11HbtE1HHuHH HHHH=H!Hx؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9q}tHuLL IHuLLIE~;1AfA.Du z HH9uHuH}LD HLHHPHXH9؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9V}EMHt LLILLIE~;1AfA.Du z HH9ueHuH}LDGHLN@HHPHXH9t HtH Wf.fUHAWAVSHXH"HHEHuHoHED~D}HG]]yDHHLw(MtmA)H}AuQHutSH}Hu9t=H}Hudt,}EtLHuHULN1H "H H;MuoHX[A^A_]E1MjIHuHULPHHuEH}HuHH "H H;MtUHAWAVSHXH\"HHEHuHaHED~D}HG]]yHHLw(MA)H}Au}Hu'tH}HutiH}HutXEHuHULHHuEH} HuH1H e"H H;MuHX[A^A_]E1M>bf.@UHAWAVSHXH"HHEHuHHED~D}HG]]yHHLw(MA)AugHuH}tiHuH}tSH5޹H}HUA}t9}EtKHuLHnHuMH}1H ; "H H;MuBHX[A^A_]IHuLH`HuH "HH "H H;Mtf.UHAWAVSHXH "HHEHuHcHED~D}HG]]yTHHLw(MA)AukHuH}tmHuH}EtWH5H}HU}t=HuELH$HuH "HH}1H "H H;Mu HX[A^A_]f.@UHAWAVSHXH "HHEHuHHED~D}HG]]y4HHLw(MA)AueHuH}tgHuH}%tQH5nH}HU}t7}utKHULHHuMH}1H "H H;MuBHX[A^A_]IHULHXHuHE "HH "H H;Mt f.UHAVSHpH^ "HHE^HG)Ѓ$HuHHE]UUyHHH_(HH52H}HU}IHuH}}HUHLAHuHHE]UUy ?HHtvH_(HtmH5H}HU}tSIHuH}5t:HuH}t)}HMtOHUHLQH5f1H "H H;MuUHp[A^]HHUHLHHUHLHuHcH "H H;Mt UHSHXH"HHE^HG)ЃHuH/fHE]UĉUȅyHHH_(HHuH}}HuHQHHHuHeHE]UĉUȅytHHH_(HtmH}Hut\H}HutKH}Hut:}EMUtjHHSHulH5e1H %"H H;MudHX[]1HoHHuHHHuHHHHuHH "H H;Mt UHAWAVSHXH"HHEHuH2HED~D}HG]]y$HHLw(MA)AHuH}"HuH}ytr}HuHULHuHUH}qHu0HcH "H H;Mt*H}I1H "H H;MuHX[A^A_]IHuHULuHurf.UHAWAVSHXH<"HHEHuH`,HED~D}HG]]y HHtnLw(MteA)AuIHuH}?tKHuH}t5}HutHHULHuJH}61H "H H;Mu?HX[A^A_]IHULhHuH"HH B"H H;MtX@UHAWAVSHHH"HHEHuH~/HED~D}HG]]y HHt\Lw(MtSA)Au7HuH}t4}tKHuLHHuMH}(1H s"H H;Mu@HH[A^A_]IHuLHWHuHbH 3"H H;MtIDUHAWAVSHXH "HHEHuHhHED~D}HG]]yHHLw(MA)H}AuyHutvH}HuteH}HutTMHuHUL'nHuHUH}RHuH"H1H "H H;MuHX[A^A_]E1MBfUHSPHH=84HtZH=:KHtGH=Ht4H=ѭHt!H=9|HtHH[]H[]ÐUHH=E1$H52$HJ11$uGH2$H=1$wH1$]fDUHSPHH=0$H52$H_J1U}1$u}GH1$H=0$"H50JH0$Ht H 0$tH[]H=0$H[]f.@UHAVSH0HuHvHEЋFEHEHEH}ȃHudH]H=IH[AtDH=fHBt1H=%H/tH=zHt HNLcܿHuLZ1H0[A^]UHAWAVSH(HuHuHED~D}HG]ԉ]؅y"HHLw(HEMA)Au{HuH}Q}L}tH={HLBAtuH=ML)tbH= LtOH=tyLtLw(M=H}AHu7H}Hu"H}Hu EMUILkHuHVHED}MMyTHHLw(MxSAuiHuH}UttHuILHOHuWHZOH5V=H}2!H} E1M1H !H H;Mu HX[A^A_]UHAWAVSHXH!HHEHuHBHED~D}HGEEy4HHLw(MAHuH}-HuH}twIHuHULHuHUH}Hu;HcH !H H;Mt5H}pH}O1H !H H;MuHX[A^A_]fDUHAWAVSHXHl!HHEHuHHED~D}HGEEyHHLw(MxjAuoHuH}ftqHuH}t[HUHuILݵHu=Hq!HH !H H;Mt5H}XH}71H !H H;MuHX[A^A_]f.@UHAWAVSHHHL!HHEHuH HED~D}HGEEyHHLw(MtxxVAu[HuH}tXHuILHӴHu;H޴H !H H;Mt5H}PH}/1H z!H H;MuHH[A^A_]ÐUHH=E'$H5($H\H 0襴'$uH($H='$rH'$]ÐUH]fDUHSPHH=&$H5y($HH @h'$u茴H'$H=&$ H5íH&$H蝳t H &$tH[]H=t&$H[]鑴fUHAVSH0HuHiHEЋFEHEHEH}ȃu\HuXt^H]H=4HSAtH=mH:t HlLcHuLx1H0[A^]ÐUHAWAVSH(HuHhHED~D}HG]ԉ]؅yBHHLw(HEMA)AuQHuH}qt|}L}tYH=GLfAtOH=lLMt!HH}"1H([A^A_]fUHAVSH HuHHEDvDuHG]]y HHt$H(HtD9uEt&H Ht+12H}111荤!H(HޔHuHuHHH [A^]fUHAVSH HuHHEDvDuHG]]y 4HHt$H(HtD9uEt&HYHt+12H}111ݣ!H0H.HuHŤHHH [A^]fUHAWAVSH(HuHcHED~D}HG]ԉ]؅y 肣HHt`Lw(MtWA)Au;H5H}HUN}t4LH芓HuH!HH}1H([A^A_]fUHAVSH HuHcHEDvDuHG]]y ĢHHt$H(HtD9uEt&HHt+12H}111m!H8H辒HuHUHHH [A^]fUHAWAVSH(HuHcHED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}otD}utHA9tAIL Hu6H}苡1H([A^A_]IL@ёHuHe!HUHAVSH HuHcHEDvDuHG]]y 4HHt#H(HtD9uEt%ZHt*11H}111ޠ HH0HuHc5HHH [A^]@UHAVSH HuHcHEDvDuHG]]y 脠HHt#H(HtD9uEt%誐Ht*11H}111. HP耐HuHc腐HHH [A^]@UHAWAVSH(HuHjcHED~D}HG]ԉ]؅y ҟHHtgLw(Mt^A)AuBHuH}/tD}utHA9tAILɏHu6H}K1H([A^A_]ILX葏HuH%!HUHAVSH HuHGcHEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111螞 H`HuHcHHH [A^]@UHAVSH HuHMcHEDvDuHG]]y DHHt+H(Ht"D9u!Et-HXbHt(1.H}111Hh:HuH!HHH [A^]f.DUHAVSH HuH:cHEDvDuHG]]y 脝HHt(H(HtD9uEt*H1X襍Ht(1.H}111)Hp}HuH!HHH [A^]fUHAWAVSH(HuH8cHED~D}HG]ԉ]؅y ҜHHtyLw(MtpA)AuTHuH}/tV}utZL1IA9tAIL跌Hu6H}91H([A^A_]ILxHuH!Hf.@UHAVSH HuHcHEDvDuHG]]y ԛHHtH(HtD9uEt!1Ht+12H}111肛!HHcӋHuH؋HHH [A^]UHAWAVSH(HuHdHED~D}HG]܉]y "HHt#H(HtD9uAEtHHt+12H}111̚!HLcHuL"HHH([A^A_]f.DUHAVSH HuHeHEDvDuHG]]y dHHt#H(HtD9uEt%芊Ht*11H}111 H`HuHceHHH [A^]@UHAVSH HuHfHEDvDuHG]]y 贙HHt1H(Ht(D9u'H11x؉HuHl!H1H}111PHH [A^]UHAVSH HuHgHEDvDuHG]]y HHt&H(HtD9uHx7Ht1H}111軘 H!HHH [A^]UHAWAVSH(HuHhHEDvDuHG]܉]y rHHt H(HtD9uI蛈Ht!1H}111HH([A^A_]Mt3LILH讈HHuGLL*HH!H뮐UHAWAVSH(HuHiHED~D}HG]ԉ]؅y 袗HHtsLw(MtjA)AuNHuH}tP}EtRAf.u{AIL荇Hu6H}1H([A^A_]ILUHuH!H@UHAVSH0HuHiHEDvDuHG]܉]y 贖HHt*H(Ht!D9u Et,EӆHt-16H}111W%HE覆HuE裆HHH0[A^]UHAVSH0HuHiHEDvDuHG]܉]y HHt*H(Ht!D9u Et,EHt-16H}111藕%HEHuEHHH0[A^]UHAWAVSH(HuHiHED~D}HG]ԉ]؅y 2HHtgLw(Mt^A)AuBHuH}菕tD}utHA9tAIL)Hu6H}諔1H([A^A_]ILHuH!HUHAVSH HuHjHEDvDuHG]]y THHt#H(HtD9uEt%zHt*11H}111 HPHuHcUHHH [A^]@UHAWAVSH(HuHjHED~D}HG]ԉ]؅y 袓HHtgLw(Mt^A)AuBHuH}tD}utHA9tAIL虃Hu6H}1H([A^A_]ILaHuH!HUHAVSH HuHjHEDvDuHG]]y ĒHHt#H(HtD9uEt%Ht*11H}111n HHuHcłHHH [A^]@UHAVSH HuHjHEDvDuHG]]y HHt+H(Ht"D9u!Et-H2Ht(1.H}111趑H HuH!HHH [A^]f.DUHAVSH HuHjHEDvDuHG]]y THHt(H(HtD9uEt*H1uHt(1.H}111HMHuH!HHH [A^]fUHAVSH HuHjHEDvDuHG]]y 褐HHt$H(HtD9uEt&HɀHt+12H}111M!HH螀HuH5HHH [A^]fUHAVSH HuH'kHEDvDuHG]]y HHt"H(HtD9uEt$|Ht(1.H}111蟏HHuH!HHH [A^]UHAVSH HuHjHEDvDuHG]]yDHHH(HD9uEt%貶H`Hul'H}111[HH7HuCHΏHt6HHzt)HtHH1Q@H߾]1HH [A^]ÐUHSPHH=BGHtZH=jHtGH=jHt4H=Ht!H=9HtHH[]ԌH[]ÐUHH=e#H5#H^H 0~#u~H6#H=/#R~H##]ÐUH]fDUHSPHH=#H5#Hz^H ~#ul~H#H=#}H5F^H#H}}t H #tH[]H=#H[]q~fUHAVSH0HuH2HEЋFEHEHEH}ȃu\Hu8t^H]H=]H3AtH=7Ht HLLc|HuL|X1H0[A^]ÐUHAWAVSH(HuH2HED~D}HG]ԉ]؅y"HHLw(HEMA)AuQHuH}Qt|}L}tYH=\LFAtOH=6L-to H_HuHc_HHH [A^]@UHAVSH HuH\HEDvDuHG]]y nHHt#H(HtD9uEt% _Ht*11H}111n H^HuHc^HHH [A^]@UHAWAVSH(HuHQ]HED~D}HG]ԉ]؅y 2nHHtgLw(Mt^A)AuBHuH}ntD}utHA9tAIL)^Hu6H}m1H([A^A_]IL]HuH!HUHAWAVSH(HuH]HED~D}HG]ԉ]؅y RmHHtgLw(Mt^A)AuBHuH}mtD}utHA9tAILI]Hu6H}l1H([A^A_]IL]HuH!HUHAWAVSH(HuH}^HEDvDuHG]ԉ]؅yrlHHL(MtwA)Au[H5A=H}HU:l}tTIH5$=H}HUl}t7LLH V\HuH!HH}k1H([A^A_]DUHAVSH HuHWHEDvDuHG]]y kHHtH(HtD9u蛚[Ht1H}111Dk H?!HHH [A^]UHAVSH HuH]HEDvDuHG]]y kHHt$H(HtD9uEt&H)[Ht+12H}111j!HHZHuHkHHH [A^]fUHAWAVSH(HuH]HED~D}HG]ԉ]؅y RjHHt`Lw(MtWA)Au;H5%;H}HUj}t4LH}ZZHuH!HH}i1H([A^A_]fUHAVSH HuHt]HEDvDuHG]]y iHHt$H(HtD9uEt&HYHt+12H}111=i!HHYHuH%jHHH [A^]fUHAWAVSH(HuH=]HED~D}HG]ԉ]؅y hHHt`Lw(MtWA)Au;H59H}HUh}t4LHXHuH~!HH}bh1H([A^A_]fUHAVSH HuH\HEDvDuHG]]y $hHHt$H(HtD9uEt&HIXHt+12H}111g!HHXHuHhHHH [A^]fUHAWAVSH(HuH\HED~D}HG]ԉ]؅y rgHHt`Lw(MtWA)Au;H5E8H}HU>g}t4LH藖zWHuH!HH}f1H([A^A_]fUHAWAVSHXHuHL>HED~D}HG]ԉ]؅yfHHLw(MA)H}AHufH}HufH}HufH}HufH}HuftpH}Huft_H}HuftNEMU]emuL!VHuHc&Ve1HX[A^A_]E1MUHAWAVSHHHuH?HED~D}HG]ԉ]؅yReHHLw(MA)H}AHueH}Hu|etwH}HuketfH}HuZetUH}Hu[etDEMU]uLTHuHcTwd1HH[A^A_]E1M=UHAWAVSH(HuH\HEDvDuHG]ԉ]؅y 2dHHtwL(MtnA)AuRH5gH}HUc}tKIHuH}rdt7ULL!THuHc&TH}c1H([A^A_]fUHAWAVAUATSHhHuH?HEFEHGMĉMȅy`cHHL(EH}bAC6HcHp1cLp1EIcMdLDME+EărH}bH5kH}HUb}HH}Hu4cgEM9}H}HucHEM9}H}LDb'HDEArIDI9II91)HHHHt f.DI|IHXHu]&HXHu]HXHu\EMUuH觋ELHELHHuHrHE]UĉUȅy\HHL(H}[AC$HcHX[LX1EIcM,LDM[E+Eă7H}Hu\5H}Hu[ H}Hu[ H}LD[H}Hu[DEArII9 IDI91)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u:H5ͷ[Z12H}JZ1HXH`H9t HtaHHĈ[A\A]A^A_]1HTE1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9;}EMUUtLLvELLdEE~;1AfA.Du z HH9u8IHuH}LD{YIHcEIHHXH`H9TYHHXH`H9t Ht蘋HI f.fUHAWAVSHHHuHHED~D}HG]܉]y"XHHLw(Mt}A)H}AuaHuiXtcH}HuXXtRH}HuGXtAEMULEGHuEGxW1HH[A^A_]E1MjUHAWAVSH(HuHYHED~D}HG]ԉ]؅y 2WHHtWLw(MtNA)Au2HuH}Wt4uLrCGHuH׆!HH}V1H([A^A_]fUHAWAVSH(HuHYHED~D}HG]ԉ]؅y VHHtWLw(MtNA)Au2HuH}Vt4uLzFHuH'!HH} V1H([A^A_]ÐUHH=#H5n#HYH 0F]#u͕H#H=#bFH#]ÐUH]钆fDUHSPHH=p#H5 #H*YH 0F#uhHA#H=:#EH5XH'#HEt H #tH[]H=#H[]FfUHAVSH0HuHHEЋFEHEHEH}ȃuoHuHUtqH]H=gXHCAt1H= 1H*tH=Ht HISLcDHuLDUT1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yTHHLw(HEMA)AuhHuH}AT}L}tlH=VWL2AtbH=0LtOH=wLtHuHc>HHH [A^]@UHAWAVSH(HuHiZHED~D}HG]ԉ]؅y 2NHHtgLw(Mt^A)AuBHuH}NtD}utHA9tAIL)>Hu6H}M1H([A^A_]ILh=HuH}!HUHAVSH HuHZHEDvDuHG]]y TMHHt#H(HtD9uEt%z=Ht*11H}111L HpP=HuHcU=HHH [A^]@UHAVSH HuHYHEDvDuHG]]y LHHt#H(HtD9uEt%<Ht*11H}111NL Hx<HuHc<HHH [A^]@UHAWAVSH(HuHdZHED~D}HG]ԉ]؅y KHHtgLw(Mt^A)AuBHuH}OLtD}utHA9tAIL;Hu6H}kK1H([A^A_]IL;HuHE{!HUHAVSH HuHYHEDvDuHG]]y KHHt#H(HtD9uEt%:;Ht*11H}111J H;HuHc;HHH [A^]@UHAWAVSH(HuHlZHED~D}HG]ԉ]؅y bJHHtgLw(Mt^A)AuBHuH}JtD}utHA9tAILY:Hu6H}I1H([A^A_]IL!:HuHy!HUHAVSH0HuHYHEDvDuHG]܉]y IHHt*H(Ht!D9u Et,(E9Ht-16H}111'I%HEv9HuEs9HHH0[A^]UHAWAVSH(HuHpZHED~D}HG]ԉ]؅y HHHtsLw(MtjA)AuNHuH} ItP}EtRA(f.u{A(IL8Hu6H}/H1H([A^A_]ILu8HuH x!H@UHAVSH HuHHEDvDuHG]]y GHHt$H(HtD9uEt&H7Ht+12H}111}G!HH7HuHeHHHH [A^]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y "GHHt`Lw(MtWA)Au;H5: H}HUF}t4LHw*7HuHv!HH}F1H([A^A_]fUHAVSH HuHZHEDvDuHG]]y dFHHtH(HtD9uav6Ht1H}111F Hv!HHH [A^]UHAVSH HuHYHEDvDuHG]]y EHHtH(HtD9uu6Ht1H}111E Hu!HHH [A^]UHAVSH HuHYHEDvDuHG]]y DEHHtH(HtD9uMup5Ht1H}111D Ht!HHH [A^]UHAVSH HuHYHEDvDuHG]]y DHHtH(HtD9ut4Ht1H}111dD H_t!HHH [A^]UHAVSH HuHYHEDvDuHG]]y $DHHtH(HtD9uQtP4Ht1H}111C Hs!HHH [A^]UHAVSH HuHYHEDvDuHG]]y CHHtH(HtD9us3Ht1H}111DC H?s!HHH [A^]UHAVSH HuHYHEDvDuHG]]y CHHtH(HtD9u%s03Ht1H}111B Hr!HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y rBHHt\Lw(MtSA)Au7H5JH}HU>B}t0}t7LHqt2Hu9H}A1H([A^A_]ILH92HuHq!HUHAWAVSH(HuHHED~D}HG]ԉ]؅y AHHt\Lw(MtSA)Au7H5jH}HU^A}t0}t7LHp1Hu9H}A1H([A^A_]ILHY1HuHp!HUHHHHGzu H=#]$NH5 [@1]@UHAVSH HuH[HEDvDuHG]]y t@HHt"H(HtD9uEt$~p0Ht(1.H}111@Hs0HuHp!HHH [A^]UHAVSH HuHp[HEDvDuHG]]y ?HHtH(HtD9u p/Ht1H}111r? Hc/HHH [A^]f.UHAVSH0DvHGD)t]HuHHEDu؉]܉]y?HHH_(HHuH}r?ttuH?HuHHEDu؉]܉]y >HHtBH(Ht9D9uBEtN1&nH.HuHy?HH5fX>1HH0[A^]H}111A>HH.Huf.UHAVSH HuHb[HEDvDuHG]]y =HHt$H(HtD9uEt&H.Ht+12H}111=!HH-HuH>HHH [A^]fUHAWAVSH(HuHA[HED~D}HG]ԉ]؅y B=HHt`Lw(MtWA)Au;H5H}HU=}t4LHlH-HuHcM-H}<1H([A^A_]fUHAWAVAUATSHXHuH$HEFEHGM̉MЅy<HHYL(H}E11;AC6HcH}[<LmEIcI\IDMQE+ẼH}LDK<EEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H};E1H}HEH9KPE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]LL&kE~<1DADf.u z HI9uQ*HuH}1LD:6*Ht,E1H}HEH9t HtlLHX[A\A]A^A_]L%i!I$H}HEH9uHH}HEH9t HtlH* UHAWAVAUATSHXHuHXHEFEHGM̉MЅy09HHYL(H}E118AC6HcH} 9LmEIcI\IDMQE+ẼH}LD8EEArKDH9JI91D)HHLHtfDItH4HHuHnDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u H}7E1H}HEH9KPE1DHpHHH‰уH s1oHH)1@ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt8HHf.fADALfD H HuL9]LLfE~<1DADf.u z HI9u'HuH}1LDG7&Ht,E1H}HEH9t HtiLHX[A\A]A^A_]L%Nf!I$H}HEH9uHH}HEH9t HtSiH' UHAVSH HuH HEDvDuHG]]y 5HHt#H(HtD9uEt% &Ht*11H}1115 H%HuHc%HHH [A^]@UHAWAVSHHe!HHEHXH H`D~DhHGlpy5HH9Lw(M A)HXAH|]5HXHu4(E(M(U)U)M)E|HUL~dEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$}$HuHXHU4Y$HuHc!H31H d!H H;MuHĘ[A^A_]E1MgfDUHAWAVSHHc!HHEHXH H`D~DhHGlpyR3HH9Lw(M A)HXAH|3HXHu23(E(M(U)U)M)E|HUL0cEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$"HuHXHU2"HuH-b!H21H `b!H H;MuHĘ[A^A_]E1MZefDUHAVSH HuHHEDvDuHG]]y 1HHtH(HtD9ub!Ht1H}111d1 H_a!HHH [A^]UHAVSH HuHTHEDvDuHG]]y $1HHtH(HtD9uaP!Ht1H}1110 H`!HHH [A^]UHAWAVSH(HuHSHED~D}HG]ԉ]؅y 0HHtWLw(MtNA)Au2HuH}0t4uL_ HuH7`!HH}01H([A^A_]fUHAWAVAUATSHHHHDrHGD)[HUH fSHMDuȉ]̉]ЅyHH/HHL~(H}11,/AC6HcH}/LeEIcM,LDMnE+ẼJH}LD/FH}Hu/1DE5ArII9VIDI9H1HHHHHtf.A4AtHHuHA ALALALALALAL AL HH9uHUH RHMDuȉ]̉]ЅyHHl.HHtOH~(HtFD9us3^Hu2H,^!HgH=#HH[A\A]A^A_]};H5Q-1=H}-1H}HEH9tHtaH}111-HHH[A\A]A^A_]E1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADA ADALH HuH9ULL\E~21A A;Lu HH9u HuH}1LDc-HH\!HH}HEH9HH}HEH9t Ht_H UHAWAVSH(HuHSHED~D}HG]ԉ]؅y ,HHtgLw(Mt^A)AuBHuH}o,tD}utHA9tAIL Hu6H}+1H([A^A_]ILHuHe[!HUHAVSH HuHSHEDvDuHG]]y 4+HHt#H(HtD9uEt%ZHt*11H}111* H0HuHc5HHH [A^]@UHAVSH HuH?THEDvDuHG]]y *HHt+H(Ht"D9u!Et-HHt(1.H}111&*HzHuHZ!HHH [A^]f.DUHAVSH HuHTHEDvDuHG]]y )HHt(H(HtD9uEt*H1Ht(1.H}111i)HHuHQY!HHH [A^]fUHAVSH HuHzUHEDvDuHG]]y )HHtH(HtD9uX@Ht1H}111( HX!HHH [A^]UHAWAVSH(HuHRUHED~D}HG]ԉ]؅y (HHtXLw(MtOA)Au3HuH}(t5uLWHHuH')H} (1H([A^A_]ÐUHAWAVSH(HuH[UHED~D}HG]ԉ]؅y 'HHtXLw(MtOA)Au3HuH}/(t5uLWHHuHw(H}Z'1H([A^A_]ÐUHAWAVSH(HHJHG)ǃHUH=VH}ȉMЉEԉE؅yHH'HHH^(HH5H}HU&}IH5KH}HU&}tgIH5.H}HU&}tJHLLH2VHHu,H$H=N#H([A^A_]3H5U)&1H([A^A_]fDUHSH(HHJHG)ǃtyHUH=5[H}؉MEEyHH%HHt_H^(HtVHuH}^&tEHuHBVHu-HcH([]H=֧#H([]2H5ZU%1H([]fDUHAVSH HuH\HEDvDuHG]]y $%HHt H(HtD9uUHMHt1H}111$HH [A^]HtH5SH%H[HHT!Hf.fUHAWAVSH8HuHT]HED~D}HG]܉]yb$HHLw(MtxA)H}Au\Hu$t^H}Hu$tMH}Hu$t<EMULT?HuHcD#1H8[A^A_]E1MofDUHAVSH HuHHEDvDuHG]]y t#HHt"H(HtD9uEt$RHt(1.H}111#H(sHuHS!HHH [A^]UHAWAVSHXH,S!HHEHuHQ]HED~D}HG]]y "HHtzLw(MtqA)AuUHuH}"tRH5=H}HUj"}t8HuLH'SHuHcH}"1H eR!H H;Mu HX[A^A_]pUf.fUHAWAVSHXH,R!HHEHuH^HEDvDuHG]]y!HHL(MA)AuuH5KH}HUx!}tnIHuH}!tUH5H}HUE!}t;HULLHQxHuHc}H} 1H =Q!H H;Mu HX[A^A_]HT@UHAWAVSHXH Q!HHEHuH_HED~D}HG]]y HHtzLw(MtqA)AuUHuH} tRH5H}HUJ }t8HuLH QHuHcH}1H EP!H H;Mu HX[A^A_]PSf.fUHAWAVSHXH P!HHEHuH`HEDvDuHG]]yHHL(MA)AuuH5+H}HUX}tnIHuH}ytUH5H}HU%}t;HULLHOXHuHc]H}1H O!H H;Mu HX[A^A_](R@UHHHHGzu H=J#]+H5an1]@UHAWAVSH(HuHdHED~D}HG]ԉ]؅y BHHtZLw(MtQA)Au5HuH}t7ELNHNHuHH}1H([A^A_]f.DUHAWAVAUATSHh^HG)ЃmHuHHE]ȉỦUЅyjHHL(H}E11AC6HcHpBLpEIcI\IDME+ẼH}LD/EEtArKDH9JI91D)HHLHtf.ItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uHpHIHx]UUyHHH_(Ht~HpHuMtjHpHu9tVHpHu%tBEMUHLH HuH IH5OE1H}:HE11HODHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9}t LLJK LL=KIE~<1DADf.u z HI9uq HuH}1LDV Ht2E1HpHxH9t HtMLHh[A\A]A^A_]L/ IHpHxH9uHHpHxH9t HtLH  UHAWAVAUATSHx^HG)Ѓ}gHuHHE]UĉUȅy*HHL(H}11AC6HcHpLpEIcM,LDME+EăH}LDH}HuDEArII9IDI91)HHHHtI4ItHHuHDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u.HpHHHx]UUyHHH_(HHpHuHpHuHpHhtzHpHutfEMhHuHGHbHuEHpBHuHMHDH5\12H}1HpHxH9t HtIHHx[A\A]A^A_]E1l1H룉؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9:}tHULLEHULL}EIE~=1DAfA.Du z HH9uHuH}1LDHuEH}hHTLoHHpHxH9GLHHpHxH9t HtGH" f.fUHAWAVSHXHD!HHEHuHHED~D}HG]]ydHHLw(MA)H}Au}HutH}HuUtiH}HutXEHuHULDH9HuEH}HuH'1H C!H H;MuHX[A^A_]E1M>Ff.@UHAWAVAUATSHx^HG)ЃHuH*`HE]UĉUȅyHHL(H}AC6HcH`L`1EIcM,LDMBE+EăH}Hu.H}LDH}HuDEArII9IDI9 1)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uLH`H^HhptxyHH3H_(HH`HuH`HuH`HuH`HutzH`HuytfuEMUHUHAH)HuEH`z HuHHDH5]12H}n1H`HhH9t HtCHHx[A\A]A^A_]E1C1H룉؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9)}utHMLL?HMLL?IE~;1AfA.Du z HH9uiHuH}LDKHuEH}.HSL5HH`HhH9FKHH`HhH9t HtAH fUHAWAVSHXH>!HHEHuH7HED~D}HG]]y4HHLw(MA)AukHuH}wtmHuH}%tWH5nH}HU }t=HuELH5>HuH=!HH}| 1H =!H H;Mu HX[A^A_]@f.@UHAWAVSHXH=!HHEHuHkHED~D}HG]]y HHLw(MA)AuiHuH}i tkHuH} tUH5NH}HU }t;HUuLH<HuHzH5FH}HU?}t7H3H{Hu"HH([]H}о1H([]f.UHAWAVAUATSHhHuH`HEFEHGMĉMȅyHHL(H}11'AC6HcHxLxEIcMdLDEME+Eă!H}LDoH5 H}HU}HËE;E}H}HugHDEArIDI9II91)HHHHtf.ItI4HHuHpDILI ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}1HxHEH9\aE1Q؃HpHHHljH s1sHH)1ADALAALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5H4HfAD5AL5fAD4A 4H HuH9XMLL/E~G1f.DADfA.u z HH9u HuH}1LDfHt.1HxHEH9t Ht1HHh[A\A]A^A_]Hk.!HHxHEH9uHHxHEH9t Htk1H f.DUHAWAVSH(HuH{HED~D}HG]ԉ]؅y HHtSLw(MtJA)Au.HuH}Ot0}ut4L-Hu6H}1H([A^A_]ILHuHY-!H@UHAWAVSH(HuHHED~D}HG]ԉ]؅y "HHt\Lw(MtSA)Au7H5H}HU}t0}t7LH,$Hu9H}1H([A^A_]ILHHuH},!HUHAWAVAUATSHHHuHHEFEHGMĉMȅy@HHsL(H}AC6HcH}-Le1EIcM,LDME+EăH}HuZH}LDH}Hu.DEArII9IDI91HHHHHtf.A4AtHHuHLDA ALALALALALAL AL HH9uH}1H}HEH9t Ht-HHH[A\A]A^A_]E1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADA ADALH HuH9zuЋMLL)E~61A A;Lu HH9uHuH}LD[HHx)!HH}HEH9HH}HEH9t Htw,H f.UHAWAVAUATSHHHuHHEFEHGMĉMȅyHHL(H}vAC6HcH}Lm1EIcMdLDME+EăH5H}HU}HH}LDH}HuHDEArIDI9II91HHHHHtf.A|A}t[IH5H}HU!}t>ULLLI$HQHuH\H}1H0[A\A^A_]UHAWAVAUATSH(HuH0$HEDvDuHG]ĉ]ȅyHHLo(MA)AH5!H}HUN}IH59H}HU-}txIH5H}HU}t[IH5H}HU}t>LLLLI#H#HuH.H}1H([A\A]A^A_]UHAWAVSH8HuH(HEDvDuHG]̉]Ѕy bHHtxL(MtoA)AuSH5:H}HU.}tLIHuH}t8HULL#PHuHcUH}1H8[A^A_]ÐUHAWAVSH8HuH'HED~D}HG]̉]Ѕy HHtlLw(MtcA)AuGHuH}tIHuH}t8uHUL"HuHcH}1H8[A^A_]f.UHAWAVSH(HuH5HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5QH}HU}t4LH!HuH^!!HH}B1H([A^A_]fUHAWAVSH(HuHY4HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5aH}HU}t4LH5! HuH !HH}1H([A^A_]ÐUHH=s#H5u#HPH 0 t#u-gHVt#H=Os#HCs#]ÐUH]N fDUHSPHH= s#H5t#HgPH s#ufHs#H=r#mH53PHr#Ht H r#tH[]H=r#H[]fUHAVSH0HuHeHEЋFEHEHEH}ȃHuH]H=OH"AtDH=H"t1H=uH"tH=ݙHl"t HLc,HuL11H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yrHHLw(HEMA)Au{HuH}}L}tH=NL!AtuH=Ly!tbH=\Lf!tOH=ĘLS!tH}HU}t7}utKHULHHuMH}R1H !H H;MuBHX[A^A_]IHULHXHuH!HH [!H H;Mtqf.UHAWAVSHXH,!HHEHuHHED~D}HG]]yHHLw(MA)AugHuH}tiHuH}tSH5H}HUQ}t9}EtKHuLHI~HuMH}1H K!H H;MuBHX[A^A_]IHuLH`/HuH!HH !H H;Mtf.UHAVSH HuH1hHEDvDuHG]]y tHHt"H(HtD9uEt$`Ht(1.H}111H0sHuH!HHH [A^]UHAVSH HuHhHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111oH(HuHW!HHH [A^]UHAWAVSH(HuH/iHED~D}HG]ԉ]؅y HHtpLw(MtgA)AuKHuH}otMH5iH}HU}t3}ut7LHHu9H}1H([A^A_]ILH8HuHY!HАUHH=j#H5l#HNH 0 k#uMHVk#H=Oj#HCj#]ÐUH]ffDUHSPHH= j#H5k#HNH j#uHj#H=i#MH5XNHi#Ht H i#tH[]H=i#H[]fUHAVSH0HuHEHEЋFEHEHEH}ȃHuH]H=MHAtDH=\Hrt1H=\H_tH=HLt H~Lc HuL1H0[A^]UHAWAVSH(HuH܈HED~D}HG]ԉ]؅yRHHLw(HEMA)Au{HuH}}L}tH=LLrAtuH=l[LYtbH=j[LFtOH=L3t<tHLHUHpLM:!IHLHUHpLM(DHuLH(1Ef.EuzEf.EuzEf.Eu{$HuH(HU9pf.Pu'z%xf.XuzEf.`u{'蟻HuH(HpE~>1AfA.Du z HH9u!VHuH(LD5HzH HHHH9nsHHHH9t HtH UHAWAVAUATSHXHuHc8HEDvDuHG]ĉ]ȅy>HHLo(MA)A HuH}}H5CH}HU}aIH5CH}HU}@IH5tH}HU}IH5tH}HU}HH5|tH}HUe}HEH5CH}HUC}HEH5BH}HU!}HEH5BH}HU}t{HEHuH}tfH5BH}HU}tL}ELUtNHLLLLILMPARuuuRH} l1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0舸HuH HUHAWAVAUATSHXHuH:HEDvDuHG]]yHHLo(MnA)H}A NHuLH58AH}HU}.IH5$AH}HUh} IH5^rH}HUG}IH5@H}HU&}HH5@H}HU}HEH5@H}HU}HEH}HuptsH5@H}HU}tYHEH}Hu#tD}ELUЋEtQLLLLILMPuARuU ?1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H THuH HUHAWAVSHHH HHEHH0HDvDHGyHHL(MA)HAaHuZHHup=HH"HHvHH@HHHLL*HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL2n1H ( H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!豳HuHHU1Ef.`u$z"Ef.huzEf.pu{$]HuHHU9HuH@f. u*z(Hf.(uzPf.0u{'ڲHuHH@f.u*z(f.uzf.u{'wHuHHPHuH/HHc0H  H H;MDUHAWAVSH(HuH&HEDvDuHG]ԉ]؅yrHHL(MA)AumHuH}toH5H}HU%}tUIH5H}HU}t8}utH}1H([A^A_]ILLHHHuHcUHAWAVAUATSHH HHEHPHn(HXF`HGdhy0HHHG(HpLPL虿AC6HcHHE1EIcHLEL^AH]C?HcH輿HE1EIcHIDHpHI͋`+dHPHHHPHuuHPHuDZHPHL荿tiHPLD)tSHEHEf(Ef)EDHxE#A1HxzHP脾E1HHH9t HtHHH9t Ht}H HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU*E~E1HMfA.uzHH9xu"衪HuHPHUDE~>1ADf.u z HH9Eu!]HuHPLD蝺<HKL- IEHHH9?DHHHH9tHt HHHH9t HtHϪ fUHAVSH HuH*%HEDvDuHG]]y $HHt%H(HtD9uEt1<HHHt51H}111̸HH [A^]HpHHuHtH58H蘹H@HH H뱐UHAWAVSHhH HHEHuH.HED~D}HG]]yDHHLw(MA)H}Au_HuFHEHE(E)E}tDH?HEHEHE 1f.EuRzP2蘷eIHuLXHcEf.EuzEf.EuzEf.Eu{踧HuH}HU1蚧Ht1H | H H;Mu#Hh[A^A_]H肧H Y H H;Mtof.UHAWAVSHxH, HHEHxH _HED~D}HG]]y豶HHLw(MA)HxAu:Hu谶HEHE(E)E}tHuL蔽!'jIHuL`EEf.EuzEf.EuzEf.Eu{!EHuHxHU1腶$Ht1H  H H;Mu%Hx[A^A_]EH H H;MtUHAVSH0DvHGD)؃HuH)HEDu؉]܉]y>HHH(HD9腼H[HHH5xHصH耥H{HuH1)HEDu؉]܉]y 迴HHtOH_(HtFHuH}%t5LcuHJcԤHuH٤HH5(J1HH0[A^]H}1113H. HfUHAWAVAUATSHHU HHEHpH+HxFEHGMMyٳHHL(HpLAC6HcH8讳L81EIcM,LDME+E HpHu蔳HpLDzHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp91H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL肸IHuLLxEf.EuzEf.EuzEf.Eu{!LHuHpHU1茱E~G1fAfA.Du z HH9u!HuHpLD@ߠHtD1H8H@H9t HtH HH;Eu4HHĨ[A\A]A^A_]H/ HH8H@H9uHH8H@H9t Ht$H^ UHAWAVAUATSHH HHEHpH/(HxFEHGMMy虯HHL(Hp AC6HcH8nL81EIcM,LDME+E HpHuTHpLD:HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL*IHuLLEf.EuzEf.EuzEf.Eu{! HuHpHU1LE~G1fAfA.Du z HH9u!HuHpLD蟜HtD1H8H@H9t HtMHd HH;Eu4HHĨ[A\A]A^A_]H HH8H@H9uFHH8H@H9t HtH UHHHHGzu H=7#]H5!^1]@UHAWAVSH8HuH"HED~D}HG]̉]Ѕy2HHLw(MtrA)H}AuVHu苫tXH}HuztGH}Huit6u܋UMLHuHc蓪1H8[A^A_]E1Muf.fUHAWAVAUATSHhHuH5"HEFEHGMĉMȅy@HH{L(H}趩AC6HcHxLx1EIcM,LDME+EăH}HuTH}LDDEArII9IDI91)HHHHtf.I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}輨1HxHEH9otE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9W}ut LL LLAE~E1f.AfA.Du z HH9uЗHuH}LD貗Ht.1HxHEH9t HtcHHh[A\A]A^A_]ARHHxHEH9uHHxHEH9t HtHN UHAWAVSH(HuH<HED~D}HG]ԉ]؅y 袦HHtyLw(MtpA)AuTH51H}1zHtPIHuH}t:ULL藭蒖Hu aHH} 1HH([A^A_]f.UHAWAVSH(HuH\HED~D}HG]ԉ]؅y¥HHLw(Mt{A)Au_HuH}taHuH} tPUHuLì踕HuUH}1蠕HuoH}1H([A^A_]ÐUHH=1#H52#HH 0襕1#u gH1#H=0#rH0#]ÐUH]ZfDUHSPHH=0#H592#H/H @(1#ufHq1#H=j0# H5HW0#H蝔t H D0#tH[]H=40#H[]鑕fUHAVSH0HuHJHEЋFEHEHEH}ȃHuTH]H=dHKAtDH=EH2t1H=CHtH=}NH t H>Lc̓HuLѓJ1H0[A^]UHAWAVSH(HuHIHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}A}L}tH=KL2AtuH=,LtbH=*LtOH=dMLt<tHLHUHpLM!IHLHUHpLM(|HuLH(1=Ef.EuzEf.EuzEf.Eu{$|HuH(HUٌpf.Pu'z%xf.XuzEf.`u{'?|HuH(HpyE~>1AfA.Du z HH9u!{HuH(LD6{HzHe HHHH9ns赾HHHH9t HtSH| UHAWAVAUATSHXHuHHEDvDuHG]ĉ]ȅyފHHLo(MA)A HuH}H58H}HU艊}aIH5$H}HUh}@IH5^5H}HUG}IH5=5H}HU&}HH55H}HU}HEH5H}HU}HEH5H}HU}HEH5H}HU蟉}t{HEHuH}0tfH5TH}HUp}tL}ELUtNHLLLLILMPARuuuդRH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0(yHuH HUHAWAVAUATSHXHuH?HEDvDuHG]]y~HHLo(MnA)H}A NHu轈LH5H}HU)}.IH5H}HU} IH52H}HU}IH5H}HUƇ}HH5|H}HU襇}HEH5gH}HU胇}HEH}HutsH54H}HUP}tYHEH}HuÇtD}ELUЋEtQLLLLILMPuARu螢U ߆1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H vHuH HUHAWAVSHHH HHEHHOHDvDHGy2HHL(MA)HAaHu-ZHHu=HH1"HHHH@躅HH蚅HLLʅHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn}1H ȴ H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!QtHuHHU1葄Ef.`u$z"Ef.huzEf.pu{$sHuHHU:sHuH'@f. u*z(Hf.(uzPf.0u{'zsHuHH@贃f.u*z(f.uzf.u{'sHuHHQrHuHFrHHcrH H H;M蹵DUHAWAVSH(HuHHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}gtoH5b^H}HUŁ}tUIH5;^H}HU訁}t8}utH}X1H([A^A_]ILLHHqHuHcqUHAWAVAUATSHHU HHEHPHHXF`HGdhyЀHHHG(HpLPL9AC6HcH蛀HE1EIcHLELAH]C?HcH\HE1EIcHIDHpHI͋`+dHPHH耀HPHuHPHuDHPHL-tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHP$E1HHH9t Ht:HHH9t HtH4 HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM轖HpHHUHMMPEf.EuzEf.EuzEf.Eu{$kHuHPHU{E~E1HMfA.uzHH9xu"AkHuHPHUD{E~>1ADf.u z HH9Eu!jHuHPLD={jHKL-l IEHHH9?D軭HHHH9tHt YHHHH9t Ht5Hok fUHAVSH HuHHEDvDuHG]]y yHHt%H(HtD9uEt1 HiHt51H}111lyHH [A^]HpHiHuHtH5bH8zHiHH& H뱐UHAWAVSHhH\ HHEHuHPHED~D}HG]]yxHHLw(MA)H}AuZHuxHEHE(E)E}t?H?HE(c )Ec 1f.EuRzP2=xeIHuLXHcEf.EuzEf.EuzEf.Eu{]hHuH}HU1x?hHt1H ! H H;Mu#Hh[A^A_]H'hH H H;MtUHAWAVSHxHܧ HHEHxHHED~D}HG]]yawHHLw(MA)HxAu:Hu`wHEHE(E)E}tHuLr!vjIHuL`EEf.EuzEf.EuzEf.Eu{!fHuHxHU15wfHt1H H H;Mu%Hx[A^A_]EfH H H;Mt觩UHAVSH0DvHGD)؃HuH`HEDu؉]܉]yuHHH(HD9uH fHHH5(_HvH0fH{HuHHEDu؉]܉]y ouHHtOH_(HtFHuH}ut5LcuHJceHuHeHH5zt1HH0[A^]H}111tHޤ HfUHAWAVAUATSHH HHEHpHHxFEHGMMytHHL(HpsAC6HcH8^tL81EIcM,LDME+E HpHuDtHpLD*tHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpr1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL`IHuLLxEf.EuzEf.EuzEf.Eu{!aHuHpHU1AHcH0>L0H߾>AC6HcHhd>Lh1EIcIDHE؋E+E H}Huĺg>H}LD>>H}LD'>EEArKDH9JI9 1D)HHLHtfItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u?H}<1HhHpH9t HtpH0H8H9t HtoH m HH;EmHHĨ[A\A]A^A_]DHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9.H}LLK]AE~E1f.ADf.u z HI9u+HuH}LD4<+HjIc+HHhHpH9]bn H%H HHhHpH9t HtDnH0H8H9t Ht'nHa, f.UHAWAVAUATSHHk HHEHuH HEFEHGMMy:HHHG(HEH]H߾:AHcHt:HHpH߾9AC?HcHC:HE1EIcHMHLEH}9L}HcH8:H8E1H]HcL$MDH}eE+E@HH}Hu96H}HpD9H}HuHU9H}H|9H}HHU}9HEADžH}}rJI96KH9)1D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9ubH}U8E1H8H@H9t HtkkHHH9t HtNkHHH9t Ht1kHHh HH;E<LH[A\A]A^A_]1TDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9HEAŅq}rJI9KH91D)HHLHtH4I4HHuH!H I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9D|HuH}HpHMIW}~?1HMfA.u z HI9u %HuH}HUHM5}~:1fA.u z HI9u]%HuH}HHM5>%H|L=d IH8H@H9qvhHH8H@H9tHt gHHHH9tHt gHHHH9t HttgH% UHAWAVAUATSHHed HHEHuHgHEFEHEH]H߾3AHcH03L0H߾b3AC6HcHh3Lh1EIcIDHE؋E+E H}Hu3H}LD3H}LD3EEArKDH9JI9 1D)HHLHtfItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u?H}\21HhHpH9t HtseH0H8H9t HtVeHmb HH;ElHHĨ[A\A]A^A_]DHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9.H}LL{RE~H1f.@ADf.u z HI9uQ!HuH}LD13!HjH` HHhHpH9^cdH HHhHpH9t HtcH0H8H9t HtcH! UHAWAVAUATSHH` HHEHuHLHEFEHEH]H߾/AHcH00L0H߾/AC6HcHh/Lh1EIcIDHE؋E+E H}Hu/H}LD/H}LD/EEArKDH9JI9 1D)HHLHtfItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u?H}|.1HhHpH9t HtaH0H8H9t HtvaH^ HH;ElHHĨ[A\A]A^A_]DHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9.H}LLNE~H1f.@ADf.u z HI9uqHuH}LD-SHjH\ HHhHpH9^c3`H HHhHpH9t Ht_H0H8H9t Ht_H UHAWAVAUATSHH\ HHEHuH8HEFEHGMMy/,HHHG(HEH]H߾+AHcH,HHpH߾q+AC?HcH+HE1EIcHMHLEH}1+L}HcH8+H8E1H]HcL$MDH}eE+E@HH}Hu+6H}HpDV+H}HuHU=+H}H|s+H}HHU +HEADžH}}rJI96KH9)1D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9ubH})E1H8H@H9t Ht\HHH9t Ht\HHH9t Ht\HY HH;E<LH[A\A]A^A_]1TDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9HEAŅq}rJI9KH91D)HHLHtH4I4HHuH!H I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9D|HuH}HpHMIHH}~?1HMfA.u z HI9u .HuH}HUHMo'}~:1fA.u z HI9uHuH}HHM/'H|L=^V IH8H@H9qvYHH8H@H9tHt LYHHHH9tHt (YHHHH9t HtYH> UHAWAVAUATSHHU HHEHuHrHEFEHGMMy%HHHG(HEH]H߾$AHcHT%HHpH߾$AC?HcH#%HE1EIcHMHLEH}$L}HcH8$H8E1H]HcL$MDH}eE+E@HH}Hu$6H}HpD$H}HuHU$H}H|$H}HHU]$HEADžH}}rJI96KH9)1D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9ubH}5#E1H8H@H9t HtKVHHH9t Ht.VHHH9t HtVH(S HH;E<LH[A\A]A^A_]1TDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9HEAŅq}rJI9KH91D)HHLHtH4I4HHuH!H I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHpHHH‰уH s1jHH)1LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuL9D|HuH}HpHMIA}~?1HMfA.u z HI9u ~HuH}HUHM }~:1fA.u z HI9u=HuH}HHM H|L=O IH8H@H9qvRHH8H@H9tHt RHHHH9tHt xRHHHH9t HtTRH UHH@HuHHEFEHEH}؃u+HuqtuH}s@$Ht1H@]þ1H@]H=HubH@]f.UHH0HuHHE؋FEHEH}Ѓu+Hut}@HEHt1H0]þ1H0]H=`HuH0]f.UHSH(HuHHE؋FEHEH}Ѓu0HuPt2}b?HuHc H([]þ~1H([]fUHH0HuHHE؋FEHEH}Ѓu+Hut}>HE Ht1H0]þ1H0]H=PHu H0]f.UHSH(HuHHE؋FEHEH}Ѓu6Hu@t8}v>H Hu#H߾H([]þh1H([]UHSH(HuHHE؋FEHEH}Ѓu6Hut8}=Ht Hu#H߾H([]þ1H([]UHH0HuH1HE؋FEHEH}Ѓu+HuAt}k=HE Ht1H0]þt1H0]H=Hu2 H0]f.UHSH(HuH6HE؋FEHEH}Ѓu0Hut2}<e HuHcj H([]þ1H([]fUHH@HuH4HEFEHEH}؃u+Hu1tuH}Q< Ht1H@]þd1H@]H=Hu" H@]f.UHH0HuHAHE؋FEHEH}Ѓu+Hut};HET Ht1H0]þ1H0]H= Hu H0]f.UHSH(HuHTHE؋FEHEH}Ѓu0Hut2}L; HuHc H([]þ>1H([]fUHH0HuH^HE؋FEHEH}Ѓu+Hut}:HED Ht1H0]þ1H0]H=Hu H0]f.UHSH(HuHcHE؋FEHEH}Ѓu6Hut8}T:HHu#H߾H([]þ(1H([]UHSH(HuHHE؋FEHEH}Ѓu6Hut8}9H4Hu#H߾XH([]þ1H([]UHH0HuHHE؋FEHEH}Ѓu+Hut}I9HEHt1H0]þ41H0]H=HuH0]f.UHSH(HuHĩHE؋FEHEH}Ѓu0Hupt2}|8%HuHc*H([]þ1H([]ÐUHH="H5N"HکH 0%="uH"H="Hs"]ÐUH]8fDUHSPHH=P"H5"HuH د"u(H!"H="H5AH"Ht H "tH[]H="H[]fUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H=HHAtDH=ŎHHt1H=ÎHHtH=HHt HLcLHuLQ1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=LGAtuH=LGtbH=LGtOH=LsGt<tHLHUHpLMX !IHLHUHpLM(tHuLH(1Ef.EuzEf.EuzEf.Eu{$,HuH(HUipf.Pu'z%xf.XuzEf.`u{'HuH(Hp E~>1AfA.Du z HH9u!HuH(LDeHzH, HHHH9nsE0HHHH9t Ht/H UHAWAVAUATSHXHuHjHEDvDuHG]ĉ]ȅynHHLo(MA)A HuH}H5uH}HU}aIH5uH}HU}@IH5H}HU}IH5ͦH}HU}HH5H}HU}HEH5JuH}HUs}HEH5(uH}HUQ}HEH5uH}HU/}t{HEHuH}tfH5tH}HU}tL}ELUtNHLLLLILMPARuuu%RH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0HuHL* HUHAWAVAUATSHXHuHlHEDvDuHG]]yHHLo(MnA)H}A NHuMLH5hsH}HU}.IH5TsH}HU} IH5H}HUw}IH5-sH}HUV}HH5 sH}HU5}HEH5rH}HU}HEH}HutsH5rH}HU}tYHEH}HuStD}ELUЋEtQLLLLILMPuARuU o1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H HuH( HUHAWAVSHHHI( HHEHH`HDvDHGyHHL(MA)HAaHuZHHu=HH"HHHH@JHH*HLLZHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLPn 1H X& H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1!Ef.`u$z"Ef.huzEf.pu{$HuHHUiHuH@f. u*z(Hf.(uzPf.0u{' HuHH@Df.u*z(f.uzf.u{'HuHHHuH_HHc`H 7$ H H;MI'DUHAWAVSH(HuH)YHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}toH5H}HUU}tUIH5H}HU8}t8}utH}1H([A^A_]ILLHH&HuHc+UHAWAVAUATSHH" HHEHPHZHXF`HGdhy`HHHG(HpLPLAC6HcH+HE1EIcHLELAH]C?HcHHE1EIcHIDHpHI͋`+dHPHHHPHuHPHuDHPHLtiHPLDYtSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht#HHH9t Ht#H HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHUZE~E1HMfA.uzHH9xu"HuHPHUDE~>1ADf.u z HH9Eu!HuHPLDlHKL- IEHHH9?DKHHHH9tHt HHHH9t HtH fUHAVSH HuHZWHEDvDuHG]]y THHt%H(HtD9uEt1` HxHt51H}111HH [A^]HpHCHuHtH5hHHpHH H뱐UHAWAVSHhH HHEHuH`HED~D}HG]]ytHHLw(MA)H}AuTHuvHEHE(E)E}t9(7)EHE31f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU16Ht1H  H H;Mu#Hh[A^A_]HH  H H;MtfDUHAWAVSHxHl HHEHxHIHED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuL !gjIHuL`EEf.EuzEf.EuzEf.Eu{!HuHxHU1dHt1H F H H;Mu%Hx[A^A_]EDH ! H H;Mt7UHAVSH0DvHGD)؃HuH[HEDu؉]܉]y~HHH(HD9 HHHH5HHH{HuHq[HEDu؉]܉]y HHtOH_(HtFHuH}et5LcuH9 JcHuHHH5 [1HH0[A^]H}111sHn HfUHAWAVAUATSHH HHEHpHF]HxFEHGMMyHHL(HpAC6HcH8L81EIcM,LDME+E HpHuHpLDHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpy1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLIHuLLxEf.EuzEf.EuzEf.Eu{!HuHpHU1E~G1fAfA.Du z HH9u!@HuHpLDHtD1H8H@H9t HtH HH;Eu4HHĨ[A\A]A^A_]Ho HH8H@H9uHH8H@H9t HtdH UHAWAVAUATSHHU HHEHpHoZHxFEHGMMyHHL(HpLAC6HcH8L81EIcM,LDME+E HpHuHpLDzHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp91H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLXIHuLLEf.EuzEf.EuzEf.Eu{!LHuHpHU1E~G1fAfA.Du z HH9u!HuHpLD@HtD1H8H@H9t HtH HH;Eu4HHĨ[A\A]A^A_]H/ HH8H@H9uHH8H@H9t Ht$H^ UHAWAVSH8^HG)ЃYHuH$THE]ȉỦUЅyHH:Lw(M-H5U1H}1wHIHuH}ULLHRHHuHSHE]ȉỦUЅyHHH_(HH}Hu_tH}HuNtnH}Hu=t]H}Hu,tLDEHuHUHMHHtEHtSH(bH5R:1HH8[A^A_]1HUUH}1tHuUH}YHUH}f.UHHHzu H=Gz"]!H5!S1]ÐUHAWAVAUATSHhHuHeSHEFEHGMĉMȅypHH{L(H}AC6HcHxHLx1EIcM,LDME+EăH}HuH}LDDEArII9IDI91)HHHHtf.I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}1HxHEH9otE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9W}ut LL? LL2AE~E1f.AfA.Du z HH9uHuH}LDCHt.1HxHEH9t Ht HHh[A\A]A^A_]AHHxHEH9uHHxHEH9t HtD H~ UHAWAVSH8HuH_OHED~D}HG]̉]ЅyHHLw(MtrA)H}AuVHu+tXH}HutGH}Hu t6u܋UMLHuHc31H8[A^A_]E1Muf.fUHAVSHPHuHqNHEЋFEHEH}ȾHcH}E+E܃ulLuH}HuHtjH}Hu7tYH}LtG}uLHu-HcHH}HEH9u$,H}Ⱦ>1H}HEH9t Ht[ HHP[A^]HH}HEH9t Ht3 Hm UHH=t"H5nv"HkH 0]u"uHu"H=t"RHt"]ÐUH]xfDUHAVSIH=ot"H5v"HkH t"u臗H@u"H=9t"H5jH&t"L|t H t"t5HtAHH5jLHKH u'H[A^]TH=s"HHHu[A^]f.fUHAVSH0HuHzHEЋFEHEHEH}ȃHuH]H=jHAtDH=MHt1H=MHtH=Ht HLclHuLq1H0[A^]UHAWAVSH(HuH<tHLHUHpLM8!IHLHUHpLM(ĬHuLH(1Ef.EuzEf.EuzEf.Eu{$|HuH(HU蹼pf.Pu'z%xf.XuzEf.`u{'HuH(HpYE~>1AfA.Du z HH9u!֫HuH(LD赫HzHEHHHH9nsHHHH9t Ht3Hm UHAWAVAUATSHXHuH(HEDvDuHG]ĉ]ȅy辺HHLo(MA)A HuH}H54H}HUi}aIH54H}HUH}@IH5>eH}HU'}IH5eH}HU}HH5dH}HU}HEH53H}HUù}HEH5x3H}HU衹}HEH5c3H}HU}t{HEHuH}tfH543H}HUP}tL}ELUtNHLLLLILMPARuuuRH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0HuHHUHAWAVAUATSHXHuH+HEDvDuHG]]y^HHLo(MnA)H}A NHu蝸LH51H}HU }.IH51H}HU} IH5bH}HUǷ}IH5}1H}HU覷}HH5\1H}HU腷}HEH5G1H}HUc}HEH}HutsH51H}HU0}tYHEH}Hu裷tD}ELUЋEtQLLLLILMPuARu輾U 迶1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H ԦHuHhHUHAWAVSHHHHHEHHHDvDHGyHHL(MA)HAaHu ZHHu=HH"HHHH@蚵HHzHLL誵HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL0n]1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!1HuHHU1qEf.`u$z"Ef.huzEf.pu{$ݣHuHHU蹣HuH@f. u*z(Hf.(uzPf.0u{'ZHuHH@蔳f.u*z(f.uzf.u{'HuHH1ТHuH&询HHc谢H H H;MDUHAWAVSH(HuHyHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}GtoH5BH}HU襱}tUIH5H}HU舱}t8}utH}81H([A^A_]ILLHHvHuHc{UHAWAVAUATSHH5HHEHPHHXF`HGdhy谰HHHG(HpLPLAC6HcH{HE1EIcHLELޯAH]C?HcH<HE1EIcHIDHpHI͋`+dHPHH`HPHuHPHuDگHPHL tiHPLD詯tSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t HtHHH9t HtHHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$mHuHPHU誫E~E1HMfA.uzHH9xu"!HuHPHUD`E~>1ADf.u z HH9Eu!ݚHuHPLD輚HKL-LIEHHH9?DHHHH9tHt 9HHHH9t HtHO fUHAVSH HuHHEDvDuHG]]y 褩HHt%H(HtD9uEt1@HșHt51H}111LHH [A^]HpH蓙HuHtH5HHHHH뱐UHAWAVSHhH<HHEHuH0HED~D}HG]]yĨHHLw(MA)H}Au:HuƨHEHE(E)E}tHuL!=dIHuLXEf.EuzEf.EuzEf.Eu{^HuH}HU1表@Ht1H "H H;Mu#Hh[A^A_]Hc(H H H;MtUHAWAVSHxHHHEHxHOHED~D}HG]]yaHHLw(MA)HxAu:Hu`HEHE(E)E}tHuLȮ!צjIHuL`EEf.EuzEf.EuzEf.Eu{!HuHxHU15ԖHt1H H H;Mu%Hx[A^A_]E贖H H H;MtUHAWAVAUATSHHeHHEHpHHxFEHGMMyHHL(Hp\AC6HcH8辥L81EIcM,LDME+E HpHu褥HpLD芥HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpI1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLIHuLLxEf.EuzEf.EuzEf.Eu{!\HuHpHU1蜣E~G1fAfA.Du z HH9u!HuHpLDPHtD1H8H@H9t HtHHH;Eu4HHĨ[A\A]A^A_]H?HH8H@H9uHH8H@H9t Ht4Hn UHAWAVAUATSHH%HHEHpH?HxFEHGMMy詡HHL(HpAC6HcH8~L81EIcM,LDME+E HpHudHpLDJHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL踦IHuLLEf.EuzEf.EuzEf.Eu{!HuHpHU1\E~G1fAfA.Du z HH9u!ЎHuHpLD诎HtD1H8H@H9t Ht]HtHH;Eu4HHĨ[A\A]A^A_]HHH8H@H9uVHH8H@H9t HtH. UHAVSH HuH HEDvDuHG]]y 脝HHtHG(HtD9uH讍Ht1H}1112 H褍HHH [A^]f.UHAVSH HuH[6HEDvDuHG]]y HHt H(HtD9uUH Ht1H}111葜 HHHH [A^]f.fUHAWAVAUATSHhHuH5HEFEHGM̉MЅy@HHSL(H}趛AC6HcHx<Lx1EIcM,LDM7E+ẼH}HurH}LDDEArII9IDI91HHHHHtf.fI4ItHHuH>DI ILILILILILILILHH9uH}1HxHEH9AFE1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt-HHfADA ADALH HuH9HuLL謡E~61I I;Lu HH9u&HuH}LD荚Ht.1HxHEH9t HtHHh[A\A]A^A_]HnHHxHEH9uHHxHEH9t HtnH訊 fUHAWAVSHXHuH:3HEЋFEHGM܉My HHt~Lw(H}E11~HcH} MtyE+E܃u)L}H}Lt&}t7LL藠5H}ȾxE1H}HEH9u/7E1LL`H貈Ht(E1H}HEH9t HteLHX[A^A_]H蕈IH}HEH9uHH}HEH9t Ht!H[ DUHAWAVATSHpHuH?2HEȋFEHEH}NAC6HcHxԗLx1EIcIHE؋E+EԃH}HuH}LD躗H}HuEEArKH9JI91HHLLHtfI4H4HHuH:fDI H ILHLILHLILHLHI9uH}u1HxHEH9t HtHHp[A\A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9H}HUL"E~91DI H; u HI9u跅HuH}LD虅HH)HHxHEH9HHxHEH9t Ht"H\ fDUHAVSH`HuH/HE؋FEHEH}1UHcH}E+EuZLuH}LtWH}Hu'tFHuLOH蹄Hu-HĄHH}HEH9u$,H}о#1H}HEH9t Ht@HH`[A^]HH}HEH9t HtHR UHH=8"H5.:"H9/H 0e9"uUHf9"H=_8"2HS8"]ÐUH]閨fDUHAVSIH=/8"H59"H.H 8"ugUH9"H=7"̃H5.H7"L\t H 7"t5iHtAHH5~.LH+H u'H[A^]4H=7"((Hu[A^]f.fUHAVSH0HuH8HEЋFEHEHEH}ȃHuԒH]H=-HAtDH= Ht1H= HtH=<Ht H辐LcLHuLQʑ1H0[A^]UHAWAVSH(HuH8HED~D}HG]ԉ]؅y蒑HHLw(HEMA)Au{HuH}}L}tH=,LAtuH= LtbH= LtOH=;Lst<tHLHUHpLM`!IHLHUHpLM(jHuLH(1 zEf.EuzEf.EuzEf.Eu{$ljHuH(HUzpf.Pu'z%xf.XuzEf.`u{'jHuH(HpIzE~>1AfA.Du z HH9u!iHuH(LDziHzH5HHHH9ns腬HHHH9t Ht#H]j UHAWAVAUATSHXHuHHEDvDuHG]ĉ]ȅyxHHLo(MA)A HuH}xH5H}HUYx}aIH5H}HU8x}@IH5.#H}HUx}IH5 #H}HUw}HH5"H}HUw}HEH5H}HUw}HEH5hH}HUw}HEH5SH}HUow}t{HEHuH}xtfH5$H}HU@w}tL}ELUtNHLLLLILMPARuuu3RH} v1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0fHuHHUHAWAVAUATSHXHuHHEDvDuHG]]yNvHHLo(MnA)H}A NHuvLH5H}HUu}.IH5H}HUu} IH5 H}HUu}IH5mH}HUu}HH5LH}HUuu}HEH57H}HUSu}HEH}HuutsH5H}HU u}tYHEH}HuutD}ELUЋEtQLLLLILMPuARuU t1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H dHuHXHUHAWAVSHHHHHEHH=HDvDHGytHHL(MA)HAaHusZHHus=HHt"HHsHH@sHHjsHLLsHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLXnMr1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!!bHuHHU1arEf.`u$z"Ef.huzEf.pu{$aHuHHU raHuHp@f. u*z(Hf.(uzPf.0u{'JaHuHH@qf.u*z(f.uzf.u{'`HuHH!q`HuHp`HHc`H wH H;M艣DUHAWAVSH(HuHiHEDvDuHG]ԉ]؅yoHHL(MA)AumHuH}7ptoH52LH}HUo}tUIH5 LH}HUxo}t8}utH}(o1H([A^A_]ILLHHf_HuHck_UHAWAVAUATSHH%HHEHPHHXF`HGdhynHHHG(HpLPL nAC6HcHknHE1EIcHLELmAH]C?HcH,nHE1EIcHIDHpHI͋`+dHPHHPnHPHumHPHuDmHPHLmtiHPLDmtSHEHEf(Ef)EDHxE#A1HxzHPlE1HHH9t Ht HHH9t HtHHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM~HpHHUHMMPEf.EuzEf.EuzEf.Eu{$]YHuHPHUiE~E1HMfA.uzHH9xu"YHuHPHUDPiE~>1ADf.u z HH9Eu!XHuHPLD iXHKL-<IEHHH9?D苛HHHH9tHt )HHHH9t HtH?Y fUHAVSH HuHHEDvDuHG]]y gHHt%H(HtD9uEt1h|HWHt51H}111N UHAWAVAUATSHHHHEHpHHxFEHGMMyy\HHL(Hp[AC6HcH8N\L81EIcM,LDME+E HpHu4\HpLD\HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpZ1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLnIHuLLEf.EuzEf.EuzEf.Eu{!IHuHpHU1,ZE~G1fAfA.Du z HH9u!IHuHpLDYIHtD1H8H@H9t Ht-HDHH;Eu4HHĨ[A\A]A^A_]HψHH8H@H9u&HH8H@H9t HtċHI UHAVSH HuHHEDvDuHG]]y TXHHtHG(HtD9uH~HHt1H}111X HtHHHH [A^]f.UHAVSH HuH+HEDvDuHG]]y WHHt H(HtD9u]lHGHt1H}111aW HGHHH [A^]f.fUHAWAVAUATSHhHuHHEFEHGM̉MЅyWHHSL(H}VAC6HcHx WLx1EIcM,LDM7E+ẼH}HuBWH}LDVDEArII9IDI91HHHHHtf.fI4ItHHuH>DI ILILILILILILILHH9uH}U1HxHEH9AFE1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt-HHfADA ADALH HuH9HuLLiE~61I I;Lu HH9uDHuH}LD]UDHt.1HxHEH9t Ht艇HHh[A\A]A^A_]H>HHxHEH9uHHxHEH9t Ht>HxE fUHAWAVSHXHuH HEЋFEHGM܉My SHHt~Lw(H}E11NSHcH}SMtyE+E܃u)L}H}LSt&}t7LLh5H}ȾHSE1H}HEH9u/7E1LLthHCHt(E1H}HEH9t Ht5LHX[A^A_]HeCIH}HEH9uHH}HEH9t HtH+D DUHAWAVATSHpHuHHEȋFEHEH}RAC6HcHxRLx1EIcIHE؋E+EԃH}HuRH}LDRH}HuREEArKH9JI91HHLLHtfI4H4HHuH:fDI H ILHLILHLILHLHI9uH}EQ1HxHEH9t Ht_HHp[A\A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9H}HUL*eE~91DI H; u HI9u@HuH}LDPi@HHHHxHEH9HHxHEH9t HtH,A fDUHAVSH`HuHHE؋FEHEH}1%OHcH}OE+EuZLuH}LOtWH}HuOtFHuLcdH?Hu-H?HH}HEH9u$,H}оN1H}HEH9t HtHH`[A^]HH}HEH9t HtH"@ f.fUHH@HuHHEȋFEHEH}u`HuOtbH}HuOtQH}HuNt@H}HuEWcE>HuE>H@]þM1H@]f.UHH@HuHHEȋFEHEH}u`HuoNtbH}Hu^NtQH}HuNt@H}HuEbE=HuE=H@]þOM1H@]ÐUHH=E!H5!HjH 0=!u=H!H=!=H!]ÐUH]^UfDUHSPHH=!H5y!HH p=h!uH!H=!==H5H!H<t H !tH[]H=t!H[]=fUHAVSH0HuH5HEЋFEHEHEH}ȃHuLH]H=:H{AtDH=uHbt1H=sHOtH=H<t HnJLc;HuL<zK1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yBKHHLw(HEMA)Au{HuH}qK}L}tH=!Lb~AtuH=\LI~tbH=ZL6~tOH=L#~t<tHLHUHpLM=!IHLHUHpLM(%HuLH(1m4Ef.EuzEf.EuzEf.Eu{$$HuH(HU 5pf.Pu'z%xf.XuzEf.`u{'o$HuH(Hp4E~>1AfA.Du z HH9u!&$HuH(LDf4$HzHcHHHH9nsfHHHH9t HtfH$ UHAWAVAUATSHXHuH3HEDvDuHG]ĉ]ȅy3HHLo(MA)A HuH}M3H5hH}HU2}aIH5TH}HU2}@IH5H}HUw2}IH5mH}HUV2}HH5LH}HU52}HEH5H}HU2}HEH5ȫH}HU1}HEH5H}HU1}t{HEHuH}`2tfH5H}HU1}tL}ELUtNHLLLLILMPARuuu9RH} <11HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0X!HuH`HUHAWAVAUATSHXHuHoHEDvDuHG]]y0HHLo(MnA)H}A NHu0LH5H}HUY0}.IH5H}HU80} IH5.H}HU0}IH5ͩH}HU/}HH5H}HU/}HEH5H}HU/}HEH}Hu@0tsH5dH}HU/}tYHEH}Hu/tD}ELUЋEtQLLLLILMPuARu7U /1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H $HuH^HUHAWAVSHHH^HHEHHHDvDHGyb.HHL(MA)HAaHu].ZHHu@.=HHa."HHF.HH@-HH-HLL-HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL4n,1H \H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1,Ef.`u$z"Ef.huzEf.pu{$-HuHHUj, HuHW+@f. u*z(Hf.(uzPf.0u{'HuHH@+f.u*z(f.uzf.u{'GHuHH+ HuHv*HHcH ZH H;M]DUHAWAVSH(HuHɏHEDvDuHG]ԉ]؅yB*HHL(MA)AumHuH}*toH5H}HU)}tUIH5kH}HU)}t8}utH})1H([A^A_]ILLHHHuHcUHAWAVAUATSHHYHHEHPH>HXF`HGdhy)HHHG(HpLPLi(AC6HcH(HE1EIcHLEL.(AH]C?HcH(HE1EIcHIDHpHI͋`+dHPHH(HPHuE(HPHuD*(HPHL](tiHPLD'tSHEHEf(Ef)EDHxE#A1HxzHPT'E1HHH9t HtjZHHH9t HtMZHdWHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM+HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU#E~E1HMfA.uzHH9xu"qHuHPHUD#E~>1ADf.u z HH9Eu!-HuHPLDm# HKL-RIEHHH9?DUHHHH9tHt UHHHH9t HteUH fUHAVSH HuHHEDvDuHG]]y !HHt%H(HtD9uEt1*HHt51H}111!HH [A^]HpHHuHtH5 Hh"HHHVQH뱐UHAWAVSHhHQHHEHuHHED~D}HG]]y!HHLw(MA)H}AuZHu!HEHE(E)E}t?( )EH?HE 1f.EuRzP2m eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU1 oHt1H QPH H;Mu#Hh[A^A_]HWH .PH H;MtDSUHAWAVSHxH PHHEHxHHED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuLp'!jIHuL`EEf.EuzEf.EuzEf.Eu{!%HuHxHU1eHt1H NH H;Mu%Hx[A^A_]EH NH H;MtQUHAVSH0DvHGD)؃HuHHEDu؉]܉]yHHH(HD9y&H;HHH5XHH`H{HuHHEDu؉]܉]y HHtOH_(HtFHuH}t5LcuH%Jc HuH HH5*1HH0[A^]H}111HMHfUHAWAVAUATSHH5MHHEHpHHxFEHGMMyHHL(Hp,AC6HcH8L81EIcM,LDME+E HpHutHpLDZHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL^"IHuLLxEf.EuzEf.EuzEf.Eu{!, HuHpHU1lE~G1fAfA.Du z HH9u! HuHpLD  HtD1H8H@H9t HtmLHIHH;Eu4HHĨ[A\A]A^A_]HIHH8H@H9ufLHH8H@H9t HtLH>  UHAWAVAUATSHHHHHEHpHHxFEHGMMyyHHL(HpAC6HcH8NL81EIcM,LDME+E HpHu4HpLDHEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLLIHuLLEf.EuzEf.EuzEf.Eu{!HuHpHU1,E~G1fAfA.Du z HH9u!HuHpLDHtD1H8H@H9t Ht-HHDEHH;Eu4HHĨ[A\A]A^A_]HDHH8H@H9u&HHH8H@H9t HtGH UHAWAVSH8^HG)ЃYHuHĊHE]ȉỦUЅy>HH:Lw(M-H51H}1HIHuH}|ULL('HHHuH'HE]ȉỦUЅyHHH_(HH}HutH}HutnH}Hut]H}HutLDEHuHUHMHxqHtEgHtS]H(bH5o1HH8[A^A_]1HUUH}1HuUH}pHUH}Qf.UHAVSH0HHzHUHHEEHFEԉE؅yHH$HHLv(MH}HuztiH}HuitXH}HuXtGuUMLHu*Hc "H=>!H0[A^]H5k1H0[A^]þWE1MVf.UHAWAVAUATSHhHuHHEFEHGMĉMȅyHH{L(H}AC6HcHxLx1EIcM,LDME+EăH}Hu$H}LDDEArII9IDI91)HHHHtf.I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}1HxHEH9otE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9W}ut LL LLAE~E1f.AfA.Du z HH9uHuH}LDHt.1HxHEH9t Ht3AHHh[A\A]A^A_]A"HHxHEH9uHHxHEH9t Ht@H UHAWAVAUATSHhHuHBHEFEHGMĉMȅyp HH{L(H} AC6HcHxH Lx1EIcM,LDME+EăH}Hu H}LD DEArII9IDI91)HHHHtf.I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH} 1HxHEH9otE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9W}ut LLG LL:AE~E1f.AfA.Du z HH9uHuH}LDC Ht.1HxHEH9t Ht=HHh[A\A]A^A_]AHHxHEH9uHHxHEH9t HtD=H~ UHSH(HHzt}HUHLHEEHFEEyHH HHtQH~(HtHxP#HHu+HcH H=U!H([]H5ɨD 1HH([]H}111/ UHAVSHPHuHHEȋFEHEH}HcH} E+EԃLuH}Hud t~H}HuS tmH}HuB t\H}LtJ}uULHu-HcHH}HEH9u$,H}F1H}HEH9t Htc;HHP[A^]HH}HEH9t Ht;;Hu f.DUHAVSH@HuHPHE؋FEHEH}1eHcH}E+EuDLuH}LtALHu-HcHH}HEH9u$,H}оI1H}HEH9t Htf:HH@[A^]HH}HEH9t Ht>:Hx UHH=%!H5!HLH 0!umH!H=!bH!]ÐUH]*0fDUHSPHH=!H5Y!HH 0H!uH!H=!H5Hw!Ht H d!tH[]H=T!H[]fUHAVSH0HuHHEЋFEHEHEH}ȃuoHuHtqH]H=$HC9At1H=NH*9tH=H9t HILcHuLU1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}A}L}tlH=L28AtbH==~L8tOH=wL8t<tHLHUHpLM@!IHLHUHpLM($HuLH(1}Ef.EuzEf.EuzEf.Eu{$HuH(HUpf.Pu'z%xf.XuzEf.`u{'HuH(HpE~>1AfA.Du z HH9u!6HuH(LDvHzHHHHH9nsHHHH9t HtH UHAWAVSH(HuHQHEDvDuHG]ԉ]؅y"HHL(MA)AumHuH}wtoH5rH}HU}tUIH5KH}HU}t8}utH}h1H([A^A_]ILLHHHuHcUHAWAVAUATSHHeHHEHPHSHXF`HGdhyHHHG(HpLPLIAC6HcHHE1EIcHLELAH]C?HcHlHE1EIcHIDHpHI͋`+dHPHHHPHu%HPHuD HPHL=tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHP4E1HHH9t HtJHHH9t Ht-HDHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHUE~E1HMfA.uzHH9xu"QHuHPHUDE~>1ADf.u z HH9Eu! HuHPLDMHKL-|IEHHH9?DHHHH9tHt iHHHH9t HtEH fUHAVSH HuHOHEDvDuHG]]y HHt%H(HtD9uEt1 HHt51H}111|HH [A^]HpHHuHtH5HHHHH6H뱐UHAWAVAUATSHXHuHUHEDvDuHG]]yHHLo(MnA)H}A NHu=LH5X\H}HU}.IH5D\H}HU} IH5~H}HUg}IH5\H}HUF}HH5[H}HU%}HEH5[H}HU}HEH}HutsH5[H}HU}tYHEH}HuCtD}ELUЋEtQLLLLILMPuARu U _1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H tHuHHUHAWAVSHhH<HHEHuH0WHED~D}HG]]yHHLw(MA)H}Au_HuHEHE(E)E}tDH?HEHEHEx1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{8HuH}HU1{Ht1H H H;Mu#Hh[A^A_]HH H H;Mtf.UHAWAVSHHHHHEHHHDvDHGy"HHL(MA)HAaHuZHHu=HH!"HHHH@HHHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLnm1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!AHuHHU1Ef.`u$z"Ef.huzEf.pu{$HuHHU*HuH@f. u*z(Hf.(uzPf.0u{'jHuHH@f.u*z(f.uzf.u{'HuHHAHuH6HHcH H H;MDUHSHHm HHEHPHHXF`HDždHPHuкHPHuHPHuHPHpHPH@tnHPHHtWH}HuHUHpL@LHUrHtAhHtZ^Huq1H / H H;MuhHĸ[]@HPHuHHP\HuHcH H H;Mt fUHSH8H HHEHH8}HFHDžHHuкIHHu,HHP pHHPHH 5HHHEHE(E)E(E)pHEHE(P)0H`H@()H HH}HuHPHLL.Ef.EuzEf.EuzEf.Eu{!HuHHU1OEf.pu!zEf.xuzEf.Eu{$HuHHUPf.0u*z(Xf.8uz`f.@u{'^HuHHPf.u*z(f.uz f.u{'HuHH5HtAHtZHuqF1H H H;MuhH8[]HpHuHMHuHcRH )H H;Mt? f.UHAWAVATSHHHHE؋~GH`H|HhpHDžtH`AC6HcHdL1EIcIHE؋p+t H`HuJH`Hu-H`HuH`HP1x;p}H`LDEEArKH9JI91D)HHLHtI4H4HHuHHI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uHH {H HDž(Dž0HHuHHuHHutxH}HuHUnXHuUXyHEH`1HH H9tHtH5+z1H HH;EHH[A\A^A_]DHpHHH‰уH s1jHH)1AALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt*HHfADA fD H HuL9H}HuHUHPMXHuPH`]E~<1Af.u z HI9u!HuH`LD HPXHHH H9>SHHH H9t Ht!H[ DUHAVSHHHHEHPHk{HXF`HDždHPHuкHPHuHPHPHPHjHPHJHPH*aHPH8HHCHPL@L*%HEHE(E)E(E)pHEHE(P)0H`H@()H HHH()HH()pH}HuHPHLLAVSOHHEf.EuzEf.EuzEf.Eu{!HuHPHU1BEf.pu!zEf.xuzEf.Eu{$豾HuHPHUPf.0u*z(Xf.8uz`f.@u{'QHuHPHPf.u*z(f.uz f.u{'HuHPH(f.u*z(f.uzf.u{'苽HuHPHf.pu*z(f.xuzf.u{'(HuHPHbHtCHt\Huss1H H H;MuoH[A^]8HP 蛼Hu@HPxHuHrH OH H;MteUHAVSHH+HHEHPHyHXF`HDždHPHuкHPHuHPHPHPHzHPHZHPH:aHPH8HXCHPL@L:%HEHE(E)E(E)pHEHE(P)0H`H@()H HHH()HH()pH}HuHPHLLAVSkHHEf.EuzEf.EuzEf.Eu{!HuHPHU1REf.pu!zEf.xuzEf.Eu{$HuHPHUPf.0u*z(Xf.8uz`f.@u{'aHuHPHPf.u*z(f.uz f.u{'HuHPH8f.u*z(f.uzf.u{'蛸HuHPHf.pu*z(f.xuzf.u{'8HuHPHrHtCHt\Hus1H H H;MuoH[A^]8HP諷Hu@HP舷HuH肷H _H H;MtuUHHH>HHEHuH]LHEFEHEH}HuH}HuHEHE(E)E(E)EH}HuEf.EuzEf.EuzEf.Eu{虶HuH}HU1Ef.EuzEf.Eu{!_HuH}HU>Hu.HHH H H;Mt&.1H H H;MuHĀ]UHHHHHEHuHLHEFEHEH}HuH}HuoHEHE(E)E(E)EH}HudEf.EuzEf.EuzEf.Eu{)HuH}HU1lEf.EuzEf.Eu{!HuH}HU/δHu.HbHH H H;Mt&71H H H;MuHĀ]UHAWAVSHHYHHEH`H ;HhD~DpHGtxyHHLw(MA)H`AuqHutnH`HutUHEHE(E)E(E)EttfH}HuEf.Ec1H \H H;MHĈ[A^A_]E1M@IHuHULxEf.EuzEf.EuzEf.Eu{!HuH`HU1@Ef.EuzEf.Eu{$òHuH`HU蟲H!H/HH uH H;MUHAWAVSHHIHHEH`Hc:HhD~DpHGtxyHHLw(MA)H`AuqHutnH`HutUHEHE(E)E(E)EttfH}HuEf.Ec1H LH H;MHĈ[A^A_]E1M@IHuHULEf.EuzEf.EuzEf.Eu{!HuH`HU10Ef.EuzEf.Eu{$賰HuH`HU菰H!HHH eH H;MwUHH=v!H5x!Ha1蚰w!uH[w!H=Tv!gHHv!]fDUHSPHH=0v!H5w!H 1Ev!u葰Hw!H=u!H5ݛHu!H袯t H u!tH[]H=u!H[]閰f.@UHAVSH0HuHeHEЋFEHEHEH}ȃu\HuXt^H]H=IHSAtH=iH:t HlLcHuLx1H0[A^]ÐUHAWAVSH(HuHdHED~D}HG]ԉ]؅yBHHLw(HEMA)AuQHuH}qt|}L}tYH=\LfAtOH=hLMt}utBA9v8tAv8IL/Hu6H}豵1H([A^A_]ILHuHHfDUHAVSH HuHyHEDvDuHG]]y THHt H(HtD9uEt"_8}Ht*11H}111 HSHuHcXHHH [A^]UHAVSH HuH\zHEDvDuHG]]y 褴HHt+H(Ht"D9u!Et-H¤Ht(1.H}111FH蚤HuH.HHH [A^]f.DUHAVSH HuHzHEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111艳HݣHuHqHHH [A^]fUHAWAVSH(HuHO{HED~D}HG]ԉ]؅y2HHLw(Mt}A)AuaHuH}ytc}EteAN@]fWfUf.u{AF@ILHu6H}舲1H([A^A_]IL΢HuHbHf.UHAVSH0HuHzHEDvDuHG]܉]y $HHt%H(HtD9uWEt$EHHt-16H}111̱%HEHuEHHH0[A^]f.UHAVSH0HuHzHEDvDuHG]܉]y dHHt*H(Ht!D9u Et,EE胡Ht-16H}111%HEVHuESHHH0[A^]UHAVSH0HuHzHEDvDuHG]܉]y 褰HHt'H(HtD9uEt)G@EƠHt-16H}111J%HE虠HuE薠HHH0[A^]f.UHAVSH HuH HEDvDuHG]]y HHt"H(HtD9uEt$V Ht(1.H}111華HHuHwHHH [A^]UHAVSH HuH[HEDvDuHG]]y 4HHt"H(HtD9uEt$蚡[Ht(1.H}111߮H 3HuHHHH [A^]UHAVSH HuH0HEDvDuHGEEy 脮HHtAH(Ht8xEtH}111C H}DH(茞Ht1HH [A^]HHf.UHAVSH HuH/HEDvDuHGEEy ԭHHtAH(Ht8xEtH}111蓭 H}蔭H0ܝHt1HH [A^]HbHf.UHAWAVSH(HuH?1HED~D}HGEԉE؅y"HHLw(Mt{xYAu^HuH}zt`H51H}HUج}tFuILH8 Hu*HH H}蛬H}z1H([A^A_]ÐUHAVSH HuH1zHEDvDuHG]]y DHHt!H(HtD9uEt#H_PlHt+1>H}111-H@HAHuHHxAFHHH [A^]ÐUH]ÐUHAVSH#HH=L5 [HLH[#HH={HL[A^]UH]ÐUHAVSH#HBH=#L5ZHLcH#HvH= HL[A^]>UHH=5f!H5#Hg!H 0艛f!u H= f!>He!]f.Ht.UHSPHH HSHHPKHH[]1f.UHSPHH=e!H5)#H2g!H (f!u H=ve!詚H5SxHce!H9t H Pe!tH[]H=@e!H[]-DUHSPHHHtHH[]1f.UH]"fDUHSPHHt%H辙HtHH8H5赙T{t0u<W)@H=|wHH[]1HH[]H5Ww1H[]UHSH(HuH5wHE؋FEHEHEuWH5wH}HUèHtQHÿH HSHHPKHH=vHLHH}Hu (H}оO1H}Ht Hu覙HH([]ÐUHH=ue!H5>#Hg!H 0e!u H=Ke!螘H?e!]f.HtXUHSPH@$H HSHHPHKHHHKHHHK HH HK(HH(HK0HH0HK8HH8H[]1UHSPHH=d!H5#HRf!H {4He!u H=d!H5vHd!Hyt H pd!tH[]H=`d!H[]mDUHSPHHHt!HH[]qf.UH]bfDUHSPHHt%HHtH6H8H5Y{t5uA@W))@)@ )@0H=uHH[](1HH[] H5u*1H[]f.UHSH(HuHluHE؋FEHEHEH5BuH}HUHt{Hÿ@H HSHHPHKHHHKHHHK HH HK(HH(HK0HH0HK8HH8H=tHNHH}Hu (H}оQ1H}Ht Hu訖HH([]ÐUHH=Ud!H5e!HuH 0ŕd!uH&e!H=d!蒕Hd!]ÐUH]fDUHSPHH=c!H5e!H'uH `xd!u謕Hd!H=c!-H5tHc!H轔t H c!tH[]H=c!H[]鱕fUHAVSH0HuH%JHEЋFEHEHEH}ȃu\Huxt^H]H=dtHsAtH=NHZt H茢LcHuL蘣1H0[A^]ÐUHAWAVSH(HuHIHED~D}HG]ԉ]؅ybHHLw(HEMA)AuQHuH}董t|}L}tYH=wsLAtOH=MLmttY}EMUtjEMUHHuHH؂HuHH5 Q1H H H;Mu/Hh[]1HPHHH聂HuDUHAWAVSHXHLHHEHuHHED~D}HG]]yԑHHLw(MA)AHuH}ґHuH})tr}HuHUL 讁HuHUH}!蒁Hu0Hc藁H nH H;Mt*H}1H DH H;MuHX[A^A_]IHuHUL%Hurf.UHSPHH=rH$tZH=J HtGH="mHt4H=lHt!H=I;HtHH[]H[]ÐUHH=T!H5V!HLrH 0赀 U!u HVU!H=OT!肀HCT!]ÐUH]fDUHSPHH= T!H5U!HqH PT!uHT!H=S!H5qHS!Ht H S!tH[]H=S!H[]顀fUHSH(HuH5HE؋FEHEHEH}Ѓu1Hujt3H}<HuHcAH([]þ赎1H([]UHAWAVSH(HuH 5HED~D}HG]ԉ]؅y 肎HHtdLw(HEMt8A)Au3HuH}蹎t}Hut;H~Ht<1@H}1)HE1ILPF~HuHcK~H([A^A_]f.@UHAVSH0HuH4HEЋFEHEuGH58H}HU荍}t@HHtCHH5oHPE1LE}Hu+H}Ⱦ51H0[A^]E1}HuLUHAVSH HuH4HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5nHPE1LE|HucH}111lRE1|HuCL]Ht6HH }t)H}HH1Q@H߾|1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y HHt#H(HtD9uA Et|Ht+12H}111茋!HLc{HuL{HHH([A^A_]f.DUHAWAVSH(HuHpHED~D}HG]ԉ]؅y "HHtWLw(MtNA)Au2HuH}腋t4uL3{HuHǺHH}諊1H([A^A_]fUHAVSH HuHqHEDvDuHG]]y tHHtH(HtD9uyzHt1H}111" zHHH [A^]f.@UHAWAVSH(HuHpHED~D}HG]ԉ]؅y ҉HHtXLw(MtOA)Au3HuH}5t5uLڢHyHuHwH}Z1H([A^A_]ÐUHAWAVSH(HuHqHED~D}HG]ԉ]؅y "HHttLw(MtkA)AuOHuH}腉tQH5pH}HU݈}t7uLHyHuHHH}莈1H([A^A_]DUHAWAVSH(HuH'qHED~D}HG]ԉ]؅y RHHtWLw(MtNA)Au2HuH}赈t4uL6cxHuHHH}ۇ1H([A^A_]fUHHHHGzu H=zO!]H5莇1]@UHHHHGzu H=O!]ԔH5NN1]@UHHHztuHH]H=O!]鐔H5 1]UHSPHH=EiH脺tZH=HqtGH=H^t4H=[HKt!H=1H8tHH[]dH[]f.@UHAWAVSH(HuHvHED~D}HG]ԉ]؅y RHHtWLw(MtNA)Au2HuH}赆t4uLڑavHuHcfvH}ۅ1H([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y 袅HHt^Lw(MtUA)Au9H5)H}HUn}t2}t9LHuHu;H}$1H([A^A_]ILHpeuHuHcjufDUHAWAVSH(HuHHED~D}HG]ԉ]؅y „HHtXLw(MtOA)Au3HuH}%t5uLDHtHuHgH}J1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt_Lw(MtVA)Au:H5'H}HUރ}t3}t:LH[HtHuH5IH}HUo}t7H虛HrHu"HBH([]H}о 1H([]ÐUHH=J!H5L!H oH 0r}K!uHK!H=J!rrHJ!]ÐUH]&fDUHSPHH=J!H5)L!HnH @rK!uHaK!H=ZJ! rH5snHGJ!Hqt H 4J!tH[]H=$J!H[]rfUHSH(HuH'HE؋FEHEHEH}Ѓu1HuZt3H},qHuHc1qH([]þ襀1H([]UHAWAVSH(HuH&HED~D}HG]ԉ]؅y rHHtdLw(HEMt8A)Au3HuH}詀t}Hut;HrpHt<1@H}1)HE1ILP6pHuHc;pH([A^A_]f.@UHAVSH0HuH{&HEЋFEHEuGH5{*H}HU}}t@HHtCHH5llHPE1LEoHu+H}Ⱦ%1H0[A^]E1voHuL UHAVSH HuHr&HEDvDuHG]]y~HHH(HD9u3HPxHt9HHH5kHPE1LEnHucH}111\~RE1nHuCLMHt6HHnt)HnHH1Q@H߾n1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y }HHt#H(HtD9uAEtmHt+12H}111|}!HLcmHuLmHHH([A^A_]f.DUHAWAVSH(HuHnHED~D}HG]ԉ]؅y }HHtWLw(MtNA)Au2HuH}u}t4uL,#mHuHHH}|1H([A^A_]fUHAVSH HuHnHEDvDuHG]]y d|HHtH(HtD9u蓕lHt1H}111| lHHH [A^]f.@UHAWAVSH(HuHnHED~D}HG]ԉ]؅y {HHtXLw(MtOA)Au3HuH}%|t5uLHkHuHg|H}J{1H([A^A_]ÐUHAWAVSH(HuHvnHED~D}HG]ԉ]؅y {HHtXLw(MtOA)Au3HuH}u{t5uL2H kHuH{H}z1H([A^A_]ÐUHAWAVSH(HuHonHED~D}HG]ԉ]؅y bzHHttLw(MtkA)AuOHuH}ztQH5H}HUz}t7uLH胓VjHuHHH}y1H([A^A_]DUHHHHGzu H=E!]H5~y1]@UHHHHGzu H= F!]ĆH5>>y1]@UHHHztuHH]H=&F!]逆H5x1]UHSPHH=fHttZH=vHatGH= HNt4H=KH;t!H=#H(tHH[]TwH[]f.@UHAWAVSH(HuHfHED~D}HG]ԉ]؅y BxHHtWLw(MtNA)Au2HuH}xt4uLʃQhHuHcVhH}w1H([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y wHHt^Lw(MtUA)Au9H5H}HU^w}t2}t9LHgHu;H}w1H([A^A_]ILHpUgHuHcZgfDUHAWAVSH(HuHHED~D}HG]ԉ]؅y vHHtXLw(MtOA)Au3HuH}wt5uL4HfHuHWwH}:v1H([A^A_]ÐUHAWAVSH(HuH HED~D}HG]ԉ]؅y vHHt_Lw(MtVA)Au:H5vH}HUu}t3}t:LHKHfHuH59H}HU_t}t7H蹍HdHu"H2uH([]H}оt1H([]ÐUHH=eA!H5B!H{lH 0dA!u H6B!H=/A!bdH#A!]ÐUH]鲓fDUHSPHH=A!H5B!HlH 0dA!u訿HA!H=@!cH5kH@!Hct H @!tH[]H=@!H[]dfUHSH(HuHHE؋FEHEHEH}Ѓu1HuJst3H} cHuHc!cH([]þr1H([]UHAWAVSH(HuHHED~D}HG]ԉ]؅y brHHtdLw(HEMt8A)Au3HuH}rt}Hut;H9 bbHt<1@H}q1)HE1ILP&bHuHc+bH([A^A_]f.@UHAVSH0HuHkHEЋFEHEuGH5kH}HUmq}t@HHtCHH5iHPE1LEaHu+H}Ⱦq1H0[A^]E1faHuLqUHAVSH HuHbHEDvDuHG]]ypHHH(HD9u3HPxHt9HHH5iHPE1LE`HucH}111LpRE1`HuCL=qHt6HH`t)H`HH1Q@H߾`1HH [A^]UHAWAVSH(HuHNkHED~D}HG]ԉ]؅y oHHtWLw(MtNA)Au2HuH}=pt4}Hut7LwH_Hu9H}Ko1H([A^A_]ILH_HuH_f.DUHAVSH HHDrHGD)߃tauqHUH lHMDu]]yHHnHHtMH~(HtDD9uMݎH^Hu-H^H"H=?!H [A^]{H5LlWn1HH [A^]H}111@nfUHHHHGzu H=?!]{H5|nm1]f.DUHAVSH HHDrHGD)߃t]umHUH qHMDu]]yHHmHHtIH~(Ht@D9uIu]Hu,HjH"H=?!H [A^]zH5wq;m1HH [A^]H}111$mfDUHHHHGzu H=?!]_zH5rl1]f.DUHAWAVSH8HuHevHED~D}HG]̉]Ѕy lHHtnLw(MteA)AuIHuH}mtKHuH} mt:HuHUL$H\HuH1mH}l1H8[A^A_]f.UHAVSH0^HG)ЃHuHvHEȉ]ЉUԉU؅ykHHH_(HHuH}E;E}eH5rH}HUb}tII14H}b1H}HtHuT HE1HHH[A^A_]E1HMH}LL蜂RHuH=nHuE;E}eH5lH}HU \}tHH14H}[1H}HtHu,M HE1HH8[A^A_]1HULLc{KHuHHH}Huf.UHAWAVSH8HuH-aHEDvDuHG]̉]ЅyB[HHL(HEMtaA)AH}AuTHu[tVH5aH}HUZHt=IƋE;E}aH5jH}HUZ}tHD10Z1H}HtHuK HE1HH8[A^A_]1HuLL-zJHuHLHH}Huf.@UHAWAVATSH@HuH_HEDvDuHG]]yZHHLg(HEHEMA)AAugH5`H}HUYHIH5`H}HUYHINjE;E}_H5giH}HUhY}t_HBH}8Y1H}HuGOE1HEHEMP1B1LLLxZIHt81H}Ht HuHJH}Ht Hu5JHH@[A\A^A_]HHH}HuȐUHH=+!H5^-!H9iH 05IM,!u H,!H=+!IH+!]ÐUH]|fDUHSPHH=`+!H5,!HhH H+!u8 H1,!H=*+!HH5hH+!H-Ht H +!tH[]H=*!H[]!IfUHSH(HuHHE؋FEHEHEH}Ѓu1HuWt3H} GHuHcGH([]þ5W1H([]UHAWAVSH(HuHHED~D}HG]ԉ]؅y WHHtdLw(HEMt8A)Au3HuH}9Wt}Hut;HGHt<1@H}V1)HE1ILPFHuHcFH([A^A_]f.@UHAVSH0HuH HEЋFEHEuGH5 H}HU V}t@HHtCHH5fHPE1LE3FHu+H}ȾU1H0[A^]E1FHuLVUHAVSH HuHHEDvDuHG]]ydUHHH(HD9u3HPxHt9HHH5eHPE1LEfEHucH}111TRE1FEHuCLUHt6HHEt)HEHH1Q@H߾lE1HH [A^]UHAWAVSH(HuHOHED~D}HG]ԉ]؅y bTHHtWLw(MtNA)Au2HuH}Tt4}Hut7LwHiDHu9H}S1H([A^A_]ILH.DHuH9Df.DUHAVSH HHDrHGD)߃tauqHUH YQHMDu]]yHHjSHHtMH~(HtDD9uM+wHCHu-HCH"H=)!H [A^]}`H5PR1HH [A^]H}111RfUHHHHGzu H=)!]`H5SR1]f.DUHAVSH HHDrHGD)߃t]umHUH VHMDu]]yHHJRHHtIH~(Ht@D9uIuvBHu,H H"H=)!H [A^]a_H5VQ1HH [A^]H}111QfDUHHHHGzu H=)!]^H5]WyQ1]f.DUHAWAVSH8HuH[HED~D}HG]̉]Ѕy BQHHtnLw(MteA)AuIHuH}QtKHuH}Qt:HuHULxtH:AHuHQH}P1H8[A^A_]f.UHAWAVSH(HuH]HED~D}HG]ԉ]؅y rPHHtXLw(MtOA)Au3HuH}Pt5HuLs@HuHHH}O1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y OHHtXLw(MtOA)Au3HuH}=Pt5HuLr?HuHfHH}JO1H([A^A_]ÐUHAWAVSH(HuH]HED~D}HG]ԉ]؅y OHHt`Lw(MtWA)Au;H5ZH}HUN}t4LHsr?HuH~HH}N1H([A^A_]fUHAWAVSH(HuH]HED~D}HG]ԉ]؅y RNHHt`Lw(MtWA)Au;H5ZH}HUN}t4LHqZ>HuH}HH}M1H([A^A_]fUHSPHH=b^H4tZH=*8H!tGH==Ht4H= }Ht!H=YHtHH[]LH[]f.@UHAWAVSH(HuHJHED~D}HG]ԉ]؅y MHHtaLw(MtXA)AuJHED~D}HG]ԉ]؅yBLHHLw(HEMtGA)AuBH5RH}HULHtLHoH<<HtS1H}Hu$814H}K1H}HtHu= HE1HH([A^A_]H;HH}Huf.@UHAWAVSHHHuHKHED~D}HG]̉]Ѕy 2KHHtwLw(MtnA)AuRHuH}KtTHuH}KtCHUHMH}Ln);Hu%H=VHu;H}J1HH[A^A_]fUHAWAVSHHHuHJHED~D}HG]܉]ybJHHLw(MA)AuoHuH}JtqHuH}Jt`H5ZH}HUJ}tFHUHMH}LIm4:Hu%H= VHu:H}ȾI1HH[A^A_]f.UHAWAVSHHHuHIHEDvDuHG]ԉ]؅ybIHHL(HEMtaA)AAuXH5PH}HU*IHtRIH}HuIt>E;E}eH5XH}HUH}tII14H}H1H}HtHu : HE1HHH[A^A_]E1HMH}LL@l8HuH=THu,9HH}Huf.fUHAWAVSHHHuHHHEDvDuHG]ԉ]؅yHHHL(HEMtaA)AH}AuTHu}HtVH5NH}HUGHt=IƋE;E}aH5WH}HUG}tIE10iG1H}HtHu8 HE1HHH[A^A_]E1HUH}LLj7HuH=XSHu7HH}HuUHAWAVATSHPHuHZGHEDvDuHG]ĉ]ȅyFHHLg(HEHEMA)AAugH5yMH}HUFHIH5YMH}HUlFHINjE;E}_H57VH}HU8F}tdICH}F1H}HuLTE1HEHEMP1GE1H}LLLi%6Ht81H}Ht Hu7H}Ht Hu7HHP[A\A^A_]H=QHuJ6HH}Huf.UHAWAVSH(HuHuIHED~D}HG]ԉ]؅y 2EHHt`Lw(MtWA)Au;H5TH}HUD}t4LHh:5HuHtHH}D1H([A^A_]fUHAWAVSH(HuHHHED~D}HG]ԉ]؅yrDHHLw(HEMtDA)Au?H5+KH}HU>DHtLHgo4HtS1H}Hu$814H}C1H}HtHu95 HE1HH([A^A_]HsHH}HufUHAWAVSH8HuH]IHED~D}HG]̉]Ѕy rCHHtmLw(MtdA)AuHHuH}CtJHuH}Ct9HuHULfm3HuHsHH}B1H8[A^A_]f.fUHAWAVSH8HuHHHED~D}HG]ԉ]؅yBHHLw(MA)AueHuH}CtgHuH}CtVH5CRH}HUDB}tE;E}eH58QH}HU9A}tHH14H}A1H}HtHu\2 HE1HH8[A^A_]1HULLAd$1HuHpHH}Huf.UHAWAVSH8HuH]FHEDvDuHG]̉]Ѕyr@HHL(HEMtaA)AH}AuTHu@tVH5GH}HU)@Ht=IƋE;E}aH5OH}HU?}tHD10?1H}HtHu 1 HE1HH8[A^A_]1HuLL c/HuH|oHH}Huf.@UHAWAVATSH@HuHEHEDvDuHG]]y0?HHLg(HEHEMA)AAugH5EH}HU>HIH5EH}HU>HINjE;E}_H5NH}HU>}t_HBH}h>1H}HuGOE1HEHEMP1B1LLLa.Ht81H}Ht Hux/H}Ht Hue/HH@[A\A^A_]HmHH}HuȐUHH=!H5N!HN1j.B!uB H!H=!7.Hx!]fDUHSPHH=`!H5!H1.!uH6!H=/!-H5ʶH!Hr-t H !tH[]H=!H[]f.f.@UHAVSH0HuHHEЋFEHEHEH}ȃuoHu(=tqH]H=6H#pAt1H=.H ptH=hHot H);Lc,HuL,5<1H0[A^]f.@UHAWAVSH(HuH|HED~D}HG]ԉ]؅y;HHLw(HEMA)AuhHuH}!<}L}tlH=%LoAtbH=LntOH=WLnt)Ht+12H}1118!HHc)HuH)HHH [A^]ÐUHH=!H5n!H}ZH 0%)]!uH!H=!(H!]ÐUH]2\fDUHSPHH=p!H5 !HZH (!u8HA!H=:!(H5YH'!H(t H !tH[]H=!H[])fUHSH(HuHHE؋FEHEHEH}Ѓu;Hu7t=H]H=WYHjt/H荦Hc'Hu'71H([]ûl'HuHq'H([]UHAWAVSH(HuHLHEDvDuHG]ԉ]؅y 6HHtwL(HEMtKA)AuFHuH}6t1}LutNH=pXLitfL覥&Ht?1CH}/61,HE1 ILLPp&HuHcu&H([A^A_]ûN&HuUHAVSH0HuHHEЋFEHEuGH5H}HU5}t@HHtCHH5WHPE1LE%Hu+H}ȾU51H0[A^]E1%HuL=6UHAVSH HuHHEDvDuHG]]y5HHH(HD9u3HPxHt9HHH5VHPE1LE%HucH}1114RE1$HuCL}5Ht6HH)%t)H#%HH1Q@H߾ %1HH [A^]UHAVSHPHndHHE^HG)Ѓ&HuHHE]UĉUȅy3HHH_(HHuH}3I}HHuHHuHHE]UĉUȅyh3HHH_(HH}Hu3toH}Hu3t^H}Hu3tMI}uUMEHHI8#HuLC#H521H cH H;MuHP[A^]1HZff.@UHAWAVSHXHbHHEHuHRKHED~D}HG]]yD2HHLw(MA)AHuH}B2HuH}2tr}HuHULU"HuHUH}1"Hu0Hc"H aH H;Mt*dH}i11H aH H;MuHX[A^A_]IHuHUL!Hurf.UHH=!H5~!HZH 0!m!uݧH!H=!!H!]ÐUH]LfDUHSPHH=!H5!HZH P!!uxHQ!H=J!!H5eZH7!H t H $!tH[]H=!H[]!fUHAVSH0HuHHEЋFEHEHEH}ȃHud0H]H=YH[cAtDH=f HBct1H=% H/ctH=Hct HN.LcHuLZ/1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y"/HHLw(HEMA)Au{HuH}Q/}L}tH=XLBbAtuH=M L)btbH= LbtOH=tLbtAtH=;H>t H Lc HuL  1H0[A^]ÐUHAWAVSH(HuH\HED~D}HG]ԉ]؅y HHLw(HEMA)AuQHuH} t|}L}tYH=HIL=AtOH=NL=t HuHHH} 1H8[A^A_]f.UHAWAVSH(HuH]BHED~D}HG]ԉ]؅y r HHtmLw(MtdA)AuHHuH} tJHuL5 H Hu1Ht9H5H H H} 1H([A^A_]HHUHAWAVSH(HuHBHED~D}HG]ԉ]؅y HHtmLw(MtdA)AuHHuH} tJHuL_ H Hu1Ht9H5ԹH4 H H} 1H([A^A_]HHUHAWAVSH(HuHLHED~D}HG]ԉ]؅y HHtYLw(MtPA)Au4HuH}M t6HuLY H߿ HuH H}Y 1H([A^A_]UHAVSH HuHHEDvDuHG]]y $ HHt H(HtD9uEt"_8M Ht*11H}111 H# HuHc( HHH [A^]UHAWAVSH(HuHCHED~D}HG]ԉ]؅y r HHtgLw(Mt^A)AuBHuH} tD}utHA9tAILi Hu6H} 1H([A^A_]IL1 HuHHUHAVSH HuHDHEDvDuHG]]y HHt#H(HtD9uEt%躽 Ht*11H}111> H落 HuHc蕽 HHH [A^]@UHAVSH HuHEHEDvDuHG]]y HHt+H(Ht"D9u!Et-H Ht(1.H}111 Hڼ HuHnHHH [A^]f.DUHAVSH HuHBFHEDvDuHG]]y $ HHt(H(HtD9uEt*H1E Ht(1.H}111 H HuHHHH [A^]fUHAWAVSH(HuHGHED~D}HG]ԉ]؅y r HHtaLw(MtXA)Au}utBA9vptAvpILo Hu6H} 1H([A^A_]IL7 HuHHfDUHAVSH HuHHGHEDvDuHG]]y HHt H(HtD9uEt"_p轺 Ht*11H}111A H蓺 HuHc蘺 HHH [A^]UHAVSH HuHGHEDvDuHG]]y HHt+H(Ht"D9u!Et-H Ht(1.H}111 Hڹ HuHnHHH [A^]f.DUHAVSH HuHGHEDvDuHG]]y $ HHt(H(HtD9uEt*H1E Ht(1.H}111 H HuHHHH [A^]fUHAWAVSH(HuH>HHED~D}HG]ԉ]؅y r HHtaLw(MtXA)Au}utBA9vttAvtILo Hu6H} 1H([A^A_]IL7 HuHHfDUHAVSH HuH,HHEDvDuHG]]y HHt H(HtD9uEt"_t轷 Ht*11H}111A H蓷 HuHc蘷 HHH [A^]UHAVSH HuHCHHEDvDuHG]]y HHt+H(Ht"D9u!Et-H Ht(1.H}111 Hڶ HuHnHHH [A^]f.DUHAVSH HuHAHHEDvDuHG]]y $ HHt(H(HtD9uEt*H1E Ht(1.H}111 H HuHHHH [A^]fUHAWAVSH(HuHPHHED~D}HG]ԉ]؅y r HHtuLw(MtlA)AuPHuH} tRH5TH}HU- }t8uLHU Hc HuHn H} 1H([A^A_]@UHAWAVAUATSH8HHZHG)σk|HUH=JH}]MĉMȅyHHu HHH^(HHuH} H5=H}HU- }IH5#oH}HU }IH5=H}HU }vIH5=H}HU }UIH5=H}HU }4HEHuH}6 H5V=H}HUr }uHHLLMMPuuv H H= H8[A\A]A^A_] HUH=HH}]MĉMȅyHH HHH^(Ht|HuH}d tkH5_H}HU }tQIH58H}HU }t4uHLH Hز HuH H5GS 1H8[A\A]A^A_]f.fUHSH8^HG)ЃtHuH>LHEЉ]؉U܉Uy HHH_(HH5lH}HU }HH H HyHuHKHEЉ]؉U܉Uy HHtmH_(HtdHuH} tSH5klH}HUT }t9HuHH' H艱 HuH蔱 H8[]H5DK 1H8[]f.@UHAVSH HuHlLHEDvDuHG]]y HHtH(HtD9u Ht1H}111t HoHHH [A^]UHAWAVATSH0HuHLHEDvDuHG]̉]Ѕy0 HHLg(MA)AHuH} H5NH}HUۿ }twIH5m9H}HU辿 }tZIH5H}HU衿 }t=uLLLIu ү HuHcׯ H}L 1H0[A\A^A_]ÐUHAWAVSH(HuHDHED~D}HG]ԉ]؅y  HHtuLw(MtlA)AuPHuH}o tRH5MH}HU; }t8uLH H HuH H}} 1H([A^A_]@UHAWAVSH(HuHCHED~D}HG]ԉ]؅y B HHtuLw(MtlA)AuPHuH}蟾 tRH5iH}HU }t8uLH H3 HuH> H}譽 1H([A^A_]ÐUHH= H5 ḨH 05  u聮 HV H=O  HC ]ÐUH] fDUHSPHH= H5 HgH Э  u H H= 蝭 H53Hת H- t H Ī tH[]H= H[]! fUHAVSH0HuHbHEЋFEHEHEH}ȃu\Hu t^H]H=H AtH=;gH t H Lc芬 HuL菬  1H0[A^]ÐUHAWAVSH(HuH\bHED~D}HG]ԉ]؅yһ HHLw(HEMA)AuQHuH} t|}L}tYH=L AtOH=NfL tEEEEEEUHuH Ef.Eu"z Ef.EuzEf.Eu訝 HH}HU1 HuHHE]UĉUȅy HHH_(HH}Hue tqH}HuT t`H}HuC tOH}HuD t>EMUuH6 HuH}HH55` 1H H H;MuHx[]1HZ f.DUHAWAVSH(HuHAHED~D}HG]ԉ]؅y  HHt`Lw(MtWA)Au;H5@H}HUΫ }t4LH HuHHH}肫 1H([A^A_]fUHAVSH HuH6AHEDvDuHG]]y D HHt H(HtD9u Hm Ht1H}111 H HHH [A^]f.fUHAVSH HuH HEDvDuHG]]y 褪 HHtH(HtD9uEt!1Κ Ht+12H}111R !HPH裚 HuH讚 HHH [A^]UHSH8^HG)Ѓ!HuHƥHEЉ]؉U܉Uy٩ HHwH_(HjHuH}U U}a1 H;HuHXHEЉ]؉U܉Uyk HHH_(HH}Huɩ H}Hu贩 H}Hu蟩 }uUM HH< HHuHHEЉ]؉U܉Uy HHtcH_(HtZHuH}E tIH5 H}HU腨 }t/}HutZHH 跘 Hu\H548 1H8[]1HHuHHpHt HuCH HHY HuHHH8[]HHxH/ HuHƨ H8[]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y 肧 HHtJLw(MtAA)Au%HuH} t'}t.1薗 Hu=H} 1H([A^A_]HuILHcW HuH\ UHAWAVSH8HuHKnHED~D}HG]ԉ]؅y 貦 HHtqLw(MthA)AuLHuH}- tNH5 H}HUm }t4}Hut7LH 蟖 Hu9H}! 1H8[A^A_]ILHd HuHHUHAWAVSH8HuHdnHED~D}HG]ԉ]؅y ¥ HHtqLw(MthA)AuLHuH}= tNH5H}HU} }t4}Hut7LH 试 Hu9H}1 1H8[A^A_]ILHt HuHHUHAVSH HuHHEDvDuHG]]y Ԥ HHtH(HtD9uEt!1 Ht+12H}111肤 !HHcӔ HuHؔ HHH [A^]UHAWAVSH8HuH4HED~D}HG]̉]Ѕy" HHLw(HEEMD)؃rH}11ƣ uD9}H}Hul t]D}ȋ]D9}H}Hu1 t@Hu؋ULR Hu'HuHE1HEEMo1HH8[A^A_]DUHAVSH HuHHEDvDuHG]]y  HHtH(HtD9u @ Ht1H}111Ģ HHHH [A^]UHHHztuHH]H= ] H5`j 1]UHSPHH=4H tZH=H tGH=GMH t4H=H t!H= MH tHH[]Ġ H[]f.@UHSH(HuHHE؋FEHEEȃrH}о蕡 1[H5xH}HU菡 H1}tH5H}HU }t7H H+ Hu"H¡ H([]H}о蠠 1H([]ÐUHH=E H5ޘ H=H 0% ͗ u-H H= H ]ÐUH] fDUHSPHH= H5y H-=H h uX-H H= 荐 H5<H H t H tH[]H=t H[] fUHAVSH0HuHEHEЋFEHEHEH}ȃHuԟ H]H=b<H AtDH=ՀH t1H=H tH=IH t H辝 LcL HuLQ ʞ 1H0[A^]UHAWAVSH(HuHEHED~D}HG]ԉ]؅y蒞 HHLw(HEMA)Au{HuH} }L}tH=I;L AtuH=L tbH=L tOH=HLs t<tHLHUHpLMb !IHLHUHpLM(v HuLH(1- Ef.EuzEf.EuzEf.Eu{$v HuH(HUɆ pf.Pu'z%xf.XuzEf.`u{'/v HuH(Hpi E~>1AfA.Du z HH9u!u HuH(LD& u HzHUHHHH9ns襸 HHHH9t HtC H}v  UHAWAVSHHH9HHEHHPNHDvDHGy貄 HHL(MA)HAaHu譄 ZHHu萄 =HH豄 "HH薄 HH@: HH HLLJ HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL n 1H HH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!r HuHHU1 Ef.`u$z"Ef.huzEf.pu{$}r HuHHU躂 Yr HuH见 @f. u*z(Hf.(uzPf.0u{'q HuHH@4 f.u*z(f.uzf.u{'q HuHHс pq HuHƀ Oq HHcPq H 'H H;M9 DUHAWAVSH(HuHHEDvDuHG]ԉ]؅y蒀 HHL(MA)AumHuH} toH5\H}HUE }tUIH5\H}HU( }t8}utH} 1H([A^A_]ILLHHp HuHcp UHAWAVAUATSHHկHHEHPHHXF`HGdhyP HHHG(HpLPL~ AC6HcH HE1EIcHLEL~~ AH]C?HcH~ HE1EIcHIDHpHI͋`+dHPHH HPHu~ HPHuDz~ HPHL~ tiHPLDI~ tSHEHEf(Ef)EDHxE#A1HxzHP} E1HHH9t Ht躰 HHH9t Ht蝰 HHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM蕋 HpHHUHMMPEf.EuzEf.EuzEf.Eu{$ j HuHPHUJz E~E1HMfA.uzHH9xu"i HuHPHUDz E~>1ADf.u z HH9Eu!}i HuHPLDy \i HKL-IEHHH9?D; HHHH9tHt ٫ HHHH9t Ht赫 Hi  fUHAVSH HuHJHEDvDuHG]]y Dx HHt%H(HtD9uEt1 Hhh Ht51H}111w HH [A^]HpH3h HuHtH5XaHx H`h HHH뱐UHAWAVSHhHܧHHEHuHHED~D}HG]]ydw HHLw(MA)H}AuZHufw HEHE(E)E}t?('b)EH?HEb1f.EuRzP2v eIHuLXHcEf.EuzEf.EuzEf.Eu{f HuH}HU1 w f Ht1H H H;Mu#Hh[A^A_]Hf H ~H H;Mt蔩 UHHH^HHEHHzHFHDžHHu v HHp u HEHE(E)E(p(M(U(]) )0)@)P(E)`H}Hp" Ef.EuzEf.EuzEf.Eu{!oe HuHHU1u pf. xf.(Ef.0uyzwEf.8uhzfEf.@uWzUEf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'d HuHHp t gd Hu.HHH AH H;Mt&W s 1H H H;MuH]fUHSHHHHHEHHHFHDžHHuкs HHys HEHE(E)EHHHv H}H΄ Ef.EuzEf.EuzEf.Eu{!!c HuHHU1as f.f.f.f.f.pjf.TNf.82f.f.f.f. f.( f.0(f.8tn0f.@XR8f.H<6@f.P Hf.XPf.`Xf.h`f.phf.xpf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{' ` HuHHDp _ Hu.HwHH H H;Mt&Ӣ Lo 1H H H;MuHH[]@UHAWAVSHHiHHEHHHD~DHGyn HH Lw(MA)HAHun HHP n HEHE(E)E(P(`(p(]))) )0(E)@tiH}HP Ef.Efm 1H "H H;MH[A^A_]E1MIHuHPLxEf.EuzEf.EuzEf.Eu{!] HuHHU1n Pf.Xf.`f.hf.unzlpf. uZzXxf.(uFzDEf.0u5z3Ef.8u$z"Ef.@uzEf.Hu{'\ HuHHP m \ HcH7HH }H H;M[菟 f.UHAWAVSHHHIHHEHHcHD~DHGyk HHLw(MA)HAHuk HHk thHEHE(E)EHH衞 tiH}H| Ef.Efj 1H .H H;MHH[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!Z HuHHU1k f.f.f.f.f.~xf.b\f.F@f.*$f.f.f.f.f. f.(| f.0f`(f.8JD0f.@.(8f.H @f.PHf.XPf.`Xf.h`f.phf.xunzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'W HuHHg W H3HHH YH H;M+k UHSH(HuHHE؋FEHEH}ЃuEHuPg tG}Zx HW Hu2Ht6H5)PHg H1W H([]þif 1H([]H]HH([]UHSH(HuHHE؋FEHEH}ЃuEHuf tG}w HdV Hu2Ht6H5OHf HV H([]þe 1H([]HHH([]ÐUHH=ea H5b HXH 0EV a uH6b H=/a V H#a ]ÐUH]$i fDUHSPHH=a H5b HH U a uHHa H=` U H5H` H=U t H ` tH[]H=` H[]1V fUHAVSH0HuH HEЋFEHEHEH}ȃuoHud tqH]H=0H At1H='Hڗ tH=8HǗ t Hb LcT HuLT d 1H0[A^]f.@UHAWAVSH(HuHL HED~D}HG]ԉ]؅yc HHLw(HEMA)AuhHuH}c }L}tlH=L AtbH=~&Lɖ tOH='L趖 tO }t0}t7LHCi t? Hu9H}N 1H([A^A_]ILH9? HuH~HUHAWAVSH(HuHP|HED~D}HG]ԉ]؅y N HHt\Lw(MtSA)Au7H5}H}HU^N }t0}t7LHh > Hu9H}N 1H([A^A_]ILHY> HuH}HUHAWAVSH(HuHЏHED~D}HG]܉]y M HHt#H(HtD9uAEt= Ht+12H}111\M !HLc= HuL= HHH([A^A_]f.DUHAVSH HuHpGHEDvDuHG]]y L HHtH(HtD9uf = Ht1H}111L Hc= HHH [A^]f.UHSHH^HG)Ѓ@HuH HEЉ]؉U܉UyBL HH!H_(HHuH}L HuH}yL EMHe 2< HHuH HEЉ]؉U܉UyK HHH_(HH}HuL txH}HuK tgH}HuK tVH}HuK tEEMU]HNe ; HuHc; HH[]H5J 1HH[]1Hcf.UHAWAVSH(HuHHED~D}HG]ԉ]؅y J HHtYLw(MtPA)Au4HuH}J t6EL*d : HuHc: H}9J 1H([A^A_]UHAVSH HuH_ HEDvDuHG]]y J HHtH(HtD9uc 0: Ht1H}111I HyHHH [A^]UHAWAVSHHHuH5 HED~D}HG]܉]yrI HHLw(MA)H}AurHuI ttH}HuI tcH}HuI tRH}HuI tAEMU]Lb 79 HuHxHH 1HH[A^A_]E1MYf.fUHAWAVSH8HuH HED~D}HG]̉]Ѕy bH HHt^Lw(MtUA)Au9HuH}H t;ELLb El8 HuEi8 H}G 1H8[A^A_]f.UHAWAVSHxH xHHEHxH\ HED~D}HG]]yG HH Lw(MA)HxAHuG HxHutG (E(M)M)EuHUL` Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$$7 HuHxHUaG 7 HuHc7 ~F 1H vH H;MuHx[A^A_]E1My fUHAWAVSHxHvHHEHxH HED~D}HG]]yF HH Lw(MA)HxAHu_F HxHuE (E(M)M)EuHULY_ Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$5 HuHxHUE 5 HuHc5 D 1H IuH H;MuHx[A^A_]E1MFx fUHAVSH HuH HEDvDuHG]]y D HHt H(HtD9uQ^ H4 Ht1H}111QD HH [A^]HtH5-H3E H4 HH!tHf.fUHAWAVAUATSHhHuHa HEFEHGMĉMȅyC HH{L(H}VC AC6HcHxC Lx1EIcM,LDMmE+EăH}HuC H}LDC DEArII9IDI91)HHHHtf.I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}\B 1HxHEH9OTE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9WuLL?[ E~;1AfA.Du z HH9u1 HuH}LDA r1 Ht.1HxHEH9t Ht#t HHh[A\A]A^A_]HpHHxHEH9uHHxHEH9t Hts H2  f.fUHAWAVSH(HuH'HED~D}HG]܉]y b@ HHt!Lw(MtD9uEt#Ih0 Ht.1:H}111@ )IL8I\0 HuLz? HHH([A^A_]fUHAWAVSHHH pHHEHuHHED~D}HG]]y? HHLw(MA)H}AHuк? (E)EHuLX Ef.EuzEf.Eu{i/ HuH}HU1? K/ Hu,HcP/ H 'oH H;Mt&=r > 1H oH H;MuHH[A^A_]f.UHAWAVAUATSHxHuHyHEFEHGMĉMȅy`> HHL(H}= AC$HcH`8> L`1EIcM,LDEMTE+Eă-H}HuX> +H}HuC> H}Hu@> H}LD= E;E}H}Hu > DEArII9IDI91)HHHHtI4ItHHuHuI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}< 1H`HhH9t Hto HHx[A\A]A^A_]E1*؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9]EMuMLLU E~;1AfA.Du z HH9u+ HuH}LD; + HH*kHH`HhH9HH`HhH9t Htn HW,  UHAWAVAUATSHxHuHHEFEHGMĉMȅy: HHL(H}&: AC$HcH`: L`1EIcM,LDEMTE+Eă-H}Hu: +H}Hu: H}Hu: H}LD+: E;E}H}Hu\: DEArII9IDI91)HHHHtI4ItHHuHuI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}8 1H`HhH9t Htl HHx[A\A]A^A_]E1*؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9]EMuMLLQ E~;1AfA.Du z HH9u( HuH}LDK8 ' HHzgHH`HhH9HH`HhH9t Htmj H(  UHAWAVSH(HuHHED~D}HG]ԉ]؅y 7 HHtaLw(MtXA)Au}utBA9vXtAvXIL& Hu6H}6 1H([A^A_]ILP& HuH[fHfDUHAVSH HuHHEDvDuHG]]y $6 HHt H(HtD9uEt"_XM& Ht*11H}1115 HX#& HuHc(& HHH [A^]UHAVSH HuHHEDvDuHG]]y t5 HHt+H(Ht"D9u!Et-HP% Ht(1.H}1115 H`j% HuHdHHH [A^]f.DUHAVSH HuHrHEDvDuHG]]y 4 HHt(H(HtD9uEt*H1P$ Ht(1.H}111Y4 Hh$ HuHAdHHH [A^]fUHAWAVSH(HuH`HED~D}HG]ԉ]؅y 4 HHtgLw(EMtCA)H}Au:HuC4 t)}Et?A8F|tAF|IL# Ht81>3 1+E1#ILp# HuHWcHH([A^A_]fUHAVSH HuHHEDvDuHG]]y 3 HHt$H(HtD9uEt&|9# Ht*11H}1112 Hx# Hu" HHH [A^]UHAVSH HuHeHEDvDuHG]]y d2 HHt+H(Ht"D9u!Et-Hp" Ht(1.H}1112 HZ" HuHaHHH [A^]f.DUHAVSH HuHHEDvDuHG]]y 1 HHt(H(HtD9uEt*H1p! Ht(1.H}111I1 H! HuH1aHHH [A^]fUHAWAVSH(HuHHEDvDuHG]܉]y 0 HHt H(HtD9uJ I! Ht!1H}1110 HH([A^A_]Mt3Ld ILH.! HHu LL HHV`H뮐UHAVSH0HuHHEDvDuHG]܉]y $0 HHt"H(HtD9uI EK Ht1H}111/ E3 HHH0[A^]UHAVSH HuHHEDvDuHG]]y / HHt"H(HtD9uEt$I  Ht(1.H}111// H HuH_HHH [A^]UHHHztuHH]H=V4 ]@< H5V. 1]UHAWAVSH(HuHoHED~D}HG]ԉ]؅y . HHtaLw(MtXA)Au}utBA9vxtAvxIL Hu6H}. 1H([A^A_]ILW HuH]HfDUHAVSH HuH]HEDvDuHG]]y - HHt H(HtD9uEt"_x Ht*11H}111a- H HuHc HHH [A^]UHAVSH HuHtHEDvDuHG]]y - HHt+H(Ht"D9u!Et-H" Ht(1.H}111, H HuH\HHH [A^]f.DUHAVSH HuHrHEDvDuHG]]y D, HHt(H(HtD9uEt*H1e Ht(1.H}111+ H= HuH[HHH [A^]fUHAWAVSH8HuHHED~D}HG]̉]Ѕy + HHtmLw(MtdA)AuHHuH}+ tJHuH}+ t9HUHuL,E  HuHc H}+ 1H8[A^A_]f.fUHSH(HuHRHE؋FEHEEȃrH}о* 1[H5ZH}HU* H1}tH5YH}HU) }t7HC H; Hu"H* H([]H}о) 1H([]ÐUHH=u/ H51 HH 05 / u HF0 H=?/  H3/ ]ÐUH].U fDUHSPHH=/ H50 H=H  / uH/ H=.  H5 H. H- t H . tH[]H=. H[]! fUHAVSH0HuH HEЋFEHEHEH}ȃuoHu( tqH]H=zH[ At1H=H[ tH=( H[ t H& Lcw HuL| ' 1H0[A^]f.@UHAWAVSH(HuH< HED~D}HG]ԉ]؅y' HHLw(HEMA)AuhHuH}' }L}tlH=iLZ AtbH=ݠLZ tOH= LZ t<tHLHUHpLM: !IHLHUHpLM( HuLH(1 Ef.EuzEf.EuzEf.Eu{$< HuH(HUy pf.Pu'z%xf.XuzEf.`u{' HuH(Hp E~>1AfA.Du z HH9u! HuH(LD u HzH=HHHH9nsU@ HHHH9t Ht? H-  UHAWAVSHhH<HHEHuHHED~D}HG]]yt HHLw(MA)H}AuTHuv HEHE(E)E}t9(7)EHE31f.EuRzP2 eIHuLXHcEf.EuzEf.EuzEf.Eu{ HuH}HU16 Ht1H ;H H;Mu#Hh[A^A_]H H ;H H;Mt> fDUHAWAVSHHHi;HHEHH HDvDHGy HHL(MA)HAaHu ZHHu =HH "HH HH@j HHJ HLLz HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL5 n- 1H x9H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{! HuHHU1A Ef.`u$z"Ef.huzEf.pu{$ HuHHU HuH @f. u*z(Hf.(uzPf.0u{'* HuHH@d f.u*z(f.uzf.u{' HuHH HuH  HHc H W7H H;Mi: DUHAWAVSH(HuHIlHEDvDuHG]ԉ]؅y HHL(MA)AumHuH} toH5 H}HUu }tUIH5 H}HUX }t8}utH} 1H([A^A_]ILLHHF HuHcK UHAWAVAUATSHH6HHEHPHmHXF`HGdhy HHHG(HpLPL AC6HcHK HE1EIcHLEL AH]C?HcH  HE1EIcHIDHpHI͋`+dHPHH0 HPHu HPHuD HPHL tiHPLDy tSHEHEf(Ef)EDHxE#A1HxzHP E1HHH9t Ht6 HHH9t Ht6 H3HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM+ HpHHUHMMPEf.EuzEf.EuzEf.Eu{$= HuHPHUz E~E1HMfA.uzHH9xu" HuHPHUD0 E~>1ADf.u z HH9Eu! HuHPLD HKL-/IEHHH9?Dk2 HHHH9tHt 2 HHHH9t Ht1 H  fUHAVSH HuHzjHEDvDuHG]]y t HHt%H(HtD9uEt1* H Ht51H}111 HH [A^]HpHc HuHtH5 H H HH-H뱐UHHH.HHEH`H*HhFpHDžtH`0Hu )H`Hu  HEHE(E)E(E(M)E)MH}Hu) Ef.EuzEf.EuzEf.Eu{!O HuH`HU1 Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$ HuH`HU3 Hu.Hf,HH ,H H;Mt&/ ; 1H ,H H;MuHĠ]@UHHH^,HHEH H+H(F0HDž4H Hu H Hu xHEHE(E)E(E(M(U(])@)P)`)pH}Hu.' Ef.EuzEf.EuzEf.Eu{! HuH HU1 Ef.@uyzwEf.HuhzfEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$ HuH HU Hu.HJ*HH *H H;Mt&-  1H j*H H;MuH]UHAWAVSHH9*HHEH@HpHHD~DPHGTXy HHLw(MA)H@AuHu t|H@Hu tcHEHE(E)E(E(M)`)pTtfH}Hu$ Ef.Ec 1H .)H H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{! HuH@HU1 Ef.`u5z3Ef.hu$z"Ef.puzEf.xu{$m HuH@HU I HH'HH (H H;M1+ f.UHAWAVSHH'HHEHHpHD~DHGyb HHLw(MA)HAHu] HH`= HEHE(E)E(`(p(U(]) )0)@)PtiH}H`l" Ef.Efe 1H &H H;MmH[A^A_]E1MIHuH`LEf.EuzEf.EuzEf.Eu{!Q HuHHU1 `f. hf.(unzlpf.0uZzXxf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{' HuHH` m HH$HH C%H H;MU( UHH=uH5 Hg H 0 u H=KN H?]f.UHSPHtH' H9t H1HH[]f.fUHSPHH=H5y H H  hu H= H5HHI t H tH[]H=H[]= DUHSPHHHt& HH[]A f.UH]2 fDUHAWAVAUATSH(IH(LH#HHHH@H(Ll& HEEHp#LkLH@H(L,& L5C#ILHDžHDžHDžHDžDž IwHt H% H}LSu@t H}HuHH}= IEt H}% LH(Lt H% Le% H5n"HHB% H(N% LH([A\A]A^A_]IEtH}1% ILH(Lt H% L$ IH5!HH$ IH($ L  f.UHAWAVATSHAHHEHEL%L9gH5HUD IHtcL9ct{H5HUH# HtEAtgEAOAW A+A+WыHp ++p19Q$ H HLL9cuHCAuA;u AO;HuAO;HuAO ;H t1H}Hu H}HtHtt " uHH8H5 1H[A\A^A_]f.UHSPHHt%H^ HtHH8H5Q U Q{t-u93# (H=HH[] 1HH[]HH5| 1H[]UHSPAHHH1P HH[]f.UHSH(HuH'HE؋FEHEHEu^H5H}HU3 HtXHÿc" H9t KHKHK H H=H HH}Hu (H}о 1H}Ht Hu HH([]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅yb HHLwHEMtSA)AuNH5H}HU. Ht$AHANHAN@ AF P HtS1H}Hu$814H} 1H}HtHu HE1HH([A^A_]HHH}HuUHAVSH HuHHEDvDuHG]]y T HHt"HGHtD9u(C{ Ht1H}111 HHHH [A^]f.UHAWAVSH(HuHHED~D}HG]܉]y HHtLwMtD9u Ht1+H}111g H5 LX H HHH([A^A_]ÐUHAWAVSH(HuHHED~D}HG]܉]y  HHtLwMtD9uC Ht1+H}111 H5X L H` HHH([A^A_]ÐUHAVSH@HHHEFeHuHHEEHGẺEЅyR HH3LwM&H}5Huغg HEAUANM9HuHHEEHGẺEЅy HHLwMH}Huغ t{HuH} teHEA+UUAN+MM9uH 9t HuH}HU1 ~ HuHHH5 1H FH H;Mu+H@[A^]þ Ծ 1 f.UHAWAVSH8HuHHEDvDuHG]̉]Ѕy HHLMA)H}AueHu tbHMHMAWUAG E9u;Etr HuH}HU1 T HuHH 1H8[A^A_]UHAVSH HuH( HEDvDuHG]]y HHt/HGHt&D9u%;H H1;H  Ht1H}1112 H HHH [A^]f.UHAWAVSH8FmHuH HEEHGẺEЅy HHLwHEM&.H5eH}HU Ht7A; AN;H|AN;HAN ;H }1 H1H}H"HuH HEEHGẺEЅy HHt~LMtuHuH}k t\HuH}Z tKEA9A9G|EA9G AA9G }E1 HuL HH5! i 1HH8[A^A_]H}L 1H}Hu5H}, HEH HH}HtHun @UHAWAVSHHHuHHED~D}HG]]y HHLwHEMA)AH5dH}HU HofEf~f:f:f:fpfpfff8%fP@@AA~9 ENEF E9~Tf(*f)Eл1H} 1H}HHE1LU9HuILI^69LLӉuAUD9ALEA9ANȉM9m9e919 Ht 1H}HuH HH}Ht Hu HHH[A^A_]@UHAVSH0FHuHHEEHGE܉Ey HHHGHDpX D+0+X HAAHc H}HuHHEHEEHEH5!H}HUS HtDpX D+0+X Ht31H}HtHup H5 1HH0[A^]AAHcx$G HH}HuH}111 / HH}Hu HfUHAVSHPHHzyHUH HEEHFE܉EyHH; HHJLvM=CHuH}  AofnMfpfofff:3A& HHHHUH HEHEEHEHEH5TH}HU HtLHH58H}HUj Ht0IH}Hu tMH}HL Htm1H}Ht Hun H}Ht.Hu)[ "H=HP[A^]M H5L 1HHP[A^]H}Ⱦ H=Hup HH}HuUHAVSH@F>HuHHEEHGEԉE؅yP HH LwMHuH} HuH} HcEMA) A HHHHuHKHEHEEHEH5wH}HU HtAHH}Hu t-H}Hu tUMH}HW HtH1H}HtHu H5 1HH@[A^]H} H=Hu HH}HuUHAVSH@F?HuHHEEHGEԉE؅y HH LwMHuH} HuH} HcEMAL HH HHuHwHEHEEHEH5H}HU HtAHH}Hua t-H}HuP tUMH}H HtH1H}HtHu H5i 1HH@[A^]H}N H=$Hu HH}HufUHAVSHPHHzyHUH HEEHFE܉EyHH HHJLvM=CHuH}1  AofnMfpfofff:3A HHV HHUH HEHEEHEHEH5H}HU& HtLHH5ؾH}HU Ht0IH}Hus tMH}HL Htm1H}Ht Hu H}Ht.Hu) "H=HP[A^] H58 g 1HHP[A^]H}ȾL H="Hu HH}HuUHSH(HHzGsH=H([]t u}HUH HEEHFEEyHH HHtGHFHt>xFP)H@)P HuH HH5 m 1HH([]H}111X f.UHAWAVSH8HuHHED~D}HG]ĉ]ȅy" HHLwMA)AHuH}s HcM()EH AtHA)֍~r/HL t>HUL9tA)EЉtA4 Hu%H=FHu4 H}I 1H8[A^A_]UHSH8FtyHuHHEEHGEEy HHHGH@@ ' Hu|HHrHuHHEHEEHEH5dH}HU HtH}H? Ht'1H}Hu8H5< 1HH8[]H=Hu HH}HtHu| H}111 뽐UHSH8FtyHuH=HEEHGEEy HHHGHHH Hu|H{HrHuHHEHEEHEH5$H}HUV HtH}H Ht'1H}Hu8H5n 1HH8[]H=ιHu HH}HtHu< H}111 뽐UHAWAVSH(HuH HED~D}HG]ԉ]؅y HHttLwMtkA)AuOHuH} tQHuH} t@HcEMA) HHA HuHHH} 1H([A^A_]DUHSHHHuHR HEЋFEHEHEudH5H}HU Ht^HH}Hu, tJUH}Hg Hu1H=KHu9 HH}Hu (H}ȾB 1H}Ht Hu HHH[]UHAWAVSH(HuH HED~D}HG]ԉ]؅y HHttLwMtkA)AuOHuH}O tQHuH}> t@HcEMA HHA) HuHzHH}^ 1H([A^A_]DUHSHHHuH HEЋFEHEHEudH5H}HU# Ht^HH}Hu tJUH}H < Hu1H=Hu HH}Hu (H}Ⱦ 1H}Ht Hu HHH[]UHAWAVSH(HuH| HED~D}HG]ԉ]؅yR HHLwHEMtMA)AuHH5H}HU HtA)A)N@A)FA)F F HtS1H}Hu$814H} 1H}HtHu HE1HH([A^A_]HHH}HufUHAWAVAUATSHHHuHh HEFEHGM̉MЅy@ HH-LgH}E11 AC6HcH}- LmEIcI\IDM;E+ẼH}LD DEArILH9H I91HHHHHtA|H At1H=H tH=Xi H t H Lc觮 HuL謮 % 1H0[A^]f.@UHAWAVSH(HuHld HED~D}HG]ԉ]؅y HHLw(HEMA)AuhHuH} }L}tlH=-L AtbH=L tOH=Gh L t7HE]UĉUȅyF HHH_(HH}HuкQ EEEEEE}HuH HuH6HE]UĉUȅy蹅 HHOH_(H H}Hx H}Hu H}Hu؅ }xMUEMUHHuHHuH5HE]UĉUȅy HHtuH_(HtlH5 H}HU҄ }tRIH5d H}HU资 }t5}HLH7 t HuH5i5b 1H H H;MHĀ[A^]1HHHuHEEf.EuzEf.EuzEf.Eu{Yt HuH}HU1蜄 ;t HfE4t YH HLH t H7HH*HHEs H Es ն UHAWAVSHHHHEH@Hc6HHD~DPHGTXy HHLw(MA)H@AHu tH@Hu tfHEHE(E)E(E)`HEHpTtiHuHUL衳 Ef.Ec< 1H H H;MHĨ[A^A_]E1M+IHuHULEf.EuzEf.EuzEf.Eu{!+r HuH@HU1k Ef.`u$z"Ef.huzEf.pu{$q HuH@HU q H HCHH H H;M蛴 UHAWAVSH(HuHCuHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5Q] H}HU辀 }t0}t7LH p Hu9H}v 1H([A^A_]ILHp HuHMHUHAVSH HuHYHEDvDuHG]]y  HHt!H(HtD9uEt#H_P

] Ht1H}111l Hc.] HHH [A^]f.UHAWAVAUATSHhHuHTHEFEHGMĉMȅypl HH{L(H}11k AC6HcHxIl LxEIcM,LDME+EăH}LD7l H}Hupl DEArII9IDI91)HHHHtf.@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}j 1HxHEH9lqE1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt5HHfADA fADALH HuH9T}Ut LL! LL AE~B1f.AfA.Du z HH9uZ HuH}1LDFj Y Ht.1HxHEH9t Ht薜 HHh[A\A]A^A_]IcY HHxHEH9uHHxHEH9t HtH HZ  f.fUHAWAVSH(HuH_aHED~D}HG]ԉ]؅y h HHt`Lw(MtWA)Au;H51E H}HUh }t4LH蹄 X HuHcX H}Rh 1H([A^A_]fUHSHH}HHEHpHHxFEHEHpHu/h H5jD HpHUg }(E(M(U)U)M)EH}H Ef.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{ W Ht7W HuLg 1H dH H;MuCHĈ[]HpHU1g EW HuHcJW H !H H;Mt7 UHSH(HuH*HE؋FEHEu>H56 H}HUf }t7H观 HV Hu"Hbg H([]H}о@f 1H([]ÐUHH=ŅH5^H H 0V Mu=HH=V H]ÐUH]a fDUHSPHH=`H5H H `V uH1H=*-V H5V HHU t H tH[]H=H[]V fUHAVSH0HuH% HEЋFEHEHEH}ȃHute H]H= Hk AtDH=tHR t1H=vH? tH= H, t H^c LcT HuLT jd 1H0[A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y2d HHLw(HEMA)Au{HuH}ad }L}tH= LR AtuH=[L9 tbH=]L& tOH= L t f.UHAVSHpHHHE^HG)Ѓ$HuH&jHE]UUyrR HHH_(HH5. H}HU?R }IHuH}\R }HUHLW HuHiHE]UUy Q HHtvH_(HtmH5G. H}HUQ }tSIHuH}Q t:HuH}0R t)}HMtOHUHLuV QH5iCQ 1H H H;MuUHp[A^]HHUHLHHUHLcA HuHchA H ?H H;MtU UHAWAVSHXHHHEHuH@HED~D}HG]]y P HHtnLw(MteA)AuIHuH}Q tKHuH}P t5}HutHHULU @ HuJH}P 1H aH H;Mu?HX[A^A_]IHULH@ HuHHH "H H;Mt8 @UHAWAVSHHHHHEHuH^HED~D}HG]]y O HHt\Lw(MtSA)Au7HuH}O t4}tKHuLT H? HuMH}O 1H SH H;Mu@HH[A^A_]IHuLH7? HuHB? H H H;Mt) DUHSHhH~HHE^HG)ЃHuHHE]UĉUȅydN HHCH_(HH}HuN H}HuN H}HuN }EMUEMUHuHHE]UĉUȅy M HHtNH_(HtEHuH}M t/}tBHuHeR H= HuDH5JM 1H }H H;MuK t4}tKHuLP H6; HuMH}J 1H {H H;Mu@HH[A^A_]IHuLH: HuH: H zH H;Mt} DUHAWAVSHXHzHHEHuH{- HED~D}HG]]y$J HHLw(MA)AueHuH}yJ tgHuH}J tQH5^& H}HUI }t7}utKHULHN 9 HuMH}rI 1H yH H;MuBHX[A^A_]IHULHX9 HuH5yHH {yH H;Mt| f.UHAVSH`HNyHHE^HG)ЃHuHHE]UUyH HHH_(HH}Hu I wH}HuкH ]H5$ H}HU`H }?IH}HuH '}uDEKHUHL4M k8 HaHuHHE]UUyG HHH_(HH}HuNH H}Hu'H H}HuH tH}HuH tnH5$ H}HUqG }tTIH}HuG t@}uEMUMtyHLML ~7 Hu{H5F 1H PwH H;MuuH`[A^]1HN1HHHUHL7 HuHHL7 HuHvHH vH H;Mty f.UHAWAVSHXHvHHEHuH7, HED~D}HG]]y4F HHLw(MA)AugHuH}wF tiHuH}%F tSH5n" H}HUE }t9}EtKHuLHJ 5 HuMH}E 1H uH H;MuBHX[A^A_]IHuLH`5 HuHCuHH uH H;Mtx f.UHAWAVSHhH\uHHEHuHHED~D}HG]]yD HHLw(MtuA)H}AuYHuD tVH}HuD t@EEHEHE}t[HuHULbI HËE;Et_mBD 1H tH H;MHh[A^A_]E1M^IHuHULHËE;EuE;EuE;Et!C4 HuH}HUD "4 HsHD H sH H;Mm w UHAVSH HuH[HEDvDuHG]]y dC HHt$H(HtD9uEt&H3 Ht+12H}111 C !H H^3 HuHC HHH [A^]fUHAVSH HuH0 HEDvDuHG]]y B HHt"H(HtD9uEt$\G 2 Ht(1.H}111_B H 2 HuHGrHHH [A^]UHAVSH HuHHEDvDuHG]]y B HHt"H(HtD9uEt$F +2 Ht(1.H}111A H02 HuHqHHH [A^]UHAVSH HuHHEDvDuHG]]y TA HHt"H(HtD9uEt$F {1 Ht(1.H}111@ H(S1 HuHpHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y @ HHtpLw(MtgA)AuKHuH}@ tMH5H}HU]@ }t3}ut7LHkE 0 Hu9H}@ 1H([A^A_]ILH8U0 HuHoH@UHH=fH5hH01z0 gu@HgH=fG0 Hf]fDUHSPHH=fH59hH۟1%0 -gu}@HvgH=of/ H5H\fH/ t H IftH[]H=9fH[]v0 f.@UHAVSH0HuH HEЋFEHEHEH}ȃHu4? H]H=H+r AtDH= Hr t1H=n Hq tH=] Hq t H= Lc. HuL. *> 1H0[A^]UHAWAVSH(HuH| HED~D}HG]ԉ]؅y= HHLw(HEMA)Au{HuH}!> }L}tH=Lq AtuH= Lp tbH=l Lp tOH=D Lp tHEHMHUHEHMHUHHuHHH5X5 1H TeH H;MHx[]1HgHHuHHEf.EuzEf.EuzEf.Eu{% HuH}HU1D5 $ HmH$ H dH H;Mgg fUHAWAVAUATSHHdHHEЋ^HG)ЃHhH Hpx|Uy3 HH)L(Hh`3 ACD-HcH3 L1EIcM$LDMx+|RHhHu3 cH5 HhHUF3 }BHHhH 3 $HhH(3  HhHu}3 HhHu3 HhLD2 EXE8EHE0E@EPDH`EuA1H`HhH Hpx|Uy2 HHXL(Hh1 ACD-HcH1 L1EIcM$LDMx+|HhHu1 H5 HhHUm1 }iHH5 HhHUI1 H`}>HhH 1 #HhH(1 HhHu|1 HhHu1 HhLD0 E0E@EPE8EHEDHXE.A1HXH5 0 1MHh0 Hh/ 1HHH9t Htb H`HH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLH" "IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{! HuHhHU1- } HuUHh, Ef.0u$z"Ef.@uzEf.Pu{$, HuHhHUi- E~A1AfA.uzHH9`u! HuHhLD#-  HmL HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH` .IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{! HuHhHU1 +  HuUHh* Ef.8u$z"Ef.HuzEf.u{$Z HuHhHU* E~A1AfA.uzHH9Xu! HuHhLDQ*  HL HHHH9\ HHHH9t Htg\ H  f.UHAVSH HuHHEDvDuHG]]y ( HHt%H(HtD9uEt' H Ht+12H}111( !HhH HuH) HHH [A^]ÐUHAVSH HuHW HEDvDuHG]]y D( HHt%H(HtD9uEt'P Hh Ht+1>H}111' -HH= HuHHx= B HHH [A^]DUHAVSH HuHHEDvDuHG]]y ' HHt"H(HtD9uEt$T  Ht(1.H}111/' H HuHWHHH [A^]UHAVSH HuH0HEDvDuHG]]y & HHt"H(HtD9uEt$  Ht(1.H}111& H HuHgVHHH [A^]UHAWAVSH(HuHsHED~D}HG]ԉ]؅y "& HHt\Lw(MtSA)Au7H5 H}HU% }t0}t7LH $ Hu9H}% 1H([A^A_]ILH  HuH}UHUHAVSH HuH=HEDvDuHG]]y D% HHt$H(HtD9uEt&Hi Ht+12H}111$ !H(H> HuH% HHH [A^]fUHAVSH HuH.HEDvDuHG]]y $ HHt%H(HtD9uEt'v H Ht+1>H}111<$ -HH HuHHx  HHH [A^]DUHAWAVSH(HuHQ HED~D}HG]ԉ]؅y # HHt\Lw(MtSA)Au7H51S H}HU# }t0}t7LHw  Hu9H}V# 1H([A^A_]ILH HuH-SHUHAWAVSH(HuHrQ HED~D}HG]ԉ]؅y " HHt\Lw(MtSA)Au7H5QR H}HU" }t0}t7LH  Hu9H}v" 1H([A^A_]ILH HuHMRHUHHHztuHH]H=vM]/ H5I ! 1]UHSH(HuHI HE؋FEHEEȃrH}о! 1[H5Q H}HU! H1}tH5P H}HU! }t7H HK Hu"H! H([]H}о 1H([]ÐUHH=eLH5MHGpH 0E Lu}8H6MH=/L H#L]ÐUH]@ fDUHSPHH=LH5MHoH  Lu8HLH=K H5oHKH= t H KtH[]H=KH[]1 fUHAVSH0HuH HEЋFEHEHEH}ȃuoHu tqH]H=oHR At1H=bHR tH=8 HR t H Lc HuL  1H0[A^]f.@UHAWAVSH(HuHL HED~D}HG]ԉ]؅y HHLw(HEMA)AuhHuH} }L}tlH=nLQ AtbH= aLQ tOH=' LQ t Ht"HH5XLH H uH H Ht"HH5XLH H uH H Ht"HH5XLH H uH H Ht"HH5XLHg H uHt 1w Ht"HH5XLH9 H uHF F Ht"HH5XXLH H uH  Ht"HH5.XLH H uH H=]  HQ [A^]@UH] fDUHSPH"H5|H Hz t H tH[]H= H[]n fDUHSH(HuH HE؋FEHEHEH}Ѓu1Hu: t3H}H HuHc H([]þ 1H([]UHAWAVSH(HuHܝ HED~D}HG]ԉ]؅y R HHtdLw(HEMt8A)Au3HuH} t}Hut;H)HR Ht<1@H} 1)HE1ILP HuHc H([A^A_]f.@UHAVSH0HuH[ HEЋFEHEuGH5[ H}HU] }t@HHtCHH5zHPE1LE Hu+H}Ⱦ 1H0[A^]E1V HuL UHAVSH HuHR HEDvDuHG]]y HHH(HD9u3HPxHt9HHH5'zHPE1LE HucH}111< RE1 HuCL- Ht6HH t)H HH1Q@H߾ 1HH [A^]UHAVSH HuH6 HEDvDuHG]]y HHtH(HtD9uEt!1 Ht+12H}111b !HHc HuH HHH [A^]UHAWAVSH(HuHvHED~D}HG]ԉ]؅y  HHt\Lw(MtSA)Au7H5ڞ H}HU }t0}t7LH=  Hu9H} 1H([A^A_]ILH8 HuH]#HUHAVSH HuH HEDvDuHG]]y $ HHt%H(HtD9uEt' HH Ht+12H}111 !HPH HuH( HHH [A^]ÐUHSH8HHZHG)σ(HUH=@ H}؉]MMyHHM HHH^(HHuH} }HuHC HM HHUH= H}؉]MMyHH HHH^(HtwH}Hu. tfH}Hu tUH}Hu tD}uUȋMtfH4H Hu hH=,H8[] H5 " 1H8[]1HuHHpHb HuHHxHG HuH H8[]UHAWAVSH(HuHJ HED~D}HG]ԉ]؅y HHtVLw(MtMA)Au1HuH} t3}Hut6L Hu8H}, 1H([A^A_]ILp HuHcu ӐUHAWAVSHH9 HHEH`HHhD~DpHGtxy HHLw(MA)H`AuuHX ttH`Hu t[(E(M(U)U)M)EtHXteHUL Ef.E_ 1H 8H H;MHĘ[A^A_]E1M HuHHf.UHAWAVATSHp^HG)ЃHxHHE]UUyy HHH_(HxHuHx `H5 HxHU+ }?}Hu{HH U HvHuH_HE]ȉỦUЅy HH)H_(H}P AC$HcHx HE+ẼLxH}Hu H}Hu H}LD ty}HEH`HQ0HHR0D<AWH5HcHHPH5^ 1/H} 1HxHEH9t Ht HHp[A\A^A_]1H HH HuHjHĀw.H5HcHHP|H@5HH,HEE1E1H@NHHEHXHHI8HHI0Hc4HzHHH@0HHHE/ H_(H}K AC?HcH} HE+ẼLuH}Hu H}Hu H}LD HEHhHI0HfULtn HuUH} R HuH}LD 4 Hu1HH'H5H 1,H} 1H}HEH9t Ht HHh[A^A_]1H HH HuHPHHH}HEH9t Htc H  UHAVSH HuHHEDvDuHG]]y HHt"H(HtD9uEt$N  Ht(1.H}111 H HuHHHH [A^]UHAVSH HuH HEDvDuHG]]y D HHt"H(HtD9uEt$v k Ht(1.H}111 HC HuHHHH [A^]UHAVSH HuH HEDvDuHG]]y HHt$H(HtD9uEt& Ht*11H}111= H HuHc HHH [A^]UHAWAVSH(HuHUHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5ō H}HU }t4LH1 HuH~HH}b 1H([A^A_]fUHAVSH HuHRUHEDvDuHG]]y $ HHt H(HtD9u HM Ht1H}111 H HHH [A^]f.fUHAWAVSH(HuH{UHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5e H}HUN }t4LH HuHHH} 1H([A^A_]fUHAVSH HuH(UHEDvDuHG]]y HHt H(HtD9u H Ht1H}111q Ho HHH [A^]f.fUHAWAVSH(HuHKUHED~D}HG]ԉ]؅y " HHt`Lw(MtWA)Au;H5 H}HU }t4LHk * HuHHH} 1H([A^A_]fUHAVSH HuHTHEDvDuHG]]y d HHt H(HtD9u H Ht1H}111 H HHH [A^]f.fUHAWAVSH(HuH$UHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5 H}HU }t4LH# HuH^HH}B 1H([A^A_]fUHAVSH HuHTHEDvDuHG]]y  HHt H(HtD9u H- Ht1H}111 H HHH [A^]f.fUHAVSH HuHUHEDvDuHG]]y d HHt H(HtD9u H Ht1H}111 H HHH [A^]f.fUHAVSH HuHUHEDvDuHG]]y HHt H(HtD9ue H Ht1H}111q H HHH [A^]f.fUHAVSH HuHTHEDvDuHG]]y $ HHt H(HtD9u HM Ht1H}111 HC HHH [A^]f.fUHAVSH HuHTHEDvDuHG]]y HHt H(HtD9uC H Ht1H}1111 H HHH [A^]f.fUHHHzHFLrǃtu%HH]V0H=o]9 HH]M1H5 1]f.UHAWAVAUATSHh^HG)Ѓ_HuHP HE]UĉUȅyZ HHL(H} AC6HcHpV Lp1EIcM,LDME+EăuH}Hun sH}HuY ^H}LD GDE@ArII9aIDI9S1HHHHHtI4ItHHuHI ILILILILILILILHH9uHpH Hx]UUy HHtpH_(HtgHuHpa tSH5\ HpHU }t6uHHR H HuH HDH5m h 12H}W 1HpHxH9t Htn HHh[A\A]A^A_]E1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9}uԋUt LL LL IE~51I I;Lu HH9un HuH}LD P HLW HHpHxH9HHpHxH9t Ht H  @UHAVSH HuH HEDvDuHG]]y d HHtH(HtD9uw Ht1H}111 HHHH [A^]UHAVSH HuHTHEDvDuHG]]y HHtH(HtD9u Ht1H}111 HHHH [A^]UHAVSH HuH UHEDvDuHG]]y D HHtHG(HtD9uH`n Ht1"H}111 1H@" HHH [A^]UHAWAVSH(HuH| HED~D}HG]ԉ]؅y HHt_Lw(EMtKD)؃rH}11V F1D9}HuH} tuL Ht1E1 HHHH([A^A_]@UHAVSH HuHiUHEDvDuHG]]y HHtH(HtD9u Ht1H}111 HHHH [A^]UHAVSH HuHUHEDvDuHG]]y D HHtH(HtD9u p Ht1H}111 HHHH [A^]UHAWAVSHHHuHUHED~D}HG]ԉ]؅y HHLw(MA)H}AuvHu% txH}Hu tgH}Hu tVH5 H}HUC }tH}111蜲 -HH HuHHx  HHH [A^]DUHAWAVSH(HuH HED~D}HG]ԉ]؅y 2 HHt\Lw(MtSA)Au7H5 H}HU }t0}t7LH[ 4 Hu9H}趱 1H([A^A_]ILH HuHHUHAWAVSH(HuH HED~D}HG]ԉ]؅y R HHt\Lw(MtSA)Au7H5 H}HU }t0}t7LHq T Hu9H}ְ 1H([A^A_]ILH HuHHUHAVSH HuH0KHEDvDuHG]]y t HHtH(HtD9u' 蠠 Ht1H}111$ HHHH [A^]UHHHztuHH] H=]P H5 ʯ 1]UHHHHGzu H= ] H52L莯 1]@UHAVSH HuHMHEDvDuHG]]y d HHt%H(HtD9uEt'踤 H舟 Ht+1>H}111 -HHH] HuHHx] b HHH [A^]DUHSPHH=}3HD tZH=H1 tGH=Y H t4H= H t!H=iY H tHH[]$ H[]f.@UHAWAVSH8HuH HED~D}HG]ԉ]؅y  HHtqLw(MthA)AuLHuH}荮 tNH5Q H}HUͭ }t4}Hut7LH Hu9H}聭 1H8[A^A_]ILHĝ HuHXHUHAWAVAUATSHhHuH HEFEHGM̉MЅy HHH_(H}薬 AC?HcHx HE+ẼLxH}Hub t}H}LD tj}HEH`HQ0HHR0D$t{E1E1AT$H5HcHHPH}' 1HxHEH9t HtA HHh[A\A]A^A_]1E1E1AT$H5(HcHHPSH@"HHH@8HH/HXHHI8HHI0Hc4HzH &HXHHI8HHI0Hc4HzH IE詛 HuH}LD 苛 HA苛 HHxHEH9HHxHEH9t Ht HJ  26bf.fUHAWAVSH8HuHd HED~D}HG]̉]ЅyR HHLw(HEEMD)؃rH}11 uD9}H}Hu蜪 t]D}ȋ]D9}H}Hua t@Hu؋UL(  Hu'HHE1HEEMo1HH8[A^A_]DUHAWAVSH8HuHT HEDvDuHG]ԉ]؅yB HHL(HEEMAArH} H5-H}HUݨ }t|IƋEЋM9}H}Hue t^EЋM9}H}Hu, tCHUMLL ٘ Hu'HmHE1HEEMG1H8[A^A_]UHAWAVAUATSH8HXHEHPHEHHHEH@HELcHcHELcH}HhH@0LHD,MHDHEE1@IM9HEJHMH`HJ0HHI01ˀwZHHcH5 H}HU }t7H= H; Hu"Hң H([]H}о谢 1H([]f.UHAWAVSH8HuH?HED~D}HG]̉]Ѕy r HHtuLw(MtlA)AuPHuH} tRH5 H}HU- }t8HuLH4 c HuHch H}ݡ 1H8[A^A_]@UHAWAVSH8HuHM>HED~D}HG]̉]Ѕy 袡 HHtlLw(MtcA)AuGHuH} tIHuH} t8Hu؋ULy 蜑 HuHc衑 H} 1H8[A^A_]f.UHAWAVSH8HuH}=HED~D}HG]̉]Ѕy Ҡ HHtsLw(HEMtGA)AuBHuH}E t-HuH} tHuHUL蚖 Ð Ht01!H}C 1 HE1H8[A^A_]Hc蘐 됐UHAVSH H2 H=L5OHLS Hˢ Hf H=HL2 H H~H H HGH HfHn HUH H H H H H3H H H~ H{ Hx Hu HHo HHi HHc HH] HZ DHHT HHN HS H@ HE HZ HG H4 H! H2H3 HH H5 H" H H$ H) H HH HH H H H H H H H  H H [A^]ÐUHH=EH5Ha=H 0 uhHH=ҍ H]ÐUH]L fDUHSPHH=H5yH<H 蠍 huxhHH=m H5<HH t H tH[]H=tH[] fUHAVSH0HuHeB HEЋFEHEHEH}ȃuoHu踜 tqH]H=9<H At1H= H tH=F H t H蹚 LcG HuLL ś 1H0[A^]f.@UHAWAVSH(HuH B HED~D}HG]ԉ]؅y肛 HHLw(HEMA)AuhHuH}豛 }L}tlH=(;L AtbH= L tOH=E Lv t<tHLHUHpLM&u !IHLHUHpLM(dr HuLH(1轁 Ef.EuzEf.EuzEf.Eu{$r HuH(HUY pf.Pu'z%xf.XuzEf.`u{'q HuH(Hp E~>1AfA.Du z HH9u!vq HuH(LD趁 Uq HzHHHHH9ns5 HHHH9t Htӳ H r  UHAWAVSHHHɰHHEHHI HDvDHGyB HHL(MA)HAaHu= ZHHu =HHA "HH& HH@ HH HLL HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLq n~ 1H خH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!an HuHHU1~ Ef.`u$z"Ef.huzEf.pu{$ n HuHHUJ~ m HuH7} @f. u*z(Hf.(uzPf.0u{'m HuHH@} f.u*z(f.uzf.u{''m HuHHa} m HuHV| l HHcl H H H;Mɯ DUHAVSH0^HG)Ѓ$HuH HEЉ]؉U܉Uy| HHH_(HHuH}n| H5eX H}HU{ }IH5:X H}HU{ }}uHLH8n k Hu}cHuH HEЉ]؉U܉Uy Y{ HHtRH_(HtIH5W H}HU.{ }t/HHm hk HuHcmk H5c z 1H0[A^]LHLHAH&k Huf.DUHAWAVAUATSHHHHEHPH HXF`HGdhy`z HHHG(HpLPLy AC6HcH+z HE1EIcHLELy AH]C?HcHy HE1EIcHIDHpHI͋`+dHPHHz HPHuy HPHuDy HPHLy tiHPLDYy tSHEHEf(Ef)EDHxE#A1HxzHPx E1HHH9t Htʫ HHH9t Ht譫 HĨHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMg HpHHUHMMPEf.EuzEf.EuzEf.Eu{$e HuHPHUZu E~E1HMfA.uzHH9xu"d HuHPHUDu E~>1ADf.u z HH9Eu!d HuHPLDt ld HKL-IEHHH9?DK HHHH9tHt HHHH9t HtŦ Hd  fUHAVSH HuHO HEDvDuHG]]y Ts HHtH(HtD9uEt!1~c Ht+12H}111s !HhHcSc HuHXc HHH [A^]UHAWAVAUATSHHHHEЋFH(HH0Dž8HG<@ykr HHH(Hd Eb HEb HHuHHEHEEH}q AC6HcH(r L(1EIcIHE؋E+E H51N H}HUq }IH}H`)r H}LDq H}Huq EEArKH9JI91HHLLHtI4H4HHuHvI H ILHLILHLILHLHI9uBH5p 1FH}p 1H(H0H9tHt蚣 H(111Pp HHH;EHHĸ[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9^EEEhEpH`HMLLa xE~41I H; u HI9uh_ HuH}LDo Ef.Eu$z"Ef.huzEf.pu{!_ HuH}HUZo ^ H x^ HH(H0H9ӡ HH(H0H9t Hto H_  UHAWAVAUATSHHeHHEHpH HxFEHGMMym HHL(Hp\m AC6HcH8m L81EIcM,LDME+E HpHum HpLDm HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpIl 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL^^ IHuLLxEf.EuzEf.EuzEf.Eu{!\[ HuHpHU1k E~G1fAfA.Du z HH9u![ HuHpLDPk Z HtD1H8H@H9t Ht蝝 HHH;Eu4HHĨ[A\A]A^A_]H?HH8H@H9u薝 HH8H@H9t Ht4 Hn[  UHAWAVAUATSHHHHHHEЋz}HpHMHxHEEHpi AC6HcH0i L01EIcIHE؋E+EDH5E HpHU0i }9IHpHli HpLD\i HpHui EEArKH9 JI91HHLLHtI4H4HHuHI H ILHLILHLILHLHI9u_H0HH8HDž@DžHH5D H0Hpg pHH0Huh EEEEEEHuHpZ Ef.EuzEf.EuzEf.Eu{$W HuH0HUh W HuIH;HvHHH;E=H=۩HĨ[A\A]A^A_]ut H5f 15Hpf 1H0H8H9t Ht H HH;EHHĨ[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9AEEEEEElHMLLX E~71I H; u HI9u!U HuHpLDGf Ef.EuzEf.EuzEf.Eu{$U HuHpHUe tU H,HHH0H8H9 %T HH0H8H9t Ht H,V  fDUHAWAVAUATSHhFHH HcHHpHHxEHGEEy\d HH H(HW {T HHH5[c HpHAHxHEEH5c@ HpHUc }HW T HHpHHxHEEH5To HpHUkc }t;HH5? HpHUKc }tHHzV S HW1HHh[A\A]A^A_]HuHRHEHEEH}b AC6HcHp c Lp1EIcIHE؋E+EăH5-? H}HUb }IH}Hu c H}LDb EEArKH9JI91HHLLHtI4H4HHuH[I H ILHLILHLILHLHI9u'Q HH}a 1HpHxH9oHf譔 \Hp111`a EDHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9yuLLS AE~41I H; u HI9uP HuH}LD4a P HAyP HHpHxH9HHpHxH9t Ht. HhQ  fnXUHAWAVAUATSHHHHEЋ~iHuH0 HEHEEH}%_ AC6HcH0_ L01EIcIHE؋E+E7H5; H}HU;_ },IH}Hl_ H}LDm_ H}Hu)_ EEArKH9 JI91HHLLHtI4H4HHuHI H ILHLILHLILHLHI9u[H0H H8HDž@DžHH5i H0HU^ }HH5: H0HU] }IH0Hu ^ EpExEEHUHLuP Ef.pu!zEf.xuzEf.Eu{$M HuH0HU] M Hu[M HBH5 ] 12H}\ 1H0H8H9t Ht H!HH;EHHĨ[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9EEpExEElHMLLN AE~41I H; u HI9uK HuH}LDY\ Ef.pu!zEf.xuzEf.Eu{!K HuH}HU[ K H#AMK HH0H8H9a HH0H8H9t Ht H7L  UHAWAVSHHHHHEHH! HDvDHGyrZ HHGL(MA)HAHumZ HHuPZ HHqZ HH@Z HH6Z }HLLY ZHEHE(E)E(E)`HEHp(@) HPH0()HHL4$HuHUHL@LLL Ef.EuzEf.EuzEf.Eu{!-I HuHHU1mY Ef.`u$z"Ef.huzEf.pu{$H HuHHUY H HuHX @f. u*z(Hf.(uzPf.0u{'VH HuHH@X /H HuH}W f.u*z(f.uzf.u{'G HuHH X G HuHcG 'W 1H rH H;MuHH[A^A_]E1Ml UHAWAVAUATSHHH%HHEHHHFHDžHO AC?HcHO L1EIcIHE؋+ZHHuO SHHO 8HLDTO HHp4O HH O HEHE(E)EEEArKH9JI91D)HHLHtI4H4HHuHyI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uHM 1HHH9t Ht H~HH;EHHP[A\A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9Y(p(M(U)`)P)@f( f)H0HH}HpL L? Ef.EuzEf.EuzEf.Eu{!< HuHHU1L E~<1Af.u z HI9u!c< HuHLDL pf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'; HuHHpL  f.u*z((f.uz0f.u{'s; HuHH K L; HB; HHHH9&~ HHHH9t Ht} H;  fDUHAWAVAUATSHHzHHEHHHFHDžHH߾I ACD-HcH0*J L0E1EIcILEH߾I AC?HcHhI Hh1EIcHHHE؋+HH!J HLDI ~HHuI aHHI FHHDcI (HHPCI HHdI HHI DEArII9II91)HHHHtI4I4HHuHI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uEHG 1HhHpH9t Htz H0H8H9t Htz HwHH;EGHHĸ[A\A]A^A_]ÉHpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH92H(E(M(U)U)M)pDHELAs1HHHHH9sHH9s1HpHHH‰уH s 1LoHH)1LAALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuHH9)HHHHtLI4H4HHuLHHrWI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HH9uH`H@(P)0()H HHH$HULPL7 HE~=1AfA.u z HH9u!4 HuHLDD Ef.puKzIEf.xu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$4 HuHHU\D E~J1Hf.uzHH9u%3 HuHHD D Pf.0u*z(Xf.8uz`f.@u{'p3 HuHHPC f.u*z(f.uz f.u{' 3 HuHHGC 2 HHc2 HHhHpH9u H%H HHhHpH9t HtSu H0H8H9t Ht6u Hp3  f.UHAVSHH+rHHEHPH/HXF`HDždH5C HPHUA }HH5 HPHUuA }dIHPHHA FHPHuкtA )HPHuWA  HEHE(E)E(E)pHEHEHHUHMHL3 Ef.EuzEf.EuzEf.Eu{$0 HuHPHUо3A Ef.pu!zEf.xuzEf.Eu{$0 HuHPHU@ ~0 Hu Hc0 HP? 1H @pH H;Mu Hİ[A^]Js fDUHAVSH HuH?HEDvDuHG]]y ? HHt'H(HtD9uEt)/ Ht*11H}111J? H/ Huk/ HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y > HHtmLw(EMtIA)H}Au@Hu3? t/}EtEA8tAIL. Ht81>i> 1+E1#IL. HuHAnHH([A^A_]UHAVSH`HnnHHEHuHHEFEHEH5I H}HU= }HH5] H}HU= }IH}Huк= HEHE(E)EHUHLF0 Ef.EuzEf.EuzEf.Eu{!- HuH}HUо= - Hu2HmHH `mH H;Mt*vp H}< 1H 6mH H;MuH`[A^]@UHAWAVATSHHmHHEHxHSHEFEHEHx'< AC6HcH@< L@1EIcIHE؋E+EHxHu<  HxLDc< HxHuF< EEArKH9JI91D)HHLHtfI4H4HHuHfDI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uHx; 1H@HHH9t Ht1n HHkHH;EHHĠ[A\A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9QHEHEf(Ef)E}HUL, E~K1f.DAf.u z HI9u!"* HuHxLDb: Ef.EuzEf.EuzEf.Eu{$) HuHxHU: ) H,HCiHH@HHH9 %l HH@HHH9t Ht1l Hk*  UHH=|H5}HH 0) |uH|H={R) H{]ÐUH]7 fDUHSPHH={H59}H,H ) (|uHq|H=j{( H5HW{H}( t H D{tH[]H=4{H[]q) fUHAVSH0HuH HEЋFEHEHEH}ȃHu48 H]H=aH+k AtDH=5 Hk t1H=# Hj tH=] Hj t H6 Lc' HuL' *7 1H0[A^]UHAWAVSH(HuH| HED~D}HG]ԉ]؅y6 HHLw(HEMA)Au{HuH}!7 }L}tH=HLj AtuH= Li tbH= Li tOH=D Li t<tHLHUHpLM !IHLHUHpLM( HuLH(1] Ef.EuzEf.EuzEf.Eu{$ HuH(HU pf.Pu'z%xf.XuzEf.`u{'_ HuH(Hp E~>1AfA.Du z HH9u! HuH(LDV HzHIHHHH9nsL HHHH9t HtsL H  UHAWAVSHHHiIHHEHH HDvDHGy HHL(MA)HAaHu ZHHu =HH "HH HH@j HHJ HLLz HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL n- 1H xGH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{! HuHHU1A Ef.`u$z"Ef.huzEf.pu{$ HuHHU  HuH @f. u*z(Hf.(uzPf.0u{'* HuHH@d f.u*z(f.uzf.u{' HuHH  HuH  HHc H WEH H;MiH DUHAWAVSH(HuHIz HEDvDuHG]ԉ]؅y HHL(MA)AumHuH} toH5 H}HUu }tUIH5 H}HUX }t8}utH} 1H([A^A_]ILLHHF HuHcK UHAWAVAUATSHHDHHEHPH{ HXF`HGdhy HHHG(HpLPL AC6HcHK HE1EIcHLEL AH]C?HcH  HE1EIcHIDHpHI͋`+dHPHH0 HPHu HPHuD HPHL tiHPLDy tSHEHEf(Ef)EDHxE#A1HxzHP E1HHH9t HtD HHH9t HtD HAHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM; HpHHUHMMPEf.EuzEf.EuzEf.Eu{$= HuHPHUz E~E1HMfA.uzHH9xu" HuHPHUD0 E~>1ADf.u z HH9Eu! HuHPLD HKL-=IEHHH9?Dk@ HHHH9tHt @ HHHH9t Ht? H  fUHAWAVSHxH<HHEHxHi HED~D}HG]]ya HHLw(MA)HxAumHu toHxHuL tVH5 HxHU }t9HMHM(E)E}utOHULH Q 1H ;H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$ HuHxHU q H`Hcr H I;H H;MZ[> UHAWAVSHhH;HHEHuH HED~D}HG]]y HHLw(MA)H}AuZHu HEHE(E)E}t?H?HE(Y)E]1f.EuRzP2 eIHuLXHcEf.EuzEf.EuzEf.Eu{ HuH}HU1` Ht1H 9H H;Mu#Hh[A^A_]H H 9H H;Mt< UHAWAVSH(HuH-D HED~D}HG]܉]y 2 HHt#H(HtD9uAEtX Ht+12H}111 !HhLc- HuL2 HHH([A^A_]f.DUHAWAVAUATSHH8HHEHpH HxFEHGMMyY HHL(Hp AC6HcH8. L81EIcM,LDME+E HpHu HpLD HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHp 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL IHuLLxEf.EuzEf.EuzEf.Eu{! HuHpHU1  E~G1fAfA.Du z HH9u! HuHpLD _ HtD1H8H@H9t Ht 8 H$5HH;Eu4HHĨ[A\A]A^A_]H4HH8H@H9u8 HH8H@H9t Ht7 H  UHAWAVAUATSHH4HHEHpH| HxFEHGMMy HHL(Hp AC6HcH8 L81EIcM,LDME+E HpHu HpLD HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpy 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL IHuLLEf.EuzEf.EuzEf.Eu{! HuHpHU1 E~G1fAfA.Du z HH9u!@ HuHpLD  HtD1H8H@H9t Ht3 H0HH;Eu4HHĨ[A\A]A^A_]Ho0HH8H@H9u3 HH8H@H9t Htd3 H  UHAWAVSH(HuHn HED~D}HG]܉]y HHt#H(HtD9uAEt Ht+12H}111 !HLc HuL HHH([A^A_]f.DUHAWAVAUATSHXHuH HEFEHGM̉MЅy0 HH1L(H}E11 AC6HcH}/ LmEIcI\IDM<E+ẼH}LD% EEArKDH9JI91HHLLHtItH4HHuHLDILH ILHLILHLILHLHI9uH} E1H}HEH9^cE1DHpHHH‰уH s1uHH)1f.fADALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt8HHf.DADALD H HuL9}t LLr ILLE~21ILH; u HI9u HuH}1LD Ht,E1H}HEH9t Ht/ LHX[A\A]A^A_]L%c,I$H}HEH9uHH}HEH9t Hth/ H  f.fUHAVSH HuH HEDvDuHG]]y HHt%H(HtD9uEt18 H Ht51H}111 HH [A^]HH HuHtH5 Hh H HHV+H뱐UHAWAVSHxH+HHEHuHVHED~D}HG]]y HHLw(MA)H}AHu H}Hx6 HEHE(E)ExHuL Ef.EuzEf.EuzEf.Eu{ HuH}HU1 HuHc  1H ^*H H;MuHx[A^A_]E1M[- UHAVSH HuHHEDvDuHG]]y HHtH(HtD9u Ht1H}111b  HHH [A^]f.UHAVSH HuHHEDvDuHG]]y  HHt H(HtD9u H= Ht1H}111 H HHH [A^]ÐUHH=uAH5CHH 05 Au HFBH=?A H3A]ÐUH]6 fDUHSPHH=AH5BHgH AuHAH=@ H53H@H- t H @tH[]H=@H[]! fUHAVSH0HuH HEЋFEHEHEH}ȃuoHu tqH]H=H* At1H=p H* tH=( H* t H Lcw HuL|  1H0[A^]f.@UHAWAVSH(HuH< HED~D}HG]ԉ]؅y HHLw(HEMA)AuhHuH} }L}tlH=L) AtbH=o L) tOH= L) t1@fA.Du z HI9u HuH}HD c HIcd HHpHxH9HHpHxH9t Ht" H  UHAWAVSH(HuHyI HED~D}HG]܉]y r HHt#H(HtD9uAEt Ht+12H}111 !HLcm HuLr HHH([A^A_]f.DUHAWAVSH(HuHQI HED~D}HG]܉]y HHt#H(HtD9uAEt Ht+12H}111\ !HLc HuL HHH([A^A_]f.DUHAVSH HuH&I HEDvDuHG]]y HHtH(HtD9uEt!1 Ht+12H}111 !HHc HuH HHH [A^]UHAVSH HuHH HEDvDuHG]]y D HHtH(HtD9uEt!1n Ht+12H}111 !HHcC HuHH HHH [A^]UHAWAVSH(HuHH HED~D}HG]ԉ]؅y HHtJLw(MtAA)Au%HuH} t'}t.1 Hu 1HHH9t HtU Hl HH;EyHH[A\A]A^A_]E1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9><tHLHUHpLM !IHLHUHpLM(4 HuLH(1 Ef.EuzEf.EuzEf.Eu{$ HuH(HU) pf.Pu'z%xf.XuzEf.`u{' HuH(Hp E~>1AfA.Du z HH9u!F HuH(LD % HzHHHHH9ns HHHH9t Ht H  UHAWAVSHHHHHEHH HDvDHGy HHL(MA)HAaHu ZHHu =HH "HH HH@ HHz HLL HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLJ n] 1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!1 HuHHU1q Ef.`u$z"Ef.huzEf.pu{$ HuHHU HuH @f. u*z(Hf.(uzPf.0u{'Z HuHH@ f.u*z(f.uzf.u{' HuHH1 HuH& HHc H H H;M DUHAWAVSH(HuHy8 HEDvDuHG]ԉ]؅y HHL(MA)AumHuH}G toH5B H}HU }tUIH5 H}HU }t8}utH}8 1H([A^A_]ILLHHv HuHc{ UHAWAVAUATSHH5HHEHPH9 HXF`HGdhy HHHG(HpLPL AC6HcH{ HE1EIcHLEL AH]C?HcH< HE1EIcHIDHpHI͋`+dHPHH` HPHu HPHuD HPHL tiHPLD tSHEHEf(Ef)EDHxE#A1HxzHP E1HHH9t Ht HHH9t Ht HHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM HpHHUHMMPEf.EuzEf.EuzEf.Eu{$m HuHPHU E~E1HMfA.uzHH9xu"! HuHPHUD` E~>1ADf.u z HH9Eu!ݻ HuHPLD 輻 HKL-LIEHHH9?D HHHH9tHt 9 HHHH9t Ht HO  fUHAVSH HuH HEDvDuHG]]y HHtH(HtD9uEt!1κ Ht+12H}111R !HhHc裺 HuH診 HHH [A^]UHAWAVSHhH\HHEHuHP@ HED~D}HG]]y HHLw(MA)H}Au:Hu HEHE(E)E}tHuLP !] dIHuLXEf.EuzEf.EuzEf.Eu{~ HuH}HU1 ` Ht1H BH H;Mu#Hh[A^A_]HcH H H H;Mt5 UHH=H5HH 0U }uFHH=" H]ÐUH]T fDUHSPHH=H5)HVH uXFHaH=Z轸 H5"HGHM t H 4tH[]H=$H[]A fUHAVSH0HuHm HEЋFEHEHEH}ȃuoHu tqH]H=H At1H= H tH=Hr H t H Lc藷 HuL蜷  1H0[A^]f.@UHAWAVSH(HuH\m HED~D}HG]ԉ]؅y HHLw(HEMA)AuhHuH} }L}tlH=L AtbH= L tOH=7q L t }t0}t7LH t Hu9H} 1H([A^A_]ILH9 HuHHUHAVSH HuHHEDvDuHG]]y 蔽 HHt!H(HtD9uEt#H_h輭 Ht+12H}111@ !HH葭 HuH( HHH [A^]DUHAVSH HuH" HEDvDuHG]]y HHt%H(HtD9uEt'褸 H Ht+1>H}111茼 -HHݬ HuHHxݬ  HHH [A^]ÐUHH=e H5 HEH 0  u轇H6 H=/ 責 H# ]ÐUH] fDUHSPHH= H5 HH 耬  uXH H= M H5H Hݫ t H tH[]H= H[]Ѭ fUHAVSH0HuHEa HEЋFEHEHEH}ȃuoHu蘻 tqH]H=H At1H=4 Hz tH=e Hg t H虹 Lc' HuL, 襺 1H0[A^]f.@UHAWAVSH(HuH` HED~D}HG]ԉ]؅yb HHLw(HEMA)AuhHuH}葺 }L}tlH= L AtbH=3 Li tOH=d LV t Ht+12H}111µ !HHc HuH HHH [A^]UHAVSH HuH HEDvDuHG]]y d HHtH(HtD9uEt!1莥 Ht+12H}111 !HHcc HuHh HHH [A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y 貴 HHtJLw(MtAA)Au%HuH} t'}t.1Ƥ Hu<tHLHUHpLM !IHLHUHpLM(T HuLH(1譠 Ef.EuzEf.EuzEf.Eu{$ HuH(HUI pf.Pu'z%xf.XuzEf.`u{'诐 HuH(Hp E~>1AfA.Du z HH9u!f HuH(LD覠 E HzHHHHH9ns% HHHH9t Ht H  UHAWAVSHHHHHEHHh HDvDHGy2 HHL(MA)HAaHu- ZHHu =HH1 "HH HH@躞 HH蚞 HLLʞ HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL耜 n} 1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!Q HuHHU1葝 Ef.`u$z"Ef.huzEf.pu{$ HuHHU: ٌ HuH' @f. u*z(Hf.(uzPf.0u{'z HuHH@贜 f.u*z(f.uzf.u{' HuHHQ HuHF ϋ HHcЋ H H H;M DUHAWAVSH(HuH HEDvDuHG]ԉ]؅y HHL(MA)AumHuH}g toH5bw H}HUŚ }tUIH5;w H}HU訚 }t8}utH}X 1H([A^A_]ILLHH薊 HuHc蛊 UHAWAVAUATSHHUHHEHPH HXF`HGdhyЙ HHHG(HpLPL9 AC6HcH蛙 HE1EIcHLEL AH]C?HcH\ HE1EIcHIDHpHI͋`+dHPHH耙 HPHu HPHuD HPHL- tiHPLDɘ tSHEHEf(Ef)EDHxE#A1HxzHP$ E1HHH9t Ht: HHH9t Ht H4HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMI HpHHUHMMPEf.EuzEf.EuzEf.Eu{$荄 HuHPHUʔ E~E1HMfA.uzHH9xu"A HuHPHUD耔 E~>1ADf.u z HH9Eu! HuHPLD= ܃ HKL-lIEHHH9?D HHHH9tHt Y HHHH9t Ht5 Ho  fUHAVSH HuH HEDvDuHG]]y Ē HHtH(HtD9uEt!1 Ht+12H}111r !HhHc HuHȂ HHH [A^]UHAWAVSHhH|HHEHuHp HED~D}HG]]y HHLw(MA)H}Au:Hu HEHE(E)E}tHuL膐 !} dIHuLXEf.EuzEf.EuzEf.Eu{螁 HuH}HU1 老 Ht1H bH H;Mu#Hh[A^A_]Hch H ?H H;MtU UHH=5H5H H 0u u HH=B H]ÐUH]: fDUHSPHH=H5iHH  XuHH=݀ H5HHm t H ttH[]H=dH[]a fUHAVSH0HuH5 HEЋFEHEHEH}ȃHu$ H]H=H AtDH=%q H t1H= H tH=M: H t H Lc HuL  1H0[A^]UHAWAVSH(HuHl5 HED~D}HG]ԉ]؅y HHLw(HEMA)Au{HuH} }L}tH=ׅL AtuH= p L tbH= L tOH=49 L t<tHLHUHpLMh !IHLHUHpLM(d HuLH(1t Ef.EuzEf.EuzEf.Eu{$|d HuH(HUt pf.Pu'z%xf.XuzEf.`u{'d HuH(HpYt E~>1AfA.Du z HH9u!c HuH(LDt c HzHEHHHH9ns蕦 HHHH9t Ht3 Hmd  UHAWAVSHHH)HHEHH@< HDvDHGyr HHL(MA)HAaHur ZHHur =HHr "HHr HH@*r HH r HLL:r HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLd np 1H 8H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!` HuHHU1q Ef.`u$z"Ef.huzEf.pu{$m` HuHHUp I` HuHo @f. u*z(Hf.(uzPf.0u{'_ HuHH@$p f.u*z(f.uzf.u{'_ HuHHo `_ HuHn ?_ HHc@_ H H H;M) DUHAWAVSH(HuH HEDvDuHG]ԉ]؅yn HHL(MA)AumHuH}n toH5J H}HU5n }tUIH5J H}HUn }t8}utH}m 1H([A^A_]ILLHH^ HuHc ^ UHAWAVAUATSHHŝHHEHPH~ HXF`HGdhy@m HHHG(HpLPLl AC6HcH m HE1EIcHLELnl AH]C?HcHl HE1EIcHIDHpHI͋`+dHPHHl HPHul HPHuDjl HPHLl tiHPLD9l tSHEHEf(Ef)EDHxE#A1HxzHPk E1HHH9t Ht語 HHH9t Ht荞 HHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMO[ HpHHUHMMPEf.EuzEf.EuzEf.Eu{$W HuHPHU:h E~E1HMfA.uzHH9xu"W HuHPHUDg E~>1ADf.u z HH9Eu!mW HuHPLDg LW HKL-ܖIEHHH9?D+ HHHH9tHt ə HHHH9t Ht襙 HW  fUHAVSH HuH: HEDvDuHG]]y 4f HHt%H(HtD9uEt1Y HXV Ht51H}111e HH [A^]HpH#V HuHtH5HO Hf HPV HHH뱐UHAWAVSHhH̕HHEHuH HED~D}HG]]yTe HHLw(MA)H}AuZHuVe HEHE(E)E}t?('Q)EH?HEQ1f.EuRzP2d eIHuLXHcEf.EuzEf.EuzEf.Eu{T HuH}HU1e T Ht1H H H;Mu#Hh[A^A_]HT H nH H;Mt脗 UHHHNHHEH@Hj HHFPHDžTH@XHuc QH@Huc 4HEHE(E)E(E(M)`)pHEHEH}HuV Ef.EuzEf.EuzEf.Eu{!S HuH@HU1c Ef.`uCzAEf.hu2z0Ef.pu!zEf.xuzEf.Eu{$S HuH@HUKc R Hu.H~HH ĒH H;Mt&ڕ Sb 1H H H;MuH]f.fUHH`HnHHEHH; HFHDžHHub HH@a }HEHE(E)E(@(P(`(p))))(E)(E)(E) HEH0H}H@T Ef.EuzEf.EuzEf.Eu{!UQ HuHHU1a @f.93Hf.Pf.Xf.`f.hf.pf.xf.uyzwEf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef. u$z"Ef.(uzEf.0u{'O HuHH@` O Hu.HRHH H H;Mt&讒 '_ 1H rH H;MuH`]UHAWAVSHHIHHEH H H(D~D0HG48y^ HHLw(MA)H AHu^ H Hp^ ttHEHE(E)E(p(M)@)PHEH`4tiH}HpQ Ef.Ef] 1H "H H;M,H[A^A_]E1MIHuHpLxEf.EuzEf.EuzEf.Eu{!M HuH HU1^ pf.@uIzGxf.Hu5z3Ef.Pu$z"Ef.XuzEf.`u{'GM HuH Hp] M HHHH H H;M @UHAWAVSHhHɌHHEHH HD~DHGyB\ HH5Lw(MA)HAHu=\ HH \ HEHE(E)E( (0(@(P))))(`)(p)(E)HEHtiH}H N Ef.Ef [ 1H XH H;M4Hh[A^A_]E1MIHuH LEf.EuzEf.EuzEf.Eu{!J HuHHU19[  f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf.u{'uI HuHH Y NI HHވHH $H H;M6 fUHSH(HuHl HE؋FEHEH}Ѓu6Hu Y t8}K HH Hu#H߾W H([]þHX 1H([]UHSH(HuH HE؋FEHEH}Ѓu6HuX t8}zK HTH Hu#H߾xW H([]þW 1H([]ÐUHH=5H5βHVH 0UH u-#HH="H H]ÐUH]送 fDUHSPHH=аH5iH]VH G Xu"HH=G H5)VHHMG t H ttH[]H=dH[]AH fUHAVSH0HuH HEЋFEHEHEH}ȃuoHuW tqH]H=UH At1H= H tH=H H׉ t H U LcF HuLF V 1H0[A^]f.@UHAWAVSH(HuH\ HED~D}HG]ԉ]؅yU HHLw(HEMA)AuhHuH}V }L}tlH=TL AtbH= Lو tOH=7 Lƈ t<tHLHUHpLMh !IHLHUHpLM(. HuLH(1-> Ef.EuzEf.EuzEf.Eu{$. HuH(HU> pf.Pu'z%xf.XuzEf.`u{'/. HuH(Hpi> E~>1AfA.Du z HH9u!- HuH(LD&> - HzHUmHHHH9nsp HHHH9t HtCp H}.  UHAWAVSHHH9mHHEHHP HDvDHGy< HHL(MA)HAaHu< ZHHu< =HH< "HH< HH@:< HH< HLLJ< HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLe n: 1H HkH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!* HuHHU1; Ef.`u$z"Ef.huzEf.pu{$}* HuHHU: Y* HuH9 @f. u*z(Hf.(uzPf.0u{') HuHH@4: f.u*z(f.uzf.u{') HuHH9 p) HuH8 O) HHcP) H 'iH H;M9l DUHAWAVSH(HuH HEDvDuHG]ԉ]؅y8 HHL(MA)AumHuH}8 toH5 H}HUE8 }tUIH5 H}HU(8 }t8}utH}7 1H([A^A_]ILLHH( HuHc( UHAWAVAUATSHHgHHEHPH HXF`HGdhyP7 HHHG(HpLPL6 AC6HcH7 HE1EIcHLEL~6 AH]C?HcH6 HE1EIcHIDHpHI͋`+dHPHH7 HPHu6 HPHuDz6 HPHL6 tiHPLDI6 tSHEHEf(Ef)EDHxE#A1HxzHP5 E1HHH9t Hth HHH9t Hth HeHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM[ HpHHUHMMPEf.EuzEf.EuzEf.Eu{$ " HuHPHUJ2 E~E1HMfA.uzHH9xu"! HuHPHUD2 E~>1ADf.u z HH9Eu!}! HuHPLD1 \! HKL-`IEHHH9?D;d HHHH9tHt c HHHH9t Htc H!  fUHAVSH HuHJ HEDvDuHG]]y D0 HHt%H(HtD9uEt1Z Hh Ht51H}111/ HH [A^]HpH3 HuHtH5X H0 H` HH_H뱐UHAWAVSHhH_HHEHuHХ HED~D}HG]]yd/ HHLw(MA)H}AuTHuf/ HEHE(E)E}t9(')EHE#1f.EuRzP2. eIHuLXHcEf.EuzEf.EuzEf.Eu{ HuH}HU1&/  Ht1H ^H H;Mu#Hh[A^A_]H H ^H H;Mta fDUHAWAVAUATSHXHuH HEDvDuHG]]y- HHLo(MnA)H}A NHu-. LH5H H}HU- }.IH54 H}HUx- } IH5n H}HUW- }IH5 H}HU6- }HH5 H}HU- }HEH5צ H}HU, }HEH}Hu- tsH5 H}HU, }tYHEH}Hu3- tD}ELUЋEtQLLLLILMPuARuV U O, 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H d HuH[HUHHH.\HHEH`HJ HhFpHDžtH`0Hu+ )H`Hu+  HEHE(E)E(E(M)E)MH}HuRU Ef.EuzEf.EuzEf.Eu{!o HuH`HU1+ Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$ HuH`HUS+  Hu.HZHH ZH H;Mt&] [* 1H ZH H;MuHĠ]@UHHH~ZHHEH HK H(F0HDž4H Hu** H Hu * xHEHE(E)E(E(M(U(])@)P)`)pH}HuS Ef.EuzEf.EuzEf.Eu{! HuH HU1) Ef.@uyzwEf.HuhzfEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$ HuH HU7)  Hu.HjXHH XH H;Mt&[ ?( 1H XH H;MuH]UHAWAVSHHYXHHEH@H HHD~DPHGTXy' HHLw(MA)H@AuHu' t|H@Hu' tcHEHE(E)E(E(M)`)pTtfH}HuBQ Ef.Ec' 1H NWH H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{! HuH@HU12' Ef.`u5z3Ef.hu$z"Ef.puzEf.xu{$ HuH@HU& i HHUHH ?VH H;MQY f.UHAWAVSHH VHHEHH# HD~DHGy% HHLw(MA)HAHu}% HH`]% HEHE(E)E(`(p(U(]) )0)@)PtiH}H`N Ef.Ef$ 1H TH H;MmH[A^A_]E1MIHuH`LEf.EuzEf.EuzEf.Eu{!q HuHHU1$ `f. hf.(unzlpf.0uZzXxf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{' HuHH`#  HHSHH cSH H;MuV UHAWAVSH(HuH HED~D}HG]ԉ]؅y " HHtlLw(MtcA)AuGHuH}/# tIuLxL H Hu1Ht9H5 He# H  H}F" 1H([A^A_]H6RHUHH=H5H(H 0  u-HVH=O HC]ÐUH]* fDUHSPHH= H5Hc(H ` uHH=- H5/(HH t H tH[]H=H[] fUHAVSH0HuH% HEЋFEHEHEH}ȃHut! H]H='HkT AtDH=e HRT t1H=c H?T tH= H,T t H^ Lc HuL j 1H0[A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y2 HHLw(HEMA)Au{HuH}a }L}tH=&LRS AtuH=L L9S tbH=J L&S tOH= LS t Ht+12H}111 !HHc HuH HHH [A^]UHAWAVSH(HuHv HED~D}HG]ԉ]؅y b HHtJLw(MtAA)Au%HuH} t'}t.1v Hu 1HHH9t HtU= Hl:HH;EyHH[A\A]A^A_]E1؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9><tHLHUHpLM !IHLHUHpLM(4 HuLH(1 Ef.EuzEf.EuzEf.Eu{$ HuH(HU) pf.Pu'z%xf.XuzEf.`u{' HuH(Hp E~>1AfA.Du z HH9u!F HuH(LD % HzH7HHHH9ns; HHHH9t Ht: H  UHAWAVSH(HuHl HEDvDuHG]ԉ]؅y2 HHL(MA)AumHuH} toH5 H}HU }tUIH5[ H}HU }t8}utH}x 1H([A^A_]ILLHH HuHc UHAWAVAUATSHHu6HHEHPH.n HXF`HGdhy HHHG(HpLPLY AC6HcH HE1EIcHLEL AH]C?HcH| HE1EIcHIDHpHI͋`+dHPHH HPHu5 HPHuD HPHLM tiHPLD tSHEHEf(Ef)EDHxE#A1HxzHPD E1HHH9t HtZ7 HHH9t Ht=7 HT4HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM; HpHHUHMMPEf.EuzEf.EuzEf.Eu{$ HuHPHU E~E1HMfA.uzHH9xu"a HuHPHUD E~>1ADf.u z HH9Eu! HuHPLD] HKL-/IEHHH9?D2 HHHH9tHt y2 HHHH9t HtU2 H  fUHAVSH HuHj HEDvDuHG]]y HHt%H(HtD9uEt1v H Ht51H}111 HH [A^]HpH HuHtH5 HX H HHF.H뱐UHAWAVAUATSHXHuHp HEDvDuHG]]y HHLo(MnA)H}A NHuM LH5hw H}HU }.IH5Tw H}HU } IH5 H}HUw }IH5-w H}HUV }HH5 w H}HU5 }HEH5v H}HU }HEH}Hu tsH5v H}HU }tYHEH}HuS tD}ELUЋEtQLLLLILMPuARub U o 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H HuH,HUHAWAVSHHHI,HHEHH` HDvDHGy HHL(MA)HAaHu ZHHu =HH "HH HH@J HH* HLLZ HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL n 1H X*H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{! HuHHU1! Ef.`u$z"Ef.huzEf.pu{$ HuHHU i HuH @f. u*z(Hf.(uzPf.0u{' HuHH@D f.u*z(f.uzf.u{' HuHH HuH _ HHc` H 7(H H;MI+ DUHAWAVSHhH (HHEHuHn HED~D}HG]]y HHLw(MA)H}Au_Hu HEHE(E)E}tDH?HEHEHEH1f.EuRzP2 eIHuLXHcEf.EuzEf.EuzEf.Eu{ HuH}HU1K Ht1H &H H;Mu#Hh[A^A_]H H &H H;Mt) f.UHHH~&HHEH`H{ HhFpHDžtH`"Hu* H`Hu HEHE(E)E(E)EHEHEH}Hu` Ef.EuzEf.EuzEf.Eu{! HuH`HU1 Ef.EuzEf.EuzEf.Eu{$t HuH`HU P Hu.H$HH *%H H;Mt&@(  1H %H H;MuHĠ]fUHHH$HHEH`H{ HhFpHDžtH`"Hu H`Hum HEHE(E)E(E)EHEHEH}Hu Ef.EuzEf.EuzEf.Eu{! HuH`HU1_ Ef.EuzEf.EuzEf.Eu{$ HuH`HU Hu.HD#HH #H H;Mt&&  1H d#H H;MuHĠ]fUHAWAVSHH9#HHEH@Hi HHD~DPHGTXy HHLw(MA)H@AuHu t|H@Hu tcHEHE(E)E(E)`HEHpTtfH}Hu Ef.Ec 1H ."H H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{! HuH@HU1 Ef.`u$z"Ef.huzEf.pu{$~ HuH@HU Z H H HH 0!H H;MB$ f.@UHAWAVSHH HHEH@Hi HHD~DPHGTXyr HHLw(MA)H@AuHuq t|H@HuX tcHEHE(E)E(E)`HEHpTtfH}Hu Ef.Ec 1H H H;MHĨ[A^A_]E1M2IHuHULEf.EuzEf.EuzEf.Eu{! HuH@HU1 Ef.`u$z"Ef.huzEf.pu{$> HuH@HU{  H HHH H H;M" UHH=QH5.SHH 0 Ru}HfRH=_Q HSQ]ÐUH] fDUHSPHH=0QH5RHRH QuHRH=P} H5HPH t H PtH[]H=PH[] fUHAVSH0HuHu HEЋFEHEHEH}ȃHu H]H=H AtDH=f H t1H=f H tH= H| t H Lc< HuLA  1H0[A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y HHLw(HEMA)Au{HuH} }L}tH=nL AtuH=e L tbH=e Lv tOH=Ԗ Lc t<tHLHUHpLM !IHLHUHpLM(d HuLH(1 Ef.EuzEf.EuzEf.Eu{$ HuH(HUY pf.Pu'z%xf.XuzEf.`u{' HuH(Hp E~>1AfA.Du z HH9u!v HuH(LD U HzHHHHH9ns5 HHHH9t Ht H  UHAWAVSH(HuH8 HEDvDuHG]ԉ]؅yb HHL(MA)AumHuH} toH5 H}HU }tUIH5 H}HU }t8}utH} 1H([A^A_]ILLHH HuHc UHAWAVAUATSHHHHEHPH^: HXF`HGdhy HHHG(HpLPL AC6HcH HE1EIcHLELN AH]C?HcH HE1EIcHIDHpHI͋`+dHPHH HPHue HPHuDJ HPHL} tiHPLD tSHEHEf(Ef)EDHxE#A1HxzHPt E1HHH9t Ht HHH9t Htm HHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMs HpHHUHMMPEf.EuzEf.EuzEf.Eu{$ݼ HuHPHU E~E1HMfA.uzHH9xu"葼 HuHPHUD E~>1ADf.u z HH9Eu!M HuHPLD , HKL-IEHHH9?D HHHH9tHt HHHH9t Ht H迼  fUHAVSH HuH7 HEDvDuHG]]y  HHt%H(HtD9uEt1 H8 Ht51H}111 HH [A^]HpH HuHtH5( H H0 HHvH뱐UHAWAVAUATSHXHuH< HEDvDuHG]]y> HHLo(MnA)H}A NHu} LH5C H}HU }.IH5C H}HU } IH5t H}HU }IH5]C H}HU }HH5 HHLo(MA)A HuH}} H5$ H}HU }aIH5$ H}HUȪ }@IH5U H}HU觪 }IH5U H}HU膪 }HH5|U H}HUe }HEH5$ H}HUC }HEH5# H}HU! }HEH5# H}HU }t{HEHuH}萪 tfH5# H}HUЩ }tL}ELUtNHLLLLILMPARuuu RH} l 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0舙 HuHHUHAWAVAUATSHXHEHHEHH HF HG$(y HHHG(H@LL) ACD-HcH芨 HE1EIcHLEL AH0C?HcHH HE1EIcHHHIDH@ +$HHu LHsHH0D UHH<) :HHp軧 HHܧ HLD膧 HEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHK E1HHH9t Hta HHH9t HtD H[HH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLM^ !IHLHUHpLM(t HuLH(1͜ Ef.EuzEf.EuzEf.Eu{$, HuH(HUi pf.Pu'z%xf.XuzEf.`u{'ό HuH(Hp E~>1AfA.Du z HH9u!膌 HuH(LDƜ e HzHHHHH9nsE HHHH9t Ht H  UHAWAVSH(HuH HEDvDuHG]ԉ]؅yr HHL(MA)AumHuH}Ǜ toH5w H}HU% }tUIH5w H}HU }t8}utH}踚 1H([A^A_]ILLHH HuHc UHAWAVAUATSHHHHEHPHn HXF`HGdhy0 HHHG(HpLPL虙 AC6HcH HE1EIcHLEL^ AH]C?HcH輙 HE1EIcHIDHpHI͋`+dHPHH HPHuu HPHuDZ HPHL荙 tiHPLD) tSHEHEf(Ef)EDHxE#A1HxzHP脘 E1HHH9t Ht HHH9t Ht} HHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM HpHHUHMMPEf.EuzEf.EuzEf.Eu{$ HuHPHU* E~E1HMfA.uzHH9xu"衄 HuHPHUD E~>1ADf.u z HH9Eu!] HuHPLD蝔 < HKL-IEHHH9?D HHHH9tHt HHHH9t Ht Hτ  fUHAVSH HuH* HEDvDuHG]]y $ HHt%H(HtD9uEt1$ HH Ht51H}111̒ HH [A^]HpH HuHtH58| H蘓 H@ HHH뱐UHAWAVAUATSHXHuH HEDvDuHG]]yN HHLo(MnA)H}A NHu荒 LH5 H}HU }.IH5 H}HUؑ } IH5< H}HU跑 }IH5m H}HU薑 }HH5L H}HUu }HEH57 H}HUS }HEH}Hu tsH5 H}HU }tYHEH}Hu蓑 tD}ELUЋEtQLLLLILMPuARu U 诐 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H Ā HuHXHUHAWAVSHHHHHEHHY HDvDHGy HHL(MA)HAaHu ZHHu =HH "HH HH@芏 HHj HLL蚏 HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL萭 nM 1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!!~ HuHHU1a Ef.`u$z"Ef.huzEf.pu{$} HuHHU } HuH @f. u*z(Hf.(uzPf.0u{'J} HuHH@脍 f.u*z(f.uzf.u{'| HuHH! | HuH | HHc| H wH H;M艿 DUHAWAVSHhHLHHEHuH@ HED~D}HG]]yԋ HHLw(MA)H}AuTHu֋ HEHE(E)E}t9(v)EHEv1f.EuRzP23 eIHuLXHcEf.EuzEf.EuzEf.Eu{S{ HuH}HU1薋 5{ Ht1H H H;Mu#Hh[A^A_]H{ H H H;Mt fDUHHHκHHEH@H HHFPHDžTH@fHuz _H@Hu] BHEHE(E)E(E(M(U)`)p)UH}Hu Ef.EuzEf.EuzEf.Eu{!z HuH@HU1A Ef.`uQzOEf.hu@z>Ef.pu/z-Ef.xuzEf.EuzEf.Eu{$y HuH@HU轉 \y Hu.HHH 6H H;Mt&L ň 1H H H;MuH]f.@UHH H޸HHEHH HFHDžH1Hu芈 *HH` j  HEHE(E)E(`(p(U(]))) )0(E)@(E)PH}H` Ef.EuzEf.EuzEf.Eu{!w HuHHU1! `f.hf.pf.xf.Ef. uyzwEf.(uhzfEf.0uWzUEf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'v HuHH`  v Hu.H5HH {H H;Mt&葹  1H UH H;MuH ]UHAWAVSHH)HHEH H H(D~D0HG48y袅 HHLw(MA)H AHu蝅 H Hp} ttHEHE(E)E(p(M(U)@)P)`4tiH}Hp" Ef.Ef跄 1H H H;M=H[A^A_]E1MIHuHpLxEf.EuzEf.EuzEf.Eu{!t HuH HU1 pf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'t HuH HpP s HHHH ųH H;M׶ UHAWAVSH(HHHEHH HD~DHGy HHLw(MA)HAHu HH@ HEHE(E)E(@(P(`(p))))(E) (E)0tiH}H@^ Ef.Ef 1H DH H;MH([A^A_]E1MIHuH@LEf.EuzEf.EuzEf.Eu{!q HuHHU1% @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf. u5z3Ef.(u$z"Ef.0uzEf.8u{'p HuHH@ p H+H!HH gH H;M#y DUHSH(HuH HE؋FEHEH}ЃuEHu` tG}؞ Hp Hu2Ht6H59i H虀 HAp H([]þy 1H([]HmHH([]ÐUHH=5H5HH 0o u]AHH=o H]ÐUH]颟 fDUHSPHH=H5iHYH o Xu@HH=]o H5%HHn t H ttH[]H=dH[]o fUHAVSH0HuHU$ HEЋFEHEHEH}ȃHu~ H]H=H蛱 AtDH= H肱 t1H= Ho tH=( H\ t H| Lcn HuL!n } 1H0[A^]UHAWAVSH(HuH# HED~D}HG]ԉ]؅yb} HHLw(HEMA)Au{HuH}} }L}tH=uL肰 AtuH=| Li tbH=z LV tOH=' LC t<tHLHUHpLM脆 !IHLHUHpLM(DV HuLH(1e Ef.EuzEf.EuzEf.Eu{$U HuH(HU9f pf.Pu'z%xf.XuzEf.`u{'U HuH(Hpe E~>1AfA.Du z HH9u!VU HuH(LDe 5U HzHŔHHHH9ns HHHH9t Ht賗 HU  UHAWAVSH(HuH HEDvDuHG]ԉ]؅yBd HHL(MA)AumHuH}d toH5@ H}HUc }tUIH5k@ H}HUc }t8}utH}c 1H([A^A_]ILLHHS HuHcS UHAWAVAUATSHHHHEHPH> HXF`HGdhyc HHHG(HpLPLib AC6HcHb HE1EIcHLEL.b AH]C?HcHb HE1EIcHIDHpHI͋`+dHPHHb HPHuEb HPHuD*b HPHL]b tiHPLDa tSHEHEf(Ef)EDHxE#A1HxzHPTa E1HHH9t Htj HHH9t HtM HdHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM~ HpHHUHMMPEf.EuzEf.EuzEf.Eu{$M HuHPHU] E~E1HMfA.uzHH9xu"qM HuHPHUD] E~>1ADf.u z HH9Eu!-M HuHPLDm] M HKL-IEHHH9?D HHHH9tHt 艏 HHHH9t Hte HM  fUHAVSH HuH HEDvDuHG]]y [ HHt%H(HtD9uEt1J| HL Ht51H}111[ HH [A^]HpHK HuHtH5E Hh\ HL HHVH뱐UHAWAVAUATSHXHuH HEDvDuHG]]y[ HHLo(MnA)H}A NHu][ LH5x H}HUZ }.IH5d H}HUZ } IH5 H}HUZ }IH5= H}HUfZ }HH5 H}HUEZ }HEH5 H}HU#Z }HEH}HuZ tsH5 H}HUY }tYHEH}HucZ tD}ELUЋEtQLLLLILMPuARu6z U Y 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H I HuH(HUHAWAVSHHHYHHEHHp" HDvDHGyX HHL(MA)HAaHuX ZHHuX =HHX "HHX HH@ZX HH:X HLLjX HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLw nW 1H hH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!F HuHHU11W Ef.`u$z"Ef.huzEf.pu{$F HuHHUV yF HuHU @f. u*z(Hf.(uzPf.0u{'F HuHH@TV f.u*z(f.uzf.u{'E HuHHU E HuHT oE HHcpE H GH H;MY DUHAWAVSHhHHHEHuH HED~D}HG]]yT HHLw(MA)H}AuZHuT HEHE(E)E}t?(?)EH?HE}?1f.EuRzP2S eIHuLXHcEf.EuzEf.EuzEf.Eu{D HuH}HU1`T C Ht1H H H;Mu#Hh[A^A_]HC H H H;MtԆ UHH`HHHEHH HFHDžHHuJS HH@*S }HEHE(E)E(@(P(`(p))))(E)(E)(E) HEH0H}H@r Ef.EuzEf.EuzEf.Eu{!B HuHHU1R @f.93Hf.Pf.Xf.`f.hf.pf.xf.uyzwEf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef. u$z"Ef.(uzEf.0u{'A HuHH@OQ @ Hu.HHH ȀH H;Mt&ރ WP 1H H H;MuH`]UHSHHH}HHEHHJ HFHDžHbHuк)P [HH@- P ;HEHE(E)EHH@hH H}Hp Ef.EuzEf.EuzEf.Eu{!? HuHHU1O @f.D>Hf.("Pf. Xf.`f.hf.pf.xf.zf.d^f.HBf. ,&f.( f.0f.8f.@f.Hf.P~f.Xhbf.`LFf.h0*f.pf.xf.f.f.f.f.lff.PJ f.4.(f.0f.8f.@f.Hf.Pf.Xf.utzr`f.u`z^hf.uLzJpf.u8z6xf.u$z"Ef.uzEf.u{{6; HuHH@-pK ; Hu.HzHH zH H;Mt&} xJ 1H zH H;MuHH[]Ef. rlEf.(YSEf.0@:\UHAWAVSHhHIzHHEHH HD~DHGyI HH5Lw(MA)HAHuI HH I HEHE(E)E( (0(@(P))))(`)(p)(E)HEHtiH}H Ni Ef.EfH 1H xH H;M4Hh[A^A_]E1MIHuH LxEf.EuzEf.EuzEf.Eu{!y8 HuHHU1H  f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf.u{'6 HuHH /G 6 HH^vHH vH H;My fUHAWAVSHHHyvHHEHH HD~DHGyE HHLw(MA)HAHuE HH0-E thHEHE(E)EHH0hx tiH}H0e Ef.EfE 1H ^uH H;M|HH[A^A_]E1M"IHuH0LEf.EuzEf.EuzEf.Eu{!4 HuHHU1?E 0f.8f.ys@f.]WHf.A;Pf.%Xf. `f.hf.pf.xf.f.}wf.a[f. E?f.()#f.0 f.8f.@f.Hf.Pf.X{f.`e_f.hICf.p-'f.x f.f.f.f.f.f.ic f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf. u{'30 HuHH0-m@ 0 HHoHH oH H;Mr UHSH(HuH, HE؋FEHEH}ЃuEHu? tG}_ H/ Hu2Ht6H5( H@ H/ H([]þ> 1H([]HnHH([]UHSH(HuH_ HE؋FEHEH}ЃuEHu@? tG}_ H. Hu2Ht6H5( Hy? H!/ H([]þY> 1H([]HMnHH([]ÐUHH=H5H{H 0. u=HH=߯. Hӯ]ÐUH]S fDUHSPHH=H5IH\{H p. 8uHH=z=. H5({HgH- t H TtH[]H=DH[]. fUHAVSH0HuH5 HEЋFEHEHEH}ȃHu= H]H=zH{p AtDH=u Hbp t1H=s HOp tH= H

' Ht+12H}1116 !HHc' HuH' HHH [A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y b6 HHtVLw(MtMA)Au1HuH}6 t3}ut7LK Hj& Hu9H}5 1H([A^A_]ILH/& HuH6 UHAWAVSH(HuH9 HED~D}HG]ԉ]؅y 5 HHtJLw(MtAA)Au%HuH}5 t'}t.1% Hu<tHLHUHpLM7 !IHLHUHpLM(T HuLH(1! Ef.EuzEf.EuzEf.Eu{$  HuH(HUI" pf.Pu'z%xf.XuzEf.`u{' HuH(Hp! E~>1AfA.Du z HH9u!f HuH(LD! E HzHPHHHH9ns%T HHHH9t HtS H  UHAWAVSHHHPHHEHH HDvDHGy2 HHL(MA)HAaHu- ZHHu =HH1 "HH HH@ HH HLL HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL4 n} 1H NH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!Q HuHHU1 Ef.`u$z"Ef.huzEf.pu{$ HuHHU: HuH' @f. u*z(Hf.(uzPf.0u{'z HuHH@ f.u*z(f.uzf.u{' HuHHQ HuHF HHc H LH H;MO DUHAWAVAUATSHHuLHHEHpH& HxFEHGMMy HHL(Hpl AC6HcH8 L81EIcM,LDME+E HpHu HpLD HEHEf(Ef)EDEArII9IDI91)HHHHt@I4ItHHuHpDI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uHpY 1H8H@H9E1b؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt/HHffADA fADALH HuH9^}tHuLL. IHuLLxEf.EuzEf.EuzEf.Eu{!l HuHpHU1 E~G1fAfA.Du z HH9u! HuHpLD`  HtD1H8H@H9t HtK HHHH;Eu4HHĨ[A\A]A^A_]HOHHH8H@H9uK HH8H@H9t HtDK H~  UHAVSH`H>HHHEHuHnHEFEHEH5# H}HU }HH5- H}HU }IH}Huк HEHE(E)EHUHL, Ef.EuzEf.EuzEf.Eu{!w HuH}HUо V Hu2HFHH 0GH H;Mt*FJ H} 1H GH H;MuH`[A^]@UHAWAVSHHHFHHEHHHDvDHGyR HHGL(MA)HAHuM HHu0 HHQ HH@ HH }HLL ZHEHE(E)E(E)`HEHp(@) HPH0()HHL4$HuHUHL@LLj* Ef.EuzEf.EuzEf.Eu{!  HuHHU1M Ef.`u$z"Ef.huzEf.pu{$ HuHHU  HuH @f. u*z(Hf.(uzPf.0u{'6 HuHH@p  HuH] f.u*z(f.uzf.u{' HuHH  HuHc  1H RCH H;MuHH[A^A_]E1MLF UHAWAVAUATSHHHCHHEHHHFHDžH AC$HcH~ L1EIcIHE؋+ZHHug SHH 8HLD2 HH` HH HEHE(E)EEEArKH9JI91D)HHLHtI4H4HHuH{I H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uH 1HHH9t HtC H@HH;EHHH[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9W(`(p(U)P)@)0f(f)H HH}H`LL$ AEf.EuzEf.EuzEf.Eu{!HuHHU1 E~<1Af.u z HI9u!AHuHLD `f.0u`z^hf.8uLzJpf.@u8z6xf.Hu$z"Ef.PuzEf.Xu{'HuHH` f.u*z(f.uz f.u{'KHuHH $HIc%HHHH9A HHHH9t Ht@ H UHAVSH0^HG)ЃHuHr HEЉ]؉U܉Uy HHH_(HH5 H}HU }HH " #HHc$HuHr HEЉ]؉U܉Uy HHt{H_(HtrHuH} taH5 H}HUd }tGIH5 H}HUG }t*}ut,HLHx! MH5q 1H0[A^]LHLHAHfDUHAWAVSH(HuHпHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5 H}HU~ }t4LH HuHcH}2 1H([A^A_]fUHAWAVATSHPHW;HHEHHHFHDžHn AC?HcH L1EIcIHE؋+ZHHu SHH 8HLD HHpd HH D HEHE(E)EEEArKH9JI91D)HHLHtI4H4HHuHyI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9uH 1HHH9t Ht'< H>9HH;EHHP[A\A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9Y(p(M(U)`)P)@f( f)H0HH}HpL L+ Ef.EuzEf.EuzEf.Eu{!HuHHU1 E~<1Af.u z HI9u!HuHLD pf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'HuHHp@  f.u*z((f.uz0f.u{'HuHH  |HrHHHH9V9 HHHH9t Ht8 H, fDUHAWAVAUATSHH5HHEHHHFHDžHH߾ ACD-HcH0Z L0E1EIcILEH߾ AC?HcHh Hh1EIcHHHE؋+HHQ HLD ~HHu aHH FHHD (HHPs HH HH8 DEArII9II91)HHHHtI4I4HHuHI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uEH 1HhHpH9t Ht,6 H0H8H9t Ht6 H&3HH;EGHHĸ[A\A]A^A_]ÉHpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH92H(E(M(U)U)M)pDHELAs1HHHHH9sHH9s1HpHHH‰уH s 1LoHH)1LAALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuHH9)HHHHtLI4H4HHuLHHrWI H ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HH9uH`H@(P)0()H HHH$HULPLA HE~=1AfA.u z HH9u!HuHLD Ef.puKzIEf.xu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$OHuHHUE~J1Hf.uzHH9u%HuHHD=Pf.0u*z(Xf.8uz`f.@u{'HuHHPf.u*z(f.uz f.u{'=HuHHwHHcHHhHpH90 H%H HHhHpH9t Ht0 H0H8H9t Htf0 H f.UHAVSHH[-HHEHPH_HXF`HDždH5sv HPHU}HH5Ov HPHU}dIHPHHFHPHuк)HPHu HEHE(E)E(E)pHEHEHHUHMHL Ef.EuzEf.EuzEf.Eu{$&HuHPHUоcEf.pu!zEf.xuzEf.Eu{$HuHPHUHu HcHP%1H p+H H;Mu Hİ[A^]z. fDUHAWAVAUATSHH5+HHEHPHb HXF`HGdhyHHHG(HpLPLAC6HcH{HE1EIcHLELAH]C?HcH<HE1EIcHIDHpHI͋`+dHPHH`HPHuHPHuDHPHL tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht, HHH9t Ht+ H)HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM HpHHUHMMPEf.EuzEf.EuzEf.Eu{$mHuHPHUE~E1HMfA.uzHH9xu"!HuHPHUD`E~>1ADf.u z HH9Eu!HuHPLDHKL-L$IEHHH9?D' HHHH9tHt 9' HHHH9t Ht' HO fUHAVSH HuH?HEDvDuHG]]y HHt'H(HtD9uEt)Ht*11H}111J HHukHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtmLw(EMtIA)H}Au@Hu3t/}EtEA8tAILHt81>i1+E1#ILHuHA"HH([A^A_]ÐUHH=eiH5jHkRH 0iu-H6jH=/iH#i]ÐUH] fDUHSPHH=iH5jHRH `iuȳHiH=h-H5QHhHt H htH[]H=hH[]fUHAVSH0HuH% HEЋFEHEHEH}ȃHutH]H=;QHk$ AtDH=ej HR$ t1H=cj H?$ tH= H,$ t H^LcHuLj1H0[A^]UHAWAVSH(HuH HED~D}HG]ԉ]؅y2HHLw(HEMA)Au{HuH}a}L}tH="PLR# AtuH=Li L9# tbH=Ji L&# tOH= L# tHzHu9H}1H([A^A_]ILH?HuHUHAWAVSHxH HHEHxHE HED~D}HG]]yHHLw(MA)HxAumHutoHxHu|tVH5 HxHU%}t9HMHM(E)E}utOHULHQ1H H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$HuHxHUH`HcH yH H;MZ UHAWAVAUATSHXHuHU HEDvDuHG]ĉ]ȅyHHLo(MA)A HuH}H58` H}HU}aIH5$` H}HUh}@IH5^ H}HUG}IH5= H}HU&}HH5 H}HU}HEH5_ H}HU}HEH5_ H}HU}HEH5_ H}HU}t{HEHuH}0tfH5T_ H}HUp}tL}ELUtNHLLLLILMPARuuu5RH} 1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0(HuHHUHAWAVAUATSHXHHHEHHvC HF HG$(y`HHHG(H@LLACD-HcH*HE1EIcHLELAH0C?HcHHE1EIcHHHIDH@ +$HHuLHsHH0DUHH<:HHp[HH|HLD&HEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHE1HHH9t Ht HHH9t Ht HHH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLM!IHLHUHpLM(HuLH(1mEf.EuzEf.EuzEf.Eu{$HuH(HU pf.Pu'z%xf.XuzEf.`u{'oHuH(HpE~>1AfA.Du z HH9u!&HuH(LDfHzHHHHH9ns HHHH9t Ht H UHAWAVSH(HuH< HEDvDuHG]ԉ]؅yHHL(MA)AumHuH}gtoH5b H}HU}tUIH5; H}HU}t8}utH}X1H([A^A_]ILLHHHuHcUHAWAVAUATSHHUHHEHPH> HXF`HGdhyHHHG(HpLPL9AC6HcHHE1EIcHLELAH]C?HcH\HE1EIcHIDHpHI͋`+dHPHHHPHuHPHuDHPHL-tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHP$E1HHH9t Ht: HHH9t Ht H4HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM;HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHUE~E1HMfA.uzHH9xu"AHuHPHUDE~>1ADf.u z HH9Eu!HuHPLD=ܿHKL-lIEHHH9?D HHHH9tHt Y HHHH9t Ht5 Ho fUHAVSH HuH: HEDvDuHG]]y HHt%H(HtD9uEt1HHt51H}111lHH [A^]HpH賾HuHtH5ط H8HHH&H뱐UHAWAVAUATSHXHuH@ HEDvDuHG]]yHHLo(MnA)H}A NHu-LH5HG H}HU}.IH54G H}HUx} IH5nx H}HUW}IH5 G H}HU6}HH5F H}HU}HEH5F H}HU}HEH}HutsH5F H}HU}tYHEH}Hu3tD}ELUЋEtQLLLLILMPuARunU O1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H dHuHHUHAWAVSHHH)HHEHH@ HDvDHGyHHL(MA)HAaHuZHHu=HH"HHHH@*HH HLL:HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn1H 8H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1Ef.`u$z"Ef.huzEf.pu{$mHuHHUIHuH@f. u*z(Hf.(uzPf.0u{'HuHH@$f.u*z(f.uzf.u{'臸HuHH`HuH?HHc@H H H;M)DUHAWAVSHhHHHEHuH= HED~D}HG]]ytHHLw(MA)H}AuZHuvHEHE(E)E}t?(g)EH؉؉?HE]1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU10϶Ht1H H H;Mu#Hh[A^A_]H跶H H H;MtUHH@HnHHEHHK HFHDžH^HuWHHP 7HEHE(E)E(P(`(p(]))))(E) (E)0HEH@H}HP0Ef.EuzEf.EuzEf.Eu{!cHuHHU1Pf.Xf.`f.hf.pf.xf.uyzwEf.uhzfEf.uWzUEf. uFzDEf.(u5z3Ef.0u$z"Ef.8uzEf.@u{'+HuHHP eHu.HHH H H;Mt&m1H H H;MuH@]fDUHSHHHHEHHZJ HF HDž$HHuк9HHp'HEHE(E)EH0Hp8HH}HEf.EuzEf.EuzEf.Eu{!HuHHU1pf.0xf.8f.@f.Hf.Poif.XSMf.`71f.hf.pf.xf.f.f.f.smf.WQf.;5f.f.f.f.f.f. f.wq(f.[U0f.?98f.#@f.Hf.Pf.Xf.`f. hf.(uz}pf.0ukzixf.8uWzUEf.@uFzDEf.Hu5z3Ef.Pu$z"Ef.XuzEf.`u{'諮HuHHp'脮Hu.HHH ^H H;Mt&t1H 8H H;MuH[]DUHAWAVSHHH HHEHH4 HD~DHGy肽HH'Lw(MA)HAHu}HH0 ]HEHE(E)E(0(@(P(`))))(p)(E)HEH tiH}H0Ef.Ef[1H H H;MHH[A^A_]E1MIHuH0LxEf.EuzEf.EuzEf.Eu{!GHuHHU1臼0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf. u{'HuHH0 5ԪH HdHH H H;MUHAWAVSHHyHHEHH2 HD~DHGyHHLw(MA)HAHuHH`'͹thHEHE(E)EH H`8tiH}H`6Ef.Ef1H ^H H;MH[A^A_]E1M"IHuH`LEf.EuzEf.EuzEf.Eu{!HuHHU1?`f. hf.(pf.0xf.8f.@}wf.Ha[f.PE?f.X)#f.` f.hf.pf.xf.f.{f.e_f.ICf.-'f. f.f.f.f.f.f.ic f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f. uqzohf.(u]z[pf.0uIzGxf.8u5z3Ef.@u$z"Ef.HuzEf.Pu{'ۤHuHH`'贤H4HDHH H H;M,UHSH(HuHB HE؋FEHEH}ЃuEHu耴tG}H4Hu2Ht6H5Y H蹴HaH([]þ虳1H([]HHH([]UHSH(HuHB HE؋FEHEH}ЃuEHutG}H蔣Hu2Ht6H5 HHH([]þ1H([]HHH([]ÐUHH=/H50Hi!H 0u/utH/H=.BH.]ÐUH]馻fDUHSPHH=.H5I0H!H 8/uxtH/H=z.ݢH5 Hg.Hmt H T.tH[]H=D.H[]afUHAVSH0HuHW HEЋFEHEHEH}ȃHu$H]H=9 HAtDH=+ Ht1H=+ HtH=M\ Ht HLc蜡HuL衡1H0[A^]UHAWAVSH(HuHlW HED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH= LAtuH=) LtbH=) LtOH=4[ Lt<tHLHUHpLM蘢!IHLHUHpLM(ԉHuLH(1-Ef.EuzEf.EuzEf.Eu{$茉HuH(HUəpf.Pu'z%xf.XuzEf.`u{'/HuH(HpiE~>1AfA.Du z HH9u!HuH(LD&ňHzHUHHHH9nsHHHH9t HtCH} UHAWAVSH(HuHY HEDvDuHG]ԉ]؅yҗHHL(MA)AumHuH}'toH5"t H}HU腗}tUIH5s H}HUh}t8}utH}1H([A^A_]ILLHHVHuHc[UHAWAVAUATSHHHHEHPH HXF`HGdhy萖HHHG(HpLPLAC6HcH[HE1EIcHLEL辕AH]C?HcHHE1EIcHIDHpHI͋`+dHPHH@HPHuՕHPHuD躕HPHLtiHPLD艕tSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t HtHHH9t HtHHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM#HpHHUHMMPEf.EuzEf.EuzEf.Eu{$MHuHPHU芑E~E1HMfA.uzHH9xu"HuHPHUD@E~>1ADf.u z HH9Eu!轀HuHPLD蜀HKL-,IEHHH9?D{HHHH9tHt HHHH9t HtH/ fUHAVSH HuH HEDvDuHG]]y 脏HHt%H(HtD9uEt1^HHt51H}111,HH [A^]HpHsHuHtH5x HHHHH뱐UHAWAVAUATSHXHuHo HEDvDuHG]]y讎HHLo(MnA)H}A NHuLH5 H}HUY}.IH5 H}HU8} IH5.9 H}HU}IH5 H}HU}HH5 H}HUՍ}HEH5 H}HU賍}HEH}Hu@tsH5d H}HU耍}tYHEH}HutD}ELUЋEtQLLLLILMPuARuJU 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H $}HuHHUHAWAVSHHHHHEHHV HDvDHGybHHL(MA)HAaHu]ZHHu@=HHa"HHFHH@HHʋHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLʓn譊1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!zHuHHU1Ef.`u$z"Ef.huzEf.pu{$-zHuHHUj zHuHW@f. u*z(Hf.(uzPf.0u{'yHuHH@f.u*z(f.uzf.u{'GyHuHH聉 yHuHvxHHcyH ׸H H;MDUHAWAVSHhHHHEHuH HED~D}HG]]y4HHLw(MA)H}AuTHu6HEHE(E)E}t9(r)EHEr1f.EuRzP2蓇eIHuLXHcEf.EuzEf.EuzEf.Eu{wHuH}HU1wHt1H wH H;Mu#Hh[A^A_]H}wH TH H;MtjfDUHHH.HHEH HJ H(F0HDž4H HuچH Hu轆xHEHE(E)E(E(M(U(])@)P)`)pH}Hu<Ef.EuzEf.EuzEf.Eu{!SvHuH HU1蓆Ef.@uyzwEf.HuhzfEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$uHuH HUuHu.HHH `H H;Mt&v1H :H H;MuH]UHH`HHHEHH HFHDžHHu躄HH@蚄HEHE(E)E(@(P(`(p))))(E)(E)(E) (E)0H}H@،Ef.EuzEf.EuzEf.Eu{!sHuHHU15@f.RLHf.60Pf.Xf.`f.hf.pf.xf.Ef.uyzwEf.uhzfEf.uWzUEf.uFzDEf. u5z3Ef.(u$z"Ef.0uzEf.8u{'lrHuHH@覂ErHu.HٱHH H H;Mt&5讁1H H H;MuH`]UHAWAVSHHɱHHEHHz HD~DHGyBHHLw(MA)HAHu=HH`HEHE(E)E(`(p(U(]) )0)@)PtiH}H`芉Ef.EfE1H H H;MmH[A^A_]E1MIHuH`LxEf.EuzEf.EuzEf.Eu{!1pHuHHU1q`f. hf.(unzlpf.0uZzXxf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'toHuHH`MoHHݮHH #H H;M5UHAWAVSHhHHHEHH HD~DHGyr~HH5Lw(MA)HAHum~HH M~HEHE(E)E( (0(@(P))))(`)(p)(E)(E)tiH}H |Ef.Ef=}1H H H;MMHh[A^A_]E1MIHuH LEf.EuzEf.EuzEf.Eu{!)mHuHHU1i} f.f`(f.JD0f..(8f. @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'kHuHH {ekHHHH ;H H;MMUHH=H5^HH 0ekMu<tHLHUHpLMo!IHLHUHpLM(QHuLH(1 aEf.EuzEf.EuzEf.Eu{$lQHuH(HUapf.Pu'z%xf.XuzEf.`u{'QHuH(HpIaE~>1AfA.Du z HH9u!PHuH(LDaPHzH5HHHH9ns腓HHHH9t Ht#H]Q UHAWAVSH(HuH9 HEDvDuHG]ԉ]؅y_HHL(MA)AumHuH}`toH5< H}HUe_}tUIH5; H}HUH_}t8}utH}^1H([A^A_]ILLHH6OHuHc;OUHAWAVAUATSHHHHEHPH HXF`HGdhyp^HHHG(HpLPL]AC6HcH;^HE1EIcHLEL]AH]C?HcH]HE1EIcHIDHpHI͋`+dHPHH ^HPHu]HPHuD]HPHL]tiHPLDi]tSHEHEf(Ef)EDHxE#A1HxzHP\E1HHH9t HtڏHHH9t Ht轏HԌHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMfHpHHUHMMPEf.EuzEf.EuzEf.Eu{$-IHuHPHUjYE~E1HMfA.uzHH9xu"HHuHPHUD YE~>1ADf.u z HH9Eu!HHuHPLDX|HHKL- IEHHH9?D[HHHH9tHt HHHH9t HtՊHI fUHAVSH HuHj HEDvDuHG]]y dWHHt%H(HtD9uEt1dHGHt51H}111 WHH [A^]HpHSGHuHtH5x@ HWHGHHƆH뱐UHAWAVAUATSHXHuHO HEDvDuHG]]yVHHLo(MnA)H}A NHuVLH5 H}HU9V}.IH5 H}HUV} IH5 H}HUU}IH5 H}HUU}HH5 H}HUU}HEH5w H}HUU}HEH}Hu VtsH5D H}HU`U}tYHEH}HuUtD}ELUЋEtQLLLLILMPuARubU T1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H EHuHHUHAWAVSHHHɄHHEHH HDvDHGyBTHHL(MA)HAaHu=TZHHu T=HHAT"HH&THH@SHHSHLLSHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLB`nR1H ؂H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!aBHuHHU1REf.`u$z"Ef.huzEf.pu{$ BHuHHUJRAHuH7Q@f. u*z(Hf.(uzPf.0u{'AHuHH@Qf.u*z(f.uzf.u{''AHuHHaQAHuHVP@HHc@H H H;MɃDUHAWAVSHhHHHEHuH HED~D}HG]]yPHHLw(MA)H}Au:HuPHEHE(E)E}tHuLH]!OdIHuLXEf.EuzEf.EuzEf.Eu{?HuH}HU1O?Ht1H rH H;Mu#Hh[A^A_]Hcx?H OH H;MteUHAWAVSHxH,HHEHxH HED~D}HG]]yNHHLw(MA)HxAu:HuNHEHE(E)E}tHuL[!'NjIHuL`EEf.EuzEf.EuzEf.Eu{!E>HuHxHU1N$>Ht1H ~H H;Mu%Hx[A^A_]E>H }H H;MtUHHH}HHEHH HFHDžHHujMHHp JMHEHE(E)E(p(M(U(]) )0)@)P(E)`H}Hp\ZEf.EuzEf.EuzEf.Eu{!<HuHHU1Mpf. xf.(Ef.0uyzwEf.8uhzfEf.@uWzUEf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{';HuHHp (L;Hu.H[{HH {H H;Mt&~0K1H {{H H;MuH]fUHSHHHM{HHEHH HFHDžHHuкJHHJHEHE(E)EHHH}H}HXEf.EuzEf.EuzEf.Eu{!:HuHHU1Jf.f.f.f.f.pjf.TNf.82f.f.f.f. f.( f.0(f.8tn0f.@XR8f.H<6@f.P Hf.XPf.`Xf.h`f.phf.xpf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'j7HuHHGC7Hu.HvHH wH H;Mt&3zF1H vH H;MuHH[]@UHAWAVSHHvHHEHHz HD~DHGyBFHH Lw(MA)HAHu=FHHP FHEHE(E)E(P(`(p(]))) )0(E)@tiH}HP SEf.Ef7E1H uH H;MH[A^A_]E1MIHuHPLxEf.EuzEf.EuzEf.Eu{!#5HuHHU1cEPf.Xf.`f.hf.unzlpf. uZzXxf.(uFzDEf.0u5z3Ef.8u$z"Ef.@uzEf.Hu{'.4HuHHP hD4HcHsHH sH H;M[vf.UHAWAVSHHHsHHEHHû HD~DHGy"CHHLw(MA)HAHuCHHBthHEHE(E)EHHvtiH}H PEf.EfCB1H rH H;MHH[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!/2HuHHU1oBf.f.f.f.f.~xf.b\f.F@f.*$f.f.f.f.f. f.(| f.0f`(f.8JD0f.@.(8f.H @f.PHf.XPf.`Xf.h`f.phf.xunzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{' /HuHHD?.H3HsnHH nH H;M+qUHSH(HuH HE؋FEHEH}ЃuEHu>tG}KHd.Hu2Ht6H5' H>H.H([]þ=1H([]HmHH([]UHSH(HuH/ HE؋FEHEH}ЃuEHu>tG}JH-Hu2Ht6H5& HI>H-H([]þ)=1H([]HmHH([]ÐUHH=%H5HȾH 0-u HH=r-H]ÐUH].WfDUHSPHH=H5YHcH @-HuHH= -H5/HwH,t H dtH[]H=TH[]-fUHAVSH0HuHHEЋFEHEHEH}ȃHuT<H]H=HKoAtDH=E H2ot1H=C HotH=}H ot H>:Lc+HuL+J;1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y;HHLw(HEMA)Au{HuH}A;}L}tH=L2nAtuH=, LntbH=* LntOH=dLmt<tHLHUHpLM>!IHLHUHpLM(HuLH(1]#Ef.EuzEf.EuzEf.Eu{$HuH(HU#pf.Pu'z%xf.XuzEf.`u{'_HuH(Hp#E~>1AfA.Du z HH9u!HuH(LDV#HzHRHHHH9nsUHHHH9t HtsUH UHAWAVSH(HuH HEDvDuHG]ԉ]؅y"HHL(MA)AumHuH}W"toH5RH}HU!}tUIH5+H}HU!}t8}utH}H!1H([A^A_]ILLHHHuHcUHAWAVAUATSHHEQHHEHPH HXF`HGdhy HHHG(HpLPL) AC6HcH HE1EIcHLELAH]C?HcHL HE1EIcHIDHpHI͋`+dHPHHp HPHu HPHuDHPHL tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht*RHHH9t Ht RH$OHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM5HpHHUHMMPEf.EuzEf.EuzEf.Eu{$} HuHPHUE~E1HMfA.uzHH9xu"1 HuHPHUDpE~>1ADf.u z HH9Eu! HuHPLD- HKL-\JIEHHH9?DMHHHH9tHt IMHHHH9t Ht%MH_  fUHAVSH HuH HEDvDuHG]]y HHt%H(HtD9uEt13H Ht51H}111\HH [A^]HpH HuHtH5 H(H HHIH뱐UHAWAVAUATSHXHuH HEDvDuHG]]yHHLo(MnA)H}A NHuLH58 H}HU}.IH5$ H}HUh} IH5^H}HUG}IH5 H}HU&}HH5ܑ H}HU}HEH5Ǒ H}HU}HEH}HuptsH5 H}HU}tYHEH}Hu#tD}ELUЋEtQLLLLILMPuARu1U ?1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H THuHFHUHAWAVSHHHGHHEHH0HDvDHGyHHL(MA)HAaHuZHHup=HH"HHvHH@HHHLL*HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLL/n1H (EH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1Ef.`u$z"Ef.huzEf.pu{$]HuHHU9HuH@f. u*z(Hf.(uzPf.0u{'HuHH@f.u*z(f.uzf.u{'wHuHHPHuH/HHc0H CH H;MFDUHAWAVSHhHBHHEHuHЈ HED~D}HG]]ydHHLw(MA)H}AuTHufHEHE(E)E}t9(G)EHEC1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU1&Ht1H AH H;Mu#Hh[A^A_]HH AH H;MtDfDUHAWAVSHxH\AHHEHxH9 HED~D}HG]]yHHLw(MA)HxAu:HuHEHE(E)E}tHuL*!WjIHuL`EEf.EuzEf.EuzEf.Eu{!uHuHxHU1THt1H 6@H H;Mu%Hx[A^A_]E4H @H H;Mt'CUHHH?HHEH@H HHFPHDžTH@fHu_H@Hu}BHEHE(E)E(E(M(U)`)p)UH}Hub)Ef.EuzEf.EuzEf.Eu{!!HuH@HU1aEf.`uQzOEf.hu@z>Ef.pu/z-Ef.xuzEf.EuzEf.Eu{$HuH@HU|Hu.H>HH V>H H;Mt&lA 1H 0>H H;MuH]f.@UHH H=HHEHH˔ HFHDžH1Hu *HH`  HEHE(E)E(`(p(U(]))) )0(E)@(E)PH}H`6'Ef.EuzEf.EuzEf.Eu{!HuHHU1A `f.hf.pf.xf.Ef. uyzwEf.(uhzfEf.0uWzUEf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'HuHH` " Hu.HU;HH ;H H;Mt&>* 1H u;H H;MuH ]UHAWAVSHHI;HHEH H H(D~D0HG48y HHLw(MA)H AHu H Hp ttHEHE(E)E(p(M(U)@)P)`4tiH}Hpt$Ef.Ef 1H ":H H;M=H[A^A_]E1MIHuHpLxEf.EuzEf.EuzEf.Eu{!HuH HU1 pf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'6HuH Hpp HH8HH 8H H;M;UHAWAVSH(H8HHEHHӀ HD~DHGy2HHLw(MA)HAHu-HH@ HEHE(E)E(@(P(`(p))))(E) (E)0tiH}H@!Ef.Ef1H d7H H;MH([A^A_]E1MIHuH@LEf.EuzEf.EuzEf.Eu{!HuHHU1E@f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf. u5z3Ef.(u$z"Ef.0uzEf.8u{'HuHH@ H+HA5HH 5H H;M#8UHH=H5HH 0uHH=ߏHӏ]ÐUH]fDUHSPHH=H5IHH P8uHH=zH5zHgHt H TtH[]H=DH[]fUHAVSH0HuHHEЋFEHEHEH}ȃHudH]H=H[7AtDH=U} HB7t1H=S} H/7tH=H7t HNLcHuLZ1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y"HHLw(HEMA)Au{HuH}Q}L}tH=ʊLB6AtuH=<| L)6tbH=:| L6tOH=tL6t<tHLHUHpLM!IHLHUHpLM(HuLH(1]Ef.EuzEf.EuzEf.Eu{$HuH(HUpf.Pu'z%xf.XuzEf.`u{'_HuH(HpE~>1AfA.Du z HH9u!HuH(LDVHzHHHHH9nsHHHH9t HtsH UHAWAVSH(HuHO HEDvDuHG]ԉ]؅yHHL(MA)AumHuH}WtoH5RH}HU}tUIH5+H}HU}t8}utH}H1H([A^A_]ILLHHHuHcUHAWAVAUATSHHEHHEHPHP HXF`HGdhyHHHG(HpLPL)AC6HcHHE1EIcHLELAH]C?HcHLHE1EIcHIDHpHI͋`+dHPHHpHPHuHPHuDHPHLtiHPLDtSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht*HHH9t Ht H$HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMKHpHHUHMMPEf.EuzEf.EuzEf.Eu{$}HuHPHUE~E1HMfA.uzHH9xu"1HuHPHUDpE~>1ADf.u z HH9Eu!HuHPLD-HKL-\IEHHH9?DHHHH9tHt IHHHH9t Ht%H_ fUHAVSH HuHM HEDvDuHG]]y HHt%H(HtD9uEt1HHt51H}111\HH [A^]HpHHuHtH5H(HHHH뱐UHAWAVAUATSHXHuHS HEDvDuHG]]yHHLo(MnA)H}A NHuLH58Z H}HU}.IH5$Z H}HUh} IH5^H}HUG}IH5Y H}HU&}HH5Y H}HU}HEH5Y H}HU}HEH}HuptsH5Y H}HU}tYHEH}Hu#tD}ELUЋEtQLLLLILMPuARu~U ?1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H THuHHUHAWAVSHHHHHEHH0HDvDHGyHHL(MA)HAaHuZHHup=HH"HHvHH@HHHLL*HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn1H ( H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU1Ef.`u$z"Ef.huzEf.pu{$]HuHHU9HuH@f. u*z(Hf.(uzPf.0u{'HuHH@f.u*z(f.uzf.u{'wHuHHPHuH/HHc0H  H H;MDUHAWAVSHhH HHEHuHP HED~D}HG]]ydHHLw(MA)H}AuZHufHEHE(E)E}t?(G)EH?HE=1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{HuH}HU1 Ht1H H H;Mu#Hh[A^A_]HH ~ H H;Mt UHH`H^ HHEHHz^ HFHDžHHu HH@}HEHE(E)E(@(P(`(p))))(E)(E)(E) HEH0H}H@2Ef.EuzEf.EuzEf.Eu{!EHuHHU1@f.93Hf.Pf.Xf.`f.hf.pf.xf.uyzwEf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef. u$z"Ef.(uzEf.0u{'HuHH@Hu.HBHH H H;Mt& 1H bH H;MuH`]UHSHHH=HHEHH ] HFHDžHbHuк[HH@-;HEHE(E)EHH@hHH}HXEf.EuzEf.EuzEf.Eu{!qHuHHU1@f.D>Hf.("Pf. Xf.`f.hf.pf.xf.zf.d^f.HBf. ,&f.( f.0f.8f.@f.Hf.P~f.Xhbf.`LFf.h0*f.pf.xf.f.f.f.f.lff.PJ f.4.(f.0f.8f.@f.Hf.Pf.Xf.utzr`f.u`z^hf.uLzJpf.u8z6xf.u$z"Ef.uzEf.u{{HuHH@-0Hu.HcHH H H;Mt&81H H H;MuHH[]Ef. rlEf.(YSEf.0@:\UHAWAVSHhH HHEHHF HD~DHGyHH5Lw(MA)HAHu}HH ]HEHE(E)E( (0(@(P))))(`)(p)(E)HEHtiH}H Ef.EfM1H H H;M4Hh[A^A_]E1MIHuH LxEf.EuzEf.EuzEf.Eu{!9HuHHU1y f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf.u{'赼HuHH 莼HHHH dH H;MvfUHAWAVSHHH9HHEHHSD HD~DHGyHHLw(MA)HAHuHH0-thHEHE(E)EHH0htiH}H0Ef.Ef1H H H;M|HH[A^A_]E1M"IHuH0LEf.EuzEf.EuzEf.Eu{!迺HuHHU10f.8f.ys@f.]WHf.A;Pf.%Xf. `f.hf.pf.xf.f.}wf.a[f. E?f.()#f.0 f.8f.@f.Hf.Pf.X{f.`e_f.hICf.p-'f.x f.f.f.f.f.f.ic f.MG(f.1+0f.8f.@f.Hf.Pf.Xf.`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf. u{'HuHH0--̵HH\HH H H;MUHSH(HuHS HE؋FEHEH}ЃuEHutG}HTHu2Ht6H5yHH聵H([]þ1H([]HHH([]UHSH(HuHT HE؋FEHEH}ЃuEHutG}VH贴Hu2Ht6H5٭H9HH([]þ1H([]H HH([]ÐUHH=SH5UH|H 0蕴}TuHTH=SbHS]ÐUH]dfDUHSPHH=SH5)UH$|H 0Tu|HaTH=ZSH5{HGSH荳t H 4StH[]H=$SH[]遴fUHAVSH0HuHhHEЋFEHEHEH}ȃu\HuHt^H]H=a{HCAtH=mH*t H\LcHuLh1H0[A^]ÐUHAWAVSH(HuHhHED~D}HG]ԉ]؅y2HHLw(HEMA)AuQHuH}at|}L}tYH=tzLVAtOH=lL=t1HMfA.u z HH9u賣HuH}HUDE~;1ADf.u z HH9EurHuH}LD赳THL-IEHXH`H9HHXH`H9tHtHHH H9t HtH @UHAVSH HuHK HEDvDuHG]]y DHHtHG(HtD9uHcX0qHt1H}111 HaHHH [A^]UHAVSH HuHJHEDvDuHG]]y 贱HHtHG(HtD9uHcX4Ht1H}111e HѡHHH [A^]UHAVSH HuHVHEDvDuHG]]y $HHtHG(HtD9uHcX8QHt1H}111հ HAHHH [A^]UHAVSH HuHJHEDvDuHG]]y 蔰HHtHG(HtD9uHcX<Ht1H}111E H豠HHH [A^]UHAWAVSH(DvHGD)؃tsHuHuJHEDuЉ]ԉ]؅yHHHG(HD9HX@HHH5.HnHuH JHEDuЉ]ԉ]؅y 腯HHtdH_(Ht[HuH}tJLcuLc{8H[@螟Hu4HtPMJHPE1LEHucH}111lRE1ƋHuCL]Ht6HH t)HHH1Q@H߾1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111茚!HLc݊HuLHHH([A^A_]f.DUHAWAVSH(HuH3 HED~D}HG]ԉ]؅y "HHt\Lw(MtSA)Au7H5DH}HU}t0}t7LH$Hu9H}覙1H([A^A_]ILH8HuH}HUHAVSH HuHkHEDvDuHG]]y DHHt"H(HtD9uEt$kHt(1.H}111HCHuHHHH [A^]UHAVSH HuHHEDvDuHG]]y蔘HHH(HD9u_E~] ~S~IrDHc֍qDHcHʍPDHcHjHuAH}1111KHt$1HH [A^]HPH'HuH2HDUHAVSH HuH4 HEDvDuHG]]y 脗HHt:H(Ht1D9u0Ett@EEEEEE}tFHuHjHH5X 覍1H H H;MHx[]1HHHuHHEf.EuzEf.EuzEf.Eu{}HuH}HU1}HmH}H ^H H;Mgpf.fUHAWAVAUATSHH%HHEЋ^HG)ЃHhH,fHpx|Uy荌HH)L(HhACD-HcHaL1EIcM$LDMx+|RHhHuAcH5 HhHU}BHHhH n$HhH(# HhHuHhHu貋HhLD蘋EXE8EHE0E@EPDH`EuA1H`HhHSdHpx|Uy贊HHXL(Hh'ACD-HcH舊L1EIcM$LDMx+|HhHuhH5 HhHU }iHH5pfHhHUH`}>HhH m#HhH("HhHuHhHu豉HhLD藉E0E@EPE8EHEDHXE.A1HXH5Yb贈1MHh蠈Hh興1HHH9t Ht蟻HHH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLHϘ"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{!>vHuHhHU1~vHuUHhvEf.0u$z"Ef.@uzEf.Pu{$uHuHhHU E~A1AfA.uzHH9`u!uHuHhLDÅbuHmLiuHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{!lsHuHhHU1謃KsHuUHh褂Ef.8u$z"Ef.HuzEf.u{$rHuHhHU7E~A1AfA.uzHH9Xu!rHuHhLDrHLrHHHH9oHHHH9t HtHAs f.UHAWAVAUATSHHHHEH HR H(F0HG48ypHHL(H ACD-HcHDL1EIcM$LDMG0+4H Hu$H5sH HOƀOHH HKH HH HHH Hp艀t|H LDstfHEHE(E)E(p)PHEH`DH@EAst1H@WH 1HHH9t HtҲHHH;EBHH[A\A]A^A_]E1#H@II9sII9s1HpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH@H9)HHHHtI4I4HHuHH@rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u4Ht#L4$HuLHLpLH(IHL4$HuLHLpLHIEf.EuzEf.EuzEf.Eu{!mHuH HU1~mHuHH |pf.Pu'z%xf.XuzEf.`u{'GmHuH Hp}E~A1AfA.uzHH9@u!lHuH LD;}lHLm}HHHH9蹯HHHH9t HtUHm fUHAWAVSH(HuHHED~D}HG]ԉ]؅y {HHtVLw(MtMA)Au1HuH}]|t3}Hut6L虍kHu8H}l{1H([A^A_]ILkHuHckӐUHAWAVSH8HuHB HED~D}HG]ԉ]؅y{HHLw(MtyA)Au]HuH}{t_H5fWH}HUz}tE}HutHAIHHLшjHu9H}lz1H8[A^A_]ILHjHuHCHf.@UHAWAVSH8HuHB HED~D}HG]ԉ]؅y zHHt{Lw(MtrA)AuVHuH}}ztXH5ZVH}HUy}t>}HutAIHHL҇iHu9H}gy1H8[A^A_]ILHiHuH>HfUHAVSH HuH"O HEDvDuHG]]y yHHt"H(HtD9uEt$+iHt(1.H}111xHiHuHHHH [A^]UHAWAVSH(HuH| HED~D}HG]܉]y RxHHt#H(HtD9uAEtxhHt+12H}111w!HLcMhHuLRhHHH([A^A_]f.DUHAWAVSH8HuH:A HEDvDuHG]ԉ]؅ywHHL(MA)AulHuH}xtnH5SH}HUEw}tTIH5SH}HU(w}t7}Hut:LLHFWgHuv}t4LHψzfHuHHH}u1H([A^A_]fUHAVSHPHHHE^HG)ЃMHuHhHE]UĉUȅyuHHIH_(H!H}Huu H}HuuH}Huuu؋UЋMHAHuHphHE]UĉUȅyuHHH_(HH}Huغ ut|E)EDuHuH͆~EfvEf8%fPt tD9utdHuH}HU16udHuHWHH5g:t1H H H;MuHP[A^]1H苧UHAWAVSH(HuHIiHED~D}HG]܉]y sHHt$Lw(MtD9uEt&IdHt.1:H}111s)IL IcHuLrHHH([A^A_]fDUHAVSH HuH3 HEDvDuHG]]y $sHHt%HG(HtD9uUHcHt1H}111r Hc8cHHH [A^]UHAWAVSHHHHEH0H}H8D~D@HGDHybrHHLw(MA)H0AHu]rH0HuRrzH0Hp rZHEHE(E)EHEHEEE(p)PHEH`HuHUHpLփEf.EuzEf.EuzEf.Eu{!aHuH0HU1qE;EuE;EuE;Et$vaHuH0HUqpf.Pu'z%xf.XuzEf.`u{'aHuH0HpSq`HuHc`pp1H H H;MuHĸ[A^A_]E1M赣UHAWAVAUATSHHHxHHEHuHHEDvDuHG]]ypHHLg(MA)H}AHuĺpẺEHEHELcuLc}LcmIc$HMIc$ A9u D;}uD;mt_HuH}HU1p_Hu;ILH]LH_H wH H;Mt&荢o1H QH H;MuHH[A\A]A^A_]fUHAWAVAUATSHHHHHEHuHHEDvDuHG]]ynHHLg(MA)H}AHuĺnẺEHEHELc}LcuHcMHME$A$ ADNOA9uD;uu HE;EtR^HuH}HU1n4^HuCHcAHELIcHL(^H H H;Mt&m1H ӝH H;MuHH[A\A]A^A_]f.UHAWAVSH(HuH HED~D}HG]ԉ]؅y 2mHHt\Lw(MtSA)Au7H5H}HUl}t0}t7LH4]Hu9H}l1H([A^A_]ILH0\HuHHUHAVSH HuH HEDvDuHG]]y TlHHt$H(HtD9uEt&H0y\Ht+12H}111k!H8HN\HuHlHHH [A^]fUHAWAVSH(HuH HED~D}HG]ԉ]؅y kHHt\Lw(MtSA)Au7H5H}HUnk}t0}t7LH}[Hu9H}&k1H([A^A_]ILH@i[HuHHUHAVSH HuH? HEDvDuHG]]y jHHt$H(HtD9uEt&H8ZHt+12H}111mj!HHHZHuHUkHHH [A^]fUHAWAVSH(HuH! HED~D}HG]ԉ]؅y jHHt\Lw(MtSA)Au7H5H}HUi}t0}t7LH{ZHu9H}i1H([A^A_]ILHPYHuHmHUHAVSH HuHг HEDvDuHG]]y 4iHHt$H(HtD9uEt&H@YYHt+12H}111h!HXH.YHuHiHHH [A^]fUHAWAVSHHHHE^HG)ЃHuHHE]UUy]hHHH_(HxH}Huzh^(E)pD}DuHuHzfopfvEP<u D9}uD9ut2XHuH}HU1hXHHHHuH'HE]UUygHHH_(HH}HugH}HugH}HugtoH}Hugt^H}HugtMH}HugtH}111H5ُH}HU_}t7H]rH;PHu"H`H([]H}о_1H([]ÐUHAVSH=H5+HH 2PfH_L5`HOHt"HH5LHOH uHPHOHt"HH5KLHMOH uHZPHXOHt"HH5TLHOH uH'PH=[OH[A^]UH]ZfDUHSPHH5HtHNt H atH[]H=QH[]OfDUHSH(HuH'HE؋FEHEHEH}Ѓu;Huz^t=H]H=aHut/H Hc5NHu']1H([]û NHuHNH([]UHAWAVSH(HuHHEDvDuHG]ԉ]؅y b]HHtwL(HEMtKA)AuFHuH}]t1}LutNH=zL莐tfL&OMHt?1CH}\1,HE1 ILLPMHuHcMH([A^A_]ûLHuUHAVSH0HuHKHEЋFEHEuGH5KH}HUM\}t@HHtCHH5HPE1LEsLHu+H}Ⱦ[1H0[A^]E1FLHuL\UHAVSH HuHBHEDvDuHG]]y[HHH(HD9u3HPxHt9HHH5HPE1LEKHucH}111,[RE1KHuCL\Ht6HHKt)HKHH1Q@H߾K1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y ZHHt#H(HtD9uAEtJHt+12H}111LZ!HLcJHuLJHHH([A^A_]f.DUHHHHGzu H=*]TgH5#Y1]@UHAWAVSHXHuH'HED~D}HG]܉]yYHHLw(MA)H}AHuZH}HuYH}HuYt{H}HuYtjH}HuYtYH}HuYtHHuEHUMHMULT0IHuHc5IX1HX[A^A_]E1M$UHAWAVSHhHuH(HED~D}HG]܉]ybXHHLw(MA)H}AHuXH}HuXH}HuXH}HubXH}Hu}XH}Hu8XtsH}HuWXtbH}HuXtQHuEHUMHMULE]LfSGHuHcG7W1Hh[A^A_]E1MUHAVSH HuH.*HEDvDuHG]]y VHHtH(HtD9uR GHt1H}111V HHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y bVHHt\Lw(MtSA)Au7H5H}HU.V}t0}t7LHERdFHu9H}U1H([A^A_]ILH)FHuHHUHAWAVSH8HuHe+HED~D}HG]̉]Ѕy UHHtvLw(MtmA)AuQHuH}UtSH53H}HU=U}t9ELH[QrEHuHcwEH}T1H8[A^A_]UHAWAVSH(HuHHED~D}HG]ԉ]؅y THHt`Lw(MtWA)Au;H5MH}HU~T}t4LHqPDHuHNHH}2T1H([A^A_]fUHAWAVSH(HuH HEDvDuHG]ԉ]؅ySHHL(MtwA)Au[H5v H}HUS}tTIH5LH}HUS}t7LLHOCHuHcCH}NS1H([A^A_]DUHAWAVSH(HuH)HEDvDuHG]ԉ]؅ySHHL(MtwA)Au[H5H}HUR}tTIH5lH}HUR}t7LLHNBHuHcBH}nR1H([A^A_]DUHAWAVSH8HuHIHEDvDuHG]̉]Ѕy 2RHHtxL(MtoA)AuSH5 H}HUQ}tLIHuH}Rt8HULLM BHuHc%BH}Q1H8[A^A_]ÐUHAWAVSH8HuHyHEDvDuHG]̉]Ѕy bQHHtxL(MtoA)AuSH5H}HU.Q}tLIHuH}Qt8HULL-MPAHuHcUAH}P1H8[A^A_]ÐUHAWAVSH8HuHHEDvDuHG]̉]Ѕy PHHt~L(HEMtRA)AuMH5 H}HUVP}t/IHuH}PtHULL=Lx@Ht01!H}O1 HE1H8[A^A_]HcM@fUHAWAVSH8HuHHEDvDuHG]̉]Ѕy OHHt~L(HEMtRA)AuMH5HH}HUfO}t/IHuH}OtHULL_K?Ht01!H}O1 HE1H8[A^A_]Hc]?됐UHH=H5H-H 0u?}u?HH=B?H]ÐUH]ufDUHSPHH=H5)H,H ?u\?HaH=Z>H5v,HGHm>t H 4tH[]H=$H[]a?fUHAVSH0HuHHEЋFEHEHEH}ȃu\Hu(Nt^H]H=+H#AtH={H t HHHtVLw(MtMA)Au1HuH}E?t3}ut7L(;H.Hu9H}l>1H([A^A_]IL8H.HuHF?UHAWAVSH(HuH-HED~D}HG]ԉ]؅y >HHt\Lw(MtSA)Au7H54H}HU=}t0}t7LH=:.Hu9H}=1H([A^A_]ILH@-HuHmmHUHHHHGzu H=:]JH5-=1]@UHAVSH HuH-HEDvDuHG]]y <HHt"H(HtD9uEt$ 9-Ht(1.H}111<HX,HuHlHHH [A^]UHAWAVSH(HuHjHED~D}HG]ԉ]؅y B<HHt\Lw(MtSA)Au7H5kH}HU<}t0}t7LH8D,Hu9H};1H([A^A_]ILH ,HuHkHUHAWAVSH(HuH iHED~D}HG]ԉ]؅y b;HHt\Lw(MtSA)Au7H5jH}HU.;}t0}t7LHc7d+Hu9H}:1H([A^A_]ILH)+HuHjHUHHHHGzu H=]GH5B$n:1]@UHHHHGzu H= ]GH5-.:1]@UHAVSH HuHBiHEDvDuHG]]y :HHt%H(HtD9uEt'r6H(*Ht+1>H}1119-HH)HuHHx)*HHH [A^]DUHAVSH HuHh HEDvDuHG]]y D9HHt"H(HtD9uEt$5k)Ht(1.H}1118HC)HuHhHHH [A^]UHHHztuHH]MH=]FH5p`z81]UHAWAVSH(HuH@(HED~D}HG]ԉ]؅y R8HHtSLw(MtJA)Au.HuH}8t0}ut4LV4](Hu6H}71H([A^A_]ILH%(HuHgH@UHAWAVSH(HuHp'HED~D}HG]ԉ]؅y 7HHt\Lw(MtSA)Au7H5-H}HUN7}t0}t7LHw3'Hu9H}71H([A^A_]ILHPI'HuHfHUHAWAVSH(HuH} HED~D}HG]ԉ]؅y 6HHt\Lw(MtSA)Au7H5fH}HUn6}t0}t7LH2&Hu9H}&61H([A^A_]ILH`i&HuHeHUHAWAVSH(HuHHED~D}HG]ԉ]؅y 5HHt\Lw(MtSA)Au7H51,H}HU5}t0}t7LH1%Hu9H}F51H([A^A_]ILHh%HuHeHUHAWAVSH(HuHn(HED~D}HG]ԉ]؅y 4HHt\Lw(MtSA)Au7H5OdH}HU4}t0}t7LH71$Hu9H}f41H([A^A_]ILHp$HuH=dHUHAWAVSH(HuH'HED~D}HG]ԉ]؅y 4HHt\Lw(MtSA)Au7H5q*H}HU3}t0}t7LHQ0$Hu9H}31H([A^A_]ILHx#HuH]cHUHSH(HuH#[HE؋FEHEEȃrH}о31[H5bH}HU2H1}tH59bH}HU_2}t7H.H"Hu"H23H([]H}о21H([]ÐUHAVSH=D1"HHaH=XH18IH uH%#L[A^]DUHAVSH=D1"HH/aH=H18IH uH"L[A^]DUHAWAVAUATSPH=H5H'H !3"HHL5L!HL1H5'H]HL'!tH Nu H=E("HHY!HH1H5'H}H tH u H=!AL=5cL%f.fIItqC4>H=!C1!!HLH1H_8IH tMuf.H`!MtKt>H}L0 IMuLH}111"-HH HuHHx HHH [A^]DUHSH(HuHA%HEFEHEtH}111C"!+HHt1 H+#HHH([]f.UHAWAVSH(HuH-&HED~D}HG]ԉ]؅y !HHtSLw(MtJA)Au.HuH}?"t0}ut4L+Hu6H}o!1H([A^A_]ILHuHIQH@UHAVSH HuH#&HEDvDuHG]]y !HHt$H(HtD9uEt&H*9Ht*11H}111  HHuHcHHH [A^]UHSH(HuH4&HEFEHEtH}111S !)HHt1 H;!HHH([]f.UHAWAVSH(HuH'HED~D}HG]ԉ]؅y HHtSLw(MtJA)Au.HuH}O t0}ut4L)Hu6H}1H([A^A_]ILHuHYOH@UHAVSH HuH&HEDvDuHG]]y $HHt$H(HtD9uEt&L(IHt*11H}111 HHuHc$HHH [A^]UHSH(HuH&HE؋FEHEH}Ѓu0Hut2}(HuHcH([]þ.1H([]fUHSH(HuHx'HE؋FEHEH}Ѓu0Hut2}'5HuHc:H([]þ1H([]fUHAWAVSH(HuH'HED~D}HG]ԉ]؅yrHHLw(HEMA)AHuH}}H]M~@HL HtMtLHtPMtLPHHTPIILPIF@I 1J ;H9s J 8H9LHHyHHHƉH`sa1H}R1+HE1ILH HR1H([A^A_]IF@HH)13L30L0D3 L30D0 L00D3@L3PD0@L0PD3`L3pD0`L0pHHuHt"HHD3 3D0 0H HuI9AHHILHt 1fD  HH9uI)HHHrQ1 T TT TT TT TT TT TT THI9uIL@ HHJHUHAWAVSH(HuH%HEDvDuHG]܉]y HHt!H(HtD9uEt/Lw@ Ht71H}111>HH([A^A_]HI HuMt3LMILH HHuP LL3 HHIHf.UHSH(HuH$%HEFEHEtH}111!j#H Ht1 H{HHH([]f.UHSH(HuH_%HEFEHEtH}111#!"Hx Ht1 H HHH([]f.UHSH(HuH%HEFEHEtH}111!0"H Ht1 HHHH([]f.UHSH(HuH'HEFEHEtH}111C! "HHt1 H+HHH([]f.UHSH(HuHH'HEFEHEtH}111!!H(Ht1 HHHH([]f.UHSH(HuH'HEFEHEtH}111c!4!HHt1 HKHHH([]f.UHSH(HuH'HEFEHEtH}111! HHHt1 HHHH([]f.UHSH(HuHJ(HEFEHEtH}111!N HHt1 HkHHH([]f.UHSH(HuHg(HEFEHEtH}111!HhHt1 HHHH([]f.UHSH(HuH(HEFEHEtH}111!HHt1 HHHH([]f.UHSH(HuH(HEFEHEtH}1113!HHt1 HHHH([]f.UHSH(HuH(HEFEHEtH}111!jHHt1 HHHH([]f.UHSH(HuHJ)HEFEHEtH}111S!HHt1 H;HHH([]f.UHSH(HuH)HEFEHEtH}111!rH8Ht1 HHHH([]f.UHAWAVSH(HuH4*HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5 H}HUN}t4LHHuHCHH}1H([A^A_]fUHAWAVSH(HuHH*HED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H51 H}HU}t4LH%HuH^BHH}B1H([A^A_]fUHAWAVSH(HuH*HEDvDuHG]ԉ]؅yHHL(EMAArH}gH5NH}HU}tMIƋMذ;M}H}Hut/}LLHuE1H([A^A_]ÐUHH=H5.H*H 0uHfH=_HS]ÐUH]3fDUHSPHH=0H5H.*H `uHHH=-H5)HHt H tH[]H=H[]fUHAVSH0HuH%HEЋFEHEHEH}ȃuoHuxtqH]H=k)HsCAt1H=[ HZCtH=HGCt HyLcHuL 1H0[A^]f.@UHAWAVSH(HuH̵HED~D}HG]ԉ]؅yBHHLw(HEMA)AuhHuH}q}L}tlH=Z(LbBAtbH=J LIBtOH=L6BtH$LLLMI;-BH} 1H8[A\A]A^A_]MUH$LLLMIAHuHR:Hf.UHAWAVAUATSH(HuHe HEDvDuHG]ĉ]ȅy HHLo(MA)AH53u H}HU }IH5 H}HU }IH56 H}HU }tlIH5H}HUo }tOHH5)H}HUR }t2}t=LLLLII+AH} 1H([A\A]A^A_]MULLLLIIA9HuH8HUHAWAVAUATSH(HuHnHEDvDuHG]ĉ]ȅyHHLo(MA)AH5s H}HUN}IH5 H}HU-}IH54 H}HU }tlIH5H}HU}tOHH5H}HU}t2}t=LLLLII/*AH}1H([A\A]A^A_]MULLLLIIAHuHM7HUHAVSH HuH HEDvDuHG]]y HHtH(HtD9u)@Ht1H}111 H6HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H52 H}HUN}t0}t7LH(Hu9H}1H([A^A_]ILHIHuH5HUHAVSH HuH/HEDvDuHG]]y HHtH(HtD9u(Ht1H}111R HcHHH [A^]f.UHAVSH HuH1HEDvDuHG]]y HHtH(HtD9u'.Ht1H}111 HcHHH [A^]f.UHAVSH HuH2HEDvDuHG]]y dHHtH(HtD9u&Ht1H}111 Hc~HHH [A^]f.UHAWAVSH(HuH3HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4uL&HuHg3HH}K1H([A^A_]fUHAWAVSH(HuHs3HED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}ot4uLz%#HuH2HH}1H([A^A_]fUHAWAVSH(HuH3HED~D}HG]ԉ]؅y bHHtkLw(MtbA)AuFHuH}tHHuH}t7uUL$_HuH1HH}1H([A^A_]ÐUHH=H5~H4H 0Umu!HH="H]ÐUH]fDUHSPHH=H5H4H uh!HQH=JH5Q4H7HMt H $tH[]H=H[]AfUHAVSH0HuHHEЋFEHEHEH}ȃuoHutqH]H=3H4At1H=UH3tH=HH3t H LcHuL1H0[A^]f.@UHAWAVSH(HuH\HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=2L2AtbH=tTL2tOH=7L2t}utBA9v8tAv8IL_Hu6H}1H([A^A_]IL'HuHHfDUHAVSH HuHo$HEDvDuHG]]y HHt H(HtD9uEt"_8譸Ht*11H}1111 H胸HuHc舸HHH [A^]UHAVSH HuHs$HEDvDuHG]]y HHt+H(Ht"D9u!Et-HHt(1.H}111vHʷHuH^HHH [A^]f.DUHAVSH HuH^$HEDvDuHG]]y HHt(H(HtD9uEt*H15Ht(1.H}111H HuHHHH [A^]fUHAVSH HuH\$HEDvDuHGEEy dHHtAH(Ht8xEtH}111# H}$HlHt1HH [A^]HHf.UHAWAVSH8HuHHED~D}HGẺEЅy HHtnLw(MtexCAuHHuH}tJEILE践Hu*E贵 H}EH}$1H8[A^A_]f.UHAVSH HuHHEDvDuHG]]y HHtH(HtD9uIHt1H}111 HcHHH [A^]f.UHAWAVSH8HuH,HED~D}HG]̉]Ѕy BHHtoLw(MtfA)AuJHuH}tLHuH}|t;EML;HuHHH}1H8[A^A_]f.UHAWAVSH(HuHG HED~D}HG]ԉ]؅y rHHtYLw(MtPA)Au4HuH}t6EL聳HuHHH}1H([A^A_]UHAVSH HuHHEDvDuHG]]y HHtH(HtD9u#Ht1H}111t HoHHH [A^]UHAWAVSH(HuH"HED~D}HG]ԉ]؅y 2HHtaLw(MtXA)Au}utBA9vxtAvxIL/Hu6H}1H([A^A_]ILHuHHfDUHAVSH HuH"HEDvDuHG]]y THHt H(HtD9uEt"_x}Ht*11H}111 HSHuHcXHHH [A^]UHAVSH HuH"HEDvDuHG]]y HHt+H(Ht"D9u!Et-H°Ht(1.H}111FH蚰HuH.HHH [A^]f.DUHAVSH HuH"HEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111艿HݯHuHqHHH [A^]fUHAWAVSH(HuH#HED~D}HG]ԉ]؅y 2HHtsLw(MtjA)AuNHuH}菿tP}utTL1IA9FPtAFPILHu6H}蟾1H([A^A_]ILHuHyH@UHAVSH HuH|$HEDvDuHG]]y DHHtH(HtD9uEt!1nHt+12H}111!HHcCHuHHHHH [A^]UHAWAVSH(HuH4&HED~D}HG]܉]y 蒽HHt#H(HtD9uAEt踭Ht+12H}111<!HLc荭HuL蒭HHH([A^A_]f.DUHAVSH HuH'HEDvDuHG]]y ԼHHt H(HtD9uEt"_PHt*11H}111聼 HӬHuHcجHHH [A^]UHAWAVSH(HuH)HED~D}HG]ԉ]؅y "HHtsLw(MtjA)AuNHuH}tP}utTL1IA9F`tAF`IL Hu6H}菻1H([A^A_]ILիHuHiH@UHAVSH HuH*HEDvDuHG]]y 4HHtH(HtD9uEt!1^Ht+12H}111!HHc3HuH8HHH [A^]UHAWAVSH(HuH,HED~D}HG]܉]y 肺HHt#H(HtD9uAEt訪Ht+12H}111,!H Lc}HuL肪HHH([A^A_]f.DUHAVSH HuHV.HEDvDuHG]]y ĹHHt H(HtD9uEt"_`Ht*11H}111q H(éHuHcȩHHH [A^]UHAWAVSH(HuH/HED~D}HG]ԉ]؅y HHtmLw(MtdA)AuHHuH}]tJ}EtLANXf.u{AFXILHu6H}腸1H([A^A_]IL0˨HuH_Hf.UHAVSH0HuH/HEDvDuHG]܉]y $HHt'H(HtD9uEt)GXEFHt-16H}111ʷ%H8EHuEHHH0[A^]f.UHAWAVSH(HuH/HED~D}HG]ԉ]؅y bHHtmLw(MtdA)AuHHuH}護tJ}EtLANhf.u{AFhILSHu6H}ն1H([A^A_]IL@HuHHf.UHAVSH0HuH/HEDvDuHG]܉]y tHHt'H(HtD9uEt)GhE薦Ht-16H}111%HHEiHuEfHHH0[A^]f.UHAVSH HuHHEDvDuHG]]y 贵HHt%H(HtD9uEt',HإHt+1>H}111\-HH譥HuHHx譥貥HHH [A^]DUHAWAVSH(HuHrHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HU辴}t0}t7LH?Hu9H}v1H([A^A_]ILHP蹤HuHMHАUHH=H5zH.H 0դEu-HH=袤H{]ÐUH]fDUHSPHH=XH59zH.H puH)H="=H5a.HHͣt H tH[]H=H[]fUHAVSH0HuH5YHEЋFEHEHEH}ȃuoHu舳tqH]H=-HAt1H=PVHjtH=]HWt H艱LcHuL蕲1H0[A^]f.@UHAWAVSH(HuHXHED~D}HG]ԉ]؅yRHHLw(HEMA)AuhHuH}聲}L}tlH=,LrAtbH=?ULYtOH=\LFt}t2}t9I~0HHQrHu9H}1H([A^A_]ILH7HuHHfDUHAWAVSH(HuHHEDvDuHG]ԉ]؅y 蒮HHtbL(MtYA)Au=HuH} t?HEIO0HI(L4H\虞Hu L)H衞H}1H([A^A_]UHAWAVSH(HuH HEDvDuHG]ԉ]؅y ҭHHtbL(MtYA)Au=HuH}Mt?HEIO0HI(L4H\ٝHu D)۝H}P1H([A^A_]UHAWAVSH(HuHo HEDvDuHG]ԉ]؅y HHtsL(MtjA)AuNHuH}荭tPHEIO0HY HI(L4Hu2Ht:JHED~D}HG]܉]y 財HHt$Lw(MtD9uEt&IưבHt.1:H}111[)ILxI詑HuL͠HHH([A^A_]fDUHAWAVAUATSHHUHHEЋ^HG)Ѓ>HhH\zHpx|Uy轠HH L(Hh0ACD-HcH葠L1EIcM$LDMyx+|LHhHuqEHhH蒠*H5|HhHU} HHhHuHhLDHEPE`E@EXE8EHDEArII94II9'1)HHHHtI4I4HHuHI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9ufHH'xHy 腞HHtuH_(HtlHHu蕞tSEPEXE`HuH H5w15Hh֝1HHH9t HtHHH;EHH[A\A]A^A_]E1HHuH@HEf.Pu$z"Ef.XuzEf.`u{!蟍HuHHU1ߝ~H!H腍HJ؃HpHHHljH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*H4HAD6A 6AD4A 4H HuH9|tHuHMLMIHuHMLMHIEf.Pu$z"Ef.`uzEf.@u{!#HuHhHU1cEf.Xu$z"Ef.8uzEf.Hu{$ϋHuHhHU E~=1AfA.u z HH9u!芋HuHhLDʛiH&LpHHHH9HHHHH9t HtH UHAWAVAUATSHhHuHpHEFEHGMĉMȅypHH|L(H}E11AC6HcHxHLxEIcI\IDME+EăH}LD5H5zvH}HUݙ}EEArKLH9J I91D)HHLHtfI|H7H#1U26uVH{6H=t5UHh5]fDUHAVSIH=O5H56H#1dU5uUH%6H=51UH5j#H 5LTt H 4t01THt1H H H;MuLHx[A^A_]HxHU1VFHuMIHFH _H H;MtuUHHH>HHEHXHp H`FhHDžlDž| HXHuUHXHuUp;h}HXH|UHEHE(E)E(EHEHEuUuMMEEz9M}DMAyD9M}DEAxD9M)E};uu;Uu;MuD;Mu ;EuD;Et EHt8E;EtOuT1H H H;MHİ]HXHU18UE;Eu(E;Eu E;EuE;EuE;EuE;Et$DHuHXHUTqDHhHHH GH H;M`YDUHHHHHEHuHHEFEHEE H}HuSH}HuSE;E}H}HuS(E)EHEHEHEHEEEEU)MDM}D)ƉuDEuD)M;Eu;Uu;}uD;Mu ;uuD;Et 2CHt4E;EtHVR1H H H;MuzHĀ]H}HU1SSE;EuE;EuE;Et!BHuH}HUSBHuH;HH H H;Mt藅UHHH^HHEHuHWHEFEHEE H}Hu!RH}HuRE;E}H}Hu&RHEHEHEHEEEEUE1҉)AHDM}D)AHʉuDED]DD)AH(E)EMu;Eu;Uu;}uD;Mu D;]uD;Et fAHt4E;EtHVP1H /H H;MuzHĀ]H}HU1QE;EuE;EuE;Et!@HuH}HUNQ@HuHoHH H H;Mt˃UHH`HHHEHuH3HEFEHEH}Hu^PH}HuԺDPEELELEHMHMȋM܉MЋuMOʉUԅɺOʅOUω}D9u ;Mu;Et ?Ht1E;EtES[O1H H H;MuwH`]H}HU1PE;EuE;EuE;Et!v?HuH}HUԾOU?HuH~HH /H H;MtEUHHHHHEH`HHhFpHDžtE H`reNHuNwH`HuNZH`HuxN=x;p}H`HuNEEHEHE(EHEHEHEHEEEU+MEM+MȉMM+u)Eu;Uu ;Eu;Mt!=HuH`HU1?NE;Eu(E;Eu E;EuE;EuE;EuE;Et$=HuH`HUME;EuE;EuE;Et$`=HuH`HUM<=Ht1H }H H;Mu#HĠ]H|HH |H H;Mtf.UHHH|HHEH`HHhFpHDžtE H`r%LHurLwH`HuULZH`Hu8L=x;p}H`HuNLEEHEHE(E)EHEHEHEHEEEUEMщMMMMuΉu;Uu ;Eu;Mt!;HuH`HU1KE;Eu(E;Eu E;EuE;EuE;EuE;Et$\;HuH`HUKE;EuE;EuE;Et$ ;HuH`HUoK:Ht1H zH H;Mu#HĠ]HuzHH zH H;Mt}f.UHSHXHzHHEHuH HEFEHEH}HuJH5&H}HUI}HH}HuhJH}HuJEEHEHEH}UHMHWE;EuE;EuE;Et!9HuH}HU"J9Hu.HCyHH yH H;Mt&|I1H cyH H;MuHX[]UHSHHH@yHHEHuHj HEFEHEH}HulIH5E%H}HUH}HH}HuHEEHEHEH}HUHVE;EuE;EuE;Et!8HuH}HUHw8Hu.H xHH QxH H;Mt&g{G1H +xH H;MuHH[]f.UHAWAVATSHpHwHHE؋~nHuH HEHEEH}HuHGH5#H}HUUG})HH5#H}HU4G}IH}HuȺcGE)ED}H}HMHL3U~EfvEf8%fPtt D9}7HvH}HUȾZHuH! HEHEEH}Hu%GSH5"H}HUaF}5HH5"H}HU@F}IH}HuȺoFH}HuUFE)pDeE)ED}H}HMLEHLT~Efvpf8%fPt tD9et!5HuH}HUȾFF~EfvEf8%fPt tD9}t!5HuH}HUF5HuH%uHH5 E1H [uH H;Mu Hp[A\A^A_]dxUHAWAVAUATSHH%uHHEH@HtHHFPHDžTDžt H@HuDH@HuDX;P}H@HtD(E)EHEHEHEHxEE]LcuDmHcEH`HcEHhLc}LceHcEH8D;uu+;]u&H`;EuD;muHh;EuE;Et 4HtDE;xt[l|C1H sH H;MHĨ[A\A]A^A_]H@HU1DE;xuE;|uE;Et$~3HuH@HUCZ3HqH`A)AD)H8H+hIcHI)IHcIM)IL'3H rH H;M1 vfDUHAWAVAUATSHHrHHEH@HHHFPHDžTDžt H@HuvBH@HuYBX;P}H@HtlB(E)EHEHEHEHxEEMLc}D)ËEHcUAH`A)AHcUHhLcuLcmHcUH8NADND;}u*;Mu%H`;Mu;EuHh;EuE;Et 1HtDE;xt[l@1H FqH H;MHĨ[A\A]A^A_]H@HU1AE;xuE;|uE;Et$0HuH@HULA0HqAH8H+hIcHL+`IHcIM)IL0H pH H;M:sf.@UHAWAVAUATSHhHHpHHEHxHV HEFEHEE HxHuĺ@HxHu?E;E}HxHu@teẺEHEHEHMHMMMLcuLc}LcmLceHc]A9u ;]uE;Et /Ht>E;EtUc>1H JoH H;MHh[A\A]A^A_]HxHU1?E;EuE;EuE;Et$ /HuHxHUY?.HzILILH.H nH H;Mfqf.@UHAWAVAUATSHhHxnHHEHxH; HEFEHEE HxHuĺ5>HxHu>E;E}HxHu4>tzẺEHMHMHEHEEELcuLc}LceUċEȃADOO9u ;EuE;Et -Ht>E;EtUc=1H emH H;MHh[A\A]A^A_]HxHU1=E;EuE;EuE;Et$%-HuHxHUt=-HzHcILAIcHL,H lH H;M^oUHSHHlHHEHpHHxFEHEE Hpr;~Hh<jHpHuк,<MHpHu<0E;E}HpHu+<(E)EHEHEHEHEEEHhD]DMDEDUDD)DD)HcHHHHHcHH)HcHHD))MDЉEEƉuD;]uD;MuD;UuD;Eu ;EuE;Et$@+HuHpHUо;E;EuE;EuE;Et$+HuHpHUS;*Ht1H jH H;Mu$HĘ[]HXjHH jH H;MtmUHHpHjHHEHuHHEFEHEE H}r9:Hu:)H}Hu:H}HuԺ:E;E}H}Hu$:EELMLMHEHEȋE܉EHMLcULHDEA@HcHHHEHcHH)HHE))ME9uD;EuE;Et!k)HuH}HU9E;EuE;EuE;Et!2)HuH}HUԾ9)Ht1H hH H;Mu Hp]HhHH hH H;MtkDUHSHHhHHEHpHHxFEHEE Hpr 8Hh8nHpHuк<8QHpHu84E;E}HpHu;8(E)EHEHEHEHEEEHhD]DMDD)DEDUDD)HcHHHHHcHH)HcHHD))MDЉEEƉuD;]uD;MuD;UuD;Eu ;EuE;Et$L'HuHpHUо7E;EuE;EuE;Et$'HuHpHU_7&Ht1H fH H;Mu$HĘ[]HdfHH fH H;Mtif.fUHHpHfHHEHuH_HEFEHEE H}r53Hu6"H}Hu6H}HuԺ6E;E}H}Hu$6EELMLMHEHEȋE܉EHMHc}DEDHcHHHEHcHH)HHE))MD9uD;EuE;Et!r%HuH}HU5E;EuE;EuE;Et!9%HuH}HUԾ5%Ht1H dH H;Mu Hp]HdHH dH H;Mtgf.fUHSH(HuHU HE؋FEHEH}Ѓu0Hu4t2}B$HuHc$H([]þ31H([]fUHSHhH0dHHEHuH HEFEHEH}usHuк4tpHEHE(E)EH}AËE;Eu(E;Eu E;EuE;EuE;EuE;Et #Ht4#HuF-31H xcH H;Mu=Hh[]H}HU13_#HuHcd#H ;cH H;MtQfUHH=H5 HH 0e#} u#H H=2#H]ÐUH]HfDUHSPHH=H5) H>H # uL#Ha H=Z"H5 HGH]"t H 4tH[]H=$H[]Q#fUHAVSH0HuHHEЋFEHEHEH}ȃu\Hu2t^H]H={HeAtH=kHdt H,0Lc!HuL!811H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y1HHLw(HEMA)AuQHuH}11t|}L}tYH=L&dAtOH=~L dt*1H ZH H;MuHh[]ËU19|9U؋E9|M9U19|9UE9vM9kU99 Vf.@UHAWAVAUATSHHYHHEЋ~mHpH)HxHEEHpHu)8HpHu) foEE)Efnfpfofff:3fEEąUHHpHU1HpHB)HxHEEHpHu(HpHl)nHpHu(QDMEDUD]D}DefoElD)D)D)HPDBDf~9Lf:A9DOf:9Lf:9ODmuDEUD9AL]}DuD9AOΉMD9uD9uD9uD9uD9u D;Pt9fPfoPHuHpHU1D(foPfvEP<u D9muD9ut$HuHpHU(HuH!WHH5''1H WWH H;MuHĈ[A\A]A^A_][ZUHHHWHHEH`HHhFpHDžtH`Hu&H`Hu&HEHE(E)E(E)EHEHEfoEfnMf:"MfpPffEUE)ЉEM)щMf~;Uu+f:;Uu f:;Uuf:;Uu ;Eu;Mt 0Ht8E;EtOu%1H UH H;MHĠ]H`HU1J&E;Eu(E;Eu E;EuE;EuE;EuE;Et$HuH`HU%HhHUHH YUH H;M`kXUHH`H1UHHEHuH HEFEHEH}Hu$H}HuԺ$E܉EHUHUȋuE+uƉu+EM+MEM9u ;Eu;Mt!HuH}HUԾ$}Hu.HTHH WTH H;Mt&mW#1H 1TH H;MuH`]ÐUHH=H5H H 0e}uHH=2H]ÐUH]r2fDUHSPHH=H5)HH uXHaH=ZH5qHGH]t H 4tH[]H=$H[]QfUHSH(HuHHE؋FEHEHEH}Ѓu1Hu#t3H}c*HuHcH([]þe"1H([]UHAWAVSH(HuHHED~D}HG]ԉ]؅y 2"HHtdLw(HEMt8A)Au3HuH}i"t}Hut;H)2Ht<1@H}!1)HE1ILPHuHcH([A^A_]f.@UHAVSH0HuH;HEЋFEHEuGH5;H}HU=!}t@HHtCHH5j HPE1LEcHu+H}Ⱦ 1H0[A^]E16HuL!UHAVSH HuH2HEDvDuHG]]y HHH(HD9u3HPxHt9HHH5 HPE1LEHucH}111 RE1vHuCL !Ht6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuHaHED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111<!HLcHuLHHH([A^A_]f.DUHAWAVSH(HuHFHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HU}t0}t7LH!-Hu9H}V1H([A^A_]ILH8HuH-NHUHAVSH HuH6HEDvDuHG]]y HHt@H(Ht7D9u6EtBHHtcHHhHA8HHcI@HHH Ht+12H}111!HHH HuH HHH [A^]1 HuUHAVSHpH~MHHEVHGDD)ˍCHuH HEUMMEyHHsH_(HfHuH}_Q}HutHHxhH H HcHuHF HEUMMEy[HH Lw(EMH}HuH}HuH}HuH}HuкuM;M}H}Hu.V}EEEEEEuUMDLEL*Ef.Eu"z Ef.EuzEf.Eu HH}HUоtHuH HEUMMEy HHH_(HHuH}t~H}HuкthEEEEEE}HuHHxhHHU(H5P WL1H JH H;MHp[A^]E1EMHHXHk HuH߾HHUH`Ef.EuzEf.EuzEf.Eu{! HuH}HUоX H>HIH1Lf.UHSH8^HG)Ѓ.HuHHEЉ]؉U܉Uy)HHH_(HwHuH}b}HujH'H) H;HuHHEЉ]؉U܉UyHHH_(HH}Hu H}HuH}Hu}uUMH/'HHHuHHEЉ]؉U܉Uy HHtcH_(HtZHuH}tIH5LH}HU}t/}HutVHH&HuXH5w{1H8[]1HHHpHHuCH HHHuH4GHH8[]HHxHvHuH H8[]fUHAWAVSHH9GHHEH`H HhD~DpHGtxyHHLw(MA)H`AuuHXttH`Hut[(E(M(U)U)M)EtHXteHUL$Ef.E_1H 8FH H;MHĘ[A^A_]E1MH f.UHAVSHPHN;HHE^HG)ЃMHuH/HE]UĉUȅy HHIH_(H!H}Hu  H}Hu H}Hu u؋UЋMHHuHHE]UĉUȅy3 HHH_(HH}HuغP t|E)EDuHuH~EfvEf8%fPt tD9utHuH}HU1f HuH9HH5j 1H 9H H;MuHP[A^]1H<UHAVSHPH~9HHEDvHGD)؃tlHuHHHEDuȉ]̉]ЅyHHH(HD9EpHHu}HuHHEDuȉ]̉]Ѕy HHtNH_(HtEH}Huغt/E)EDu}twHuHyH5~1Hm8HH;EHHP[A^]H}111H0HBHuH߾fHHHuH8~EfvEf8%fPt tD9utHuH}HU1JHHHg7H;:f.UHAVSH HuH3 HEDvDuHG]]y $HHt%HG(HtD9u,UHHt1H}111 Hc8HHH [A^]UHAWAVSHH6HHE^HG)ЃHuH HE]UUy]HHH_(HxH}Huz^(E)pD}DuHuH/fopfvEP<u D9}uD9ut2HuH}HU1HH5HHuH' HE]UUyHHH_(HH}HuH}HuH}HutoH}Hut^H}HutMH}HutH}111<-HHHuHHxHHH [A^]DUHAWAVSH(HuH0HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H512H}HU}t0}t7LHHu9H}V1H([A^A_]ILHHuH-2HUHAWAVSH(HuHr0HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5Q1H}HU}t0}t7LHHu9H}v1H([A^A_]ILHHuHM1HUHAWAVSH(HuH HED~D}HG]܉]y HHt#H(HtD9uAEt8Ht+12H}111!HLc HuLHHH([A^A_]f.DUHAWAVSH(HuHHED~D}HG]ԉ]؅y RHHtXLw(MtOA)Au3HuH}t5HuLbHuH/HH}1H([A^A_]ÐUHAWAVSH(HuHiHED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}t5HuL HuHF/HH}*1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}mt5HuL HuH.HH}z1H([A^A_]ÐUHAWAVSH(HuHBHED~D}HG]ԉ]؅y BHHtXLw(MtOA)Au3HuH}t5HuL RHuH-HH}1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH} t5HuL HuH}1H([A^A_]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}]t5HuL] HuH}j1H([A^A_]ÐUHAVSH HuH HEDvDuHG]]y 4HHt$H(HtD9uEt& YHt*11H}111 H/HuHHH [A^]UHAVSH HuH HEDvDuHG]]y HHt$H(HtD9uEt&: Ht*11H}111- HHuNHHH [A^]UHAWAVSHHH<+HHEHuHHED~D}HG]]yHHLw(MA)H}AHuԺE܉EHEHEHuLE;EuE;EuE;EtHuH}HU1{Hu.H*HH U*H H;Mt&k-1H /*H H;MuHH[A^A_]f.UHAWAVSHHHuH HEЋFEHGM܉My HHt~Lw(H}E11HcH}MtzE+E܃u)L}H}Lt&}t7LL#9H}ȾE1H}HEH9u08E1ILLAHt(E1H}HEH9t Ht+LHH[A^A_]L=(IH}HEH9uHH}HEH9t Ht+H UHHHztuHH]H=]H5 *1]UHSPHH=sH+tZH=vXH+tGH=H~+t4H={'Hk+t!H=ɢHX+tHH[]H[]f.@UHSH(HuHsHE؋FEHEEȃrH}оU1[H58'H}HUOH1}tH5&H}HU}t7HHHu"HH([]H}о`1H([]ÐUHH=5H5HH 0uHH=H]ÐUH]fDUHSPHH=H5iHWH XuHH=MH5#HHt H ttH[]H=dH[]fUHAVSH0HuHEHEЋFEHEHEH}ȃuoHutqH]H=H(At1H=tHz(tH=؟Hg(t HLc'HuL,1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅ybHHLw(HEMA)AuhHuH}}L}tlH=L'AtbH=cLi'tOH=ǞLV'tH:H 0-u譾HvH=oHc]ÐUH]fDUHSPHH=@H5HH puHHH= =H5HHt H tH[]H=H[]fUHSH(HuH7HE؋FEHEHEH}Ѓu1Hut3H}\HuHcaH([]þ1H([]UHAWAVSH(HuH,HED~D}HG]ԉ]؅y HHtdLw(HEMt8A)Au3HuH}t}Hut;HHt<1@H}"1)HE1ILPfHuHckH([A^A_]f.@UHAVSH0HuHHEЋFEHEuGH5H}HU}t@HHtCHH5HPE1LEHu+H}ȾU1H0[A^]E1HuL=UHAVSH HuHHEDvDuHG]]yHHH(HD9u3HPxHt9HHH5HPE1LEHucH}111RE1HuCL}Ht6HH)t)H#HH1Q@H߾ 1HH [A^]UHAWAVSH(HuH .HED~D}HG]܉]y HHt#H(HtD9uAEt(Ht+12H}111!HLcHuLHHH([A^A_]f.DUHSPHH=sHtZH=l HtGH=GHt4H=Ht!H= HtHH[]H[]ÐUHH=H5>HH 0u-uhHvH=oBHc]ÐUH]fDUHAVSIH=?H5H2H uwhHH= H5HLlt H t8ypHtDHH5LH8H u*H[A^]AH=55,Hu[A^]fDUHAVSH0HuHHEЋFEHEHEH}ȃuoHutqH]H=0HAt1H=HtH=(Ht HLcwHuL|1H0[A^]f.@UHAWAVSH(HuH<HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=LAtbH=nLtOH=LtH E75UHAWAVSHHHHEH@HÕHHD~DPHGTXyrHHLw(MA)H@AHumtH@HuTtfHEHE(E)E(E)`HEHpTtiHuHUL'Ef.Ec1H H H;MHĨ[A^A_]E1M+IHuHULEf.EuzEf.EuzEf.Eu{!HuH@HU1Ef.`u$z"Ef.huzEf.pu{$7HuH@HUtH HHH H H;MUHSHXHHHE^HG)ЃlHuHOHE]UĉUȅy4HHfH_(H@H}Hu+H}HukH}HuV}EMU[xf.u&z$f.uzf.uCxHHHHuHXHE]UĉUȅy =HHtZH_(HtQHuH}Pt;}t[EMUHH<HuNH51H H H;MuHHX[]1HHHuHHuHHH H H;MtUHAWAVSH(HuHHED~D}HG]܉]y 2HHt!Lw(MtD9uEt#IxZHt.1:H}111)ILI,HuLJHHH([A^A_]fUHSHXH HHE^HG)ЃrHuH HE]UĉUȅyTHHlH_(HFH}Hu1H}HuH}Huv}EMUf.u&z$f.uzf.uHHHHuH HE]UĉUȅy WHHtZH_(HtQHuH}jt;}t[EMUHHVHuNH5 1H ( H H;MuHHX[]1HHHuHHuH HH H H;MtfUHAWAVSH(HuH HED~D}HG]܉]y RHHt$Lw(MtD9uEt&IƐwHt.1:H}111)ILIIHuLgHHH([A^A_]fDUHAVSH0HuH!HEDvDuHG]܉]y HHt'H(HtD9uEt)GXEHt-16H}111:%H EHuEHHH0[A^]f.UHAWAVSH(HuH HED~D}HG]ԉ]؅yHHLw(MA)AuqHuH}ts}EtuANX]f(fUfTfVf.u{AFXILHu6H}1H([A^A_]IL(ZHuHHfUHAVSH0HuHHEDvDuHG]܉]y HHt*H(Ht!D9u Et,EHt-16H}111W%H0EHuEHHH0[A^]UHAVSH0HuHHEDvDuHG]܉]y HHt*H(Ht!D9u Et,EHt-16H}111%H8EHuEHHH0[A^]UHAVSH0HuHHEDvDuHG]܉]y 4HHt'H(HtD9uEt)GhEVHt-16H}111%H@E)HuE&HHH0[A^]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y rHHtYLw(MtPA)Au4HuH}t6ELzHuHHH}1H([A^A_]UHAVSH0HuHHEDvDuHG]܉]y HHt'H(HtD9uEt)GpEHt-16H}111j%HHEHuEHHH0[A^]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtYLw(MtPA)Au4HuH}Mt6ELHuHHH}1H([A^A_]UHAWAVSH(HuH(HED~D}HG]ԉ]؅y RHHtmLw(MtdA)AuHHuH}tJ}EtLAN`f.u{AF`ILCHu6H}1H([A^A_]ILP HuHHf.UHAVSH0HuHHEDvDuHG]܉]y dHHt'H(HtD9uEt)G`EHt-16H}111 %HXEYHuEVHHH0[A^]f.UHAVSH HuH;HEDvDuHG]]y HHt+H(Ht"D9u!Et-HxHt(1.H}111FH`HuH.HHH [A^]f.DUHAVSH HuHHEDvDuHG]]y HHt(H(HtD9uEt*H1xHt(1.H}111HhHuHqHHH [A^]fUHAVSH HuHHEDvDuHG]]y 4HHt H(HtD9uEt"_P]Ht*11H}111 Hp3HuHc8HHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtaLw(MtXA)Au}utBA9vPtAvPILHu6H}1H([A^A_]ILxGHuHHӐUHH=UH5HnH 0eݹu= H&H=2H]ÐUH]0fDUHSPHH=H5H H xu HH=ͿH5HH]t H tH[]H=H[]QfUHAVSH0HuHtHEЋFEHEHEH}ȃuoHutqH]H=FHAt1H= HtH=XyHt HLc觾HuL謾%1H0[A^]f.@UHAWAVSH(HuHltHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=5LAtbH=LtOH=GxLtHPE1LEӼHu+H}ȾU1H0[A^]E1覼HuL=UHAVSH HuHsHEDvDuHG]]yHHH(HD9u3HPxHt9HHH5qHPE1LEHucH}111RE1HuCL}Ht6HH)t)H#HH1Q@H߾ 1HH [A^]UHAWAVSH(HuH& HED~D}HG]ԉ]؅yHHLw(EEMD)؃rH}11sD9}H}Hu5t[D}Ћ]D9}H}Hut>uUL(úHu&HWHE1EEMq1HH([A^A_]UHAWAVSH(HuH HED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111!HLcHuLHHH([A^A_]f.DUHAVSH HuHBHEDvDuHG]]y 4HHt%H(HtD9uEt'HXHt+1>H}111-HH-HuHHx-2HHH [A^]DUHAVSH HuH}HEDvDuHG]]y tHHt!H(HtD9uEt#H_P蜸Ht+12H}111 !H8HqHuHHHH [A^]DUHAWAVSH(HuH]HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H53 H}HU}t0}t7LHķHu9H}F1H([A^A_]ILH@艷HuHHUHAVSH HuHHEDvDuHG]]y HHt H(HtD9u?H Ht1H}111 HHHH [A^]f.fUHAWAVSH(HuHHED~D}HG]ԉ]؅y BHHtXLw(MtOA)Au3HuH}t5HuLRHuHHH}1H([A^A_]ÐUHSH8^HG)ЃHuHHEЉ]؉U܉UyHHH_(HHuH}HuHH茵HHH8[]HuHuHEЉ]؉U܉Uy HHtlH_(HtcHuH}tRH5H}HU}t8HuHHtHuHHH8[]H5u1H8[]fDUHAWAVSH8HuHHED~D}HG]̉]Ѕy BHHtuLw(MtlA)AuPHuH}tRH5H}HU}t8HuLH5HuHHH}1H8[A^A_]@UHAWAVSH(HuHHED~D}HG]ԉ]؅y rHHtfLw(HEMtQD)؃rH}11%NWD9}HuH}tELHYHt1HE1 HTHHH([A^A_]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtaLw(MtXA)AuH}ݿ1H([A^A_]HHUHAWAVSH(HuHHED~D}HG]ԉ]؅y 蒿HHt_Lw(HEMt3A)Au.HuH}ɿtHuLH藯Ht'1+H}1HE1HH([A^A_]UHAWAVSH(HuHHED~D}HG]ԉ]؅y ¾HHtYLw(MtPA)Au4HuH}=t6HuLsHϮHuHfH}I1H([A^A_]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5H}HU޽}t4LHHuHHH}蒽1H([A^A_]fUHAWAVSH(HuHPHED~D}HG]ԉ]؅y RHHt\Lw(HEMt0A)Au+HuH}艽tHuLZHt'1-H}ڼ1HE1 HHH([A^A_]fUHAWAVSH(HuH HED~D}HG]ԉ]؅y 肼HHtXLw(MtOA)Au3HuH}t5HuL蒬HuH&HH} 1H([A^A_]ÐUHAWAVSHHHuH}HED~D}HG]]y һHHtiLw(Mt`A)AuDHuH}MtFHuH}<t5HUHMH}LXɫHt'16H}I1HHH[A^A_]H=0 HuHH}HH}H fUHAWAVSHHHuH HED~D}HG]]y ҺHHtuLw(HEMtlA)AuDHuH}EtRHuH}tAHUHMH}LHt31BH}A1 HE1HHH[A^A_]H= HuHH}HH}Hk DUHAWAVAUATSHXHuHHEDvDuHG]ĉ]ȅy边HHLo(HEMA)H}AugHu)tiH}HutXH5Q H}HUdHt?}LeL}tpLuLHLLLLn1H}Ht"HuYE1HEMR1HHX[A\A]A^A_]LuLH袬LLLLL菬HuHHH}HuHH}HH}[Hש UHAWAVAUATSHXHuHHEDvDuHG]]y.HHLo(HEHEMA)H}AugHu葸tiH}HuDtXH5 H}HU̷Ht?}LeL}txLuLHzLLLLvj1H}Ht*Hu%E1HEHEMJ1HHX[A\A]A^A_]LuLHLLLLLZHuHHH}H{HH}HH}跪H3 f.UHAVSH HuHHEDvDuHG]]y 脶HHt"H(HtD9uEt$諦Ht(1.H}111/H胦HuHHHH [A^]UHHHztuHH]}H=F]@H5躵1]UHAWAVSH(HuHPHED~D}HG]ԉ]؅y 蒵HHt\Lw(MtSA)Au7H5H}HU^}t0}t7LH蔥Hu9H}1H([A^A_]ILHYHuHHUHAWAVSH(HuH2HED~D}HG]ԉ]؅y 貴HHt\Lw(MtSA)Au7H5H}HU~}t0}t7LH=贤Hu9H}61H([A^A_]ILHyHuH HUHAWAVSH(HuHHED~D}HG]ԉ]؅y ҳHHtVLw(MtMA)Au1HuH}/t3}ut7L6HڣHu9H}\1H([A^A_]IL H蟣HuH6UHAWAVSH(HuH HED~D}HG]ԉ]؅y HHtVLw(MtMA)Au1HuH}_t3}ut7L`H Hu9H}茲1H([A^A_]IL0HϢHuHڢUHSH(HuH3HE؋FEHEEȃrH}о1[H5H}HUH1}tH5IH}HUo}t7H+H諡Hu"HBH([]H}о 1H([]ÐUHH=ՠH5nH@H 0襡]u=>HH=rH]ÐUH]*fDUHSPHH=pH5 H?H @u=HAH=: H5?H'H蝠t H tH[]H=H[]鑡fUHAVSH0HuHVHEЋFEHEHEH}ȃHuTH]H=>HKAtDH=UH2t1H=C)HtH=}ZH t H>Lc̟HuLџJ1H0[A^]UHAWAVSH(HuHUHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}A}L}tH==L2AtuH=<LtbH=*(LtOH=dYLtHHLo(MA)A HuH}}H5H}HU}aIH5H}HUȤ}@IH5OH}HU觤}IH5OH}HU膤}HH5|OH}HUe}HEH5H}HUC}HEH5H}HU!}HEH5H}HU}t{HEHuH}萤tfH5H}HUУ}tL}ELUtNHLLLLILMPARuuuRH} l1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0舓HuHHUHAWAVAUATSHXHuHHEDvDuHG]]yޢHHLo(MnA)H}A NHuLH58H}HU艢}.IH5$H}HUh} IH5^MH}HUG}IH5H}HU&}HH5H}HU}HEH5H}HU}HEH}HuptsH5H}HU谡}tYHEH}Hu#tD}ELUЋEtQLLLLILMPuARuU ?1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H THuHHUHAWAVAUATSHXHHHEHHHF HG$(y萠HHHG(H@LLACD-HcHZHE1EIcHLEL轟AH0C?HcHHE1EIcHHHIDH@ +$HHuLHsHH0DƟUHH<:HHp苟HH謟HLDVHEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDHE1HHH9t Ht1HHH9t HtH+HH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLMP!IHLHUHpLM(DHuLH(1蝔Ef.EuzEf.EuzEf.Eu{$HuH(HU9pf.Pu'z%xf.XuzEf.`u{'蟄HuH(HpٔE~>1AfA.Du z HH9u!VHuH(LD薔5HzHHHHH9nsHHHH9t HtH UHAWAVSHHHHHEHH\HDvDHGy"HHL(MA)HAaHuZHHu=HH!"HHHH@誒HH芒HLL躒HEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLؾnm1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!AHuHHU1聑Ef.`u$z"Ef.huzEf.pu{$HuHHU*ɀHuH@f. u*z(Hf.(uzPf.0u{'jHuHH@褐f.u*z(f.uzf.u{'HuHHAHuH6HHcH H H;MDUHAWAVSH(HuHHEDvDuHG]ԉ]؅yHHL(MA)AumHuH}WtoH5RkH}HU赎}tUIH5+kH}HU蘎}t8}utH}H1H([A^A_]ILLHH~HuHc~UHAWAVAUATSHHEHHEHPHHXF`HGdhyHHHG(HpLPL)AC6HcH苍HE1EIcHLELAH]C?HcHLHE1EIcHIDHpHI͋`+dHPHHpHPHuHPHuDHPHLtiHPLD蹌tSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t Ht*HHH9t Ht H$HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMqHpHHUHMMPEf.EuzEf.EuzEf.Eu{$}xHuHPHU躈E~E1HMfA.uzHH9xu"1xHuHPHUDpE~>1ADf.u z HH9Eu!wHuHPLD-wHKL-\IEHHH9?D諺HHHH9tHt IHHHH9t Ht%H_x fUHAVSH HuHHEDvDuHG]]y 贆HHt%H(HtD9uEt1ܳHvHt51H}111\HH [A^]HpHvHuHtH5oH(HvHHH뱐UHAWAVSHxHLHHEHxHHED~D}HG]]yхHHLw(MA)HxAumHu#toHxHu輅tVH5bHxHUe}t9HMHM(E)E}utOHULHCQ1H _H H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$uHuHxHUBtH`HctH H H;MZ˷UHAWAVSHhHHHEHuHHED~D}HG]]yHHLw(MA)H}AuZHuHEHE(E)E}t?H?HE(p)En1f.EuRzP2meIHuLXHcEf.EuzEf.EuzEf.Eu{sHuH}HU1ЃosHt1H QH H;Mu#Hh[A^A_]HWsH .H H;MtDUHAWAVSHxH HHEHxH*HED~D}HG]]y葂HHLw(MA)HxAu:Hu萂HEHE(E)E}tHuL脯!jIHuL`EEf.EuzEf.EuzEf.Eu{!%rHuHxHU1erHt1H H H;Mu%Hx[A^A_]EqH H H;Mt״UHH`HHHEHH;HFHDžHHuJHHu-HH` HH HH̀}HEHE(E)E(E)EHEHE(`)@HpHP( )H0HHH()H}HuH`H LEf.EuzEf.EuzEf.Eu{!pHuHHU1VEf.EuzEf.EuzEf.Eu{$oHuHHU`f.@u*z(hf.Huzpf.Pu{'koHuHH` f.u*z((f.uz0f.u{'oHuHH Bf.u*z(f.uzf.u{'nHuHH~~nHuHH}1H EH H;Mu H`]Rf.@UHHpHHHEHHԶHFHDžH Hu}HHu}HH`}}HH ]}HH=}HEHE(E)E(E)EHEHE(`)@HpHP( )H0HHH()H}HuH`H LuEf.EuzEf.EuzEf.Eu{!~lHuHHU1|Ef.EuzEf.EuzEf.Eu{$3lHuHHUp|`f.@u*z(hf.Huzpf.Pu{'kHuHH` | f.u*z((f.uz0f.u{'pkHuHH {f.u*z(f.uzf.u{' kHuHHG{jHuj_z1H H H;Mu Hp]跭UHHpH~HHEHHHFHDžH Hu*zHHu zHH`yHH yHHyHEHE(E)E(E)EHEHE(`)@HpHP( )H0HHH()H}HuH`H LWEf.EuzEf.EuzEf.Eu{!hHuHHU1.yEf.EuzEf.EuzEf.Eu{$hHuHHUx`f.@u*z(hf.Huzpf.Pu{'ChHuHH`}x f.u*z((f.uz0f.u{'gHuHH xf.u*z(f.uzf.u{'}gHuHHwVgHuPgv1H H H;Mu Hp]'UHSHHHHEHPHHXF`HDždHPHuкvHPHu|vHPHP\vHPHEf.EuzEf.EuzEf.Eu{!eHuHPHU1]uEf.pu!zEf.xuzEf.Eu{$dHuHPHU uPf.0u*z(Xf.8uz`f.@u{'ldHuHPHPtf.u*z(f.uz f.u{' dHuHPHCtf.u*z(f.uzf.u{'cHuHPHsf.pu>z<f.xu*z(f.uzf.u{'/cHuHPHiscHuHc cr1H ѢH H;Mu HĨ[]ݥfUHH0HHHEHHHFHDžHfHuJr_HHu-rBHH` r"HH qHEHE(E)E(E)EHEHE(`)@HpHP( )H0HH}HuH`H ZEf.EuzEf.EuzEf.Eu{!QaHuHHU1qEf.EuzEf.EuzEf.Eu{$aHuHHUCq`f.@u*z(hf.Huzpf.Pu{'`HuHH`p f.u*z((f.uz0f.u{'C`HuHH }p`Hu`o1H H H;Mu H0]fUHHHHHEH`HHhFpHDžtH`0HuZo)H`Hu=o HEHE(E)E(E(M)E)MH}Hu,Ef.EuzEf.EuzEf.Eu{!^HuH`HU1/oEf.Eu,z*Ef.EuzEf.EuzEf.Eu{$^HuH`HUnr^Hu.HHH LH H;Mt&bm1H &H H;MuHĠ]@UHH HHHEHHHFHDžH1Hum*HH` m HEHE(E)E(`(p(U(]))) )0(E)@(E)PH}H`2Ef.EuzEf.EuzEf.Eu{!]HuHHU1Am`f.hf.pf.xf.Ef. uyzwEf.(uhzfEf.0uWzUEf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'[HuHH` "l[Hu.HUHH H H;Mt&豞*k1H uH H;MuH ]UHAWAVSHHIHHEH@HHHD~DPHGTXyjHHLw(MA)H@AuHujt|H@HujtcHEHE(E)E(E(M)`)pTtfH}Hu茗Ef.Eci1H >H H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{!YHuH@HU1"jEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$}YHuH@HUiYYHHHH /H H;MAf.UHAWAVSH(HHHEHHHD~DHGyrhHHLw(MA)HAHumhHH@ MhHEHE(E)E(@(P(`(p))))(E) (E)0tiH}H@Ef.EfYg1H H H;MH([A^A_]E1MIHuH@LEf.EuzEf.EuzEf.Eu{!EWHuHHU1g@f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf. u5z3Ef.(u$z"Ef.0uzEf.8u{'VHuHH@ RfUH+HHH ǕH H;M#٘DUHSH(HuH HE؋FEHEH}Ѓu6Huet8}BHtUHu#H߾dH([]þd1H([]UHSH(HuH_HE؋FEHEH}Ѓu6Hu@et8}ȑHTHu#H߾dH([]þhd1H([]ÐUHH=ZH5[HǨH 0TZutHZH=YTHY]ÐUH]vfDUHSPHH=YH59[HbH T(Zu(tHqZH=jY]TH5.HWYHSt H DYtH[]H=4YH[]TfUHAVSH0HuHU HEЋFEHEHEH}ȃuoHuctqH]H=H裖At1H= H芖tH= Hwt HaLc7SHuLYHѦH 0UP-XuݤHvXH=oW"PHcW]ÐUH]餉fDUHSPHH=@WH5XHlH OWuxHXH= WOH58HVHMOt H VtH[]H=VH[]APfUHSH(HuHHE؋FEHEHEH}Ѓu;Hu _t=H]H=Ht/HͨHcNHu'K^1H([]ûNHuHNH([]UHAWAVSH(HuH|HEDvDuHG]ԉ]؅y ]HHtwL(HEMtKA)AuFHuH})^t1}LutNH=ĤLtfLMHt?1CH}_]1,HE1 ILLPMHuHcMH([A^A_]û~MHuUHAVSH0HuHHEЋFEHEuGH5H}HU\}t@HHtCHH5HPE1LEMHu+H}Ⱦ\1H0[A^]E1LHuLm]UHAVSH HuHHEDvDuHG]]y4\HHH(HD9u3HPxHt9HHH5HPE1LE6LHucH}111[RE1LHuCL\Ht6HHYLt)HSLHH1Q@H߾H5yH}HUR}t7H|HBHu"HrSH([]H}оPR1H([]ÐUHAVSH=e1CHHH=NH18IH uHeCL[A^]DUHAWAVATSH=fOH5PHiH Y~BO,bH3PL54PHMH=BHNHzRH5'LHAtH UMu H=LMBH=9d117BHL%݀H=&MH1A$8IH uHBMtH5£LLPAIuL]BH=c1AHH=LH1A$8IH uH#BMtH5mLL@IuLAH=N3AH N[A\A^A_]f.UH]4cfDUHSPHbH5HMH@t H MtH[]H=MH[]~AfDUHAVSH0HuHHEЋFEHEHEH}ȃuoHuHPtqH]H=XHCAt1H=H*tH=Ht HINLc?HuL?UO1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yOHHLw(HEMA)AuhHuH}AO}L}tlH=GL2AtbH=LtOH=wLtHt 1H([A^A_]Ic>fUHAVSH0HuHHEЋFEHEuGH5H}HUM}t@HHtCHH5PHPE1LE>Hu+H}ȾM1H0[A^]E1=HuLmNUHAVSH HuHHEDvDuHG]]y4MHHH(HD9u3HPxHt9HHH5HPE1LE6=HucH}111LRE1=HuCLMHt6HHY=t)HS=HH1Q@H߾<=1HH [A^]UHAWAVSH(HuHעHED~D}HG]ԉ]؅y 2LHHtWLw(MtNA)Au2HuH}Lt4uL^C<HuH{HH}K1H([A^A_]fUHAVSH HuHHEDvDuHG]]y KHHt H(HtD9uEt"_H;Ht*11H}1111K H;HuHc;HHH [A^]ÐUHH=JH5LHcH 0;}KumHKH=Jb;HJ]ÐUH] BfDUHSPHH=JH5)LHH 0;KuHaKH=ZJ:H5ʣHGJH:t H 4JtH[]H=$JH[];fUHAVSH0HuHHEЋFEHEHEH}ȃuoHuHJtqH]H=;HC}At1H=NH*}tH=H}t HIHLc9HuL9UI1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yIHHLw(HEMA)AuhHuH}AI}L}tlH=*L2|AtbH==L|tOH=wL|t}HEH5H}HU>}HEH5H}HU>}t{HEHuH}0?tfH5TH}HUp>}tL}ELUtNHLLLLILMPARuuu5RH} >1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0(.HuHmHUHAWAVAUATSHXHmHHEHHvHF HG$(y`=HHHG(H@LL<ACD-HcH*=HE1EIcHLEL<AH0C?HcH<HE1EIcHHHIDH@ +$HHu<LHsHH0D<UHH<<:HHp[<HH|<HLD&<HEHE(E)EEEH0ArJI9KH91D)HHLHtH4I4HHuHH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HI9uDH:E1HHH9t HtnHHH9t HtmHjHH;ELHX[A\A]A^A_]1FDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL92LHEH`f(pf)PEEAr!HHJH9JH91D)HHLHtHHH4H4HHuHHH%H H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HI9uDHpHHH‰уH s 1HHiHH)1HHLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuL9$t?HHH$HuH<tHLHUHpLM )!IHLHUHpLM("HuLH(1m1Ef.EuzEf.EuzEf.Eu{$!HuH(HU 2pf.Pu'z%xf.XuzEf.`u{'o!HuH(Hp1E~>1AfA.Du z HH9u!&!HuH(LDf1!HzH`HHHH9nscHHHH9t HtcH! UHAWAVSH(HuHHEDvDuHG]ԉ]؅y0HHL(MA)AumHuH}g0toH5b H}HU/}tUIH5; H}HU/}t8}utH}X/1H([A^A_]ILLHHHuHcUHAWAVAUATSHHU_HHEHPHHXF`HGdhy.HHHG(HpLPL9.AC6HcH.HE1EIcHLEL-AH]C?HcH\.HE1EIcHIDHpHI͋`+dHPHH.HPHu.HPHuD-HPHL-.tiHPLD-tSHEHEf(Ef)EDHxE#A1HxzHP$-E1HHH9t Ht:`HHH9t Ht`H4]HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM HpHHUHMMPEf.EuzEf.EuzEf.Eu{$HuHPHU)E~E1HMfA.uzHH9xu"AHuHPHUD)E~>1ADf.u z HH9Eu!HuHPLD=)HKL-lXIEHHH9?D[HHHH9tHt Y[HHHH9t Ht5[Ho fUHAVSH HuHʓHEDvDuHG]]y 'HHt%H(HtD9uEt1HHt51H}111l'HH [A^]HpHHuHtH5H8(HHH&WH뱐UHAVSH0HuHHEDvDuHG]܉]y &HHt"H(HtD9uEHt1H}111& EHHH0[A^]UHAWAVAUATSHXHuHHEDvDuHG]]yN&HHLo(MnA)H}A NHu&LH5H}HU%}.IH5H}HU%} IH5H}HU%}IH5mH}HU%}HH5LH}HUu%}HEH57H}HUS%}HEH}Hu%tsH5H}HU %}tYHEH}Hu%tD}ELUЋEtQLLLLILMPuARuDU $1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H HuHXTHUHHHTHHEH`HHhFpHDžtH`"Hu:$H`Hu$HEHE(E)E(E)EHEHEH}HuEf.EuzEf.EuzEf.Eu{!HuH`HU1$Ef.EuzEf.EuzEf.Eu{$HuH`HU#`Hu.HRHH :SH H;Mt&PV"1H SH H;MuHĠ]fUHHHRHHEH@HHHFPHDžTH@fHu"_H@Hu}"BHEHE(E)E(E(M(U)`)p)UH}HuXEf.EuzEf.EuzEf.Eu{!!HuH@HU1a"Ef.`uQzOEf.hu@z>Ef.pu/z-Ef.xuzEf.EuzEf.Eu{$HuH@HU!|Hu.HQHH VQH H;Mt&lT 1H 0QH H;MuH]f.@UHAWAVSHHPHHEH@HHHD~DPHGTXyr HHLw(MA)H@AuHuq t|H@HuX tcHEHE(E)E(E)`HEHpTtfH}HuBEf.Ec1H OH H;MHĨ[A^A_]E1M2IHuHULxEf.EuzEf.EuzEf.Eu{!HuH@HU1Ef.`u$z"Ef.huzEf.pu{$>HuH@HU{H HNHH NH H;MRf.@UHAWAVSHHNHHEH HӖH(D~D0HG48y2HHLw(MA)H AHu-H Hp ttHEHE(E)E(p(M(U)@)P)`4tiH}HpEf.EfG1H MH H;M=H[A^A_]E1MIHuHpLEf.EuzEf.EuzEf.Eu{!3 HuH HU1spf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{' HuH Hp HHLHH ULH H;MgOUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtlLw(MtcA)AuGHuH}tIuLH Hu1Ht9H5HUH H}61H([A^A_]H&KHUHAWAVSHHHYKHHEHHpHDvDHGyHHL(MA)HAaHuZHHu=HH"HHHH@ZHH:HLLjHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn1H hIH H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!HuHHU11Ef.`u$z"Ef.huzEf.pu{$HuHHUyHuH@f. u*z(Hf.(uzPf.0u{'HuHH@Tf.u*z(f.uzf.u{'HuHHHuHoHHcpH GGH H;MYJDUHAWAVSHhHGHHEHuHHED~D}HG]]yHHLw(MA)H}AuTHuHEHE(E)E}t9()EHE1f.EuRzP2eIHuLXHcEf.EuzEf.EuzEf.Eu{#HuH}HU1fHt1H EH H;Mu#Hh[A^A_]HH EH H;MtHfDUHAWAVSHxHEHHEHxHyHED~D}HG]]y!HHLw(MA)HxAu:Hu HEHE(E)E}tHuL !jIHuL`EEf.EuzEf.EuzEf.Eu{!HuHxHU1Ht1H vDH H;Mu%Hx[A^A_]EtH QDH H;MtgGUHH H.DHHEHH$wHFHDžHHuzHHu]HH`=HH }HEHE(E)E(E)EHEHE(`)@HpHP( )H0Hf(Ef(MfXfX`f^ Ef) MUXXp^/0f.Euzff.Eu z f.Mu{!HuHHU1Ef.EuzEf.EuzEf.Eu{$xHuHHU`f.@u*z(hf.Huzpf.Pu{'HuHH`R f.u*z((f.uz0f.u{'HuHH HuH"AH 1H UAH H;Mu H ]bDf.@UHH0HAHHEHHuHF HDž$HHuHHuHH`(E)EHEHE(E)EHEHE(`)@HpHP`hEEpEME0E8f.Mu$z"0f.Euz8f.Eu{!HuHHU1Ef.EuzEf.EuzEf.Eu{$fHuHHU`f.@u*z(hf.Huzpf.Pu{'HuHH`@H\\\\0\8\f(Yf(Y\YY\YY\YYXYXWQY.H >H H;Mt&!A 1H =H H;MuH0]UHHH=HHEHPHrHXF`HDždHPHuj HPHuM HPHu0 HPHu k(E)E(E)E(E)E(E)pH}HuHUHMHEf.EuzEf.Eu{!HuHPHU1 Ef.EuzEf.Eu{$HuHPHU Ef.EuzEf.Eu{$CHuHPHU Ef.puzEf.xu{$HuHPHU: HuHR 1H ;H H;Mu H]>fDUHSHHm;HHEHHGHF HDž$HdHu ]HHu @HHu #HHu HHP (E)E(E)E(E)E(E)p(P)0H`H@H}HuHUHMLPEEf.EuzEf.Eu{!2HuHHU1r Ef.EuzEf.Eu{$HuHHU2 Ef.EuzEf.Eu{$HuHHU Ef.puzEf.xu{$oHuHHU Pf.0u*z(Xf.8uz`f.@u{'HuHHPI HuHcf1H 8H H;Mu H[];fUHSHHH}8HHEHHrHFHDžHJHuк)CHHu &HHPHH HHHHHEHE(E)E(E)pHEHE(P)0H`H@( )()()H}HuHPH LLEf.EuzEf.EuzEf.Eu{!HuHHU1Ef.pu!zEf.xuzEf.Eu{$HuHHUPf.0u*z(Xf.8uz`f.@u{'&HuHHP` f.uz(f.u{'HuHH f.uzf.u{'HuHHf.uzf.u{'9HuHHsHuHc1H 4H H;Mu HH[]7UHHHzu H= ]H5;1]ÐUHH H~4HHEHHHrHFHDžHHu*HHu HH`wHH WHEHE(E)E(E)EHEHE(`)@HpHP( )H0H`]\fhfmf\uUf(\DEfA(fff\f(fYf(fYffYf\f) fY\0f.uuzf.Uu z fD.Eu{!HuHHU1Ef.EuzEf.EuzEf.Eu{$HuHHU`f.@u*z(hf.Huzpf.Pu{'.HuHH`h f.u*z((f.uz0f.u{'HuHH HuH81H 1H k1H H;Mu H ]x4@UHSHH=1HHEHPHDpHXF`HDždHPHuкHPHuHPHPlHPHLHPHl,HPHL HEHE(E)E(E)pHEHE(P)0H`H@()H HHH()HH()pH}HuHPHLLEf.EuzEf.EuzEf.Eu{!mHuHPHU1Ef.pu!zEf.xuzEf.Eu{$HuHPHUYPf.0u*z(Xf.8uz`f.@u{'HuHPHPf.u*z(f.uz f.u{'YHuHPHf.u*z(f.uzf.u{'HuHPH0f.pu*z(f.xuzf.u{'HuHPHlHuHcq1H 5-H H;Mu HĨ[]A0f.UHSH8H,HHEHH&nHFHDžHHuкHHucHHPlCHHL#HHmHEHE(E)E(E)pHEHE(P)0H`H@()H HH}HuHPHEf.EuzEf.EuzEf.Eu{!HuHHU1Ef.pu!zEf.xuzEf.Eu{$?HuHHU|Pf.0u*z(Xf.8uz`f.@u{'HuHHPf.u*z(f.uz f.u{'|HuHHUHuHcZ1H *H H;Mu H8[]*-fDUHHHzu H=W]H5Bm{1]ÐUHAWAVAUATSHH)HHEHhHHpFxHDž|HhAC6HcH0RL01EIcIHE؋x+|H5oHhHU} IHhHuFHhLDHhHuEEArKH9JI91HHLLHtf.DI4H4HHuHYfDI H ILHLILHLILHLHI9uHh1H0H8H9t Ht*H'HH;EHHĨ[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9lHEHEf(Ef)EuHMLLE~91fI H; u HI9u!HuHhLD+Ef.EuzEf.EuzEf.Eu{$|HuHhHUXH9H%HH0H8H9-28)HH0H8H9t Ht(H f.UHH H%HHEHHHFHDžHHuzHHu]HH`=HH HEHE(E)E(E)EHEHE(`)@HpHP( )H0H`e\fhf}f\UDMfA(\DEfA(fff\f(fYf(ff(ffYf\f) fffYf: ffYf(fX\0f(YfXWQfWf.u{f^f) ^0f.UuzfD.Mu z fD.Eu{!HuHHU1 Ef.EuzEf.EuzEf.Eu{$HuHHU`f.@u*z(hf.Huzpf.Pu{'"HuHH`\ f.u*z((f.uz0f.u{'HuHH HuH,"H1H _"H H;Mu H ]l%UHHH."HHEH HeH(F0HDž4H >Hu7H HuH H`H dH HHEHE(E)E(E)EHEHE(`)@HpHP~HH@H8$H}HuH`HEf.EuzEf.EuzEf.Eu{!HuH HU1Ef.EuzEf.EuzEf.Eu{$HuH HU`f.@u*z(hf.Huzpf.Pu{')HuH H`c1f.@f.@u6z4HH9uXM1H H H;Mu[H]Hu$LEH HcHuHHH =H H;MtS"f.DUHHHHHEH HabH(F0HDž4H HuH HuH H`}H5ϊH HU"}tHMHM(E)E(E)EHMHM(`)@HpHPH}HuH`HEf.EuzEf.EuzEf.Eu{!HuH HU1(Ef.EuzEf.EuzEf.Eu{$HuH HU`f.@u*z(hf.Huzpf.Pu{'=HuH H`wHuHH1H H H;Mu H]UHH=H5.HHcH 0uݷHfH=_HS]ÐUH]PfDUHSPHH=0H5HbH uxHH=mH5bHHt H tH[]H=H[]fUHAVSH0HuHeHEЋFEHEHEH}ȃuoHutqH]H= bHAt1H=dHtH=Ht HLcGHuLL1H0[A^]f.@UHAWAVSH(HuH HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=aLAtbH=cLtOH=Lvt<tHLHUHpLMN!IHLHUHpLM(dHuLH(1Ef.EuzEf.EuzEf.Eu{$HuH(HUYpf.Pu'z%xf.XuzEf.`u{'HuH(HpE~>1AfA.Du z HH9u!vHuH(LDUHzHHHHH9ns5HHHH9t HtH  UHAWAVSHHHHHEHHHDvDHGyBHHL(MA)HAaHu=ZHHu =HHA"HH&HH@HHHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLn1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!aHuHHU1Ef.`u$z"Ef.huzEf.pu{$ HuHHUJHuH7@f. u*z(Hf.(uzPf.0u{'芼HuHH@f.u*z(f.uzf.u{''HuHHaHuHV߻HHcH H H;MDUHAWAVSH(HuH0HEDvDuHG]ԉ]؅y"HHL(MA)AumHuH}wtoH5rH}HU}tUIH5KH}HU}t8}utH}h1H([A^A_]ILLHH覺HuHc諺UHAWAVAUATSHHeHHEHPH2HXF`HGdhyHHHG(HpLPLIAC6HcHHE1EIcHLELAH]C?HcHlHE1EIcHIDHpHI͋`+dHPHHHPHu%HPHuD HPHL=tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHP4E1HHH9t HtJHHH9t Ht-HDHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$蝴HuHPHUE~E1HMfA.uzHH9xu"QHuHPHUDE~>1ADf.u z HH9Eu! HuHPLDMHKL-|IEHHH9?DHHHH9tHt iHHHH9t HtEH fUHAVSH HuHHEDvDuHG]]y HHtH(HtD9uEt!1Ht+12H}111!HhHcӲHuHزHHH [A^]UHAWAVSHhHHHEHuH8HED~D}HG]]yHHLw(MA)H}Au:HuHEHE(E)E}tHuL!dIHuLXEf.EuzEf.EuzEf.Eu{讱HuH}HU1萱Ht1H rH H;Mu#Hh[A^A_]HcxH OH H;MteUHAWAVATSH`HuH:HEFEHEH}^AC6HcH}L}1EIcIHE؋E+ẼH}Hu H}LDH5ekH}HUN}EEArK H9J I91HHLLHtfDI<tHLHUHpLM !IHLHUHpLM(ԔHuLH(1-Ef.EuzEf.EuzEf.Eu{$茔HuH(HUɤpf.Pu'z%xf.XuzEf.`u{'/HuH(HpiE~>1AfA.Du z HH9u!HuH(LD&œHzHUHHHH9nsHHHH9t HtCH} UHAWAVSH(HuHYHEDvDuHG]ԉ]؅yҢHHL(MA)AumHuH}'toH5"H}HU腢}tUIH5~H}HUh}t8}utH}1H([A^A_]ILLHHVHuHc[UHAWAVAUATSHHHHEHPH HXF`HGdhy萡HHHG(HpLPLAC6HcH[HE1EIcHLEL辠AH]C?HcHHE1EIcHIDHpHI͋`+dHPHH@HPHuՠHPHuD躠HPHLtiHPLD艠tSHEHEf(Ef)EDHxE#A1HxzHPE1HHH9t HtHHH9t HtHHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMHpHHUHMMPEf.EuzEf.EuzEf.Eu{$MHuHPHU芜E~E1HMfA.uzHH9xu"HuHPHUD@E~>1ADf.u z HH9Eu!轋HuHPLD蜋HKL-,IEHHH9?D{HHHH9tHt HHHH9t HtH/ fUHAVSH HuHHEDvDuHG]]y 脚HHt%H(HtD9uEt1оH訊Ht51H}111,HH [A^]HpHsHuHtH5HH蠊HHH뱐UHAWAVAUATSHXHuHo HEDvDuHG]]y讙HHLo(MnA)H}A NHuLH5H}HUY}.IH5H}HU8} IH5.DH}HU}IH5H}HU}HH5H}HU՘}HEH5H}HU賘}HEH}Hu@tsH5dH}HU耘}tYHEH}HutD}ELUЋEtQLLLLILMPuARu輼U 1HX[A\A]A^A_]E1MuM]LLLLILMPuARuA8H $HuHHUHAWAVSHHHHHEHHaHDvDHGybHHL(MA)HAaHu]ZHHu@=HHa"HHFHH@HHʖHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL<n譕1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!聅HuHHU1Ef.`u$z"Ef.huzEf.pu{$-HuHHUj HuHW@f. u*z(Hf.(uzPf.0u{'誄HuHH@f.u*z(f.uzf.u{'GHuHH联 HuHvHHcH H H;MDUHSH(HHHEHHHFHDžHHuкYHH9HEHE(E)EHHH6H}H<Ef.EuzEf.EuzEf.Eu{!HuHHU1!f.f.smf.WQf.;5f.f.f. f.(f.0f.8 f.@wq(f.H[U0f.P?98f.X#@f.`Hf.hPf.pXf.x`f.hf.uz}pf.ukzixf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'HuHHUHu.HHH οH H;Mt&]1H H H;MuH([]DUHSHH}HHEHpHJHxFHDžHp Huк)HpH Q HEHE(E)EHH HH}HEf.EuzEf.EuzEf.Eu{!~HuHpHU1f.ŀuezcf.ňuOzM f.Őu9z7HHSuRύ1H H H;MuUHĈ[]~HuHpH QL}HuHHH ŽH H;MtUHAWAVSH(HHHEHHJHD~DHGyHHLw(MA)HAHu HHthHEHE(E)EHHtiH}HEf.Ef31H ~H H;MH([A^A_]E1M"IHuHLxEf.EuzEf.EuzEf.Eu{!|HuHHU1_f.f.{f.e_f.ICf.-'f. f.f.f. f.(f.0f.8ic f.@MG(f.H1+0f.P8f.X@f.`Hf.hPf.pXf.x`f.uqzohf.u]z[pf.uIzGxf.u5z3Ef.u$z"Ef.uzEf.u{'KyHuHH腉$yHHHH H H;M| UHAWAVSHHɸHHEH`HHhD~DpHGtxyBHHLw(MA)H`AHu=H`HQthHEHE(E)EHH!ttiH}HEf.Efc1H H H;M2HĈ[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!OwHuH`HU1菇f.@f.pu:z8f.xu$z"f.ŀuz HHSu'vHuH`HQvHH6HH |H H;M莹f.UHSH(HuHHE؋FEHEH}ЃuEHuptG}.H$vHu2Ht6H5IoH詆HQvH([]þ艅1H([]H}HH([]UHSH(HuHHE؋FEHEH}ЃuEHuЅtG}蔩HuHu2Ht6H5nH HuH([]þ1H([]HݴHH([]ÐUHH=5H5ΖHDo H 0euuHH=2uH]ÐUH]\fDUHSPHH=ДH5iHn H uXuHH=tH5n HH]tt H ttH[]H=dH[]QufUHAVSH0HuH)HEЋFEHEHEH}ȃHuH]H=n H AtDH=sHt1H=H߶tH==.H̶t HLcsHuLs 1H0[A^]UHAWAVSH(HuH\)HED~D}HG]ԉ]؅y҂HHLw(HEMA)Au{HuH}}L}tH=l LAtuH=rLٵtbH=ֱLƵtOH=$-L賵tH5H}HUy}t7HHiHu"HzH([]H}о`y1H([]ÐUHH=H5H#H 0iuGHH=ߌiHӌ]ÐUH]f}fDUHSPHH=H5IHH i8uXGHH=zMiH5HgHht H TtH[]H=DH[]ifUHSH(HuHGHE؋FEHEHEH}Ѓu1Huxt3H}'lhHuHcqhH([]þw1H([]UHAWAVSH(HuH<HED~D}HG]ԉ]؅y wHHtdLw(HEMt8A)Au3HuH}wt}Hut;HI&gHt<1@H}2w1)HE1ILPvgHuHc{gH([A^A_]f.@UHAVSH0HuHHEЋFEHEuGH5!H}HUv}t@HHtCHH5 HPE1LEfHu+H}Ⱦev1H0[A^]E1fHuLMwUHAVSH HuHHEDvDuHG]]yvHHH(HD9u3HPxHt9HHH5 HPE1LEfHucH}111uRE1eHuCLvHt6HH9ft)H3fHH1Q@H߾f1HH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y uHHt\Lw(MtSA)Au7H5H}HUt}t0}t7LHxeHu9H}t1H([A^A_]ILH8dHuHmHUHAWAVSH(HuHPHED~D}HG]܉]y 2tHHt#H(HtD9uA EtXdHt+12H}111s!HLc-dHuL2dHHH([A^A_]f.DUHSH8^HG)Ѓ.HuHFoHEЉ]؉U܉UyYsHHH_(HwH}HusbH}HusMH}Hus8}uUMHHwH*cH {HuHnHEЉ]؉U܉UyrHHH_(HHuH}+s}HuHvHbHHuH!nHEЉ]؉U܉Uy 4rHHtcH_(HtZHuH}rtIH5|NH}HUq}t/}HutVHHQv*bHuXH5mq1H8[]1HuHHpHaHuCH HHaHuHdHH8[]HHxHaHuH=rH8[]fUHAWAVAUATSHHeHHEЋ^HG)ЃHhHlJHpx|UypHH)L(Hh@pACD-HcHpL1EIcM$LDMx+|RHhHupcH5HhHU&p}BHHhH p$HhH(cp HhHu]pHhHuoHhLDoEXE8EHE0E@EPDH`EuA1H`HhHHHpx|UynHHXL(HhgnACD-HcHnL1EIcM$LDMx+|HhHunH5HhHUMn}iHH5JHhHU)nH`}>HhH n#HhH(bnHhHu\nHhHumHhLDmE0E@EPE8EHEDHXE.A1HXH5Fl1MHhlHhl1HHH9t HtߟHHH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLHo"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{!~ZHuHhHU1j]ZHuUHhiEf.0u$z"Ef.@uzEf.Pu{$ ZHuHhHUIjE~A1AfA.uzHH9`u!YHuHhLDjYHmLYHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`Kl.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{!WHuHhHU1gWHuUHhfEf.8u$z"Ef.HuzEf.u{$:WHuHhHUwgE~A1AfA.uzHH9Xu!VHuHhLD1gVHLVHHHH9诙HHHH9t HtGHW f.UHAWAVAUATSHH5HHEH H7H(F0HG48yeHHL(H #eACD-HcHeL1EIcM$LDMG0+4H HudeH5H HOeOHH HeH H@eH HH7eH Hpdt|H LDdtfHEHE(E)E(p)PHEH`DH@EAst1H@WH c1HHH9t HtH)HH;EBHH[A\A]A^A_]E1#H@II9sII9s1HpHHH‰уH s1pHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH@H9)HHHHtI4I4HHuHH@rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u4Ht#L4$HuLHLpLHJf(IHL4$HuLHLpLHIEf.EuzEf.EuzEf.Eu{!RHuH HU1BbQHuHH 7apf.Pu'z%xf.XuzEf.`u{'QHuH HpaE~A1AfA.uzHH9@u!;QHuH LD{aQHLaHHHH9HHHH9t Ht蕓HQ fUHAWAVSH(HuH)HED~D}HG]ԉ]؅y "`HHtVLw(MtMA)Au1HuH}`t3}Hut6Lc*PHu8H}_1H([A^A_]ILOHuHcOӐUHAWAVAUATSH8HuH&HEDvDuHG]ĉ]ȅyN_HHLo(MA)AuiHuH}_tkH5;H}HU_}tQIƃ}L}tUEIEL8LLDHlOHuAH}^1H8[A\A]A^A_]IELLLNHuHgHfUHAWAVATSH0HuH&HEDvDuHG]̉]Ѕy0^HHLg(Mt{A)Au_HuH}^taH5:H}HU]}tGIƃ}L}tII$L8LLHkNHu?H}]1H0[A\A^A_]I$LLLMHuHYH@UHAVSH HuHKKHEDvDuHG]]y $]HHt"H(HtD9uEt$ aKMHt(1.H}111\H#MHuHHHH [A^]UHAWAVSH(HuH`HED~D}HG]܉]y r\HHt#H(HtD9uAEtLHt+12H}111\!HLcmLHuLrLHHH([A^A_]f.DUHAVSH HuHHEDvDuHG]]y [HHtH(HtD9u_KHt1H}111b[ HcKHHH [A^]f.UHSH8^HG)ЃHuHRHE؉]UUy[HHH_(HHuH}~[}HuH^KHHuH"RHE؉]UUy ZHHtvH_(HtdH}HuZtSH}HuZtBH}HuZt1}uUȋMtLH+^vJHuNH5QY1H8[]1HuHH>JHuHH&JHuHHH8[]UHSH8^HG)ЃHuH%RHE؉]UUyrYHHH_(HHuH}Y}HuHT]uIHHuHQHE؉]UUy XHHtvH_(HtdH}Hu`YtSH}HuOYtBH}Hu>Yt1}uUȋMtLH\HHuNH5)QgX1H8[]1HuHHHHuHHHHuH*HH8[]UHSH8^HG)ЃHuHQHE؉]UUyWHHH_(HHuH}^X}HuH0\GHHuH>QHE؉]UUy jWHHtvH_(HtdH}HuWtSH}HuWtBH}HuWt1}uUȋMtLH[VGHuNH5PV1H8[]1HuHHGHuHHGHuHHH8[]UHSH8^HG)ЃHuH>QHE؉]UUyRVHHH_(HHuH}V}HuH(ZUFHHuHPHE؉]UUy UHHtvH_(HtdH}Hu@VtSH}Hu/VtBH}HuVt1}uUȋMtLHYEHuNH5BPGU1H8[]1HuHHEHuHHvEHuH HH8[]UHAVSH HuH;HEDvDuHG]]y THHt$H(HtD9uEt&XDHt*11H}111}T HDHuDHHH [A^]UHAVSH HuH;HEDvDuHG]]y $THHt$H(HtD9uEt&TXIDHt*11H}111S HDHuCHHH [A^]UHAWAVSH(HuHOHED~D}HG]ԉ]؅y rSHHtVLw(MtMA)Au1HuH}St3}Hut6LsWzCHu8H}R1H([A^A_]IL@CHuECӐUHAWAVSH(HuHOHED~D}HG]ԉ]؅y RHHtVLw(MtMA)Au1HuH}St3}Hut6LVBHu8H},R1H([A^A_]ILpBHuuBӐUHAVSH HuHHEDvDuHG]]y QHHt%H(HtD9uEt'UHAHt+12H}111|Q!H HAHuHdRHHH [A^]ÐUHHHztuHH]H=i]^H5y Q1]UHSPHH=H脄tZH= HqtGH=H^t4H=[HKt!H=H8tHH[]dOH[]f.@UHSH(HuHSxHE؋FEHEEȃrH}о5P1[H5H}HU/PH1}tH5iH}HUO}t7HSH?Hu"HbPH([]H}о@O1H([]ÐUHH=5hH5iH H 0?huQHiH=g?Hg]ÐUH]efDUHSPHH=gH5iiH H `?XhuPHhH=g-?H5a HgH>t H tgtH[]H=dgH[]?fUHSH(HuH'HE؋FEHEHEH}Ѓu;HuzNt=H]H= Hut/HAHc5>Hu'M1H([]û >HuH>H([]UHAWAVSH(HuHHEDvDuHG]ԉ]؅y bMHHtwL(HEMtKA)AuFHuH}Mt1}LutNH= L莀tfL@O=Ht?1CH}L1,HE1 ILLP=HuHc=H([A^A_]û<HuUHAVSH0HuHKHEЋFEHEuGH5KH}HUML}t@HHtCHH5 HPE1LEs<Hu+H}ȾK1H0[A^]E1F<HuLLUHAVSH HuHBHEDvDuHG]]yKHHH(HD9u3HPxHt9HHH5= HPE1LE;HucH}111,KRE1;HuCLLHt6HH;t)H;HH1Q@H߾;1HH [A^]UHAWAVSH(HuHHED~D}HG]܉]y JHHt#H(HtD9uAEt:Ht+12H}111LJ!HLc:HuL:HHH([A^A_]f.DUHAWAVSH8HuH=HED~D}HG]̉]ЅyIHHLw(HEEMD)؃rH}11ID9}H}Hu)JtqD}ȋ]D9}H}HuItT}Hu؋Ut1Lm`9Hu5CE1HEEMpIL0c9Ht1HH8[A^A_]HxHfUHAWAVAUATSH^HG)Ѓ7HXHEH`hlpyHHH]L(HXGAC6HcH xHL E1EIcIIDMh+l|HXHuHzHXHuHbHXLD0HHEEArKH9JI91HHLLHtI4H4HHuHUI H ILHLILHLILHLHI9u!H H DH(048y GHHcH_(HVHXH bG;H5Y#H HUF}4XHH]H6HHuHVCHE]UUy`FHHFHG(HEL}LEAC6HcH UFH E1EIcHLELEAH]C?HcHXFHXE1EIcHMHIDH}ZE+E5H}Hu'FLmЄ/H}Hu,FH}HuDEH}HEH}LDEEEH}\ArJI9KH9{1HHLLHtH4I4HHuHH I HLILHLILHLILHI9uH5A}DE1kHXhDE13H}PDE1HXH`H9t HtfwH H(H9t HtIwLH[A\A]A^A_]E11H HH@H<4HLHC4IDHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9luHUt LL~YILL8IE~71I H; u HI9u!3HuHXLDzC2H L2IHDHpHHH‰уH s1hHH)1LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL9LEEGArHMJH9suJH9sl1HHLLHtH}H4H4HHuH}HH H HLHLHLHLHLHLHI9uDHpHHH‰уH s1H}dHH)1H}LLD L0D L0D@LPD@LPD`LpD`LpHHuHt&HHD D H HuL9}uHULtH}HMLMVHEH}HHMLMHHEE~=1HMH I; uHH9uU0HuH}HUD@E~91HMH H; u HI9u0HuH}HUD}@/H;H}/IHXH`H9.3&$HHXH`H9tHt srHH H(H9t HtOrH0 UHAVSH HuHbHHEDvDuHG]]y >HHtH(HtD9uU/Ht1H}111> HnHHH [A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅y R>HHt\Lw(MtSA)Au7H5*H}HU>}t0}t7LHKTT.Hu9H}=1H([A^A_]ILH8.HuHmHUHAVSH HuH3HEDvDuHG]]y t=HHt%H(HtD9uEt'SH-Ht+12H}111=!HPHm-HuHx-HHH [A^]ÐUHSH8^HG)Ѓ.HuH8HEЉ]؉U܉Uy<HHH_(HwHuH}%=b}HujHcSH,H;HuH8HEЉ]؉U܉Uy.<HHH_(HH}Hu<H}Huw<H}Hub<}uUMHg~H+HHuHq7HEЉ]؉U܉Uy ;HHtcH_(HtZHuH}<tIH5H}HUH;}t/}HutVHH7Rz+HuXH56:1H8[]1HHHpH;+HuCH HH +HuHjHH8[]HHxH*HuH;H8[]fUHAWAVSHHjHHEH`HjHhD~DpHGtxy2:HHLw(MA)H`AuuHX:ttH`Hu:t[(E(M(U)U)M)EtHXteHULOEf.E_m91H iH H;MHĘ[A^A_]E1M#Ht1H}1112 H3HHH [A^]f.UHAVSH HuHHEDvDuHG]]y t2HHtHG(HtD9uHX"Ht1H}111"2 H 3HHH [A^]f.UHAVSH HuH;HEDvDuHG]]y 1HHt"H(HtD9uEt$H!Ht(1.H}1111H!HuHgaHHH [A^]UHAVSH HuHKHEDvDuHG]]y $1HHt"H(HtD9uEt$$GK!Ht(1.H}1110H#!HuH`HHH [A^]UHAVSH HuH4HEDvDuHG]]y t0HHt$H(HtD9uEt&F Ht*11H}1110 Ho HuHct HHH [A^]UHAVSH HuHHEDvDuHG]]y /HHtH(HtD9uEHt1H}111t/ Ho_HHH [A^]UHAVSH HuHHEDvDuHG]]y 4/HHtHG(HtD9uHH^Ht1H}111. H/HHH [A^]f.UHAWAVSHx^HG)ЃHxHHE]UUy{.HHH_(HHuHx.yH5 HxHU-.}XHuHHpDaH;H]H_HuHHEȉ]ЉUԉU؅y-HH@L(H}R-AC6HcHx-HxH]ME+EԃH}Hu.H}Hu.H}HD-HuHUHMLCwHuHUH},[HuHUH}D,<Hu1H\H'H5,1/H},1HxHEH9t Ht_HHx[A^A_]E1HHxHEH9t Ht_H f.UHAWAVAUATSH(HHZHG)σHUH=S2H}]MĉMȅyHH+HHH^(HH5pH}HU+}IH5w7H}HU+}nIH5H}HUp+}MHLLHBH.H=KH([A\A]A^A_]8HUH=u1H}]MĉMȅyHH+HHH^(HH5H}HU*}IH56H}HU*}IH5H}HU*}tsIH5[6H}HUu*}tVIH5>6H}HUX*}t9HLLLMI{AHuHZHH5v0*1H([A\A]A^A_]f.UHAVSH HuH!HEDvDuHG]]y )HHtHG(HtD9uH@Ht1H}111r) Hp*HHH [A^]f.UHAWAVAUATSHhHuH+HEFEHGMĉMȅy )HHyL(H}(AC6HcHp)Lp1EIcM,LDME+EăH}HuR)H}Hu)H}LD(DEArII9IDI91HHHHHtI4ItHHuHRDI ILILILILILILILHH9uH}'1HpHxH9t HtZHHh[A\A]A^A_]E1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9z}HuUt LL<ILLPE~81I I;Lu HH9uHuH}LD-'HH8VHHpHxH9{HHpHxH9t Ht+YHe f.DUHAWAVAUATSHhHuHHEFEHGMĉMȅy%HHvL(H}&%AC6HcHx%Lx1EIcM,LDME+EăH}Hu%H}Hu%H}LDt%DEArII9IDI91HHHHHtI4ItHHuHODI ILILILILILILILHH9uH}D$1HxHEH9t Ht^WHHh[A\A]A^A_]E1؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9}}uЋUt LL: LL9IE~=1I I;Lu HH9uVHuH}LD#8HL?HHxHEH9zHHxHEH9t HtUH fUHAWAVSH8HuHrHED~D}HG]̉]Ѕy R"HHtmLw(MtdA)AuHHuH}"tJHuH}"t9HuHUL8MHuHQHH}!1H8[A^A_]f.fUHAWAVSH8HuH6HED~D}HG]̉]Ѕy !HHtmLw(MtdA)AuHHuH}!tJHuH}!t9HuHUL7}HuHQHH} 1H8[A^A_]f.fUHAWAVSH8HuHHED~D}HG]̉]Ѕy HHtlLw(MtcA)AuGHuH}-!tIHuH} t8Hu؋UL6HuHBPHH}& 1H8[A^A_]f.UHAWAVSH8HuHHEDvDuHG]ԉ]؅yHHL(MA)AulHuH}U tnH52H}HU}tTIH5H}HUx}t7}Hut:LLH5HuH}111\-HH HuHHx  HHH [A^]DUHAWAVSH(HuHIHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5QKH}HU}t0}t7LH1 Hu9H}v1H([A^A_]ILH HuHMKHUHAWAVSH(HuHIHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5qJH}HU}t0}t7LH1 Hu9H}1H([A^A_]ILH HuHmJHUHAWAVSH(HuHAHED~D}HG]ԉ]؅y 2HHtpLw(MtgA)AuKHuH}tMH5%H}HU}t3}ut7LH0 Hu9H}1H([A^A_]ILHX HuHyIH@UHAVSH HuHHEDvDuHG]]y DHHt$H(HtD9uEt&/i Ht*11H}111 H`? HuHcD HHH [A^]UHAVSH HuHPHEDvDuHG]]y HHtH(HtD9u/Ht1H}111D H?HHHH [A^]UHHHztuHH]H=69]p%H5?1]UHAVSH0DvHGD)HuH/HEDu]]yHHH_(HHuH},HuH.HHHH5H7HHfHuH/HEDu]]y HHt:HG(Ht1D9u:H`HHuHHH5.1HH0[A^]H}111HFHf.UHAVSH HuHHEDvDuHG]]y dHHtHG(HtD9uHhHt1H}111 HHHH [A^]f.UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}=t5HuLw,HuHcH}J1H([A^A_]ÐUHAVSH HuHiHEDvDuHG]]y HHt%H(HtD9uEt',+H8Ht+1>H}111-HH HuHHx HHH [A^]DUHHHzu H=5]!H5UK1]ÐUHAWAVAUATSH~dHhHlHpHDžxEHhAC6HcH(L(1EIcIHE؋x+|}H5DHhHU}rIHhLDUEErArKH9JI91HHLLHtf.DI4H4HHuHfDI H ILHLILHLILHLHI9uHuHHEHEEL}LEÍHcH(L(E1H]HcIDLELAC?HcHhLh1EL}IcIHE؋E+E H}H`H}LHUlH}LHUTHEADž}rKDI97KI9*1HHLLHt@ItI4HHuHILI ILILILILILILHI9uH5*1iHh12H}1HhHpH9t HtDH(H0H9t HtCHHĸ[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9LL&E~F1f.DI H; u HI9u!HuHhLD{HsH?HDHpHHH‰уH s1qHH)1ADALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADALADA H HuL9 HEȉHMЅH}s 1HUHUIH9sHI9s1ЃHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuHUH9tZHHHHtfI4H4HHuHHUr/I H ILHLILHLILHLHH9uH`LL?$}~C1f.ILI; u HI9uvHuH}LHM }~:1@I H; u HH9Eu6HuH}LHM HH<HHhHpH9$"HHhHpH9tHt ?HH(H0H9t Htt?H UHSPHH=H?tZH=vl H?tGH=H~?t4H={;Hk?t!H=ɶHX?tHH[] H[]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅y r HHttLw(MtkA)AuOHuH} tQH5DH}HU- }t7uLHe"fHuH:HH} 1H([A^A_]DUHAWAVAUATSHHHuHHEFEHGMĉMȅy HHPL(H}11 AC6HcH} LeEIcM,LDMME+EăH}LD H5,H}HU }DEArI I9ILI91HHHHHtf.fAH5i6H}HU}t7HHHu"HbH([]H}о@1H([]f.UHAVSH@HuHHEFEHEH5H}HU}HH}HuH}HurH5ŰH}HU}tfIH5wH}HU}tIHuHUHLIIHt4HtFHuVH}01H@[A^]HUH}rHuHUH}VHuH4HDUHAWAVAUATSHxHuHHEFEHEH}11MAC6HcHhLhEIcIHE؋E+EăH}LDH}HuH}HuH5;H}HU$}IH5H}HU}EEArK H9J I91HHLLHtf.I1f.I H; u HI9uHuH}LD>HuHUH},HH-.HHhHpH9HHhHpH9t Ht 1HZ UHH=H5~!HK1zr uҽH H=GH]fDUHSPHH=H5)!H1% u}Hf H=_H5HLHt H 9tH[]H=)H[]vf.@UHSH(HuHHE؋FEHEHEH}Ѓu1Hu:t3H} HuHcH([]þ1H([]UHAWAVSH(HuHܢHED~D}HG]ԉ]؅y RHHtdLw(HEMt8A)Au3HuH}t}Hut;HRHt<1@H}1)HE1ILPHuHcH([A^A_]f.@UHAVSH0HuH[HEЋFEHEuGH5[H}HU]}t@HHtCHH5HPE1LEHu+H}Ⱦ1H0[A^]E1VHuLUHAVSH HuHRHEDvDuHG]]yHHH(HD9u3HPxHt9HHH5HPE1LEHucH}111<RE1HuCL-Ht6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuH;HED~D}HG]܉]y HHt#H(HtD9uA$EtHt+12H}111\!HLcHuLHHH([A^A_]f.DUHAWAVSH8HuHHED~D}HGẺEЅy HHtgLw(HEEMxArH}11~H}qEt6H}Hu5t[EȋM9|#2E1HEEMu6119}H}HutHu؋UIL0Ht1HH8[A^A_]H (H@UHAWAVSH(HuHR&HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H51'H}HU}t0}t7LH?Hu9H}V1H([A^A_]ILHHuH-'HUHAWAVAUATSHD~HGD)ȃ~PHXHH`DhlpyHHL(HX/AC$HcH L E1EIcIIDM+lHX?H HH(D048yHHzLw(Mm2A9HXH [@H5RH HU}XILH@HHHI\HuHMHED}MMyVHHHG(HEL}LAC6HcH KH E1EIcHLELAH]C?HcHX HXE1EIcHMHIDH}_} H}DH5vqE1khHXHuHXHuHXLDEEArKH9 JI91HHLLHtI4H4HHuHI H ILHLILHLILHLHI9u\},H}HuLmȄ&H}HuH}HuDH}HH}LDEEOArHMJI9oKH9b1HHLLHH}H4I4HHuH "H E11AHXYE13H}AE1HXH`H9t HtW%H H(H9t Ht:%LH[A\A]A^A_]DHpHHH‰уH s1hHH)1AALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9DuHUILL8IE~71I H; u HI9u!YHuHXLD8HrL?IH}HH I HLILHLILHLILHI9uDHpHHH‰уH s1H}lHH)1H}LAALD L0AD AL0D@LPAD@ALPD`LpAD`ALpHHuHt(HHD ADA H HuL9LMEEQArHMJH9suJH9sl1HHLLHtLMI4H4HHuLMHI H ILHLILHLILHLHI9uDHpHHH‰уH s1LMlHH)1LMAALLAD AL0D L0AD@ALPD@LPAD`ALpD`LpHHuHt(HHADA D H HuL9uHULH}HHMHHEHE~91HMH I; u HH9u_HuH}HUDE~91HMH H; u HI9u!HuH}HUDHTH}IHXH`H9GL&$HHXH`H9tHt } HH H(H9t HtY H f.UHAWAVAUATSHhHuHHEFEHGMĉMȅyHH8L(H}VAC$HcHpLp1EIcM,LDM }tH}q}H}HuH}HuH}LDDEArII9IDI91HHHHHtI4ItHHuHMI ILILILILILILILHH9uE1H}i1HpHxH9t HtHHh[A\A]A^A_]É؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9HuUILLPE~51I I;Lu HH9uHuH}LD{HH HHpHxH9HHpHxH9t HtH8 fUHAWAVSH(HuHHED~D}HGEԉE؅yHHLw(Mt{xYAu^HuH}t`H5.H}HUH}tFuILHX}Hu*HH H} H}1H([A^A_]ÐUHAVSH HuHHEDvDuHGEEy HHtCH(Ht:xEtH}111s"H}tH`Ht1HH [A^]HcHf.UHHHztuHH]H=V ]pH51]UHSH(HuHHE؋FEHEEȃrH}о1[H5H}HUH1}tH5H}HU}t7HH;Hu"HH([]H}о1H([]ÐUHH=E H5 HH 05 umH H= H ]ÐUH] fDUHSPHH= H5y H_H h uH H= H5+H H-t H tH[]H=t H[]!fUHAVSH0HuHHEЋFEHEHEH}ȃuoHutqH]H=HAt1H=(HtH=(Ht HLcwHuL|1H0[A^]f.@UHAWAVSH(HuH<HED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=LAtbH=&LtOH=LtHt+12H}111!HHcHuHHHH [A^]UHAVSH HuH5HEDvDuHG]]y dHHtH(HtD9uEt!1Ht+12H}111!HHccHuHhHHH [A^]UHAVSH HuHc5HEDvDuHG]]y HHtH(HtD9uEt!1Ht+12H}111b!HHcHuHHHH [A^]UHAWAVSH(HuH.5HED~D}HG]ԉ]؅y HHtJLw(MtAA)Au%HuH}_t'}t.1Hu<tHLHUHpLMP!IHLHUHpLM(ĹHuLH(1Ef.EuzEf.EuzEf.Eu{$|HuH(HUpf.Pu'z%xf.XuzEf.`u{'HuH(HpYE~>1AfA.Du z HH9u!ָHuH(LD赸HzHEHHHH9nsHHHH9t Ht3Hm UHAVSH HuH3HEDvDuHG]]y HHt%H(HtD9uEt1fHHt51H}111lHH [A^]HpH賷HuHtH5ذH8HHH&H뱐UHAWAVSHxH\HHEHxH$HED~D}HG]]yHHLw(MA)HxAumHu3toHxHutVH5HxHUu}t9HMHM(E)E}utOHULHQ$1H oH H;MHx[A^A_]E1MGIHULHEf.EuzEf.EuzEf.Eu{$HuHxHURH`HcH H H;MZUHAWAVAUATSHXHuHS3HEDvDuHG]ĉ]ȅy.HHLo(MA)A HuH}mH5>H}HU}aIH5t>H}HU}@IH5oH}HU}IH5oH}HUv}HH5loH}HUU}HEH5 >H}HU3}HEH5=H}HU}HEH5=H}HU}t{HEHuH}tfH5=H}HU}tL}ELUtNHLLLLILMPARuuuiRH} \1HX[A\A]A^A_]M]HLLLLILMPARuuuA0H0xHuH HUHAWAVSHhH<HHEHuH09HED~D}HG]]yHHLw(MA)H}AuPHuHEHEf(Ef)E}t3fWf)EHEfW1f.EuRzP2'eIHuLXHcEf.EuzEf.EuzEf.Eu{GHuH}HU1)Ht1H H H;Mu#Hh[A^A_]HH H H;Mtf.UHAWAVSHHHHHEHHЊHDvDHGy2HHL(MA)HAaHu-ZHHu=HH1"HHHH@HHHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLbn}1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!QHuHHU1葿Ef.`u$z"Ef.huzEf.pu{$HuHHU:ٮHuH'@f. u*z(Hf.(uzPf.0u{'zHuHH@贾f.u*z(f.uzf.u{'HuHHQHuHFϭHHcЭH H H;MDUHAWAVSH(HuH"HEDvDuHG]ԉ]؅yHHL(MA)AumHuH}gtoH5bH}HUż}tUIH5;H}HU証}t8}utH}X1H([A^A_]ILLHH薬HuHc蛬UHAWAVAUATSHHUHHEHPH$HXF`HGdhyлHHHG(HpLPL9AC6HcH蛻HE1EIcHLELAH]C?HcH\HE1EIcHIDHpHI͋`+dHPHH耻HPHuHPHuDHPHL-tiHPLDɺtSHEHEf(Ef)EDHxE#A1HxzHP$E1HHH9t Ht:HHH9t HtH4HH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMM+HpHHUHMMPEf.EuzEf.EuzEf.Eu{$荦HuHPHUʶE~E1HMfA.uzHH9xu"AHuHPHUD耶E~>1ADf.u z HH9Eu!HuHPLD=ܥHKL-lIEHHH9?DHHHH9tHt YHHHH9t Ht5Ho fUHHpH1HHEHuHP:HEFEHEH}HuH}HuҴHEHE(E)EEEH}Hu;Ef.EuzEf.EuzEf.Eu{芤HuH}HU1ʹEf.Eu{!^HuH}HU螴=Hu.HHH H H;Mt&-観1H H H;MuHp]fUHHHHHEH`H:HhFpHDžtH`"HuzH`Hu]HEHE(E)E(E)EHEHEH}HuEf.EuzEf.EuzEf.Eu{!HuH`HU1OEf.EuzEf.EuzEf.Eu{$ĢHuH`HU蠢Hu.H4HH zH H;Mt& 1H TH H;MuHĠ]fUHAWAVSHxH,HHEHxH(HED~D}HG]]y豱HHLw(MA)HxAuoHu谱tlHxHu藱tSHEHE(E)EEp}t_H}HuEf.Ez~`1H =H H;MHx[A^A_]E1MEIHuHULxEf.EuzEf.EuzEf.Eu{!HuHxHU1$Ef.pu{$負HuHxHU莠H/HHH dH H;M'vfUHAWAVSHH9HHEH@HS(HHD~DPHGTXy貯HHLw(MA)H@AuHu豯t|H@Hu蘯tcHEHE(E)E(E)`HEHpTtfH}HuEf.Ec1H .H H;MHĨ[A^A_]E1M2IHuHULEf.EuzEf.EuzEf.Eu{!ҞHuH@HU1Ef.`u$z"Ef.huzEf.pu{$~HuH@HU軮ZH HHH 0H H;MBUHH=H5>H H 0U-u衞HvH=o"Hc]ÐUH]fDUHSPHH=@H5H H u<HH= 轝H5 HHMt H tH[]H=H[]AfUHAVSH0HuHRHEЋFEHEHEH}ȃu\Hut^H]H= HAtH=[WHt HLc誜HuL诜(1H0[A^]ÐUHAWAVSH(HuH|RHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}!t|}L}tYH= LAtOH=nVLt<tHLHUHpLM.!IHLHUHpLM(yHuLH(1Ef.EuzEf.EuzEf.Eu{$\yHuH(HU虉pf.Pu'z%xf.XuzEf.`u{'xHuH(Hp9E~>1AfA.Du z HH9u!xHuH(LDxHzH%HHHH9nsuHHHH9t HtHMy UHAWAVSHHH HHEHH QHDvDHGy肇HHL(MA)HAaHu}ZHHu`=HH聇"HHfHH@ HHHLLHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LL谳nͅ1H H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!uHuHHU1Ef.`u$z"Ef.huzEf.pu{$MuHuHHU芅)uHuHw@f. u*z(Hf.(uzPf.0u{'tHuHH@f.u*z(f.uzf.u{'gtHuHH衄@tHuH薃tHHc tH H H;M DUHAWAVSH(HuHHEDvDuHG]ԉ]؅ybHHL(MA)AumHuH}跃toH5_H}HU}tUIH5_H}HU}t8}utH}訂1H([A^A_]ILLHHrHuHcrUHAWAVAUATSHHHHEHPH^HXF`HGdhy HHHG(HpLPL艁AC6HcHHE1EIcHLELNAH]C?HcH謁HE1EIcHIDHpHI͋`+dHPHHЁHPHueHPHuDJHPHL}tiHPLDtSHEHEf(Ef)EDHxE#A1HxzHPtE1HHH9t Ht芳HHH9t HtmHHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMaHpHHUHMMPEf.EuzEf.EuzEf.Eu{$lHuHPHU}E~E1HMfA.uzHH9xu"lHuHPHUD|E~>1ADf.u z HH9Eu!MlHuHPLD|,lHKL-IEHHH9?D HHHH9tHt 詮HHHH9t Ht腮Hl fUHSHH}HHEHHJHF HDž$HVHuк){OHH {/HEHE(E)EH0HHH}HZEf.EuzEf.EuzEf.Eu{!jHuHHU1zf.082f.8f.@f.Hf.Pf.X f.`(f.htn0f.pXR8f.x<6@f. Hf.Pf.Xf.`f.hf.pf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'BhHuHH|xhHu.HHH H H;Mt& w1H ϧH H;MuH[]f.fUHAWAVSHHHHEHHJHD~DHGywHHLw(MA)HAHu wHH`vHEHE(E)E(`(p(U(]) )0)@)PtiH}H` Ef.Efv1H `H H;MmH[A^A_]E1MIHuH`LxEf.EuzEf.EuzEf.Eu{!fHuHHU1Av`f. hf.(unzlpf.0uZzXxf.8uFzDEf.@u5z3Ef.Hu$z"Ef.PuzEf.Xu{'DeHuHH`~ueHHHH H H;MUHAWAVSHHɤHHEHHHD~DHGyBtHHLw(MA)HAHu=tHHtthHEHE(E)EH H!tiH}HhEf.Efcs1H H H;M-H[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!OcHuHHU1sf. F@f.(*$f.0f.8f.@f.Hf.Pf.X| f.`f`(f.hJD0f.p.(8f.x @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'`HuHH q`HH;HH H H;M蓣f.DUHHHNHHEH HjH(F0HDž4H HuoH HuoxHEHE(E)E(E(M(U(])@)P)`)pH}Hu"Ef.EuzEf.EuzEf.Eu{!s_HuH HU1oEf.@uyzwEf.HuhzfEf.PuWzUEf.XuFzDEf.`u5z3Ef.hu$z"Ef.puzEf.xu{$^HuH HUo^Hu.H:HH H H;Mt&薡n1H ZH H;MuH]UHSH(HuHHE؋FEHEH}Ѓu6HuPnt8}VH^Hu#H߾(mH([]þxm1H([]UHSH(HuHHE؋FEHEH}Ѓu6Humt8}ܚH]Hu#H߾lH([]þl1H([]ÐUHH=H5.H`H 0]uHfH=_R]HS]ÐUH]fDUHSPHH=0H5ɢH~`H ]uHH=\H5J`HH}\t H ԠtH[]H=ĠH[]q]fUHAVSH0HuHHEЋFEHEHEH}ȃHu4lH]H=_H+AtDH=5MHt1H=#HtH=]Ht HjLc[HuL[*k1H0[A^]UHAWAVSH(HuH|HED~D}HG]ԉ]؅yjHHLw(HEMA)Au{HuH}!k}L}tH=^LAtuH=LLtbH= LtOH=DLӝt<tHLHUHpLM~!IHLHUHpLM(@HuLH(1-PEf.EuzEf.EuzEf.Eu{$@HuH(HUPpf.Pu'z%xf.XuzEf.`u{'/@HuH(HpiPE~>1AfA.Du z HH9u!?HuH(LD&P?HzHUHHHH9ns襂HHHH9t HtCH}@ UHAWAVSHHH9HHEHHPHDvDHGyNHHL(MA)HAaHuNZHHuN=HHN"HHNHH@:NHHNHLLJNHEHE(E)E(E)`HEHp(@) HPH0()HHtlL4$HuHUHL@LLF{nL1H H}H H;M!HH[A^A_]E1MLIL4$HuHUHL@LL@Ef.EuzEf.EuzEf.Eu{!<HuHHU1MEf.`u$z"Ef.huzEf.pu{$}<HuHHULY<HuHK@f. u*z(Hf.(uzPf.0u{';HuHH@4Lf.u*z(f.uzf.u{';HuHHKp;HuHJO;HHcP;H '{H H;M9~DUHAWAVSH(HuHHEDvDuHG]ԉ]؅yJHHL(MA)AumHuH}JtoH5&H}HUEJ}tUIH5&H}HU(J}t8}utH}I1H([A^A_]ILLHH:HuHc:UHAWAVAUATSHHyHHEHPHHXF`HGdhyPIHHHG(HpLPLHAC6HcHIHE1EIcHLEL~HAH]C?HcHHHE1EIcHIDHpHI͋`+dHPHHIHPHuHHPHuDzHHPHLHtiHPLDIHtSHEHEf(Ef)EDHxE#A1HxzHPGE1HHH9t HtzHHH9t HtzHwHH;ELH[A\A]A^A_]1HMHxHI9sIH9s1HpHHH‰уH s1H}nHH)1H}LAALD L0AD AL0D@LPAD@ALPfD`LpfAD`ALpHHuHt*HHfD fADA H HuHxH9)HHHHtH}H4I4HHuH}HHxrWH I HLILHLILHLILHL IL HL(IL(HL0IL0HL8IL8HH9uDHEE}As 1HuHuIDH9sLHI9s1HpHHH‰уH s1LeHH)1LLLD L0D L0D@LPD@LPfD`LpfD`LpHHuHt(HHfD fD H HuHuH9)HHHLHtH4H4HHuHHUrWH H HLHLHLHLHLHLHL HL HL(HL(HL0HL0HL8HL8HH9udHDLtHUHpHMMqHpHHUHMMPEf.EuzEf.EuzEf.Eu{$ 4HuHPHUJDE~E1HMfA.uzHH9xu"3HuHPHUDDE~>1ADf.u z HH9Eu!}3HuHPLDC\3HKL-rIEHHH9?D;vHHHH9tHt uHHHH9t HtuH3 fUHAVSH HuHJHEDvDuHG]]y DBHHt%H(HtD9uEt1JpHh2Ht51H}111AHH [A^]HpH32HuHtH5X+HBH`2HHqH뱐UHAWAVSHhHqHHEHuHзHED~D}HG]]ydAHHLw(MA)H}AuZHufAHEHE(E)E}t?(-)EH?HE-1f.EuRzP2@eIHuLXHcEf.EuzEf.EuzEf.Eu{0HuH}HU1 A0Ht1H pH H;Mu#Hh[A^A_]H0H ~pH H;MtsUHHH^pHHEH@HzHHFPHDžTH@fHu @_H@Hu?BHEHE(E)E(E(M(U)`)p)UH}HumEf.EuzEf.EuzEf.Eu{!/HuH@HU1?Ef.`uQzOEf.hu@z>Ef.pu/z-Ef.xuzEf.EuzEf.Eu{$/HuH@HUM?.Hu.HnHH nH H;Mt&qU>1H nH H;MuH]f.@UHSHHmnHHEHpH:HxFHDžHpHuк>HpH =HEHE(E)EHH HpH}HkEf.EuzEf.EuzEf.Eu{!-HuHpHU1= f.(f.tn0f.XR8f.<6@f. Hf.Pf.Xf.`f.hf.pf.u|zzxf.uhzfEf.uWzUEf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'+HuHpH <+Hu.HGkHH kH H;Mt&n;1H gkH H;MuHĈ[]@UHAWAVSHH9kHHEH HH(D~D0HG48y:HHLw(MA)H AHu:H Hp:ttHEHE(E)E(p(M(U)@)P)`4tiH}Hp8hEf.Ef91H jH H;M=H[A^A_]E1MIHuHpLxEf.EuzEf.EuzEf.Eu{!)HuH HU19pf.@uZzXxf.HuFzDEf.Pu5z3Ef.Xu$z"Ef.`uzEf.hu{'&)HuH Hp`9(HHhHH hH H;MkUHAWAVSHHhHHEH`HðHhD~DpHGtxy"8HHLw(MA)H`AHu8H`H7thHEHE(E)EHHkttiH}HeEf.EfC71H gH H;MHĈ[A^A_]E1M"IHuHLEf.EuzEf.EuzEf.Eu{!/'HuH`HU1o7f.f.| f.f`(f.JD0f..(8f. @f.Hf.Pf.Xf.`f.hf.unzlpf.uZzXxf.uFzDEf.u5z3Ef.u$z"Ef.uzEf.u{'Z%HuH`H53%HHdHH eH H;M{hUHSH(HuHLHE؋FEHEH}Ѓu6Hu5t8}lbH$Hu#H߾3H([]þ(41H([]UHSH(HuHHE؋FEHEH}Ѓu6Hu4t8}aH4$Hu#H߾X3H([]þ31H([]ÐUHH=emH5nHG H 05$mu$H6nH=/m$H#m]ÐUH]CfDUHSPHH=mH5nH H #mu$HmH=l#H5 HlH-#t H ltH[]H=lH[]!$fUHAVSH0HuHHEЋFEHEHEH}ȃu\Hu2t^H]H= HeAtH=;Het H0Lc"HuL"21H0[A^]ÐUHAWAVSH(HuH\HED~D}HG]ԉ]؅y1HHLw(HEMA)AuQHuH}2t|}L}tYH=2 LdAtOH=NLdt$Ht=1CH}-1,HE1 ILHuH{]HH([A^A_]f.UHAWAVSH(HuH HEDvDuHG]܉]y 2-HHt!H(HtD9uEt/Lw8ZHt71H}111,HH([A^A_]HI#HuMt3LC`ILHWHHuLLHH\Hf.UHAWAVSH(HuHh HED~D}HG]ԉ]؅yB,HHLw(HEMA)AHuH}m,}H]M~8HL HtMtLHD_MtL^HH$_IIL^IF8I 1J ;H9s J 8H9LHHyHHHƉH`sa1H}"+1+HE1ILHbHR1H([A^A_]IF8HH)13L30L0D3 L30D0 L00D3@L3PD0@L0PD3`L3pD0`L0pHHuHt"HHD3 3D0 0H HuI9AHHILHt 1fD  HH9uI)HHHrQ1 T TT TT TT TT TT TT THI9uILHHYHUHAWAVSH(HuHmHED~D}HG]ԉ]؅yb)HHLw(HEMA)Au\HuH})thHuL8H_HuOHtWH\IHHHu1/HLH}(HE1H([A^A_]HXHfUHAWAVSH8HuHoHED~D}HG]̉]Ѕyb(HHLw(HEHEMt`A)H}AuDHu(tFH}Hu|(t5HuHUL7IHuHWH'1H8[A^A_]E1HEHEMwf.@UHAWAVSH8HuH'HED~D}HG]̉]Ѕy b'HHtpLw(HEMtDA)Au?HuH}'t*HuH}'tHuUL7VHt01!H}&1 HE1H8[A^A_]HVHDUHAWAVAUATSH8HuH'HED~D}HG]]y~&HHLw(HEMA)Au[HuH}&HuH}&A~hH]L}IvXIF`LhLIF`H9s)MfHQH}%1\HE1PINPf.@HH9sIvXI~H!YIIFHMLHLYC'Ht1H8[A\A]A^A_]H\UHUHAWAVSH(HuH&HEDvDuHG]܉]y "%HHt!H(HtD9uEt/LwHJHt71H}111$HH([A^A_]HIHuMt3L3XILHGHHuLLHHoTHf.UHHHHGzu H=*f]1H5P&$1]@UHAWAVSH8HuHE(HED~D}HG]̉]Ѕy #HHtpLw(HEMtDA)Au?HuH})$t*HuH}6$tHuUL}3Ht01!H}f#1 HE1H8[A^A_]HJSHDUHAWAVSH8HuH(HED~D}HG]̉]Ѕy #HHtrLw(HEMtFA)AuAHuH}I#t,HuH}J#tHuEL2Ht01!H}"1 HE1H8[A^A_]HhRHUHAWAVSH8HuH)HED~D}HG]̉]Ѕy 2"HHtrLw(HEMtFA)AuAHuH}i"t,HuH}d"tHuEL2$Ht01!H}!1 HE1H8[A^A_]HQHUHAWAVSH8HuHk)HED~D}HG]̉]Ѕy R!HHtqLw(HEMtEA)Au@HuH}!t+HuH}!tHuHULx1EHt01!H} 1 HE1H8[A^A_]HPH@UHHHHGzu H= c]-H5)^ 1]@UHHHHGzu H=jc]-H5, 1]@UHAWAVSH8HuH?.HED~D}HG]̉]ЅyHHLw(HEMtbA)Au]HuH}% tHHuH}2 t7HuHUL0HuUH};Ht01!H}D1 HE1H8[A^A_]HcDUHAVSH HuHHEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HHuHcHHH [A^]@UHAWAVSH(HuH-HED~D}HG]ԉ]؅yBHHLw(MtwA)Au[HuH}t]uL-HLHuEHtMHlQIHHHu'HL H}1H([A^A_]HMHfUHAWAVSH(HuH-HED~D}HG]ԉ]؅yRHHLw(MtwA)Au[HuH}t]uL-H\ HuEHtMH|PIHH Hu', HL H}1H([A^A_]HLHfUHAWAVSH(HuH HED~D}HG]ԉ]؅y bHHtbLw(HEMt6A)Au1HuH}t}Hut9L+d Ht=1CH}1,HE1 IL' HuHKHH([A^A_]f.UHAVSH HuH,HEDvDuHG]]y tHHt"H(HtD9uEt$+ Ht(1.H}111Hs HuHKHHH [A^]UHAVSH HuHhHEDvDuHG]]y HHt H(HtD9u_+H Ht1H}111q HoHHH [A^]f.fUHAWAVSH(HuHa,HED~D}HG]ԉ]؅y "HHt`Lw(MtWA)Au;H5 H}HU}t4LH** HuHIHH}1H([A^A_]fUHAVSH HuHSeHEDvDuHG]]y dHHt%H(HtD9uEt')H Ht+12H}111 !HH] HuHHHH [A^]ÐUHAVSH HuH+HEDvDuHG]]y HHtH(HtD9u)Ht1H}111b HcHHH [A^]f.UHAWAVSH(HuH+HED~D}HG]ԉ]؅y HHtXLw(MtOA)Au3HuH}ot5uL'H HuHH}1H([A^A_]ÐUHAWAVSH(HuH+HED~D}HG]ԉ]؅y bHHt`Lw(MtWA)Au;H5 H}HU.}t4LH'jHuHFHH}1H([A^A_]fUHAWAVSH(HuH+HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5- H}HUn}t0}t7LH&Hu9H}&1H([A^A_]ILHiHuHEHUHAVSH HuHT+HEDvDuHG]]y HHt"H(HtD9uEt$&Ht(1.H}111oHHuHWEHHH [A^]UHAWAVSH(HuH +HED~D}HG]ԉ]؅y HHt_Lw(HEMt3A)Au.HuH}ItHuL$HHt'1+H}1HE1HH([A^A_]UHAWAVSH(HuHq+HED~D}HG]ԉ]؅y BHHt_Lw(HEMt3A)Au.HuH}ytHuL$HGHt'1+H}1HE1HH([A^A_]UHAWAVSH8HuH+HED~D}HG]̉]ЅyrHHLw(HEHEMtaA)H}AuEHutGH}Hut6HuHUL#HVHuH1H8[A^A_]E1HEHEMvf.UHAWAVSH8HuHL,HED~D}HG]ĉ]ȅyrHHLw(HEHEHEMt]A)H}AuTHutCH}Hut2H}Hust!HuHUHML"H9Ht(11H8[A^A_]E1^HfUHAWAVSH(HuH,HED~D}HG]ԉ]؅y rHHt_Lw(HEMt3A)Au.HuH}tHuL!HwHt'1+H}1HE1HH([A^A_]UHAWAVSH(HuH-HED~D}HG]ԉ]؅y HHt_Lw(HEMt3A)Au.HuH}tHuL5 HHt'1+H}'1HE1HH([A^A_]UHAVSH HuH,HEDvDuHG]]y HHt!H(HtD9uEt#H_xHt+12H}111!HHHuHHHH [A^]DUHAWAVSH(HuH,HED~D}HG]ԉ]؅y "HHtbLw(MtYA)Au=HuH}t?}HutBI9vxtIvxILHu6H}1H([A^A_]ILHuHz>HDUHAWAVSH(HuH,HED~D}HG]ԉ]؅y BHHt^Lw(MtUA)Au9H5 H}HU}t2}t9LHBHu;H} 1H([A^A_]ILHHuHc fDUHAWAVSH(HuH;HED~D}HG]ԉ]؅y b HHt\Lw(MtSA)Au7H5 H}HU. }t0}t7LHdHu9H} 1H([A^A_]ILH)HuH<HUHAWAVSH(HuH-HED~D}HG]ԉ]؅y HHtyLw(MtpA)AuTHuH} tV}utZL1IA9tAILgHu6H} 1H([A^A_]IL/HuH;Hf.@UHAVSH HuH0.HEDvDuHG]]y HHtH(HtD9uEt!1Ht+12H}1112 !H HcHuHHHH [A^]UHAWAVSH(HuH?/HED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111| !H(LcHuLHHH([A^A_]f.DUHAVSH HuHB0HEDvDuHG]]y  HHt#H(HtD9uEt%:Ht*11H}111  H0HuHcHHH [A^]@UHAWAVSH(HuH91HED~D}HG]ԉ]؅y b HHt\Lw(HEMt0A)Au+HuH} tHuLjHt'1-H}1HE1 H8HH([A^A_]fUHAVSH HuH0HEDvDuHG]]y HHt H(HtD9uEt"_@Ht*11H}111A H8HuHcHHH [A^]UHAWAVSH(HuH1HED~D}HG]ԉ]؅y HHtaLw(MtXA)Au}utBA9v@tAv@ILHu6H}a1H([A^A_]IL@HuH;7HfDUHAWAVSH8HuH; HED~D}HG]̉]ЅyHHLw(HEMtbA)Au]HuH}5tHHuH}Bt7HuHULHuUH}KHt01!H}T1 HE1H8[A^A_]HcDUHAWAVSH8HuH;HED~D}HG]̉]ЅyHHLw(HEMtdA)Au_HuH}5tJHuH}0t9HuHULHuEH}CHt01!H}R1 HE1H8[A^A_]HcUHAWAVSH8HuH;HED~D}HG]̉]ЅyHHLw(HEMtcA)Au^HuH}5tIHuH}Nt8HuHULHuHUH}VHt01!H}S1 HE1H8[A^A_]Hc@UHAWAVSH8HuH;HED~D}HG]̉]ЅyHHLw(HEMtcA)Au^HuH}5tIHuH}`t8HuHULHuHUH}bHt01!H}S1 HE1H8[A^A_]Hc@UHAWAVAUATSHXHuHz HEFEHGMĉMȅyHHsL(HEH}nAC6HcH}Le1EIcM,LDME+EăH}HuH}HuH}LDDEArII9IDI91HHHHHtDA4AtHHuHLDA ALALALALALAL AL HH9uH}1H}HEH9t Ht4HHX[A\A]A^A_]E1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt+HHADA ADALH HuH9}HuUt LL LLAE~?1f.A A;Lu HH9uHuH}LDHIcHH}HEH9zHH}HEH9t Ht3HN UHAWAVAUATSHhHuH HEFEHGMĉMȅyHHL(HEH}AC6HcHppLp1EIcM,LDM2E+EăH}Hu H}HuH}LD2DEArII9IDI91)HHHHtf.@I4ItHHuH~DI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9uH}1HpHxH9t Ht1HHh[A\A]A^A_]E1K؃HpHHH‰уH s1sHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`ALpfAD`ALpHHuHt-HHfADA fADALH HuH9F}HuUt LL  LL AE~C1AfA.Du z HH9uHuH}LDCHyIcHHpHxH9lqHHpHxH9t Htb/H fDUHAWAVAUATSHhHuHjHEFEHGMĉMȅyHHL(HEH}^AC6HcHpLp1EIcM,LDM E+EăH}HuH}HuH}LDDEArII9IDI91HHHHHt f.DI4ItHHuHRDI ILILILILILILILHH9uH}t1HpHxH9t Ht-HHh[A\A]A^A_]E1s؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9r}HuUt LL  LL AE~91@I I;Lu HH9uHuH}LDhHIciHHpHxH9zHHpHxH9t Ht+H" f.fUHAWAVAUATSHhHuHHEFEHGMĉMȅypHHL(HEH}AC6HcHpdLp1EIcM,LDM E+EăH}Hu^H}HugH}LD,DEArII9IDI91HHHHHt f.DI4ItHHuHRDI ILILILILILILILHH9uH}1HpHxH9t Ht *HHh[A\A]A^A_]E1s؃HpHHH‰уH s1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt+HHADA ADALH HuH9r}HuUt LL' LLAE~91@I I;Lu HH9uHuH}LDmHIcHHpHxH9zHHpHxH9t Hth(H f.fUHAWAVSHXHuHHEFEHGM̉MЅyHHLw(HEH}bHcH}ME+ẼumL}H}HutkH}HutZH}LtHHu؋ULLHu,H=$HH}HEH9u$,H}1H}HEH9t Ht1'HHX[A^A_]E1HH}HEH9t Ht'H; DUHAWAVSHhHuHHEFEHGM̉MЅyHHLw(HEH}HcH}lME+ẼumL}H}HutkH}HutZH}LNtHHu؋ULLFIHu,H"HH}HEH9u$,H}1H}HEH9t Ht%HHh[A^A_]E1HH}HEH9t Ht%H DUHAWAVSHhHuH2HEFEHGM̉MЅy4HHLw(HEH}HcH}*ME+ẼumL}H}HuAtkH}HuNtZH}LtHHu؋ULLHu,H}!HH}HEH9u$,H}T1H}HEH9t Htq$HHh[A^A_]E1HH}HEH9t HtA$H{ DUHAWAVSHhHuHHEFEHGM̉MЅyHHLw(HEH}BHcH}ME+ẼumL}H}HutkH}HutZH}LtHHu؋ULLHu,H HH}HEH9u$,H}1H}HEH9t Ht#HHh[A^A_]E1HH}HEH9t Ht"H UHH=e3H54H61:3uH;4H=43H(3]fDUHSPHH=3H54HL613u1H3H=2H56H2HBt H 2tH[]H=2H[]6f.@UHAVSH0HuHHEЋFEHEHEH}ȃu\Hut^H]H=5H!AtH=KH!t H LcHuL1H0[A^]ÐUHAWAVSH(HuHlHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}t|}L}tYH=4L!AtOH=^L tHEEHGEĉEȅyHHLwMdH}sHu6GH}Hu!2H}Hu EMUL}HuHHEEHGEĉEȅyBHHLwMH}HuкEEEMULMUEf.EuzEf.EuzEf.Eu{HuH}HU1AHuHt HH5W1H H H;Mu9Hp[A^]þ3Ծ"E1MSUHAVSHpHN HHEFHuH?HEEHGEĉEȅyHHLwMdH}sHuGH}Hu2H}HuEMULGHuHHEEHGEĉEȅyHHLwMH}HuкEEMULMUEf.EuzEf.EuzEf.Eu{HuH}HU1HuHD HH5'1H x H H;Mu9Hp[A^]þԾE1MSUUHSHXH HHEFHuHBHEEHGEԉE؅yHHHGH@f.ri@ f.@r]@(1f.@HuHHEHEEH}HuRt4Ef.Er Ef.Es\1EHugH5o1H HH;Eu)HHX[]H}111H HH;Et E1f.EHuHHH HH;Etf.UHAVSHpH HHEFHuH HEEHGEĉEȅyHHmLwM`H}Huк>EEEEEEHuLEf.Eu"z Ef.EuzEf.EuHH}HU1HuH HEEHGEĉEȅyHHLwMtvH}Hu\t]H}HuKtLH}Hu:t;EMULHuHHH5P k1H H H;Mu9Hp[A^]þGԾ6E1MA DUHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLwHEMtDA)Au?H5oH}HUHtLHHtS1H}Hu$814H}b1H}HtHu HE1HH([A^A_]H0HH}HufUHAWAVSHXHuHHEЋFEHGM܉MyHHLwH}E11jHcH}MtwE+E܃uDL}H}LtSLLHu,L=rIH}HEH9u7?H}ȾIE1H}HEH9uE1H}HEH9t HtSLHX[A^A_]E1;HH}HEH9t Ht#H] UHAWAVSH(HuH0HED~D}HG]ԉ]؅yHHLwHEMtFA)AuAH5/H}HU~HtLHpHtS1H}Hu$814H} 1H}HtHuw HE1HH([A^A_]Hc_HH}Huf.DUHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLwHEMtFA)AuAH5H}HUnHtLHDHtS1H}Hu$814H}1H}HtHug HE1HH([A^A_]HcOHH}Huf.DUHAWAVSHHHHEH@H-HHD~DPHGTXyrHHqLwMDA)H@A!HumH@HuPHEHE(E)E(E)`HEHpHuHULEf.EuzEf.EuzEf.Eu{!HuH@HU17Ef.`u$z"Ef.huzEf.pu{$HuH@HUHuN1H HH H;MuHĨ[A^A_]E1MBf.@UHAWAVSH(HuHOHED~D}HG]ԉ]؅yHHLwHEMtFA)AuAH5H}HU^HtLHLHtS1H}Hu$814H}1H}HtHuW HE1HH([A^A_]Hc?HH}Huf.DUHAVSHHHHEF`HhHHpDžxHG|EySHHzLwMmHhHuSHme]UMEIH]I~H}IvHuIV HUINHMIF(HEfHnf.uCzAfHnf.u6z4fHnf.u)z'fHnf.uzfHnf.uz fHnf.u{!HuHhHU1蠾H~H0HqHuH;HEEHGEĉEȅyHHsLwM"H}8HhIH}Hu4H}HuH}Hu H}HuH}HuIHhIFHEIFHEIF HEIFHEIF(HE{HmH_HQHCH5HH5޴1H H H;MHĐ[A^]þ;sE1MhH}1 诼HBEH}莼H/EH}mHEH}LH EH}+H}EH}{eDUHAWAVSH8HuHP HEDvDuHG]̉]Ѕy rHHtnLMteA)AuIHuH}tKEHcILIHEElHuEiH}1H8[A^A_]f.UHAVSH@FLHuH HEEHGEEyHHLwM $跺HLHHuHo HEEHGEEyHHLwMH}ЅHu]t|H}HuLtkH}Hu;tZIHEIFHEIFHEHtwHݹHϹHuH5 M1HH@[A^]þ6H}111%E1M/EH}1dHyEH}оCHfEH}о"HbHHUf.UHAVSH@FQHuH HEEHGEEyaHHLwM)臸HILHHuH HEEHGEEyHHLwMH}ЅHu)t}H}HutlH}Hut[IFHEIF HEIF(HEHtw趷H訷H蚷HuH5G1HH@[A^]þH}111E1M.EH}1/HyEH}оHfEH}о^HbH}HUDUHAVSHPHHHEF HuHr HEEHGEĉEȅy"HHLwMH}Huк%MUEAf.w4fA.Nw,A^f.w fA.V wA^f.w fA.F(1f.z f.εH H}HU1 謵HHuHn HEEHGEĉEȅyHHLwMH}HubH}HuMH}Hu8EAf.w>fA.Fw6EANf.w%fA.F wEANf.w fA.F(1赴Hu+H躴H H H;Mt%H5g 1H lH H;MuHP[A^]þԾE1M뵻f.NSHubfUHAWAVSHhHHHEHuH@HED~D}HG]]ytHHLwMA)H}AHurHEHE(E)EfAfAFfXfY)f)EAN(AXNY Mf.Euzff.Eu z f.Mu{HuH}HU1ZHu.HHH H H;Mt&b1H H H;MuHh[A^A_]fUHAWAVSHhH|HHEHuHsHED~D}HG]]yHHLwMA)H}AHuHEHE(E)EfAfANf\f)MAF(A\FEf.Muzff.Mu z f.Eu{跱HuH}HU1虱Hu.H-HH sH H;Mt&1H MH H;MuHh[A^A_]fUHAWAVSH8HuHeHEDvDuHG]ĉ]ȅy HHtlLMtcA)AuGHuH}tIHcEAEADE賰Hu$E\E諰H}&1H8[A^A_]f.UHAVSH0HuH)HEDvDuHG]܉]y HHt"HHtD9uE Ht1H}111菿 EHHH0[A^]UHAVSH0HuHHEDvDuHG]܉]y DHHt"HHtD9u'EkHt1H}111 ESHHH0[A^]UHAVSH0FHuHHEEHGEEy葾HHLwMHuH}վELt蕮HutXHuHNHEEHGEEy HHt6HHt-xL ;HuHHH5貽1HH0[A^]H}о藽H}111膽UHAVSHpHHHEFHuHHEEHGEĉEȅy2HHmLwM`H}Huк5>EEEEEEHuLEf.Eu"z Ef.EuzEf.EuHH}HU1%HuHHEEHGEĉEȅyDHHLwMtvH}Hu茼t]H}Hu{tLH}Hujt;EMUL$HuHHH5k蛻1H H H;Mu9Hp[A^]þwԾfE1MADUHAWAVSHHHHEHHHYHPD~DXHG\`yHHLwMA)HHA}H@kxHHHu[HHHtԺ;(E(M(U)U)M)EHtHh|pH@HUHtL0HEf.EuHzFEf.Eu:z8Ef.Eu,z*Ef.EuzEf.EuzEf.Eu{$(HuHHHUet;hux;lu|;pt'کHuHHHt&賩HuH辩11H |H H;MuHĨ[A^A_]E1M4vfUHAVSH HuHRHEDvDuHG]]y ԸHHt8HGHt/D9u.(s(y@ (~@Ht1H}111i HdHHH [A^]DUHAVSH`HHHEHuHHEFEHEH}HuI0IH((@ (@EMU]emHH=[HmH H H;Mt&m1H H H;MuH`[A^]IHL跨 UHSH(HuHHE؋FEHEHEuqH5H}HUHtkHÿ0CH HHKHHHKHHHKHHHK HH HK(HH(H=pH肧HH}Hu (H}о腶1H}Ht HuܧHH([]ÐUHH=H5HH 0 u H=[ΦHO]f.Ht(UHSPHTH HSHHPH[]1UHSPHH=H5HrH 蔦u H=IH5HH٥t H tH[]H=H[]ͦDUHSPHHHtHH[]ѥf.UH]¥fDUHSPHHt,H^HtHH8H5QU1H[]1HH[]fDUHSH(HuHHE؋FEHEHEuQH5H}HU裴HtKHÿH HSHHPH=H2HH}Hu (H}о51H}Ht Hu茥HH([]f.UHAVSH HuH(HEDvDuHG]]y HHtHGHtD9uHXHt1H}111蕳 HHHH [A^]UHAVSH HuHHEDvDuHG]]y THHtHGHtD9uH肣Ht1H}111 HHHH [A^]ÐUHAVSH HuHmHEDvDuHG]]y IJHHtHHtD9uHt1H}111r ޢHHH [A^]f.UHAWAVSH(HuHEHED~D}HG]ԉ]؅y "HHtXLwMtOA)Au3HuH}藲t5uL2HuHHH}誱1H([A^A_]ÐUHAVSH`HHHEFHuH HEEHGEĉEȅySHHgLwMZH}lHuкV8EEEEEEHuL@Ef.EuzEf.EuzEf.Eu{ HuH}HU1NHH}HHHH;EHuHHEEHGEĉEȅy AHHtYHHtPx{fEMdHu3H=QHuHH5HH;Et"\H5d¯1HHH;EuHtHvH8H5151H[]1HH[]fDUHSH(HuH!HE؋FEHEHEuaH5H}HU胪Ht[Hÿ H HSHHPHKHHHKHHH=HHH}Hu (H}о1H}Ht Hu\HH([]f.UHAVSH HuHHEDvDuHG]]y 贩HHtHGHtD9uHXHt1H}111e HיHHH [A^]UHAVSH HuHWHEDvDuHG]]y $HHtHGHtD9uHRHt1H}111֨ HԩHHH [A^]ÐUHAVSH HuHsHEDvDuHG]]y 蔨HHt HHtD9uH轘Ht1H}111A H賘HHH [A^]f.fUHAVSH HuHPHEDvDuHG]]y HHt HHtD9u=HHt1H}111衧 HHHH [A^]f.fUHAVSH0HuH'HEDvDuHG]ԉ]؅y THHt%HHtD9uHEHUxHt1$H}111H=:HuHHH0[A^]f.DUHAVSH0HuH HEDvDuHG]ԉ]؅y 褦HHt%HHtD9u?HEHUȖHt1$H}111LH=HuHHH0[A^]f.DUHAVSH HuHy HEDvDuHG]]y HHtHHtD9uHt1H}111袥 HHH [A^]f.UHAVSH0HuH~HEDvDuHG]܉]y THHt"HHtD9uE{Ht1H}111 EcHHH0[A^]ÐUHH=%H5HH 0uuHH=BH]ÐUH]ffDUHSPHH=H5YHeH HuxHH=ݔH51HwHmt H dtH[]H=TH[]afUHSH(HuHIHE؋FEHEHEH}Ѓu1Hu*t3H}%HuHcH([]þu1H([]UHAWAVSH(HuHIHED~D}HG]ԉ]؅y BHHtdLw(HEMt8A)Au3HuH}yt}Hut;H%BHt<1@H}¢1)HE1ILPHuHc H([A^A_]f.@UHAVSH0HuHKIHEЋFEHEuGH5KMH}HUM}t@HHtCHH5*HPE1LEsHu+H}Ⱦ1H0[A^]E1FHuLݢUHAVSH HuHBIHEDvDuHG]]y褡HHH(HD9u3HPxHt9HHH5]HPE1LE覑HucH}111,RE1膑HuCLHt6HHɑt)HÑHH1Q@H߾謑1HH [A^]UHAVSH HuHˎHEDvDuHG]]y 褠HHt"H(HtD9uEt$讔ːHt(1.H}111OH裐HuH7HHH [A^]UHAWAVSH(HuHHED~D}HG]܉]y HHt#H(HtD9uA!EtHt+12H}111蜟!HLcHuLHHH([A^A_]f.DUHAVSHPDvHGD)؃zHuHSHEDu]ĉ]ȅyHHH(HD9HEE1HU1ݒHEHUHH=HuoHHuHHEDu]ĉ]ȅy臞HHH_(HXH}HuCH}Hu辞.H}Hu詞H}Hu蔞EMUZZZuEMUHUHHEHUHHuHHEDu]ĉ]ȅy裝HHH_(HEHtpH}Hut:H5H}HUgHt!uHHSHEHU茍Ht[1H}HtHuzH5D1HHP[A^]H}1111H~HEH=Hu莍HH}Huf.@UHAWAVSH8HuHpHED~D}HG]ԉ]؅y rHHtfLw(Mt]A)AuAHuH}tCHuL HEHUzHu%H=QHu׌H}1H8[A^A_]UHAVSH HuH=HEDvDuHG]]y 贛HHt H(HtD9uH݋Ht1H}111a HӋHHH [A^]f.fUHHHHGzu H=]H51]f.DUHAWAVSHHHuHlHED~D}HG]ԉ]؅y šHHtbLw(MtYA)Au=HuH}=t?HUH}L_ΊHu%H=Hu+H}@1HH[A^A_]UHAVSH HuH9HEDvDuHG]]y HHt H(HtD9ugH-Ht1H}111豙 H#HHH [A^]f.fUHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHtXLw(MtOA)Au3HuH}ݙt5HuLӍpHuuH}1H([A^A_]ÐUHAWAVSH8HuHHED~D}HG]̉]Ѕy 貘HHtmLw(MtdA)AuHHuH}-tJHuH}t9HuUL譈HuHAHH}%1H8[A^A_]f.fUHSHH^HG)ЃZHuHHEЉ]؉U܉UyҗHHGH_(HEH&H}HuFt6H5H}HU蒗HtHuHH过H1H}HH衈HuH0HEЉ]؉U܉Uy'HHH_(HH}Hu裗trH}HubtaH}HuQtPH}Hu@t?HuEMUH!HuHHH5m1HHH[]HE1H\HMHH}Hf.UHSHXHpHHE^HG)Ѓ|HuHHE]UUyHH]H_(HPHuH}`;HuH EMHH=HuAHuHHE]UUy]HHH_(HHuH}ٕH}HuYEEEEEEHuHUHME.EuzE.Euz E.Eu{!HuH}HUMHuHzHH5]1H H H;MuHX[]fUHAWAVSH8HuHbHED~D}HG]̉]Ѕy HHtmLw(MtdA)AuHHuH}荔tJHuH}vt9HuUL HuHHH}腓1H8[A^A_]f.fUHAWAVSH(HuH2HED~D}HG]ԉ]؅y BHHtXLw(MtOA)Au3HuH}轓t5HuLSPHuUH}ʒ1H([A^A_]ÐUHAWAVSH8HuHHED~D}HG]̉]Ѕy 蒒HHt]Lw(MtTA)Au8HuH} t:HuL识E蝂HuE蚂H}1H8[A^A_]f.fUHAVSH HuHHEDvDuHG]]y ԑHHt H(HtD9uHHt1H}111聑 HHHH [A^]f.fUHAVSH HuHHEDvDuHG]]y 4HHt H(HtD9uͅH]Ht1H}111 HߑHHH [A^]f.fUHAVSH HuHHEDvDuHG]]y 蔐HHt$H(HtD9uEt&H蹀Ht+12H}111=!HH莀HuH%HHH [A^]fUHAWAVSH(HuH HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5 H}HU讏}t0}t7LH3Hu9H}f1H([A^A_]ILHHuH=HUHAWAVSH(HuHaHED~D}HG]ԉ]؅y HHt^Lw(MtUA)Au9H5 H}HUΎ}t2}t9LHYHu;H}脎1H([A^A_]ILH~Hu~fDUHAWAVSH(HuHaHED~D}HG]ԉ]؅y "HHt^Lw(MtUA)Au9H5*~H}HU}t2}t9LH7"~Hu;H}褍1H([A^A_]ILH}Hu}fDUHAWAVSH(HuHHED~D}HG]ԉ]؅y BHHt\Lw(MtSA)Au7H5H}HU}t0}t7LH9D}Hu9H}ƌ1H([A^A_]ILH }HuHHUHAWAVSH(HuHHED~D}HG]ԉ]؅y bHHt\Lw(MtSA)Au7H5H}HU.}t0}t7LHd|Hu9H}1H([A^A_]ILH)|HuHHUHAWAVSH(HuH!HED~D}HG]ԉ]؅y 肋HHt\Lw(MtSA)Au7H5PH}HUN}t0}t7LH{Hu9H}1H([A^A_]ILH I{HuHݺHUHAWAVSH(HuHHED~D}HG]ԉ]؅y 袊HHt\Lw(MtSA)Au7H5pH}HUn}t0}t7LH~zHu9H}&1H([A^A_]ILH(izHuHHUHAWAVSH(HuHHED~D}HG]ԉ]؅y ‰HHt\Lw(MtSA)Au7H5H}HU莉}t0}t7LH=~yHu9H}F1H([A^A_]ILH0yHuHHUHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5H}HU讈}t0}t7LH?}xHu9H}f1H([A^A_]ILH8xHuH=HUHAWAVSHH~HuHVHEHEEHEHEH5^H}HUHtWHH5H}HUʇHt;IH5 H}HU袇}tHLH|wHA1H}Ht HuxH}H HuHHEHEEHEHEHEH5OH}HUHtrHH53H}HUHtVIH5-H}HUHt:IH5+ H}HU蹆}tHLLH,{vHtv1H}Ht HuwH}Ht HuwH}HtHuwH551HHH[A^A_]cvHH}HFvHH}Huf.fUHAVSH HuHHEDvDuHG]]y ąHHtH(HtD9uyuHt1H}111r uHHH [A^]f.UHAVSH HuHHEDvDuHG]]y $HHtH(HtD9uKyPuHt1H}111Ԅ HϴHHH [A^]UHAWAVSH8^HG)ЃwHuHHEȉ]ЉUԉU؅y~HHXH_(HKH5DH}HUK}-HHlxtHHHHuHHEȉ]ЉUԉU؅yHHH_(HEHEHEHtlH5 H}HUÃHtSIH5 H}HU觃Ht7IH5 H}HU苃HtHLLHwsHtb1H}Ht HutH}Ht HutH}HtHu~tH5!1HH8[A^A_]1HHH}Huf.UHAWAVAUATSH(DvHGD)؃t{CHuHHEDuȉ]̉]Ѕy胂HHH(HD9zvHrHH3HHuH}HEDuȉ]̉]ЅyHHdLw(MWH50 1H}1H<IH5 1H}1ҁHIH5 1H}1貁HIH5 1H}1蒁HLLLLIuHuHHEDuȉ]̉]ЅyHHHLw(MH5_ 1H}1!HtoIH5C 1H}1HtSIH5' 1H}1Ht7LLLHtqHuHHH5苀1HH([A\A]A^A_]H}111nUHAVSH@HuHHEDvDuHG]̉]Ѕy DHHt>Hw(Ht5D9u4Et@HHEHHHMHEOpHt,1;H}111*HH}@#pHuH= HupHHH@[A^]f.DUHAWAVSHHHuHHED~D}HG]]ybHHLw(HEMA)AH5d H}HU&Htz}fHAf.u,z*Af(ff.uzAf.u{fAAILnH1H}Hu$814H}e~1H}HtHuo HE1HHH[A^A_]HHHMHH@HEHMIHHMHUHuLQVRHH [nHeHHH}Huf.UHSPHH=HDtZH=:hH1tGH=mHt4H=H t!H=i(HtHH[]$|H[]f.@UHAWAVSHXHuHHED~D}HG]ԉ]؅y}HHLw(fEMA)AH}AusHu{}tuH}Huj}tdMf;M}H}HuG}tGEHUHMDH}LplHu!H=Hu/mH|1HX[A^A_]E1fEMNf.UHAWAVATSH`HuHHEDvDuHG]]y{HHLg(HEHEfEMA)AAH5H}HU{HtbIH5H}HU{HtFINjMf;M}H}Hu{t&EIVIODH}LKokHt`1H}Hu (H}z1H}Ht HuTlH}Ht HuAlHH`[A\A^A_]E1H=?HukHH}Hu뷐UHH=H5^Hg1:kRuHH=kH]fDUHSPHH=pH5 H1ju轶HFH=?jH5H,HBjt H tH[]H= H[]6kf.@UHAVSH0HuHHEЋFEHEHEH}ȃuoHuytqH]H=OHAt1H=HڬtH=8$HǬt HwLciHuLiy1H0[A^]f.@UHAWAVSH(HuHLHED~D}HG]ԉ]؅yxHHLw(HEMA)AuhHuH}x}L}tlH=>LAtbH=٧LɫtOH='#L趫tAuCHuH}ttEHuILHHdHu(H!u H}tH}s1H([A^A_]UHAVSH HuH'HEDvDuHGEEy sHHtDH(Ht;xEtH}111s#H}sHPHcHt1HH [A^]HRtHfUHAWAVSH(HuHlHEDvDuHG]܉]y sHHtDL(Mt;D9u:IL@HH?H4HHILHHcHt1H}111r HsHHH([A^A_]@UHAWAVSH(HuH0HEDvDuHG]܉]y RrHHtAL(Mt8D9u7IL@HH?H4HILHHZbHt1H}111q HrHHH([A^A_]UHAVSH HuHHEDvDuHG]]y qHHt$H(HtD9uH@HaHt1)H}111=qHH?HHHaHHH [A^]f.UHAVSH HuHHEDvDuHG]]y pHHt$H(HtD9uH@H aHt1&H}111pHH?HH`HHH [A^]f.@UHAWAVSH(HuHOHED~D}HG]ԉ]؅y 2pHHtsLw(MtjA)AuNHuH}ptPL}IL@H;`Hu3HH?HHH1L9@_H}o1H([A^A_]fDUHAWAVSH(HuH-HED~D}HG]ԉ]؅y boHHtpLw(MtgA)AuKHuH}otML}IL@Hk_Hu0HH?HH1L9@'_H}n1H([A^A_]fUHAWAVSH(HuHHED~D}HG]ԉ]؅y nHHt\Lw(MtSA)Au7H5H}HU^n}t0}t7LH^Hu9H}n1H([A^A_]ILHY^HuHHUHAVSH0HuHHEDvDuHG]܉]y mHHt'H(HtD9uEt)GPE]Ht-16H}111Zm%HXE]HuE]HHH0[A^]ÐUHAWAVATSIL%@HHt0Jc<#\]HtIJt#LH ]IuL-^[A\A^A_]ÐUH]ÐUH]ÐUH]ÐUHH=eH5HH 09]u]H6H=/\H#]ÐHt8UHSPH tH HSHHPHKHHHKHHH[]1UHH=H5NHH 0\=u]HH=R\Hs]ÐHt(UHSPHH HSHHPH[]1UHH=H5HgH 0)\u\HH=[H]ÐHt(UHSPHdH HSHHPH[]1UHH=uH5HH 0[u[HFH=?R[H3]ÐHt(UHSPHH HSHHPH[]1UHH=H5nH'H 0)[]uu[HH=ZH]ÐHt UHSPHdH HH[]1UHH=5H5HH 0Zu[HH=RZH]ÐHt UHSPHH HH[]1UHH=H5.HH 0)ZuiZHfH=_YHS]ÐHt0UHSPHdH HSHHPHKHHH[]1UHH=H5~H7H 0YmuYHH=BYH]ÐHt&UHSPH ԛH HKHH[]1fUHH=EH5HH 0YuYHH=XH]ÐHt&UHSPH TH HKHH[]1fUHSPH=H5XHH=H5FHH xX5uXH~H=w*XH5kHWXtH Xu H=OXH=#H5HuH XuoXHH=WH5HWtH u H=XXH=H52HH W!u#XHjH=cVWH5WHWtH Du H=;WH=H5HaH CWu}WHH=VH5HWtH u H=WH=H5HH V u%WHVH=OVH5CHVtH 0u H='WH=H5HMH oVuVHH=VH5HEVtH u H=VH=qH5 HH VuEVHBH=;UH5/HUtH u H=FVH=H5H9H 2UouUHH=DUH5HqUtH u H=UH=]H5HH H1UuUH.H='TH5HUtH u H=rUHH[]UHSPH=H5\HH ~TKuXHYH5HH HTuTH'H= 3THTH=M THAH[]f.Ht(UHSPH褖H HSHHPH[]1UHSPH=H5lH%H ~S[uXHiH5HH HSuTH7H=0cSHdH=]PSHQH[]f.Ht UHSPHԕH HH[]1UHSPH=H5|H5H ~SkuXHyH5HH tHRuTSHGH=@RHtH=mRHaH[]f.Ht UHSPHH HH[]1UHAVSH=H5E`RHH=<H5HH 0RuXL5H5kH$H LRWu=RHH=QL5H=QH5HQtH u H=1RH=rH5 HH QuXL5H5HZH cLYQuQHH=QL5H=PH5HQtH u H=QH=H5AHH CP0uXL5>H5HH 9LPuQH H=XPL59H=2EPH5&HrPtH u H= PH[A^]f.UHSPH=H5\HuH ~PKuXHYH5HH HOu*PH'H= OHTH=MOHAH[]f.Ht0UHSPHH HSHHPHKHHH[]1UHSPH=#H5HH ~7OuXHYH5HH H Ou\OH'H= NHH=NHH[]f.Ht&UHSPH $H HKHH[]1fUHSPH=H5,HEH ~gNuXHiH5HH TH:NuNH7H=0MH$H=MHH[]f.Ht&UHSPH TH HKHH[]1fUHAVSH=?H5MHH=,H5HH MuXL5H5[HH ]LSMGuMHH=LL5H=LH5HMtH u H=MH=H5[HtH LJuXL5H5HJH CLL}uLHH=RLL5SH=L?LH5@HlLtH -u H=$LH=XH5H H C,LuXL5.H5HH LKuoLHH=KL5H=KH5HKtH u H=-LH[A^]f.UHAVSH=H5kHH fKZHH5HVH H5KuXL5H50HH LKurKHeH=^JL5H=JHH=JH [A^]Ht UHSPHH HH[]1UHAVSH=bH5H4H VJHH5HfH H%JuXL5H5@HH LI,uDJHuH=nIL5H=IHH={IH[A^]Ht UHSPHH HH[]1UHAVSH=H5HH FIzH$H5HvH HIuXL5H5PH H rLH<u"IHH=~HL5H=~HH?H=8kHH,[A^]Ht(UHSPHH HSHHPH[]1UHAVSH=H5HtH 6H H4H5HH HHuXL5H5HYH LGuHHHH=GL5H=nGHH=[GH[A^]Ht&UHSPH H HKHH[]1fUHAVSH=2H5H$H &GHH5}HH ?HFiuXL5H5HiH bLFuGHH=qFL5rH=k^FHH=xKFHl[A^]Ht&UHSPH ԈH HKHH[]1fUHAVSH=H5{HH FjHH5-HFH OHEuXL5'H5HyH LEuEHH=aEL5"H=NEH/H=(;EH[A^]Ht0UHSPHćH HSHHPHKHHH[]1UHAWAVAUATSHH}FHH5HEH11DILpM~tE1L%f.@IM9tRIEJH{x#L9t LXDtHCH0Hu@HCH0HtH}HCIMuLDH5 H}H]HCt H uHDHH5HEH11CILpM~i1L% @HI9tRIEL?Ht1QH}111N@MYfWXUYXMYXEYX>HHH@[A^]UHAVSH@HuH HEDvDuHG]ĉ]ȅy DNHHt?HGHt6D9u5E@E@E@EN>Ht1XH}111MGMYfWXMYXEYXMYXWQ=HHH@[A^]ÐUHAVSH0HuHsHEDvDuHG]܉]yTMHHHGHD9ffHf(YfWXf(fYXf(YXf(fYXWQ8]^fYffYfH=Ht1H}111L E<HHH0[A^]@UHAVSH@HuHHEDvDuHG]ĉ]ȅyDLHHHGHD9HHPHUHMHHHMH@HEf(Ef(YfWXf(fYXf(Uf(YXf(fYXQ7^fYf)EfYf)U;Ht1$H}111bKH=Hu&<HHH@[A^]DUHAWAVSHhHuH\HED~D}HG]]yKHHLwHEMA)AH5H}HUJHt\AEAFEE@EAFE@EAFE@E:HtS1H}Hu$814H}3J1H}HtHu; HE1HHh[A^A_]MYMfWXUYUXMYMXEYEX3:HH}HufUHH0HuH5HEFEHEH}؃u?HuItA |HMHHHHHHHH=H!:H0]þ0I1H0]f.fUHHPHayHHEHuHHEFEHEH}uOHuк ItL $|(E(E@H=H9H xH H;Mt& |H1H xH H;MuHP]f.@UHSH(HuHHE؋FEHEHEuaH5_H}HU3HHt[Hÿ c{H HSHHPHKHHHKHHH=H8HH}Hu (H}оG1H}Ht Hu 9HH([]f.UHSPHHHtzHH[]8f.UH]7fDUHSPHHt%H7HtHvH8H597]{t2uEczHH@H=6HH[]7H= 1HH[]1H[]UHAWAVATSH HuHHEDvDuHG]ԉ]؅y @>HHt&HGHtD9uD`DxDp c.Ht14H}111=#EEEDDDH;.HHH [A\A^A_]fDUHAWAVATSH HuHFHEDvDuHG]ԉ]؅y =HHt&HGHtD9uD`DxDp -Ht1:H}111'=)EDEAEEA*Qo-HHH [A\A^A_]UHAVSH0HuHHEDvDuHG]܉]y<HHHGHD9u*P*ҋp*֋H **Q%e(m^Y,Y,Y,PpY,ˉH |,Ht1H}111< Ed,HHH0[A^]fUHAVSH0HuHOHEDvDuHG]ԉ]؅y;HHHGHD9H*H@H **HH *ډ*Q-F'^Y,Y,Y,Y,H H H H HEHuW+Ht1$H}111:H=)Hu+HHH0[A^]f.@UHAWAVAUATSH8HuHHED~D}HG]]y~:HHLwHEMt_A)AuZH5H}HUJ:Ht0AMANMȋDhANMD`E~ Dp `*HtW1H}Hu$814H}91H}HtHu*+ HE1HH8[A\A]A^A_]EDeDm]DDDHc)HH}HuUHH0HuHHEFEHEH}؃u:Hu9t<lfnEfpH=iH)H0]þ81H0]ÐUHH0HuHuHEFEHEH}u8Huк9t5l(EH=Hh)H0]þw81H0]UHSH(HuHHE؋FEHEHEuQH5H}HUC8HtKHÿskH HSHHPH=UH(HH}Hu (H}о71H}Ht Hu,)HH([]f.UHSPHHHtjHH[]!(f.UH](fDUHSPHHt%H'HtHfH8H5)']{t2uEjHH@H=tHH[]'H=1HH[]\DH5}61H[]UHAVSH0HuHHEDvDuHG]ԉ]؅y 6HHt+HGHt"D9u!E@E&Ht17H}111F6&EYfWXEYX&HHH0[A^]fDUHAVSH0HuHHEDvDuHG]ԉ]؅y 5HHt+HGHt"D9u!E@E&Ht1>H}1115-MYfWXMYXWQ%HHH0[A^]f.DUHAVSH0HuH3HEDvDuHG]܉]y 5HHt`HGHtWD9uVff(YfWXf(fYXWQ U^fYf$Ht1H}1114 E$HHH0[A^]f.UHAVSH0HuHϿHEDvDuHG]]y 44HHtYHGHtPD9uOff(YfWXf(fYXQ^fYf)M$$Ht1$H}1113H=Hul$HHH0[A^]f.UHAWAVSHHHuHHEDvDuHG]]yR3HHLHEMtaA)Au\H5tH}HU3Ht2AEAGEE@E2#HtS1H}Hu$814H}21H}HtHu# HE1HHH[A^A_]EYEfWXEYEX"HH}HuUHH0HuHŹHEFEHEH}؃u7Hu2t9WeHMHHHH=LH"H0]þ11H0]@UHH0HuHEHEFEHEH}u8Huк1t5d(EH=H8"H0]þG11H0]UHSH(HuHĸHE؋FEHEHEuQH5iH}HU1HtKHÿCdH HSHHPH=5H!HH}Hu (H}о01H}Ht Hu!HH([]f.UHSPHHHtcHH[] f.UH] fDUHSPHHt%H~ HtH_H8H5q"u U{t*u=ScHH=HH[] H=1HH[]4=H5U/1H[]f.DUHAVSH0HuHչHEDvDuHG]܉]y t/HHt+HGHt"D9u!E@EHt1=H}111/,MYWXMYXWZ[HHH0[A^]UHAVSH0HuHzHEDvDuHG]܉]y .HHt+HGHt"D9u!E@EHt1AH}111V.0MYWXMYXWZQHHH0[A^]f.fUHAVSH0HuHHEDvDuHG]܉]y -HHtwHGHtnD9umHZYWXWZYXZWQ ]^YZYWZ@Ht1H}111:- EHHH0[A^]UHAVSH0HuHHEDvDuHG]܉]y ,HHt^HGHtUD9uTZYWXYXWZQ ^fYfZfEHt1$H}111c,H=yHu'HHH0[A^]fDUHAWAVSH8HuH\HEDvDuHG]ĉ]ȅy,HHLHEMtaA)Au\H5H}HU+Ht2AEAGEE@EHtS1H}Hu$814H}e+1H}HtHu HE1HH8[A^A_]MYMWXMYMXWZ{HH}Hu빐UHH0HuHHEFEHEH}؃u4HuU+t6^MHH=H|H0]þ*1H0]UHH0HZHHEHuHHE؋FEHEH}ЃuKHu*tH]MMHH=1HH WZH H;Mt&m])1H 1ZH H;MuH0]fUHSH(HuHTHE؋FEHEHEuIH5H}HU)HtCHÿ\H HH=H:HH}Hu (H}о=)1H}Ht HuHH([]fUHSPHHHtA\HH[]f.UH]fDUHSPHHt%HHtHVXH8H5U{t*u=[HH=OHH[]SH=$1HH[]5H5N(1H[]f.DUHAVSH HuHuHEDvDuHG]]y (HHtHGHtD9uDp?Ht1&H}111'EDH%HHH [A^]@UHAVSH HuH:HEDvDuHG]]y t'HHtHGHtD9uDpHt1+H}111#'ED*QzHHH [A^]f.DUHAVSH0HuHHEDvDuHG]܉]y &HHt[HGHtRD9uQ*P**Q]^Y,ȉY,ʉHHt1H}1116& EHHH0[A^]f.DUHAVSH0HuHHEDvDuHG]܉]y %HHtaHGHtXD9uWHHH ***Q^Y,Y,H H HEHt1$H}111P%H=HuHHH0[A^]UHAWAVATSH0HuHJHEDvDuHG]̉]Ѕy%HHLHEMtFA)AuAH5H}HU$HtE7EgDxHtU1H}Hu$814H}n$1H}HtHu HE1HH0[A\A^A_]EADHcHH}HuUHH0HuHHEFEHEH}؃u4Hu$t67WMHH=HH0]þ#1H0]UHH0HSHHEHuHHE؋FEHEH}ЃuKHu#tHVMMHH=HH wSH H;Mt&V#1H QSH H;MuH0]fUHSH(HuHtHE؋FEHEHEuIH5|H}HU"HtCHÿUH HH=PHZHH}Hu (H}о]"1H}Ht HuHH([]fUHSPHHHtaUHH[]f.UH]fDUHSPHHt%H>HtHvQH8H515e{t:uMUHH@H@H=HH[]cH=1HH[].H5^!1H[]f.DUHAVSH@HuHHEDvDuHG]̉]Ѕy $!HHt5HGHt,D9u+E@E@E8Ht1DH}111 3MYfWXMYXEYXHHH@[A^]f.DUHAVSH@HuH HEDvDuHG]̉]Ѕy D HHt5HGHt,D9u+E@E@EXHt1HH}1117MYfWXMYXEYXQHHH@[A^]f.UHAVSH0HuHHEDvDuHG]܉]y dHHtwHGHtnD9umff(YfWXf(fYXPf(YXQ ]^fYfYH6Ht1H}111 EHHH0[A^]UHAVSH@HuHHEDvDuHG]ĉ]ȅytHHHGHD9HHPHUHMH@HEf(Ef(YfWXf(fYXUf(YXWQ ^fYf)MY]#Ht1$H}111H=HukHHH@[A^]f.UHAWAVSHXHuHHEDvDuHG]]yRHHLHEMtvA)AuqH5H}HUHtGAEAGEE@EAGE@E HtS1H}Hu$814H}1H}HtHu  HE1HHX[A^A_]MYMfWXMYMXEYEX HH}Hu@UHH0HuHHEFEHEH}؃u;Huot=7OHMHHHHHH=<H H0]þ1H0]UHH@HKHHEHuHHEȋFEHEH}uOHutLN(EHMHHH=H H sKH H;Mt&N1H MKH H;MuH@]f.@UHSH(HuHdHE؋FEHEHEuYH5H}HUHtSHÿMH HSHHPHKHHH=H: HH}Hu (H}о=1H}Ht Hu HH([]fUHSPHHHtAMHH[] f.UH] fDUHSPHHt%H HtHVIH8H5  \{t1uD LH@H=HH[]L H=݌1HH[]&H5G1H[]UHAVSH0HuHuHEDvDuHG]ԉ]؅y HHt5HGHt,D9u+E@E@E( Ht1GH}1116MYWXMYXEYXZHHH0[A^]f.fUHAVSH0HuHHEDvDuHG]ԉ]؅y 4HHt5HGHt,D9u+E@E@EHHt1KH}111:MYWXMYXEYXZQHHH0[A^]UHAVSH0HuHsHEDvDuHG]܉]yTHHHGHD9HZYWXWZYXXZYXWZWQ ]^YZYZ@YWZ@Ht1H}111} EHHH0[A^]fDUHAVSH0HuHϡHEDvDuHG]ԉ]؅y 4HHt|HGHtsD9urZYWX@YXWZYXZQ ^fYfZYZfEMHt1$H}111H=HuIHHH0[A^]UHAWAVSHHHuH|HEDvDuHG]]y2HHLHEMtvA)AuqH5 H}HUHtGAEAGEE@EAGE@EHtS1H}Hu$814H}p1H}HtHu HE1HHH[A^A_]MYMWXMYMXEYEXZ{HH}Hu뮐UHH0HuHHEFEHEH}؃u7HuUt9 GMHHH=عHyH0]þ1H0]@UHH@HCHHEHuHHEЋFEHEH}ȃuQHutN FMMHMHH=?HH QCH H;Mt&gF1H +CH H;MuH@]f.fUHSH(HuHDHE؋FEHEHEuOH5H}HUHtIHÿ EH HKHH=H$HH}Hu (H}о'1H}Ht Hu~HH([]f.fUHSPHHHt!EHH[]qf.UH]bfDUHSPHHt%HHtH6AH8H5\{t1uD DH@H=<HH[],H=1HH[]H5Θ'1H[]UHAWAVSH(HuHSHEDvDuHG]܉]y HHt"HGHtD9uDxDpHt1-H}111EEDDHHHH([A^A_]DUHAWAVSH(HuHHEDvDuHG]܉]y BHHt"HGHtD9uD0DxXiHt12H}111!EEED*Q=HHH([A^A_]UHAVSH0HuHHEDvDuHG]܉]y HHtrHGHtiD9uhP**ʋH**QIe^Y,Y,щPY,ʉHkHt1H}111 ESHHH0[A^]UHAVSH0HuH?HEDvDuHG]ԉ]؅y HHtxHGHtoD9unHHH @****Q%T^Y,Y,Y,H H HEUuHt1$H}111 H=ηHuHHH0[A^]f.fUHAWAVAUATSH8HuHHEDvDuHG]]y HHLHEMtQA)AuLH57H}HUj Ht"AMEoD`EwDxHtW1H}Hu$814H} 1H}HtHuX HE1HH8[A\A]A^A_]EE]DDHc*HH}Huf.UHH0HuH%HEFEHEH}؃u7Hu t9 ?MHHH=#HH0]þ( 1H0]@UHH@Ha<HHEHuHHEЋFEHEH}ȃuQHu2 tN $?MMHMHH=HH ;H H;Mt&? 1H ;H H;MuH@]f.fUHSH(HuHHE؋FEHEHEuOH5H}HU3 HtIHÿ c>H HKHH=δHHH}Hu (H}о 1H}Ht HuHH([]f.fUHSPHHHt=HH[]f.UH]fDUHAWAVATSHAHHEHEL%L9gtJH5xHU( IHtL9ct6H5ZHUH Hu"MH9HLL9cuHCEu,Af.wf.ufzd@1fA.GH}Hu H}HtHtt"uH9H8H51H[A\A^A_]1H}Huf.DUHSH8HHt(HkHtH8H8H5^b{tRt64<HH@H=HH8[]H=݁1HH8[] H]H4HEHEEH}HutLH}Hut;;HMHHMHHH=H H8[]H5ɏ1H8[]fUHAWAVSH8HuH4 HED~D}HG]̉]Ѕy HHtlLwMtcA)AuGHuH}-tIHuH}t8HEIHEIFHuHr7HH}V1H8[A^A_]f.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtSLMtJA)Au.HuH}]t0HEI'HuH6HH}1H([A^A_]fDUHAWAVSH(HuHHEDvDuHG]܉]y bHHtLMtD9uHt1H}111 A{HHH([A^A_]f.@UHAWAVSH(HuHvHEDvDuHG]ԉ]؅y HHtTLMtKA)Au/HuH} t1HEIGHuHj5HH}N1H([A^A_]DUHAWAVSH(HuH.HEDvDuHG]܉]y HHtLMtD9uCHt1H}111AG*HHH([A^A_]f.UHH0HuH/HEFEHEH}؃u7Hut97HMHHHH=HH0]þ(1H0]@UHH0HuHHEFEHEH}u8Huк.t527(EH=HH0]þ1H0]UHSH(HuH.HE؋FEHEHEuQH5H}HUsHtKHÿ6H HSHHPH=HHH}Hu (H}о1H}Ht Hu\HH([]f.UHSPHHHt6HH[]Qf.UH]BfDUHAWAVATSHAHHEHEL%$|L9gtJH5 HUhIHtL9ct6H5HUHGHu"H42HLL9cuHCEu)A.w.uezc@1A.GH}Hu H}HtHtt"!uHE1H8H51H[A\A^A_]1H}HufUHSH(HHt(HHtH0H8H5{tJt.4HH=HH([]H=}1HH([]eH]HHEHEEH}HuVtHH}HuEt74MMHH==HiH([]H5%t1H([]DUHAWAVSH(HuH HED~D}HG]ԉ]؅y BHHtjLwMtaA)AuEHuH}tGHuH}t6EAEAF@HuH/HH}1H([A^A_]f.DUHAWAVSH(HuHXHEDvDuHG]ԉ]؅y rHHtRLMtIA)Au-HuH}t/EAHuH/HH}1H([A^A_]UHAWAVSH(HuHHEDvDuHG]܉]y HHtLMtD9uHt1"H}111wAZHHH([A^A_]f.UHAWAVSH(HuH֭HEDvDuHG]ԉ]؅y "HHtSLMtJA)Au.HuH}st0EAG7HuH-HH}1H([A^A_]fDUHAWAVSH(HuHHEDvDuHG]܉]y rHHtLMtD9uHt1#H}111'AGZHHH([A^A_]fUHH0HuHHEFEHEH}؃u4HuUt60MHH=PH|H0]þ1H0]UHH0H,HHEHuHHE؋FEHEH}ЃuKHutH/MMHH=HH W,H H;Mt&m/1H 1,H H;MuH0]fUHSH(HuH^HE؋FEHEHEuIH5:H}HUHtCHÿ.H HH=H:HH}Hu (H}о=1H}Ht HuHH([]fUHSPHHHtA.HH[]f.UH]fDUHAWAVATSHAHHEHEL%DwL9gtSH5vHUIHt*L9ct?H5XHUHHt EuK)Hh*HLL9cuHCEu A9|19u AO1;HH}Hu H}HtHtt<"auH)H8H5(D1H[A\A^A_]f.DUHSH(HHt(HHtH3)H8H5{tJt.,HH=)HH([]$H=5x1HH([]H]H̀HEHEEH}HutHH}Hut7G,MMHH=HH([]H5e1H([]DUHAWAVSH(HuHԪ HED~D}HG]ԉ]؅y HHtjLwMtaA)AuEHuH}tGHuH}t6EAEAFHuH(HH}1H([A^A_]f.DUHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtRLMtIA)Au-HuH}t/EAHuH\'HH}@1H([A^A_]UHAWAVSH(HuHPHEDvDuHG]܉]y HHtLMtD9u3Ht1H}111 Ic?#HHH([A^A_]UHAWAVSH(HuH&HEDvDuHG]ԉ]؅y rHHtSLMtJA)Au.HuH}t0EAGHuH&HH}1H([A^A_]fDUHAWAVSH(HuHޥHEDvDuHG]܉]y HHtLMtD9uHt1H}111w IcHHH([A^A_]f.DUHH0HuH|HEFEHEH}؃u4Hut6g(MHH=˩HH0]þ1H0]UHH0H%HHEHuHQ|HE؋FEHEH}ЃuKHutH'MMHH=5H6H $H H;Mt&'61H $H H;MuH0]fUHSH(HuH{HE؋FEHEHEuIH5H}HUHtCHÿ#'H HH=HHH}Hu (H}о1H}Ht HuHH([]fUHSPHHHt&HH[]f.UH]fDUHAWAVATSHAHHEHEL%trL9gtJH5ҫHUIHtL9ct6H5HUHHu"H"HLL9cuHCEuNAf.w:f.u2z0AGHf.w!f.uz@1fA.G1H}Hu H}HtHttg"uH!H8H5So1H[A\A^A_]f.UHSH8HHt(H+HtHc!H8H5"{tZt>$HH@H@H=UHH8[]DH=s1HH8[]H]HxHEHEEH}Hut`H}HutOH}Hut>V$HMHHMHHHMHHH=HH5xx1H8[]f.UHAWAVSH8HuHԢ HED~D}HG]܉]yHHLwMtxA)H}Au\Hut^H}HutMH}HutP1HH8[]H]H HEHEEH}Hu迺tZH}Hu论tIH}Hu蝺t8 _MUuPpH=D H軪H53 ˹1H8[]f.fUHAVSH0HuH/EHEDvDuHG]ԉ]؅y 蔹HHt|HGHtsD9urZYWX@YXWZYXZQ 8^fYfZYZfEMaHt1$H}111H=9Hu詩HHH0[A^]UHAWAVSH8HuHrHED~D}HG]ĉ]ȅy蒸HHLwHEMtA)AuzH5H}HU^HtPAFHf:!YA&f:!Y\YY\]MTHtS1H}Hu$814H}Ƿ1H}HtHu HE1HH8[A^A_]H=Hu^HH}Huf.@UHH0HuHHEFEHEH}؃u7Huŷt9 MHHH=rHH0]þ1H0]@UHH@H1HHEHuH(HEЋFEHEH}ȃuQHutN MMHMHH=HPH H H;Mt&P1H H H;MuH@]f.fUHSH(HuHuHE؋FEHEHEuSH5[H}HUHtMHÿ 3 KHKHH=H萦HH}Hu (H}о蓵1H}Ht HuHH([]UHSH(HuHHE؋FEHEHEuSH5e[H}HUCHtMHÿ s KHKHH=YHХHH}Hu (H}оӴ1H}Ht Hu*HH([]UHSH(HuHHE؋FEHEHEuOH5H}HU胴HtIHÿ H HKHH=HHH}Hu (H}о1H}Ht HunHH([]f.fUHSPHHHtHH[]af.UH]RfDUHSH8HHt(HHtH#H8H5ޥ{tZt>HH@H@H=F HH8[]H=K1HH8[]H]HUF HEHEEH}Hupt`H}Hu_tOH}HuNt>HMHUHuHHPHpH=E HlH5E |1H8[]f.UHAVSH@HuH=HEDvDuHG]]y DHHtvHGHtmD9ulfHf(YfWXf(fYXf(YXWQ^fYYf)U]Ht1$H}111蛱H=D Hu_HHH@[A^]f.@UHAWAVSHHHuHkHED~D}HG]ԉ]؅yBHHLwHEMA)Au|H5HD H}HU HtRfAFfHf(ffYA&f(ffYf\YY\f)]MHtS1H}Hu$814H}q1H}HtHuȡ HE1HHH[A^A_]H=C HuHH}HuUHH0HuHXC HEFEHEH}؃u;Huot=7HMHHHHHH=C H蕠H0]þ褯1H0]UHH@HHHEHuHB HEȋFEHEH}uOHu蠯tL(EHMHHH=}B HH sH H;Mt&1H MH H;MuH@]f.@UHSH(HuHB HE؋FEHEHEuYH5~H}HU賮HtSHÿH HHKHHHKHHH=A H:HH}Hu (H}о=1H}Ht Hu蔟HH([]fUHSH(HuHWA HE؋FEHEHEuYH5]PH}HUHtSHÿ#H HHKHHHKHHH=@ HzHH}Hu (H}о}1H}Ht HuԞHH([]fUHSH(HuH@ HE؋FEHEHEuYH5q@ H}HU3HtSHÿcH HSHHPHKHHH=5@ H躝HH}Hu (H}о转1H}Ht HuHH([]ÐUH]ÐUHH=EH5nGHgHH 0I]Fu艝HFH=EHE]ÐHt0UHSPHH HSHHPHKHHH[]1UHH=eHH5IHJH 0蹜Hu H6IH=/HbH#H]ÐHt&UHSPH H HKHH[]1fUHH=KH5LHMH 09Ku藜HKH=JHJ]ÐHt&UHSPHt fKHH[]1fUHSPH=zH5ћHH=-DH5EHFH 衛DuHDH=CJH5CHwtH Cu H=CH=FH5|HHuIH 7kGu艛HGH=FH5FH tH Fu H=FxH=IH52KH+LH ͚!Ju+HjJH=cIvH5WIH裚tH DIu H=;IHH[]f.fUHH=5LH5MHOH 0ILu菚HMH=KHK]ÐHt8UHSPH H HSHHPHKHHHKHHH[]1UHH=OH5PHQH 0蹙OuHOH=NbHN]ÐHt(UHSPHH HSHHPH[]1UHH=QH5~SHTH 09mRu蝙HRH=QHQ]ÐHtUHSPHt H[]1f.UHSPH=xH5?јHH=JH5&LH_MH 衘KuH^KH=WJJH5KJHwtH 8Ju H=/JH=MH5OHUPH 7 Nu菘HTNH=MMH5AMH tH .Mu H=%MxH=yPH5RHKSH ͗Qu1HJQH=CPvH57PH裗tH $Pu H=PHH[]f.fUHSPH=SSH5HTH ~GSuXHEH5GH{HH HnFuxHFH=EÖHSH=R谖HRH[]f.Ht&UHSPH4 fKHH[]1fUHSPH=TH5H5VH ~w+UuXHAH5CHDH HJ~Bu蜖HBH=AH4UH=-TH!TH[]f.Ht&UHSPH dH HKHH[]1fUHSPH=UH5LHWH ~觕{VuXH >H5?H@H dHz>u躕H>H==#HVH=}UHqUH[]f.Ht0UHSPHH HSHHPHKHHH[]1UHSPH=3WH5HXH ~ǔWuXHIMH5NHPH H蚔MuHNH=MCHWH=V0HVH[]f.HtUHSPH H[]1f.UHSPH=XH5ܩH5ZH ~+YuXHIH5JHKH DHʓIu"HIH=HsH4YH=-X`H!XH[]f.Ht(UHSPHH HSHHPH[]1UHSPH=YH5,H[H ~'{ZuXHDH5FHGH HnEu@HEH=D裒HZH=}Y萒HqYH[]f.Ht8UHSPH H HSHHPHKHHHKHHH[]1UHAWAVAUATSHH}vHH5(HEH11ILpM~tE1L%f.@IM9tRIEJH{x#L9t L訑tHCH0Hu@HCH0HtH}H&IMuL0H5qH}H]Ht H uHHH5(HEH11 ILpM~i1L% @HI9tRIEL H*MH=#LH5oHLH}腏tH Ku H=K膐H=NH5`HOH ۏNuXH];H5<H=H (H讏;uH+<H=$;WHNH=MDH5nH~MH}ӎtH jMu H=aMԏH=uOH5ΤHQH )OuXH7H5$9H:H H8u<HY8H=R7襎HPH=N蒎H5UnHNH}!tH Nu H=N"H=PH5<HuRH .wkQuXHFH5HHIH DHJ~Gu讎HGH=FHtQH=mPH5mHZPH}otH FPu H==PpH=qRH5HTH LōRuXHBH5DHEH H蘍lCuHCH=BAHSH=Q.H5mHQH}轌tH Qu H=Q辍H=SH5HqUH jgTuXH>H5n@HAH HZ?u,H?H=>菌HpTH=iS|H5alHVSH} t H BStH[A\A]A^A_]H=*SH[A\A]A^A_]UHSPHHHtHH[]f.UH]fDUHSH8HHt(H{HtHH8H5nr{tZt>DHH@H@H=lHH8[]锋H=61HH8[]H]HjHEHEEH}Hut`H}HutOH}Huޚt>HMHHMHHHMHHH=lHH5bj 1H8[]f.UHAWAVSH8HuH$L HED~D}HG]܉]yҙHHLwMtxA)H}Au\Hut^H}HutMH}HuttHH([]f.fUHSPHHHtHH[]1sf.UH]"sfDUHSHHHHt(HrHtHH8H5tr{tbtF 脵HH@H@H@H=bHHH[]rH=}'1HHH[]MH]H#RHEHEEH}Hu8tyH}Hu'thH}HutWH}HutF ʹHMHHMHHHMHHHMHHH=$bHrH5Q+1HH[]f.fUHAVSH@F~HuH13 HEEHGEEyHHyLwM?H}Ѕ>Hu$"H}Hu H}HuHEIHEIFHEIFHuH2 HEEHGEEy0HHLwMH}ЅHuttvH}HucteH}HuRtTH}HuAtCHEIHEIFHEIFHEIFoHuHHH51 j1H@[A^]þVEE1ME1M*f.UHAWAVSH(HuHQHEDvDuHG]ԉ]؅y ~HHtSLMtJA)Au.HuH}=t0HEIoHuHHH}~1H([A^A_]fDUHAWAVSH(HuHSQHEDvDuHG]܉]y B~HHtLMtD9usnHt1H}111} A[nHHH([A^A_]f.@UHAWAVSH(HuH QHEDvDuHG]ԉ]؅y }HHtTLMtKA)Au/HuH}}t1HEIGmHuHJHH}.}1H([A^A_]DUHAWAVSH(HuHPHEDvDuHG]܉]y |HHtLMtD9u#mHt1H}111|AG mHHH([A^A_]f.UHAWAVSH(HuHPHEDvDuHG]ԉ]؅y R|HHtTLMtKA)Au/HuH}|t1HEIGflHuHHH}{1H([A^A_]DUHAWAVSH(HuHPHEDvDuHG]܉]y {HHtLMtD9ukHt1H}111W{AGkHHH([A^A_]f.UHAWAVSH(HuH$]HEDvDuHG]ԉ]؅y {HHtTLMtKA)Au/HuH}M{t1HEIGkHuHHH}z1H([A^A_]DUHAWAVSH(HuH\HEDvDuHG]܉]y RzHHtLMtD9ujHt1H}111zAGjjHHH([A^A_]f.UHH0HuHJHEFEHEH}؃u?Hu/ztA HMHHHHHHHH=ZZHQjH0]þ`y1H0]f.fUHHPHHHEHuHIHEFEHEH}uOHuкPytL T(E(E@H=YHiH #H H;Mt&9x1H H H;MuHP]f.@UHSH(HuHHHE؋FEHEHEuaH5/YH}HUcxHt[Hÿ 蓫H HSHHPHKHHHKHHH=XHhHH}Hu (H}оw1H}Ht HuݩMMHMHMH H=ZH3gH5FCv1H8[]@UHAVSH@FwHuHQ( HEEHGEԉE؅yvHHrLwM8H}7HuJvH}Hu5vH}Hu vEAEAFEAFHuH' HEEHGEԉE؅ySuHHLwMH}HuutrH}HuutaH}Hu{utPH}Hujut?EAEAFEAFEAF eHuHHH5& t1H@[A^]þ}tltE1ME1M.fUHAWAVSH(HuHFHEDvDuHG]ԉ]؅y "tHHtRLMtIA)Au-HuH}stt/EA8dHuḤHH}s1H([A^A_]UHAWAVSH(HuHFHEDvDuHG]܉]y rsHHtLMtD9ucHt1"H}111'sAZcHHH([A^A_]f.UHAWAVSH(HuHPFHEDvDuHG]ԉ]؅y rHHtSLMtJA)Au.HuH}#st0EAGbHuH{HH}_r1H([A^A_]fDUHAWAVSH(HuHFHEDvDuHG]܉]y "rHHtLMtD9uSbHt1#H}111qAGZ6bHHH([A^A_]fUHAWAVSH(HuHEHEDvDuHG]ԉ]؅y qHHtSLMtJA)Au.HuH}qt0EAGaHuH+HH}q1H([A^A_]fDUHAWAVSH(HuHEHEDvDuHG]܉]y pHHtLMtD9uaHt1#H}111pAGZ`HHH([A^A_]fUHAWAVSH(HuHTRHEDvDuHG]ԉ]؅y 2pHHtSLMtJA)Au.HuH}pt0EAG G`HuH۟HH}o1H([A^A_]fDUHAWAVSH(HuHRHEDvDuHG]܉]y oHHtLMtD9u_Ht1#H}1117oAG Z_HHH([A^A_]fUHH0HuHN?HEFEHEH}؃u:Hueot<'fnEfpH=SH_H0]þn1H0]ÐUHH0HuH>HEFEHEH}u8Huкnt5袡(EH=RH_H0]þn1H0]UHSH(HuHM>HE؋FEHEHEuQH51RH}HUmHtKHÿH HSHHPH=QHr^HH}Hu (H}оum1H}Ht Hu^HH([]f.UHSPHHHtqHH[]]f.UH]]fDUHSH(HHt(HK]HtHH8H5>_B]{tIt-H=THH([]u]H=1HH([]yH]H<HEHEEH}HultqH}Hult`H}HultOH}Hult>vMMHMHMHH=SH\H5<<k1H([]f.UHAVSH0FwHuH HEEHGE܉EykHHrLwM8H}ȅ7HukH}HukH}HukEAEAFEAFHuH4 HEEHGE܉EyjHHLwMH}ȅHu3ktrH}Hu"ktaH}HuktPH}Hukt?EAEAFEAFEAFZHuH>HH5n !j1H0[A^]þ jiE1ME1M.fUHAWAVSH(HuHR<HEDvDuHG]ԉ]؅y iHHtNLMtEA)H}Au)Hu jt+EAYHuH\HDi1H([A^A_]f.UHAWAVSH(HuH<HEDvDuHG]܉]y iHHtLMtD9u3YHt1H}111h A?"YHHH([A^A_]f.DUHAWAVSH(HuH;HEDvDuHG]ԉ]؅y bhHHtOLMtFA)H}Au*Huht,EAGwXHuH Hg1H([A^A_]f.UHAWAVSH(HuH;HEDvDuHG]܉]y gHHtLMtD9uWHt1H}111gg AWHHH([A^A_]f.@UHAWAVSH(HuH;HEDvDuHG]ԉ]؅y gHHtOLMtFA)H}Au*Huigt,EAG'WHuHHf1H([A^A_]f.UHAWAVSH(HuHF;HEDvDuHG]܉]y bfHHtLMtD9uVHt1H}111f AVHHH([A^A_]f.@UHAWAVSH(HuHGHEDvDuHG]ԉ]؅y eHHtOLMtFA)H}Au*Huft,EAGUHuHkHSe1H([A^A_]f.UHAWAVSH(HuHGHEDvDuHG]܉]y eHHtLMtD9uCUHt1H}111d A1UHHH([A^A_]f.@UHH0HuH4HEFEHEH}؃u8Hudt:跗MiH=HLHUH0]þ'd1H0]UHH0HuH^4HEFEHEH}؃uHHu:dtE2MMHMHMHH=KHTH0]þc1H0]UHSH(HuH3HE؋FEHEHEuGH5VKH}HUccHtAHÿ蓖 H=,KHSHH}Hu (H}оb1H}Ht HuVTHH([]@UHSPHHHtHH[]QSf.UH]BSfDUHSH(HHt(HRHtHH8H5TR{tLt0褕f@H=2HH([]SH=1HH([]oH]Hc2HEHEEH}HuzbtZH}HuibtIH}HuXbt8MU]PXH=1HpRH51a1H([]ÐUHH0HuH1HEFEHEH}؃uBHuat?蒔MMHMHH=y1HQH0]þ`1H0]fUHH0HuH81HEFEHEH}؃u>HuQat@MffPH=0HbQH0]þq`1H0]f.UHSH(HuH0HE؋FEHEHEuOH50H}HU3`HtIHÿc fKHH=O0HPHH}Hu (H}о_1H}Ht HuQHH([]f.fUHSPHHHtHH[]Pf.UH]PfDUHSH8HHt(HOHtHӎH8H5QO{tQt5 dH@H=Z/HH8[]OH=n1HH8[]>lH]H*/HEHEEH}Hu/_tZH}Hu_tIH}Hu _t8 ϑMUuPpH=.H+OH5.;^1H8[]f.fUHH0HuH.HEFEHEH}؃u7Hu^t9 GMHHH=@.HNH0]þ]1H0]@UHH@HHHEHuH-HEЋFEHEH}ȃuQHu]tN 贐MMHMHH=-HNH H H;Mt&藐]1H [H H;MuH@]f.fUHSH(HuHC-HE؋FEHEHEuOH5-H}HU\HtIHÿ H HKHH=,HTMHH}Hu (H}оW\1H}Ht HuMHH([]f.fUHSPHHHtQHH[]Lf.UH]LfDUHSH8HHt(H+LHtHcH8H5N"L{tZt>HH@H@H=+HH8[]DLH=1HH8[]hH]H+HEHEEH}Hu[t`H}Hu[tOH}Hu[t>VHMHUHuHHPHpH=N+HKH5=+Z1H8[]f.UHH0HuH+HEFEHEH}؃u;HuZt=ǍHMHHHHHH=*H%KH0]þ4Z1H0]UHH@HqHHEHuH*HEȋFEHEH}uOHu0ZtL4(EHMHHH=4*HJH H H;Mt&Y1H ݉H H;MuH@]f.@UHSH(HuH)HE؋FEHEHEuYH5)H}HUCYHtSHÿsH HSHHPHKHHH=l)HIHH}Hu (H}оX1H}Ht Hu$JHH([]fUHSPHHHtыHH[]!If.UH]IfDUHAVSH0HHt(HHHtHH8H5JH{Gr0tfu{sH=(HH0[A^]HH]H l(HMЉ}HEEH}ȃr;WH= 1HH0[A^]eH5(WHu!XtrH}HuXtaH}HuWtPEA;E}H}HuWt4Du蛊MU]PXDpH='HG1H0[A^]f.@UHH0HuHj'HEFEHEH}؃uHHuWtEMMHMHMHH='HhGH0]þwV1H0]UHH0HuH&HEFEHEH}؃u3HuVt5臉MɉH=&HFH0]þU1H0]UHSH(HuHY&HE؋FEHEHEuWH5&H}HUUHtQHÿ KHKH@H=%HLFHH}Hu (H}оOU1H}Ht HuFHH([]@UHSH(HuH%HE؋FEHEHEuGH5s%H}HUUHtAHÿ3 H=I%HEHH}Hu (H}оT1H}Ht HuEHH([]@UHSPHHHt衇HH[]Df.UH]DfDUHSH8HHt(H{DHtHH8H5nFrD({Gr;ttAHH@H=X$HH8[]DH]H ?$HMЉ}HEE?H}ȃr9SH= 1HH8[]`H5#VSHuStrH}HuStaH}HuStPE?;E}H}HuSt2]`MUuPpX H=r#HC1H8[]fDUHH0HuHF#HEFEHEH}؃u:Hu%St<fnEfpH="HFCH0]þUR1H0]ÐUHH0HuH"HEFEHEH}u8HuкdRt5b(EH="HBH0]þQ1H0]UHSH(HuHE"HE؋FEHEHEuQH5"H}HUQHtKHÿӄH HSHHPH=!H2BHH}Hu (H}о5Q1H}Ht HuBHH([]f.UHSPHHHt1HH[]Af.UH]rAfDUHSHHHHt(H AHtHCH8H5BAI{GrO ̓HH@H@H@H= HHH[]AH]H HM؉}HEH?H]H}Ѓr<OH=! 1HHH[]Q]H5n OHuMPtuH}HuHH}Hu (H}оEM1H}Ht Hu>HH([]ÐUHH=H5^H H 0=MumHH==H]ÐHt8UHSPH H HSHHPHKHHHKHHH[]1UHH= H5n HH 0I=] umH H= <H ]ÐHt(UHSPHH HSHHPH[]1UHH=H5H'H 0<}umHH=r<H]ÐHt(UHSPHH HSHHPH[]1UHSPH=N>H5ea<HH=H5HO H 1<uHH=;H5H<tH u H=r<H=S H5 H H ; uH$ H= p;H5 H;tH u H=<H= H5"HH ];uHZH=S ;H5G H3;tH 4 u H=+ ;HH[]f.fUHSPH=H5PH5H ~:+uXH H5rH H H:^ uNH H= S:H4H=-@:H!H[]f.Ht(UHSPH|H HSHHPH[]1UHSPH=H5LPHeH ~:[uXHiH5 H H H9uH7H=09HdH=]p9HQH[]f.Ht(UHSPH{H HSHHPH[]1UHSPH=H5OHH ~79uXHH5H+H dH 9~uHH=8HH=8HH[]f.Ht8UHSPH ${H HSHHPHKHHHKHHH[]1UHAWAVAUATSHH}HH5HEH117ILpM~tE1L%vf.@IM9tRIEJH{x#L9t L7tHCH0Hu@HCH0HtH}H67IMuL@8H59H}H]H7t H uH8H=9H5MHH m7uXHo H5 H H H@7 uH= H=6 6HH= 6H59H H}e6tH u H= f7H=H5MHH 26uXHH5HOH xH6uHH=76HH=$6H5r8HH}5tH u H=6H=H5nLHgH P 6]uXHH5dHH 6H5PupHH=5HfH=_r5H57HLH}5t H 8tH[A\A]A^A_]H= H[A\A]A^A_]5f.UHSPHHHtwHH[]4f.UH]4fDUHSHHHHt(Hk4HtHsH8H5^6b4{tbtF 4wHH@H@H@H=8HHH[]|4H=1HHH[]PH]Hn6HEHEEH}HuCtyH}HuCthH}HuCtWH}HuCtF }vHMHHMHHHMHHHMHHH==8H3H55B1HH[]f.fUHAWAVSHHHuHHED~D}HG]܉]yBHHLwMA)H}AuuHuBtwH}HuBtfH}HuBtUH}HuBtDHEIHEIFHEIFHEIFd2HuHqHA1HH[A^A_]E1MVfUHAWAVSH(HuHxHEDvDuHG]ԉ]؅y AHHtSLMtJA)Au.HuH}At0HEI1HuH;qHH}A1H([A^A_]fDUHAWAVSH(HuH0HEDvDuHG]܉]y @HHtLMtD9u1Ht1H}111@ A0HHH([A^A_]f.@UHAWAVSH(HuHHEDvDuHG]ԉ]؅y B@HHtTLMtKA)Au/HuH}@t1HEIGV0HuHoHH}?1H([A^A_]DUHAWAVSH(HuHHEDvDuHG]܉]y ?HHtLMtD9u/Ht1H}111G?AG/HHH([A^A_]f.UHAWAVSH(HuH6HEDvDuHG]ԉ]؅y >HHtTLMtKA)Au/HuH}=?t1HEIG/HuHnHH}~>1H([A^A_]DUHAWAVSH(HuH6HEDvDuHG]܉]y B>HHtLMtD9us.Ht1H}111=AGZ.HHH([A^A_]f.UHAWAVSH(HuHx6HEDvDuHG]ԉ]؅y =HHtTLMtKA)Au/HuH}=t1HEIG-HuHJmHH}.=1H([A^A_]DUHAWAVSH(HuHB6HEDvDuHG]܉]y <HHtLMtD9u#-Ht1H}111<AG -HHH([A^A_]f.UHAWAVSH(HuHG/ HEDvDuHG]܉]y R<HHtLMtD9u,Ht1H}111< Ak,HHH([A^A_]f.@UHAVSH0HuH/ HEDvDuHG]ԉ]؅y ;HHt+HGHt"D9u!E@E+Ht1#H}111V;EXE+HHH0[A^]f.UHAVSH0HuH5HEDvDuHG]ԉ]؅y ;HHt,HGHt#D9u"@E@E!+Ht1#H}111:EXE+HHH0[A^]fUHAWAVSH(HuHd5HEDvDuHG]܉]y R:HHtLMtD9u*Ht1H}111:AGj*HHH([A^A_]f.UHAVSH0HuHH5HEDvDuHG]]y 9HHtHGHtD9u)E)Ht1$H}111b9H=Hu&*HHH0[A^]DUHAVSH0HuH;5HEDvDuHG]ԉ]؅y 9HHt.HGHt%D9u$@X@HHEE/)Ht1$H}1118H=Huw)HHH0[A^]fDUHAVSH0HuH5HEDvDuHG]ԉ]؅y d8HHt.HGHt%D9u$X@H@EHE(Ht1$H}1118H=aHu(HHH0[A^]fDUHAVSH0HuH5HEDvDuHG]]y 7HHt*HGHt!D9u ffHfXf)M'Ht1$H}111W7H=Hu(HHH0[A^]f.UHAVSHPHngHHEF<HuH HEEHGEĉEȅy6HH LwMHuH}6EAf.\AAXNAN HuH. HEEHGEĉEȅy E6HHtqLwMthHuH}6tOHuH}6t>MEAf.\AAXVAVrH5 51H eH H;MHP[A^]H}5H}m5f.v\A_FAFEANf.v\AFAXNANf.v\A_FAFu%HTHeHH KeH H;ML]hf.v\A_NANzf.@UHAWAVSH(HuH+3HED~D}HG]ԉ]؅y4HHLwHEMtKA)AuIH5)H}HU^4HAf.vS\AAXF_@c1H}31H}HHE1f.v\XHA_Nf( @A_FAFHAFf.v5\ANAXFI_@A#HtY1H}Huaif.v(\XHA_NIf(A#Hu@A_FIA#HuHcHH}Ht Huf$HH([A^A_]UHAWAVSH(HuH1HEDvDuHG]ԉ]؅y 2HHt}LHEMt>A)AuaMMHMHMH H=!1HSH5^!c.1H8[]@UHAWAVSH8HuHHED~D}HG]̉]Ѕy2.HHLwMA)H}AuqHu{.tsH}Huj.tbH}HuY.tQH}HuH.t@EAEAFEAFEAF HuH]Ht-1H8[A^A_]E1MZf.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y "-HHtRLMtIA)Au-HuH}s-t/EA8HuH\HH},1H([A^A_]UHAWAVSH(HuHHEDvDuHG]܉]y r,HHtLMtD9uHt1"H}111',AZHHH([A^A_]f.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y +HHtSLMtJA)Au.HuH}#,t0EAGHuH{[HH}_+1H([A^A_]fDUHAWAVSH(HuH>HEDvDuHG]܉]y "+HHtLMtD9uSHt1#H}111*AGZ6HHH([A^A_]fUHAWAVSH(HuHu"HEDvDuHG]ԉ]؅y *HHtSLMtJA)Au.HuH}*t0EAGHuH+ZHH}*1H([A^A_]fDUHAWAVSH(HuH9"HEDvDuHG]܉]y )HHtLMtD9uHt1#H}111)AGZHHH([A^A_]fUHAWAVSH(HuH"HEDvDuHG]ԉ]؅y 2)HHtSLMtJA)Au.HuH})t0EAG GHuHXHH}(1H([A^A_]fDUHAWAVSH(HuH!HEDvDuHG]܉]y (HHtLMtD9uHt1#H}1117(AG ZHHH([A^A_]fUHAWAVSH(HuH HEDvDuHG]܉]y 'HHtLMtD9uHt1"H}111'AZHHH([A^A_]f.UHAVSH0HuH$ HEDvDuHG]܉]y D'HHt+HGHt"D9u!E@EbHt1'H}111&EXEZAHHH0[A^]fDUHAVSH0HuH7!HEDvDuHG]܉]y &HHt,HGHt#D9u"@E@ EHt1'H}1115&EXEZHHH0[A^]DUHAWAVSH(HuH HEDvDuHG]܉]y %HHtLMtD9uHt1#H}111%AGZHHH([A^A_]fUHAVSH0HuH HEDvDuHG]܉]y D%HHtHGHtD9uHHEnHt1$H}111$H=HuHHH0[A^]DUHAVSH0HuH HEDvDuHG]܉]y $HHt0HGHt'D9u&@X@ f:!MHt1$H}111A$H=WHuHHH0[A^]@UHAVSH0HuH HEDvDuHG]܉]y #HHt,HGHt#D9u"X@f:!@EHt1$H}111#H=HuYHHH0[A^]UHAVSH0HuH HEDvDuHG]܉]y D#HHt(HGHtD9uHXMeHt1$H}111"H=HuHHH0[A^]f.fUHAVSH@HRHHEF:HuH[ HEEHGẺEЅyr"HHLwMHuH}{"EA.\AAXNAN HuH HEEHGẺEЅy !HHtpLwMtgHuH}("tNHuH}"t=MEA.\AAXVAVqH5% @!1H QH H;MH@[A^]H}!H} .v\A_FAFEAN.v\AFAXN AN .v\A_F AF HWHPHH PH H;MOS.v\A_NANUHAWAVSH(HuHHED~D}HG]ԉ]؅y2 HHLwHEMtJA)AuHH5"H}HUHA.vS\AAXF_@a1 H}1H}HHE1.v\XHA_N( @A_FAFHAF.v5\ANAXF I _@ A}HtW1H}Hu_g.v'\XH A_N I (AFHu@ A_F I A&HuHNHH}Ht Hu HH([A^A_]fDUHAWAVSH(HuH{HEDvDuHG]ԉ]؅y bHHt|LHEMt=A)Au;H5 H}HU2HA.vF\HO1H}1H}HHE1A.v\L(I.AHAG.v\.v\L(H .A Ht 1H}HuA HH}Ht HuHH([A^A_]fDUHH0HuHHEFEHEH}u8Huк4t52P(EH=fH H0]þ1H0]UHSH(HuHxHE؋FEHEHEuQH5H}HUsHtKHÿOH HSHHPH=H HH}Hu (H}о1H}Ht Hu\ HH([]f.UHSPHHHtOHH[]Q f.UH]B fDUHSH8HHt(H HtHKH8H5  {tRt6NHH@H=*HH8[] H=M1HH8[]}(H]H HEHEEH}HuztqH}Huit`H}HuXtOH}HuGt>MMMHMHMH H=)HS H5^ c1H8[]@UHAWAVSH8HuHHED~D}HG]̉]Ѕy2HHLwMA)H}AuqHutsH}HuvtbH}HuetQH}HuTt@EAEAFEAFEAF HuHIHt1H8[A^A_]E1MZf.UHAWAVSH(HuHHEDvDuHG]ԉ]؅y "HHtRLMtIA)Au-HuH}t/EA8 HuHHHH}1H([A^A_]UHAWAVSH(HuHHEDvDuHG]܉]y rHHtLMtD9uHt1H}111' Ic?HHH([A^A_]UHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtSLMtJA)Au.HuH}?t0EAGHuHGHH}o1H([A^A_]fDUHAWAVSH(HuHNHEDvDuHG]܉]y 2HHtLMtD9ucHt1H}111 IcRHHH([A^A_]f.DUHAWAVSH(HuHHEDvDuHG]ԉ]؅y HHtSLMtJA)Au.HuH}t0EAGHuH;FHH}1H([A^A_]fDUHAWAVSH(HuHIHEDvDuHG]܉]y HHtLMtD9uHt1H}111 IcHHH([A^A_]f.DUHAWAVSH(HuHHEDvDuHG]ԉ]؅y BHHtSLMtJA)Au.HuH}t0EAG WHuHDHH}1H([A^A_]fDUHAWAVSH(HuH HEDvDuHG]܉]y HHtLMtD9uHt1H}111G Ic HHH([A^A_]f.DUHAWAVSH(HuH HEDvDuHG]܉]y HHtLMtD9u#Ht1H}111 Ic?HHH([A^A_]UHAVSH HuHD HEDvDuHG]]y dHHtHGHtD9uLc0HcXHt1H}111LH{HHH [A^]f.UHAVSH HuHg HEDvDuHG]]y HHt HGHtD9uLcpHcX Ht1H}111qLHHHH [A^]fUHAWAVSH(HuH4 HEDvDuHG]܉]y "HHtLMtD9uSHt1H}111 IcBHHH([A^A_]f.DUHAVSH0HuH HEDvDuHG]܉]y HHtHGHtD9uHHEHt1$H}1112H=HuHHH0[A^]DUHAVSH0HuH HEDvDuHG]܉]y HHt+HGHt"D9u!H HH H HMHt1$H}111H=GHuJHHH0[A^]fUHAVSH0HuH HEDvDuHG]܉]y 4HHt+HGHt"D9u!H@H H HMRHt1$H}111H=HuHHH0[A^]fUHAVSH0HuH HEDvDuHG]܉]y HHt.HGHt%D9u$HP PH H HMHt1$H}111#H=HuHHH0[A^]fDUHAVSH@H>?HHEFHuH HEEHGẺEЅyHHLwMHuH}MA))AAVHuH HEEHGẺEЅy %HHtbLwMtYHuH}t@HuH}rt/UEA6))AAvH5 1H =H H;MH@[A^]H}q H}\ ~ AN9MANMAV)} )ANAV E~CAN 9MAN 4~ AV9MAVAV)} )AFAV ~ AF 9MAF LH:MUu}Ppx H='HH51H8[]@UHH0HuHHEFEHEH}u8Huк0t5":(EH=HH0]þ1H0]UHSH(HuHpHE؋FEHEHEuQH5JH}HUcHtKHÿ9H HSHHPH=HHH}Hu (H}о1H}Ht HuLHH([]f.UHSPHHHt8HH[]Af.UH]2fDUHSH8HHt(HHtH5H8H5{tRt68HH@H=HH8[]H==1HH8[]mH]HHEHEEH}Hu^tqH}HuMt`H}Hu<tOH}Hu+t>7MUu}Ppx H=pHCH5_S1H8[]@UHH0HuH:HEFEHEH}u8Huкdt5b7(EH=HH0]þ1H0]UHSH(HuHHE؋FEHEHEuQH5H}HUHtKHÿ6H HSHHPH=_H2HH}Hu (H}о51H}Ht HuHH([]f.UHSPHHHt16HH[]f.UH]rfDUHSHHHHt(H HtHC2H8H5{tbtF 5HH@H@H@H=XHHH[]H=m1HHH[]H]H(HEHEEH}HutyH}HuwthH}HuftWH}HuUtF 5HMHUHuH}HHPHpHxH=HkH5{1HH[]f.fUHHPH1HHEHuHUHEFEHEH}uOHuкptL t4(E(E@H=HH C1H H;Mt&Y41H 1H H;MuHP]f.@UHSH(HuHHE؋FEHEHEuaH5|H}HUHt[Hÿ 3H HSHHPHKHHHKHHH=8HHH}Hu (H}о1H}Ht Hu\HH([]ÐUHH=eH5HH 0uu]]H6H=/BH#]ÐUH]fDUHSPHH=H5HH u\HH=H5gHHmt H tH[]H=H[]afUHSH(HuHפHE؋FEHEHEH}Ѓu1Hu*t3H}HuHcH([]þu1H([]UHAWAVSH(HuH̤HED~D}HG]ԉ]؅y BHHtdLw(HEMt8A)Au3HuH}yt}Hut;HBHt<1@H}1)HE1ILPHuHc H([A^A_]f.@UHAVSH0HuHKHEЋFEHEuGH5KH}HUM}t@HHtCHH5`HPE1LEsHu+H}Ⱦ1H0[A^]E1FHuLUHAVSH HuHBHEDvDuHG]]yHHH(HD9u3HPxHt9HHH5HPE1LEHucH}111,RE1HuCLHt6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuH=HED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111L!HLcHuLHHH([A^A_]f.DUHHHztuHH]H=]PH5"1]UHSPHH=HD.tZH=H1.tGH=zH.t4H=*H .t!H=iH-tHH[]$H[]f.@UHAVSH0HuH"HEЋFEHEEȃrH}Ⱦ1H5)H}HUH1}tlM;M}H}HuTtEH߉m Ht(HHH5HPE1LEHuE1HvLiH0[A^]f.fUHAVSH0HuH!!HEЋFEHEuOH5(H}HU}tHHHtFHHH5(HPE1LE;Hu+H}Ⱦ1H0[A^]E1HuLUHH=H5HN H 0%}u VHH=H]ÐUH]pfDUHSPHH=H5)H H uUHaH=ZH5 HGHt H 4tH[]H=$H[]fUHAWAVSH(HuH9HED~D}HG]܉]y rHHt#H(HtD9uAEtHt+12H}111!HLcmHuLrHHH([A^A_]f.DUHSH(HuHǜHE؋FEHEHEH}Ѓu1Hut3H}3-HuHcH([]þe1H([]UHAWAVSH(HuHHED~D}HG]ԉ]؅y 2HHtdLw(HEMt8A)Au3HuH}it}Hut;Hy,2Ht<1@H}1)HE1ILPHuHcH([A^A_]f.@UHAVSH0HuH;HEЋFEHEuGH5;H}HU=}t@HHtCHH5HPE1LEcHu+H}Ⱦ1H0[A^]E16HuLUHAVSH HuH2HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5!HPE1LEHucH}111RE1vHuCL Ht6HHt)HHH1Q@H߾1HH [A^]UHAVSH HuHӋHEDvDuHG]]yHHH(HD9uEt%VHHul'H}1116[H8HHuCHHt6HHt)HHH1Q@H߾1HH [A^]ÐUHAWAVSHXHuHHEЋFEHGM܉MyHHLw(H}E11HcH}MtwE+E܃uDL}H}LtSLLHu,L=""IH}HEH9u7?H}ȾE1H}HEH9uE1H}HEH9t Ht%LHX[A^A_]E1;HH}HEH9t Ht$H  UHAVSH`H!HHEDvHGD)؃HuH/HEDu]]y@HHH(HD9cH]HjH7H5zHHHH!HH;EEkHuH~HEDu]]yHHBH_(HH}HuH}HuH}HuкEEEEEEuȋUHMHaEf.EuzEf.EuzEf.Eu{!:HuH}HUоzHu*HHHHH;Et"KH5}}1HHH;Eu+HH`[A^]H}111YHHH;Et"1Hf.UHAWAVSHXHlHHEHuHHED~D}HG]]yHHLw(Mt{A)Au_HuH}StaHuH}tKHUuL~Hu2H{HH H H;Mt*!H}L1H H H;MuHX[A^A_]UHAWAVSHxHlHHEHxHHED~D}HG]]yHHLw(MA)HxAHuEHxHuHEHE(E)EuHULOEf.EuzEf.EuzEf.Eu{$HuHxHUpHuHH1H 7H H;MuHx[A^A_]E1M4 UHAWAVSH8HuHHED~D}HG]̉]ЅyHHLw(HEMA)H}Au^Hut`H}HutOH5qH}HU8Ht6uULHlcHuHH1H}Ht"Hu6E1HEM[1HH8[A^A_]UHAWAVSH(HuH3HED~D}HG]ԉ]؅y rHHtsLw(MtjA)AuNHuH}tPHuH}t?uUL`HlHu$H=FHH}1H([A^A_]fDUHAWAVAUATSHHHHEЋ^HG)ЃHpHHx]UUysHHL(HpAC6HcH}KLe1EIcM,LDM\E+E5HpHh0HpHloHpLDDE ArII9&IDI91)HHHHtI4ItHHuHI ILILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u_HpHHx]UUyHHH_(HHpHu(E)0(E)@EXE`HuH*f(@fMf(0fEfkPu"Ef.XuzEf.`u{!nHuHpHU1MHuHHAH51/Hp1H}HEH9t HtHHH;EyHHĨ[A\A]A^A_]E1؃HpHHH‰уH s1uHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPfAD`fALpfAD`fALpHHuHt/HHfADfA fADfALH HuH9hlLLE~>1AfA.Du z HH9u!HuHpLDHzH'HH}HEH9ns}HH}HEH9t Ht!H[ DUHSH(HuH HEFEHEtH}111!HHt1 HHHH([]f.UHHHztuHH]] H=]H5 *1]UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHtkLw(MtbA)AuFHuH}etHHuH}Nt7uULHuHHH}w1H([A^A_]f.@UHHHHGzu H=J]H51]@UHAWAVSH8HuHHED~D}HG]̉]ЅyHHLw(MtrA)H}AuVHuQtXH}Hu@tGH}Hu)t6u܋UMLHuHkHS1H8[A^A_]E1Muf.fUHAWAVSH(HuH HED~D}HG]ԉ]؅y HHtkLw(MtbA)AuFHuH}etHHuH}Tt7uULHuHcH}w1H([A^A_]f.@UHAVSH HuHNHEDvDuHG]]y 4HHtH(HtD9u'^Ht1H}111 HHH [A^]f.UHAVSH HuHHHEDvDuHG]]y HHtH(HtD9uHt1H}111D H?HHH [A^]UHAWAVSH8HuHHED~D}HG]̉]ЅyHHLw(MA)H}AHuYH}HuDtxH}Hu3tgu܋UHMLeHHuUH}9Hu-HtCH5HAH&1H8[A^A_]E1MHEDvDuHG]]y $HHtH(HtD9uNHt1H}111ҵ HHH [A^]f.UHAWAVSH8HuHHED~D}HG]̉]Ѕy肵HHLw(MA)H}AHuٵH}HuĵtxH}Hu賵tgu܋UHMLQHWHuUH}蹴<Hu-HtCH5aHHi覴1H8[A^A_]E1M1]@UHAWAVSH(HuHHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5PH}HUޮ}t4LH}HuHHH}蒮1H([A^A_]fUHAWAVSHxHHHEHxHHED~D}HG]]yAHH5Lw(M A)HxAHu<HxHurHxHu`HEHE(E)EUHuHMLgEf.EuzEf.EuzEf.Eu{!ƝHuHxHU1襝HuUHx臝HuV1H PH H;MuHx[A^A_]E1MMfUHAWAVSHxH HHEHxHlHED~D}HG]]y葬HH$Lw(MA)HxAHu茬HxHuȬHxHu谬HEHE(E)EHuHUHML谶Ef.EuzEf.EuzEf.Eu{!HuHxHU1UHtPHtdHuvf1H H H;MumHx[A^A_]E1MՋUHx膛HuUHxhHu7H DH H;MtZUHH=H5~HH 0umuHH=BH]ÐUH]閽fDUHSPHH=H5HLH u\HQH=JݚH5H7Hmt H $tH[]H=H[]afUHAVSH0HuHOHEЋFEHEHEH}ȃu\Hu(t^H]H=H#AtH={TH t H<LcʙHuLϙH1H0[A^]ÐUHAWAVSH(HuHOHED~D}HG]ԉ]؅yHHLw(HEMA)AuQHuH}At|}L}tYH=L6AtOH=SLt+HE؉]UUy ?HHtVH_(HtMHuH}諏t}t0}t7LHt{Hu9H}1H([A^A_]ILH9{HuHͺHUHAWAVSH(HuH$HED~D}HG]ԉ]؅y 蒊HHt\Lw(MtSA)Au7H5=H}HU^}t0}t7LH賙zHu9H}1H([A^A_]ILH@YzHuHHUHHHztuHH]H=fn] H5蚉1]UHSH(HuHsHE؋FEHEEȃrH}оU1[H58H}HUOH1}tH5H}HU诈}t7HOHxHu"H肉H([]H}о`1H([]ÐUHH=UmH5nHkH 0xmuH&nH=mxHm]ÐUH]fDUHSPHH=lH5nHH xxmuhHmH=lMxH5ҏHlHwt H ltH[]H=lH[]xfUHAVSH0HuHE-HEЋFEHEHEH}ȃuoHu蘇tqH]H=CH蓺At1H=*HztH=1Hgt H虅Lc'wHuL,w襆1H0[A^]f.@UHAWAVSH(HuH,HED~D}HG]ԉ]؅ybHHLw(HEMA)AuhHuH}葆}L}tlH=2L肹AtbH=)LitOH=0LVtHH}"g1H([A^A_]fUHSHhHPHHE^HG)Ѓ HuH%HE]UĉUȅyfHHH_(HHuH}@g}HuHiHVHHuH3%HE]UĉUȅy IfHHttH_(HtkHuH}ftZH}HuкKftDEEEEEE}HutaHUH=icH5$e1H H H;MHh[]HHXHUHuH߾eHHUH`Ef.EuzEf.EuzEf.Eu{!UHuH}HUоetUHRHHEkUHSH8^HG)Ѓ.HuH`HEЉ]؉U܉UydHHH_(HwHuH}%eb}HujHgHTH;HuH`HEЉ]؉U܉Uy.dHHH_(HH}HudH}HuwdH}Hubd}uUMHgHSHHuHq_HEЉ]؉U܉Uy cHHtcH_(HtZHuH}dtIH5?H}HUHc}t/}HutVHHifzSHuXH5^b1H8[]1HHHpH;SHuCH HH SHuHHH8[]HHxHRHuHcH8[]fUHAWAVSH(HuHYHED~D}HG]ԉ]؅y RbHHtVLw(MtMA)Au1HuH}bt3}Hut6LdZRHu8H}a1H([A^A_]IL RHuHc%RӐUHAWAVSHx^HG)ЃnHxH(HE]UUykaHHLH_(H?HuHxa'H5=HxHUa}}HuAHHcGQH<HuHQ(HEЉ]؉U܉Uy`HHL(H}ȾB`AC6HcHx`HxH]ME+E܃ujH}HuatlH}Hu`t[H}HD`tH}HuHUHMLbH5'_1/H}Ⱦ_1HxHEH9t HtHHx[A^A_]E1H HHPHuHHIHUHMLpOHuHUH}ȾK_OHuHUH}ȾD_OHLH-HHxHEH9@EHHxHEH9t Ht&H`P f.UHAWAVSH8HuHT'HED~D}HG]ԉ]؅y ^HHtqLw(MthA)AuLHuH}-_tNH5 ;H}HUm^}t4}Hut7LH`NHu9H}!^1H8[A^A_]ILHdNHuHHUHAWAVSH8HuHj'HEDvDuHG]ԉ]؅y]HHL(MA)AulHuH}5^tnH5:H}HUu]}tTIH59H}HUX]}t7}Hut:LLH`MHuHhH X#HhH(XHhHuXHhHu1XHhLDXE0E@EPE8EHEDHXE.A1HXH504W1MHh WHhW1HHH9t HtH6HH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLH%X"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{!DHuHhHU1TDHuUHhSEf.0u$z"Ef.@uzEf.Pu{$LDHuHhHUTE~A1AfA.uzHH9`u!DHuHhLDCTCHmLCHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`YU.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{!AHuHhHU1,RAHuUHh$QEf.8u$z"Ef.HuzEf.u{$zAHuHhHUQE~A1AfA.uzHH9Xu!1AHuHhLDqQAHLAHHHH9HHHH9t Ht臃HA f.UHAVSH HuH;>HEDvDuHG]]y PHHt"H(HtD9uEt$XR;@Ht(1.H}111OH@HuHHHH [A^]UHAVSH HuHSHEDvDuHG]]y dOHHt$H(HtD9uEt&Q?Ht*11H}111 O H_?HuHcd?HHH [A^]UHAWAVSH(HuHp|HED~D}HG]ԉ]؅y NHHt\Lw(MtSA)Au7H5~H}HU~N}t0}t7LHP>Hu9H}6N1H([A^A_]ILHy>HuH ~HUHAWAVSH(HuHR|HED~D}HG]ԉ]؅y MHHt\Lw(MtSA)Au7H51}H}HUM}t0}t7LHP=Hu9H}VM1H([A^A_]ILH=HuH-}HUHAWAVSH8HuHHEDvDuHG]̉]ЅyLHHL(MA)AH5H}HUL}t|IHuH}&MthHuH}MtWH5H}HUsL}t=U܋MLLIO<HuH:|HH}L1H8[A^A_]DUHAWAVSHHHL|HHEHuHHEDvDuHG]]yKHHL(MA)H}AHuԺKH}Hu LH5nH}HUeK}IH5bH}HUDK}t~M܉MHMHMȋUHuLLI'NE;EuE;EuE;EtP;HuH}HU1K2;HuHzHJ1H zH H;MuHH[A^A_]E1M}fUHAWAVSHHHuHHEDvDuHG]ĉ]ȅyRJHHL(MA)AH5H}HUJ}IH}HuJH}HumJH}HuXJtqH}HuGJt`H5H}HUI}tFUMDEDMH$LL:L9HuHcyHH}GI1HH[A^A_]E1M UHAWAVSHHHuHHEDvDuHG]ĉ]ȅyIHHL(MA)AH5H}HUH}IH}Hu2IH}HuIH}HuItqH}HuHt`H5sH}HUUH}tFUMDEDMH$LL8K8HuHxHH}G1HH[A^A_]E1M UHAWAVSH8HuHHEDvDuHG]̉]ЅyGHHL(MA)AH5{H}HUrG}t|IHuH}GthHuH}GtWH5QH}HU3G}t=U܋MLLIJf7HuHvHH}F1H8[A^A_]DUHAWAVSH8HuHHEDvDuHG]̉]ЅyFHHL(MA)AH5kH}HUbF}t|IHuH}FthHuH}FtWH5AH}HU#F}t=U܋MLLIIV6HuHuHH}E1H8[A^A_]DUHAVSH HuHHEDvDuHG]]y EHHt H(HtD9uGH5Ht1H}111AE H?FHHH [A^]f.fUHAWAVSH(HuHHED~D}HG]ԉ]؅y DHHtWLw(MtNA)Au2HuH}OEt4uLzG5HuHtHH}{D1H([A^A_]fUHAVSH HuHHEDvDuHG]]y DDHHt#H(HtD9uEt%j4Ht*11H}111C Hx@4HuHcE4HHH [A^]@UHAVSH HuHMHEDvDuHG]]y CHHt%H(HtD9uEt'bFH3Ht+1>H}111H5qH}HUA}t7HEH 2Hu"HBH([]H}оA1H([]f.UHSPHHHttHH[]1f.UH]1fDUHAVSHHt%Hm1HtHpH8H5`3d1N{t,u6BtHHYgH= H[A^]11H[A^]*H5@1[A^]IHsL2 fUHSH(HuHHE؋FEHEHEuQH5H}HUc@HtKHÿsH HSHHPH=[H0HH}Hu (H}о?1H}Ht HuL1HH([]f.UHAWAVSH(HuH-HED~D}HG]ԉ]؅y ?HHt`LwMtWA)Au;H5H}HUn?}t4LHe/HuH>oHH}"?1H([A^A_]fUHAVSH HuHlHEDvDuHG]]y >HHtHHtD9u!e/Ht1H}111> HnHHH [A^]UHAWAVSH(HuHmHED~D}HG]ԉ]؅y R>HHtWLwMtNA)Au2HuH}>t4uLzdc.HuHmHH}=1H([A^A_]fUHAVSH HuHrHEDvDuHG]]y =HHtHHtD9uc-Ht1H}111R= -HHH [A^]f.UHAVSH HuHHEDvDuHG]]y =HHtHGHtD9uHcX1-Ht1H}111< H!-HHH [A^]UHAVSH HuH gHEDvDuHG]]y t<HHtHGHtD9uH,Ht1H}111&< H$=HHH [A^]ÐUHAVSH HuH$hHEDvDuHG]]y ;HHtHGHtD9uX,Ht1H}111; H,HHH [A^]UHH=.H5~0Hq1,r/uf,H/H=.+H.]fDUHAVSIH=.H5(0H1+/u,He/H=^.+H5HK.L!+t H 8.t011+HtH1Z2uH{H=t'Hh]fDUHSPHH=PH5Hq1uQH&H=H5BH Hbt H tH[]H=H[]Vf.@UHAVSH0HuHHEЋFEHEHEH}ȃu\Hu$t^H]H=HWAtH=kHVt H,"LcHuL8#1H0[A^]ÐUHAWAVSH(HuHHED~D}HG]ԉ]؅y#HHLw(HEMA)AuQHuH}1#t|}L}tYH=L&VAtOH=~L VtH9HH HSHgHAhH9iHkHnH{H虃H衑H詟HHHHiHHY2HUH`HrH詭HHHHLHaSHZHHyHHIHHIHAH H1HiuHH)HJHiVHсHHqH$H\H)HAHI H_H虗HQH9 HQNH)dHqrHIHQHiHHHQH'H!.HAH]HyhHAiHIH衬HHHiHq!H&HAH`H1HɱHHyH%HySH葌H H!HYH*H0HqcHjH1HyHa!H*HZHdHlH9HaHɣHѣH٣H!HcHnHHH H9HeH1nH)H聓HHL[A^]H==H5XTUHHH?Ht Hx]B]Ð%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%€%Ā%ƀ%Ȁ%ʀ%̀%΀%Ѐ%Ҁ%Ԁ%ր%؀%ڀ%܀%ހ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ā%Ɓ%ȁ%ʁ%́%΁%Ё%ҁ%ԁ%ց%؁%ځ%܁%ށ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%‚%Ă%Ƃ%Ȃ%ʂ%̂%΂%Ђ%҂%Ԃ%ւ%؂%ڂ%܂%ނ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ƒ%ă%ƃ%ȃ%ʃ%̃%΃%Ѓ%҃%ԃ%փ%؃%ڃ%܃%ރ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%„%Ą%Ƅ%Ȅ%ʄ%̄%΄%Є%҄%Ԅ%ք%؄%ڄ%܄%ބ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%…%ą%ƅ%ȅ%ʅ%̅%΅%Ѕ%҅%ԅ%օ%؅%څ%܅%ޅ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%†%Ć%Ɔ%Ȇ%ʆ%̆%Ά%І%҆%Ԇ%ֆ%؆%چ%܆%ކ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%‡%ć%Ƈ%ȇ%ʇ%̇%·%Ї%҇%ԇ%և%؇%ڇ%܇%އ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ˆ%Ĉ%ƈ%Ȉ%ʈ%̈%Έ%Ј%҈%Ԉ%ֈ%؈%ڈ%܈%ވ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%‰%ĉ%Ɖ%ȉ%ʉ%̉%Ή%Љ%҉%ԉ%։%؉%ډ%܉%މ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%Š%Ċ%Ɗ%Ȋ%ʊ%̊%Ί%Њ%Ҋ%Ԋ%֊%؊%ڊ%܊%ފ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%‹%ċ%Ƌ%ȋ%ʋ%̋%΋%Ћ%ҋ%ԋ%֋%؋%ڋ%܋%ދ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%Œ%Č%ƌ%Ȍ%ʌ%̌%Ό%Ќ%Ҍ%Ԍ%֌%،%ڌ%܌%ތ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%č%ƍ%ȍ%ʍ%̍%΍%Ѝ%ҍ%ԍ%֍%؍%ڍ%܍%ލ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%Ž%Ď%Ǝ%Ȏ%ʎ%̎%Ύ%Ў%Ҏ%Ԏ%֎%؎%ڎ%܎%ގ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ď%Ə%ȏ%ʏ%̏%Ώ%Џ%ҏ%ԏ%֏%؏%ڏ%܏%ޏ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%Đ%Ɛ%Ȑ%ʐ%̐%ΐ%А%Ґ%Ԑ%֐%ؐ%ڐ%ܐ%ސ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%‘%đ%Ƒ%ȑ%ʑ%̑%Α%Б%ґ%ԑ%֑%ؑ%ڑ%ܑ%ޑ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%’%Ē%ƒ%Ȓ%ʒ%̒%Β%В%Ғ%Ԓ%֒%ؒ%ڒ%ܒ%ޒ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%“%ē%Ɠ%ȓ%ʓ%̓%Γ%Г%ғ%ԓ%֓%ؓ%ړ%ܓ%ޓ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%”%Ĕ%Ɣ%Ȕ%ʔ%̔%Δ%Д%Ҕ%Ԕ%֔%ؔ%ڔ%ܔ%ޔ%%%%%%%%%%%%%%%%%%%%%% % %%%%%%%%%% %"%$%&%(%*%,%.%0%2%4%6%8%:%<%>%@%B%D%F%H%J%L%N%P%R%T%V%X%Z%\%^%`%b%d%f%h%j%l%n%p%r%t%v%x%z%|%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%hhh/hPhlhhhhhhh xh*nhBdhZZhuPhFh<h2h(hhh hLєAS%hhrhhhh+hahhhhh@xhwnhdhZhPh- FhV hI4h}*h hhE hchhihhhh&hIhyhhhh;hghvhlhbh>XhmNhDh:h0h{&hhhhhLh|hhh"hShrhhhhhTh|hrhhh^h;ThvJh@h6h,h)"hShhhhhLhyhhhG hw h h h)!hY!h!h!xh!nh""dhU"Zht"Ph"Fh"hV,4h,*h, h-h0- hQ-ht-h-h-h-h8.h[.h.h.h.h.h#/hG/hk/h/vh/lh0bhE0Xhj0Nh0Dh0:h 10hB1&hx1h1h1h!2h|2h2h2hx3h4h(4hY4h4h4h5h85ha5h5|h5rh6hhG6^h}6Th6Jh6@h076ho7,h7"h7h8h=8h\8h8hd9h9h9h9h:hE:he:h:h:h;h6;h[;xh;nh;dh;Zh<Ph3<Fhb<hH>ho>h>h>h:?hg?h?h?h@~h"@thD@jhh@`h@Vh@Lh@Bh&A8h]A.hA$hAhBh?BhtBhBhBhChCh Dh2Dh[DhDhDhDhEh8EhlEzhEphEfhE\h FRh?FHh~F>hF4hF*h(G hfGhG hHhHhHhHh Ih8IhaIhIhIhIhJhDJhvJhJhJvhKlh3KbhfKXhKNhKDhK:hL0h>L&hdLhLhLhLh Mh0MhWMhMhMhMhMh!NhVNh~NhNhNh O|hAOrhnOhhO^hOThOJh9P@hzP6hP,hP"hQh>QhiQhQhQh Rh7RhdRhRhRhShKSh|ShShSh(ThWTxhTnhTdhTZh!UPh_UFhUVhoVhV hVhWhgWhWhWh2XhlXhXhXh(YhqYhYhYh=Z~hzZthZjh[`hD[Vhd[Lh[Bh[8h[.h\$h:\hu\h\h\h,]hS]hz]h]h]h]h^hH^hw^h^h^h^h_zhH_ph~_fh_\h_Rh`HhG`>hw`4h`*h` h/ahca hahah bh5bhmbhbhbhbhchghghghhh=hhghhhhh|hhrhihh=i^hviThiJhi@hi6h(j,hej"hjhjhjh khOkhkhkhkhlhUlhlhlhlhmhPmhmhmxhmnh;ndhnZhnPhnFh=ozRhvzHhz>hz4h{*hE{ h{h{ h{h|h|h}h?}hd}h}h}h}hhhFhuhḧvhlhbh@XhfNhDh:h0h&h:hhh hKh}hhhhYhhhhZhhhߍ|h rh5hhj^hThގJh@hD6hs,h"hhhJhzhhh#hVhhđhh(hh6h\hhxhؓnhdh'ZhYPhFhhR4ht*h h٠h h(hUhhhΡhh hIhthh̢hh hKhxvhlhѣbhXh6NhcDh:hӤ0h&h3hdhhhhh=hshhh7hahhǧhhch|h˨rhhh2^hUThJh@hܩ6h,h@"hshhߪh h`hhիhh_hhh$hfhh̭hh.xhcnhdhZhPh Fh2h$4hK*hs hh h#hKhhhhEhnhhühhhEh{hhvh4lhtbhXhNh"DhW:h0hɿ&hhMhhh5hhhhMhhhh.hihhh"|hXrhhh^hTh5JhY@h6h,h"hhhh:hphhh)hihhhhOhhhh>xhnhdhZh>PhbFhfh\hRhHh >hY4h*h h h. hUh}hhhh!hKhohhh!h\hhhvhZlhbhXh9NhDh:h0hM&hzhhh hChxhhhhThhhhBhghh|hrhhhG^huThJh@h6h%,h]"hhhhhMhrhhhh3h`hhhhShhxhnhBdhxZhPhFh^h4h*hM h}h h>hmhhhhKhhhh(hahhhh=vhdlhbhXhNhDhG:h0h&h)hmhhhhChhhh4hnhhh hhhF|horhhh^h&ThUJh@h6h,hD"hzhhhhh*hSh|hhh+hnhhhhQhxhnhdhZhIPhwFh>hj4h*h hh, h`hhhh0hfhhhh@hyhhh%h_vhlhbh XhFNhDh:h0h-&hehhhhRhhhhbhhhhh3h^hh|hrh5hhr^hThJh5@hl6h,h"hhh/hYhhhh3hYhhhhQhwhhh xhI nho dh Zh Ph!Fh)!h,4h/,*h^, h,h, h,h<-hi-h-h-h.h(.hc.h.h.h/hD/h/h/h0vhN0lh0bh0Xh0Nh-1Dhh1:h10h1&h2h82hp2h2h2h"3h^3h3h3h 4hS4h4h4h5hG5hu5h5|h5rh6hhQ6^h6Th6Jh6@h976ht7,h7"h7h7h 8hU8h8h8h8h9hM9h|9h9h9h:hL:h:h:h:xh?;nh;dh;Zh;Ph<FhK<hN>h>h>h>h3?hv?h?h?h.@hg@h@~h@thAjhUA`h|AVhALh-BBhYB8hB.hC$h?ChlChChCh%DhcDhDhDh0EhsEhEhEh@Fh}FhFhGh`GzhGphHfhH\hHRhIHhII>hI4hI*hI h'JhjJ hJhJh#KhbKhKhLhLhLhLhMhEMhtMhMhMhNvhENlhvNbhNXhNNh%ODh\O:hO0hO&hPh?PhqPhPhPhQhRQhQhQhQh2RhgRhRhRh ShVShS|hSrh1ThhT^hTTh?UJhU@hU6hU,hV"h?Vh{VhVhVh#WhPWhWhWhWhEXhXhXh$YhbYhYhYh-Zxh_ZnhZdhZZhZPh#[FhS[hf4hf*h-g highg hghhhNhhhhhhhh'ihUihihihjhPjhjhjhjvh.klh[kbhkXhkNhlDh@l:hhl0hl&hlhmhQmhBnhunhnhnhoֿhHo̿h|o¿ho鸿ho鮿hp餿hTp隿hp鐿hp醿hq|hhK4h*h҈ hh` hhh-hVhڻhлhƻh2鼻hl鲻h騻h鞻h0锻hp銻h逻hŒvhlh&bhdXhNhDh:hi0h&hh<hhh׏hhahֺhݐ̺h1ºhy鸺hÑ鮺h餺hh隺h鐺h醺ht|hÓrhhh;^hwThJh@hB6h,hЕ"h hJhhʖhhhܹh@ҹh{ȹh龹h՘鴹h骹hM頹h閹h錹h邹h+xhUnhdhZhۚPhFhHh4h*h¨ hh, huhhh+hqڶhжhƶh3鼶hu鲶h騶h*鞶h锶h銶h&逶hovhlhbhXhDNhDhɮ:h0hE&hhhhHh{hѰh%hyֵh̵hµh:鸵ho鮵h餵h隵h/鐵hv醵h|hݳrh.hh}^h̴ThJh>@h6hµ,h"h3hphhζh hWhܴhзҴhȴhI龴h鴴h۸骴h頴hY閴h錴hɹ邴hVxhnhdhKZhPhһFhh4h*hT hh h(hqhhh<ڱhzбhƱh鼱h<鲱h騱h鞱h 锱hM銱h週hqvhlhbhXhNhSDh:h20hq&hhh3hxhhhhVְh̰h°h鸰h3鮰hq餰h隰h鐰h/醰h]|hrhhh^hlThJh@h>6hu,h"hh.hkhhh-h`ܯhүhȯhF龯h鴯h骯h頯hf閯h錯h邯h!xhgnhdhZh)PhWFh`h~VhLhBhH8h.h$hh[hhh#hQhޭhwԭhʭhh鶭hX鬭h颭h阭h+鎭hf鄭hzhphJfh\hRhHhL>h4hx*h hh h[hhh.hmڬhЬhƬh4鼬h鲬h騬h鞬h^锬h銬h逬hCvhlhbhXh1NhjDh:h0h &hKhhh'hYhhh֫hD̫h«h鸫h鮫h;餫h}隫h鐫h醫hG|hrhhh?^hThJh@h_6h,h#"hrhhh+h^hhܪhҪhSȪh龪h鴪h0骪hj頪h閪h錪hS邪hxhnhdh^ZhPhFh/h 4h~*h hLh hhthh,hڧhЧhƧh!鼧ha鲧h騧h鞧h锧h銧h逧h4vhTlhtbhXhNhDh:h)0hN&hthhhhh<h\h֦h̦h¦h鸦h0鮦h\餦h隦h鐦h醦h|hrhGhhb^hThJh@h06h_,h"hhh1hjhhhܥh;ҥhȥh龥h鴥h骥h頥h閥h+錥hV邥hqxhnhdhZh# PhD Fhd h*4hJ**h* h*h* h*+hY+h+h+h+ڢh=,ТhZ,Ƣh,鼢h,鲢h,騢h-鞢hG-锢hh-銢h-逢h-vh-lh-bh.Xh6.NhY.Dh.:h.0h.&h/hB/hu/h/h/h0hG0hx0֡h0̡h0¡hE1鸡h1鮡h1餡h2隡hD2鐡ho2醡h2|h2rh3hh03^h^3Th3Jh3@h46h<4,hX4"hu4h4h4h5h-5hT5h5ܠh5Ҡh5Ƞh6龠hB6鴠hk6骠h6頠h6閠h6錠h7邠hK7xh}7nh7dh7Zh7Ph8Fh88hI>hi>h>h>h?h3?ޞhY?Ԟh?ʞh?h?鶞h@鬞h>@颞hx@阞h@鎞h@鄞h Azh&AphAfhA\hARhBHhTB>hB4hB*hB hBh'C hZChChChCh*Dڝh^DНhzDƝhD鼝hE鲝h?E騝hiE鞝hE锝hE銝hE逝hFvhIFlh~FbhFXhFNhGDh%G:hEG0heG&hGhGhGhHh/HhVHhsHhH֜hH̜hHœhH鸜hjI鮜hI餜hJ障hEJ鐜hnJ醜hJ|hJrhJhhK^hJKThKJhK@hK6hL,hEL"hrLhLhLhMh:MhrMhMܛhMқhMțhM龛hN鴛hBN骛hsN頛hN閛hN錛hN邛hOxh;OnhbOdhOZhOPh6PFh^PhZ4hw[*h[ h[h\ h1\h]\hz\h\h\ژh\Иh]ƘhB]鼘hn]鲘h]騘h]鞘h]锘h^銘hA^逘hm^vh^lh^bh^Xh_Nh3_Dho_:h_0h_&h`hK`hy`h`h`h`h{ah.b֗h]b̗hb—hb鸗hb鮗h c餗hcc隗hc鐗hc醗hd|h5drhndhhd^hdTheJhXe@he6he,he"hfh:fh`fhfhfhfhgܖh-gҖhYgȖhg龖hg鴖hg骖h h頖h7h閖hdh錖hh邖hhxhhnhidh7iZhViPhiFhiht4h*hׁ hhT h|hĥhhړhDГhlƓh鼓h鲓h験h 鞓h1锓hX銓h逓hvḧ́lhbhXhBNhlDh:h0h&hh>hhhhʆhh0ha֒h̒h’h 鸒h:鮒h餒h隒hdg鐒hg醒hYv|hrhhh^hiThymJhm@hm6hm,hn"hyhhZhZh[hE[hbܑhiґhjȑhej龑hj鴑h k骑hJk頑hk閑hk錑hk邑h mxh(mnhdhlZhAmPh[mFhkm int C++: static vtkTypeBool IsTypeOf(const char *type) Standard type and print methods. IsAV.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard type and print methods. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkAbstractCellLinks C++: static vtkAbstractCellLinks *SafeDownCast(vtkObjectBase *o) Standard type and print methods. NewInstanceV.NewInstance() -> vtkAbstractCellLinks C++: vtkAbstractCellLinks *NewInstance() Standard type and print methods. BuildLinksV.BuildLinks(vtkDataSet) C++: virtual void BuildLinks(vtkDataSet *data) Build the link list array. All subclasses must implement this method. GetIdTypeV.GetIdType(int, int, vtkCellArray) -> int C++: static int GetIdType(vtkIdType maxPtId, vtkIdType maxCellId, vtkCellArray *ca) Based on the input (i.e., number of points, number of cells, and length of connectivity array) this helper method returns the integral type to use when instantiating cell link-related classes in order to properly represent the data. The return value is one of the types (VTK_ID_TYPE,VTK_INT,VTK_SHORT) defined in the file vtkType.h. Subclasses may choose to instantiate themselves with different integral types for performance and/or memory reasons. vtkObjectvtkObjectBasevtkDataSetvtkCellArrayvtkAbstractCellLocatorvtkCommonDataModelPython.vtkAbstractCellLocatorvtkAbstractCellLocator - an abstract base class for locators which find cells Superclass: vtkLocator vtkAbstractCellLocator is a spatial search object to quickly locate cells in 3D. vtkAbstractCellLocator supplies a basic interface which concrete subclasses should implement. @warning When deriving a class from vtkAbstractCellLocator, one should include the 'hidden' member functions by the following construct in the derived class using vtkAbstractCellLocator::IntersectWithLine; using vtkAbstractCellLocator::FindClosestPoint; using vtkAbstractCellLocator::FindClosestPointWithinRadius; @sa vtkLocator vtkPointLocator vtkOBBTree vtkCellLocator V.SafeDownCast(vtkObjectBase) -> vtkAbstractCellLocator C++: static vtkAbstractCellLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkAbstractCellLocator C++: vtkAbstractCellLocator *NewInstance() Standard type and print methods. SetNumberOfCellsPerNodeV.SetNumberOfCellsPerNode(int) C++: virtual void SetNumberOfCellsPerNode(int _arg) Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. GetNumberOfCellsPerNodeMinValueV.GetNumberOfCellsPerNodeMinValue() -> int C++: virtual int GetNumberOfCellsPerNodeMinValue() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. GetNumberOfCellsPerNodeMaxValueV.GetNumberOfCellsPerNodeMaxValue() -> int C++: virtual int GetNumberOfCellsPerNodeMaxValue() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. GetNumberOfCellsPerNodeV.GetNumberOfCellsPerNode() -> int C++: virtual int GetNumberOfCellsPerNode() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. SetCacheCellBoundsV.SetCacheCellBounds(int) C++: virtual void SetCacheCellBounds(int _arg) Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). GetCacheCellBoundsV.GetCacheCellBounds() -> int C++: virtual int GetCacheCellBounds() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). CacheCellBoundsOnV.CacheCellBoundsOn() C++: virtual void CacheCellBoundsOn() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). CacheCellBoundsOffV.CacheCellBoundsOff() C++: virtual void CacheCellBoundsOff() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). SetRetainCellListsV.SetRetainCellLists(int) C++: virtual void SetRetainCellLists(int _arg) Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. GetRetainCellListsV.GetRetainCellLists() -> int C++: virtual int GetRetainCellLists() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. RetainCellListsOnV.RetainCellListsOn() C++: virtual void RetainCellListsOn() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. RetainCellListsOffV.RetainCellListsOff() C++: virtual void RetainCellListsOff() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. SetLazyEvaluationV.SetLazyEvaluation(int) C++: virtual void SetLazyEvaluation(int _arg) Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. GetLazyEvaluationV.GetLazyEvaluation() -> int C++: virtual int GetLazyEvaluation() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. LazyEvaluationOnV.LazyEvaluationOn() C++: virtual void LazyEvaluationOn() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. LazyEvaluationOffV.LazyEvaluationOff() C++: virtual void LazyEvaluationOff() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. SetUseExistingSearchStructureV.SetUseExistingSearchStructure(int) C++: virtual void SetUseExistingSearchStructure(int _arg) Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase GetUseExistingSearchStructureV.GetUseExistingSearchStructure() -> int C++: virtual int GetUseExistingSearchStructure() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase UseExistingSearchStructureOnV.UseExistingSearchStructureOn() C++: virtual void UseExistingSearchStructureOn() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase UseExistingSearchStructureOffV.UseExistingSearchStructureOff() C++: virtual void UseExistingSearchStructureOff() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase IntersectWithLineV.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int, vtkGenericCell) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) V.IntersectWithLine((float, float, float), (float, float, float), vtkPoints, vtkIdList) -> int C++: virtual int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) Return intersection point (if any) of finite line with cells contained in cell locator. See vtkCell.h parameters documentation. FindClosestPointV.FindClosestPoint([float, float, float], [float, float, float], int, int, float) C++: virtual void FindClosestPoint(double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPoint([float, float, float], [float, float, float], vtkGenericCell, int, int, float) C++: virtual void FindClosestPoint(double x[3], double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. FindClosestPointWithinRadiusV.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float, int) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2, int &inside) Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. FindCellsWithinBoundsV.FindCellsWithinBounds([float, ...], vtkIdList) C++: virtual void FindCellsWithinBounds(double *bbox, vtkIdList *cells) Return a list of unique cell ids inside of a given bounding box. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built. FindCellsAlongLineV.FindCellsAlongLine([float, float, float], [float, float, float], float, vtkIdList) C++: virtual void FindCellsAlongLine(double p1[3], double p2[3], double tolerance, vtkIdList *cells) Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built. FindCellV.FindCell([float, float, float]) -> int C++: virtual vtkIdType FindCell(double x[3]) V.FindCell([float, float, float], float, vtkGenericCell, [float, float, float], [float, ...]) -> int C++: virtual vtkIdType FindCell(double x[3], double tol2, vtkGenericCell *GenCell, double pcoords[3], double *weights) Returns the Id of the cell containing the point, returns -1 if no cell found. This interface uses a tolerance of zero InsideCellBoundsV.InsideCellBounds([float, float, float], int) -> bool C++: virtual bool InsideCellBounds(double x[3], vtkIdType cell_ID) Quickly test if a point is inside the bounds of a particular cell. Some locators cache cell bounds and this function can make use of fast access to the data. vtkLocatorvtkGenericCellvtkPointsvtkIdListvtkAbstractPointLocatorvtkCommonDataModelPython.vtkAbstractPointLocatorvtkAbstractPointLocator - abstract class to quickly locate points in 3-space Superclass: vtkLocator vtkAbstractPointLocator is an abstract spatial search object to quickly locate points in 3D. vtkAbstractPointLocator works by dividing a specified region of space into "rectangular" buckets, and then keeping a list of points that lie in each bucket. Typical operation involves giving a position in 3D and finding the closest point. The points are provided from the specified dataset input. @sa vtkPointLocator vtkStaticPointLocator vtkMergePoints V.SafeDownCast(vtkObjectBase) -> vtkAbstractPointLocator C++: static vtkAbstractPointLocator *SafeDownCast( vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkAbstractPointLocator C++: vtkAbstractPointLocator *NewInstance() Standard type and print methods. V.FindClosestPoint((float, float, float)) -> int C++: virtual vtkIdType FindClosestPoint(const double x[3]) V.FindClosestPoint(float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z) Given a position x, return the id of the point closest to it. Alternative method requires separate x-y-z values. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) Given a position x and a radius r, return the id of the point closest to the point in that radius. dist2 returns the squared distance to the point. FindClosestNPointsV.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: virtual void FindClosestNPoints(int N, const double x[3], vtkIdList *result) V.FindClosestNPoints(int, float, float, float, vtkIdList) C++: void FindClosestNPoints(int N, double x, double y, double z, vtkIdList *result) Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. FindPointsWithinRadiusV.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: virtual void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) V.FindPointsWithinRadius(float, float, float, float, vtkIdList) C++: void FindPointsWithinRadius(double R, double x, double y, double z, vtkIdList *result) Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. GetBoundsV.GetBounds() -> (float, ...) C++: virtual double *GetBounds() V.GetBounds([float, ...]) C++: virtual void GetBounds(double *) Provide an accessor to the bounds. GetNumberOfBucketsV.GetNumberOfBuckets() -> int C++: virtual vtkIdType GetNumberOfBuckets() Return the total number of buckets in the locator. This has meaning only after the locator is constructed. p_voidvtkAdjacentVertexIteratorvtkCommonDataModelPython.vtkAdjacentVertexIteratorvtkAdjacentVertexIterator - Iterates through adjacent vertices in a graph. Superclass: vtkObject vtkAdjacentVertexIterator iterates through all vertices adjacent to a vertex, i.e. the vertices which may be reached by traversing an out edge of the source vertex. Use graph->GetAdjacentVertices(v, it) to initialize the iterator. V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. V.SafeDownCast(vtkObjectBase) -> vtkAdjacentVertexIterator C++: static vtkAdjacentVertexIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkAdjacentVertexIterator C++: vtkAdjacentVertexIterator *NewInstance() InitializeV.Initialize(vtkGraph, int) C++: void Initialize(vtkGraph *g, vtkIdType v) Initialize the iterator with a graph and vertex. GetGraphV.GetGraph() -> vtkGraph C++: virtual vtkGraph *GetGraph() Get the graph and vertex associated with this iterator. GetVertexV.GetVertex() -> int C++: virtual vtkIdType GetVertex() Get the graph and vertex associated with this iterator. NextV.Next() -> int C++: vtkIdType Next() Returns the next edge in the graph. HasNextV.HasNext() -> bool C++: bool HasNext() Whether this iterator has more edges. vtkGraphvtkAMRBoxvtkCommonDataModelPython.vtkAMRBoxvtkAMRBox - Encloses a rectangular region of voxel like cells. vtkAMRBox stores information for an AMR block @sa vtkAMRInformation vtkAMRBox() vtkAMRBox(const vtkAMRBox &other) vtkAMRBox(int ilo, int jlo, int klo, int ihi, int jhi, int khi) vtkAMRBox(const double *origin, const int *dimensions, const double *spacing, const double *globalOrigin, int gridDescription=VTK_XYZ_GRID) vtkAMRBox(const int lo[3], const int hi[3]) vtkAMRBox(const int dims[6]) operation not availablethis function takes no keyword argumentsInvalidateV.Invalidate() C++: void Invalidate() Set the box to be invalid; EmptyDimensionV.EmptyDimension(int) -> bool C++: bool EmptyDimension(int i) Whether dimension i is empty, e.g. if the data set is type VTK_XY_PLANE SetDimensionsV.SetDimensions(int, int, int, int, int, int, int) C++: void SetDimensions(int ilo, int jlo, int klo, int ihi, int jhi, int khi, int desc=VTK_XYZ_GRID) V.SetDimensions((int, int, int), (int, int, int), int) C++: void SetDimensions(const int lo[3], const int hi[3], int desc=VTK_XYZ_GRID) V.SetDimensions((int, int, int, int, int, int), int) C++: void SetDimensions(const int dims[6], int desc=VTK_XYZ_GRID) Set the dimensions of the box. ilo,jlo,klo,ihi,jhi,khi GetDimensionsV.GetDimensions([int, int, int], [int, int, int]) C++: void GetDimensions(int lo[3], int hi[3]) V.GetDimensions([int, int, int, int, int, int]) C++: void GetDimensions(int dims[6]) Get the dimensions of this box. (ilo,jlo,jhi),(ihi,jhi,khi) GetNumberOfCellsV.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() V.GetNumberOfCells([int, int, int]) C++: void GetNumberOfCells(int num[3]) Gets the number of cells enclosed by the box. GetNumberOfNodesV.GetNumberOfNodes([int, int, int]) C++: void GetNumberOfNodes(int ext[3]) V.GetNumberOfNodes() -> int C++: vtkIdType GetNumberOfNodes() Gets the number of nodes required to construct a physical representation of the box. ComputeDimensionV.ComputeDimension() -> int C++: int ComputeDimension() Determines the dimension of the AMR box given the box indices. Note, the AMR box can be on an arbitrary axis-aligned plane, i.e., XZ or YZ. GetLoCornerV.GetLoCorner() -> (int, ...) C++: const int *GetLoCorner() Get the low corner index. GetHiCornerV.GetHiCorner() -> (int, ...) C++: const int *GetHiCorner() GetValidHiCornerV.GetValidHiCorner([int, int, int]) C++: void GetValidHiCorner(int hi[3]) Return a high corner. If dimension j is empty, then hi[j] is set from lo[j]. This is convenient For algorithm that must iterate over all cells EmptyV.Empty() -> bool C++: bool Empty() IsInvalidV.IsInvalid() -> bool C++: bool IsInvalid() Check to see if the AMR box instance is invalid. SerializeV.Serialize([int, ...], int) C++: void Serialize(unsigned char *&buffer, vtkIdType &bytesize) V.Serialize([int, ...]) C++: void Serialize(int *buffer) Serializes this object instance into a byte-stream. buffer -- user-supplied pointer where the serialized object is stored. bytesize -- number of bytes, i.e., the size of the buffer. NOTE: buffer is allocated internally by this method. Pre-conditions: buffer == nullptr Post-conditions: buffer != nullptr bytesize != 0 DeserializeV.Deserialize([int, ...], int) C++: void Deserialize(unsigned char *buffer, const vtkIdType &bytesize) Deserializes this object instance from the given byte-stream. Pre-conditions: buffer != nullptr bytesize != 0 DoesBoxIntersectAlongDimensionV.DoesBoxIntersectAlongDimension(vtkAMRBox, int) -> bool C++: bool DoesBoxIntersectAlongDimension(const vtkAMRBox &other, const int q) Checks if this instance of vtkAMRBox intersects with the box passed through the argument list along the given dimension q. True is returned iff the box intersects successfully. Otherwise, there is no intersection along the given dimension and false is returned. DoesIntersectV.DoesIntersect(vtkAMRBox) -> bool C++: bool DoesIntersect(const vtkAMRBox &other) CoarsenV.Coarsen(int) C++: void Coarsen(int r) Coarsen the box. RefineV.Refine(int) C++: void Refine(int r) Refine the box. GrowV.Grow(int) C++: void Grow(int byN) Grows the box in all directions. ShrinkV.Shrink(int) C++: void Shrink(int byN) Grows the box in all directions. ShiftV.Shift(int, int, int) C++: void Shift(int i, int j, int k) V.Shift((int, int, int)) C++: void Shift(const int I[3]) Shifts the box in index space IntersectV.Intersect(vtkAMRBox) -> bool C++: bool Intersect(const vtkAMRBox &other) Intersect this box with another box in place. Returns true if the boxes do intersect. Note that the box is modified to be the intersection or is made invalid. ContainsV.Contains(int, int, int) -> bool C++: bool Contains(int i, int j, int k) V.Contains((int, int, int)) -> bool C++: bool Contains(const int I[3]) V.Contains(vtkAMRBox) -> bool C++: bool Contains(const vtkAMRBox &) Test to see if a given cell index is inside this box. GetGhostVectorV.GetGhostVector(int, [int, int, int, int, int, int]) C++: void GetGhostVector(int r, int nghost[6]) Given an AMR box and the refinement ratio, r, this method computes the number of ghost layers in each of the 6 directions, i.e., [imin,imax,jmin,jmax,kmin,kmax] RemoveGhostsV.RemoveGhosts(int) C++: void RemoveGhosts(int r) Given an AMR box and the refinement ratio, r, this shrinks the AMRBox GetBytesizeV.GetBytesize() -> int C++: static vtkIdType GetBytesize() Returns the number of bytes allocated by this instance. In addition, this number of bytes corresponds to the buffer size required to serialize any vtkAMRBox instance. GetCellLinearIndexV.GetCellLinearIndex(vtkAMRBox, int, int, int, [int, int, int]) -> int C++: static int GetCellLinearIndex(const vtkAMRBox &box, const int i, const int j, const int k, int imageDimension[3]) Returns the linear index of the given cell structured coordinates V.GetBounds(vtkAMRBox, (float, float, float), (float, float, float), [float, float, float, float, float, float]) C++: static void GetBounds(const vtkAMRBox &box, const double origin[3], const double spacing[3], double bounds[6]) Get the bounds of this box. GetBoxOriginV.GetBoxOrigin(vtkAMRBox, (float, float, float), (float, float, float), [float, float, float]) C++: static void GetBoxOrigin(const vtkAMRBox &box, const double X0[3], const double spacing[3], double x0[3]) Get the world space origin of this box. The origin is the location of the lower corner cell's lower corner node, HasPointV.HasPoint(vtkAMRBox, (float, float, float), (float, float, float) , float, float, float) -> bool C++: static bool HasPoint(const vtkAMRBox &box, const double origin[3], const double spacing[3], double x, double y, double z) Checks if the point is inside this AMRBox instance. x,y,z the world point ComputeStructuredCoordinatesV.ComputeStructuredCoordinates(vtkAMRBox, (float, float, float), ( float, float, float), (float, float, float), [int, int, int], [float, float, float]) -> int C++: static int ComputeStructuredCoordinates(const vtkAMRBox &box, const double dataOrigin[3], const double h[3], const double x[3], int ijk[3], double pcoords[3]) Compute structured coordinates @PP|i *i *i@P|i *i@P *i@W vtkAMRBoxvtkAMRUtilitiesvtkCommonDataModelPython.vtkAMRUtilitiesvtkAMRUtilities - A concrete instance of vtkObject that employs a singleton design pattern and implements functionality for AMR specific operations. Superclass: vtkObject @sa vtkOverlappingAMR, vtkAMRBox V.SafeDownCast(vtkObjectBase) -> vtkAMRUtilities C++: static vtkAMRUtilities *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAMRUtilities C++: vtkAMRUtilities *NewInstance() StripGhostLayersV.StripGhostLayers(vtkOverlappingAMR, vtkOverlappingAMR) C++: static void StripGhostLayers( vtkOverlappingAMR *ghostedAMRData, vtkOverlappingAMR *strippedAMRData) This method detects and strips partially overlapping cells from a given AMR dataset. If ghost layers are detected, they are removed and new grid instances are created to represent the stripped data-set otherwise, each block is shallow-copied. * .SECTION Assumptions * 1) The ghosted AMR data must have complete metadata information. HasPartiallyOverlappingGhostCellsV.HasPartiallyOverlappingGhostCells(vtkOverlappingAMR) -> bool C++: static bool HasPartiallyOverlappingGhostCells( vtkOverlappingAMR *amr) A quick test of whether partially overlapping ghost cells exist. This test starts from the highest-res boxes and checks if they have partially overlapping cells. The code returns with true once partially overlapping cells are detected. Otherwise, false is returned. BlankCellsV.BlankCells(vtkOverlappingAMR) C++: static void BlankCells(vtkOverlappingAMR *amr) Blank cells in overlapping AMR vtkOverlappingAMR(i)vtkAnimationScenePlayModesPLAYMODE_SEQUENCEPLAYMODE_REALTIMEvtkCommonDataModelPython.vtkAnimationScene.PlayModesvtkCommonDataModelPython.vtkAnimationScenevtkAnimationScene - the animation scene manager. Superclass: vtkAnimationCue vtkAnimationCue and vtkAnimationScene provide the framework to support animations in VTK. vtkAnimationCue represents an entity that changes/ animates with time, while vtkAnimationScene represents scene or setup for the animation, which consists of individual cues or other scenes. A scene can be played in real time mode, or as a seqence of frames 1/frame rate apart in time. @sa vtkAnimationCue V.SafeDownCast(vtkObjectBase) -> vtkAnimationScene C++: static vtkAnimationScene *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAnimationScene C++: vtkAnimationScene *NewInstance() SetPlayModeV.SetPlayMode(int) C++: virtual void SetPlayMode(int _arg) Get/Set the PlayMode for running/playing the animation scene. In the Sequence mode, all the frames are generated one after the other. The time reported to each Tick of the constituent cues (during Play) is incremented by 1/frame rate, irrespective of the current time. In the RealTime mode, time indicates the instance in time. SetModeToSequenceV.SetModeToSequence() C++: void SetModeToSequence() Get/Set the PlayMode for running/playing the animation scene. In the Sequence mode, all the frames are generated one after the other. The time reported to each Tick of the constituent cues (during Play) is incremented by 1/frame rate, irrespective of the current time. In the RealTime mode, time indicates the instance in time. SetModeToRealTimeV.SetModeToRealTime() C++: void SetModeToRealTime() Get/Set the PlayMode for running/playing the animation scene. In the Sequence mode, all the frames are generated one after the other. The time reported to each Tick of the constituent cues (during Play) is incremented by 1/frame rate, irrespective of the current time. In the RealTime mode, time indicates the instance in time. GetPlayModeV.GetPlayMode() -> int C++: virtual int GetPlayMode() Get/Set the PlayMode for running/playing the animation scene. In the Sequence mode, all the frames are generated one after the other. The time reported to each Tick of the constituent cues (during Play) is incremented by 1/frame rate, irrespective of the current time. In the RealTime mode, time indicates the instance in time. SetFrameRateV.SetFrameRate(float) C++: virtual void SetFrameRate(double _arg) Get/Set the frame rate (in frames per second). This parameter affects only in the Sequence mode. The time interval indicated to each cue on every tick is progressed by 1/frame-rate seconds. GetFrameRateV.GetFrameRate() -> float C++: virtual double GetFrameRate() Get/Set the frame rate (in frames per second). This parameter affects only in the Sequence mode. The time interval indicated to each cue on every tick is progressed by 1/frame-rate seconds. AddCueV.AddCue(vtkAnimationCue) C++: void AddCue(vtkAnimationCue *cue) Add/Remove an AnimationCue to/from the Scene. It's an error to add a cue twice to the Scene. RemoveCueV.RemoveCue(vtkAnimationCue) C++: void RemoveCue(vtkAnimationCue *cue) Add/Remove an AnimationCue to/from the Scene. It's an error to add a cue twice to the Scene. RemoveAllCuesV.RemoveAllCues() C++: void RemoveAllCues() Add/Remove an AnimationCue to/from the Scene. It's an error to add a cue twice to the Scene. GetNumberOfCuesV.GetNumberOfCues() -> int C++: int GetNumberOfCues() Add/Remove an AnimationCue to/from the Scene. It's an error to add a cue twice to the Scene. PlayV.Play() C++: virtual void Play() Starts playing the animation scene. Fires a vtkCommand::StartEvent before play beings and vtkCommand::EndEvent after play ends. StopV.Stop() C++: void Stop() Stops the animation scene that is running. SetLoopV.SetLoop(int) C++: virtual void SetLoop(int _arg) Enable/Disable animation loop. GetLoopV.GetLoop() -> int C++: virtual int GetLoop() Enable/Disable animation loop. SetAnimationTimeV.SetAnimationTime(float) C++: void SetAnimationTime(double time) Makes the state of the scene same as the given time. SetTimeModeV.SetTimeMode(int) C++: void SetTimeMode(int mode) override; Overridden to allow change to Normalized mode only if none of the constituent cues is in Relative time mode. IsInPlayV.IsInPlay() -> int C++: int IsInPlay() Returns if the animation is being played. vtkAnimationCuevtkAnnotationvtkCommonDataModelPython.vtkAnnotationvtkAnnotation - Stores a collection of annotation artifacts. Superclass: vtkDataObject vtkAnnotation is a collection of annotation properties along with an associated selection indicating the portion of data the annotation refers to. @par Thanks: Timothy M. Shead (tshead@sandia.gov) at Sandia National Laboratories contributed code to this class. V.SafeDownCast(vtkObjectBase) -> vtkAnnotation C++: static vtkAnnotation *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAnnotation C++: vtkAnnotation *NewInstance() GetSelectionV.GetSelection() -> vtkSelection C++: virtual vtkSelection *GetSelection() The selection to which this set of annotations will apply. SetSelectionV.SetSelection(vtkSelection) C++: virtual void SetSelection(vtkSelection *selection) The selection to which this set of annotations will apply. GetDataV.GetData(vtkInformation) -> vtkAnnotation C++: static vtkAnnotation *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkAnnotation C++: static vtkAnnotation *GetData(vtkInformationVector *v, int i=0) Retrieve a vtkAnnotation stored inside an information object. LABELV.LABEL() -> vtkInformationStringKey C++: static vtkInformationStringKey *LABEL() The label for this annotation. COLORV.COLOR() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *COLOR() The color for this annotation. This is stored as an RGB triple with values between 0 and 1. OPACITYV.OPACITY() -> vtkInformationDoubleKey C++: static vtkInformationDoubleKey *OPACITY() The color for this annotation. This is stored as a value between 0 and 1. ICON_INDEXV.ICON_INDEX() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *ICON_INDEX() An icon index for this annotation. ENABLEV.ENABLE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *ENABLE() Whether or not this annotation is enabled. A value of 1 means enabled, 0 disabled. HIDEV.HIDE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *HIDE() Whether or not this annotation is visible. DATAV.DATA() -> vtkInformationDataObjectKey C++: static vtkInformationDataObjectKey *DATA() Associate a vtkDataObject with this annotation V.Initialize() C++: void Initialize() override; Initialize the annotation to an empty state. ShallowCopyV.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *other) override; Make this annotation have the same properties and have the same selection of another annotation. DeepCopyV.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *other) override; Make this annotation have the same properties and have a copy of the selection of another annotation. GetMTimeV.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Get the modified time of this object. vtkDataObjectvtkSelectionV *vtkInformationV|i *vtkInformationVectorvtkInformationvtkInformationVectorvtkAnnotationLayersvtkCommonDataModelPython.vtkAnnotationLayersvtkAnnotationLayers - Stores a ordered collection of annotation sets Superclass: vtkDataObject vtkAnnotationLayers stores a vector of annotation layers. Each layer may contain any number of vtkAnnotation objects. The ordering of the layers introduces a prioritization of annotations. Annotations in higher layers may obscure annotations in lower layers. V.SafeDownCast(vtkObjectBase) -> vtkAnnotationLayers C++: static vtkAnnotationLayers *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAnnotationLayers C++: vtkAnnotationLayers *NewInstance() SetCurrentAnnotationV.SetCurrentAnnotation(vtkAnnotation) C++: virtual void SetCurrentAnnotation(vtkAnnotation *ann) The current annotation associated with this annotation link. GetCurrentAnnotationV.GetCurrentAnnotation() -> vtkAnnotation C++: virtual vtkAnnotation *GetCurrentAnnotation() The current annotation associated with this annotation link. SetCurrentSelectionV.SetCurrentSelection(vtkSelection) C++: virtual void SetCurrentSelection(vtkSelection *sel) The current selection associated with this annotation link. This is simply the selection contained in the current annotation. GetCurrentSelectionV.GetCurrentSelection() -> vtkSelection C++: virtual vtkSelection *GetCurrentSelection() The current selection associated with this annotation link. This is simply the selection contained in the current annotation. GetNumberOfAnnotationsV.GetNumberOfAnnotations() -> int C++: unsigned int GetNumberOfAnnotations() The number of annotations in a specific layer. GetAnnotationV.GetAnnotation(int) -> vtkAnnotation C++: vtkAnnotation *GetAnnotation(unsigned int idx) Retrieve an annotation from a layer. AddAnnotationV.AddAnnotation(vtkAnnotation) C++: void AddAnnotation(vtkAnnotation *ann) Add an annotation to a layer. RemoveAnnotationV.RemoveAnnotation(vtkAnnotation) C++: void RemoveAnnotation(vtkAnnotation *ann) Remove an annotation from a layer. V.Initialize() C++: void Initialize() override; Initialize the data structure to an empty state. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *other) override; Copy data from another data object into this one which references the same member annotations. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *other) override; Copy data from another data object into this one, performing a deep copy of member annotations. V.GetData(vtkInformation) -> vtkAnnotationLayers C++: static vtkAnnotationLayers *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkAnnotationLayers C++: static vtkAnnotationLayers *GetData(vtkInformationVector *v, int i=0) Retrieve a vtkAnnotationLayers stored inside an information object. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; The modified time for this object. vtkArrayDatavtkCommonDataModelPython.vtkArrayDatavtkArrayData - Pipeline data object that contains multiple vtkArray objects. Superclass: vtkDataObject Because vtkArray cannot be stored as attributes of data objects (yet), a "carrier" object is needed to pass vtkArray through the pipeline. vtkArrayData acts as a container of zero-to-many vtkArray instances, which can be retrieved via a zero-based index. Note that a collection of arrays stored in vtkArrayData may-or-may-not have related types, dimensions, or extents. @sa vtkArrayDataAlgorithm, vtkArray @par Thanks: Developed by Timothy M. Shead (tshead@sandia.gov) at Sandia National Laboratories. V.SafeDownCast(vtkObjectBase) -> vtkArrayData C++: static vtkArrayData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkArrayData C++: vtkArrayData *NewInstance() V.GetData(vtkInformation) -> vtkArrayData C++: static vtkArrayData *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkArrayData C++: static vtkArrayData *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. AddArrayV.AddArray(vtkArray) C++: void AddArray(vtkArray *) Adds a vtkArray to the collection ClearArraysV.ClearArrays() C++: void ClearArrays() Clears the contents of the collection GetNumberOfArraysV.GetNumberOfArrays() -> int C++: vtkIdType GetNumberOfArrays() Returns the number of vtkArray instances in the collection GetArrayV.GetArray(int) -> vtkArray C++: vtkArray *GetArray(vtkIdType index) Returns the n-th vtkArray in the collection GetArrayByNameV.GetArrayByName(string) -> vtkArray C++: vtkArray *GetArrayByName(const char *name) Returns the array having called name from the collection GetDataObjectTypeV.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return class name of data type (VTK_ARRAY_DATA). V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *other) override; Shallow and Deep copy. These copy the data, but not any of the pipeline connections. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *other) override; Shallow and Deep copy. These copy the data, but not any of the pipeline connections. vtkArrayvtkAttributesErrorMetricvtkCommonDataModelPython.vtkAttributesErrorMetricvtkAttributesErrorMetric - Objects that compute attribute-based error during cell tessellation. Superclass: vtkGenericSubdivisionErrorMetric It is a concrete error metric, based on an attribute criterium: the variation of the active attribute/component value from a linear ramp @sa vtkGenericCellTessellator vtkGenericSubdivisionErrorMetric V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard VTK type and error macros. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard VTK type and error macros. V.SafeDownCast(vtkObjectBase) -> vtkAttributesErrorMetric C++: static vtkAttributesErrorMetric *SafeDownCast( vtkObjectBase *o) Standard VTK type and error macros. V.NewInstance() -> vtkAttributesErrorMetric C++: vtkAttributesErrorMetric *NewInstance() Standard VTK type and error macros. GetAbsoluteAttributeToleranceV.GetAbsoluteAttributeTolerance() -> float C++: virtual double GetAbsoluteAttributeTolerance() Absolute tolerance of the active scalar (attribute+component). Subdivision is required if the square distance between the real attribute at the mid point on the edge and the interpolated attribute is greater than AbsoluteAttributeTolerance. This is the attribute accuracy. 0.01 will give better result than 0.1. SetAbsoluteAttributeToleranceV.SetAbsoluteAttributeTolerance(float) C++: void SetAbsoluteAttributeTolerance(double value) Set the absolute attribute accuracy to `value'. See GetAbsoluteAttributeTolerance() for details. It is particularly useful when some concrete implementation of vtkGenericAttribute does not support GetRange() request, called internally in SetAttributeTolerance(). It may happen when the implementation support higher order attributes but cannot compute the range. \pre valid_range_value: value>0 GetAttributeToleranceV.GetAttributeTolerance() -> float C++: virtual double GetAttributeTolerance() Relative tolerance of the active scalar (attribute+component). Subdivision is required if the square distance between the real attribute at the mid point on the edge and the interpolated attribute is greater than AttributeTolerance. This is the attribute accuracy. 0.01 will give better result than 0.1. SetAttributeToleranceV.SetAttributeTolerance(float) C++: void SetAttributeTolerance(double value) Set the relative attribute accuracy to `value'. See GetAttributeTolerance() for details. \pre valid_range_value: value>0 && value<1 RequiresEdgeSubdivisionV.RequiresEdgeSubdivision([float, ...], [float, ...], [float, ...], float) -> int C++: int RequiresEdgeSubdivision(double *leftPoint, double *midPoint, double *rightPoint, double alpha) override; Does the edge need to be subdivided according to the distance between the value of the active attribute/component at the midpoint and the mean value between the endpoints? The edge is defined by its `leftPoint' and its `rightPoint'. `leftPoint', `midPoint' and `rightPoint' have to be initialized before calling RequiresEdgeSubdivision(). Their format is global coordinates, parametric coordinates and point centered attributes: xyx rst abc de... `alpha' is the normalized abscissa of the midpoint along the edge. (close to 0 means close to the left point, close to 1 means close to the right point) \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 GetErrorV.GetError([float, ...], [float, ...], [float, ...], float) -> float C++: double GetError(double *leftPoint, double *midPoint, double *rightPoint, double alpha) override; Return the error at the mid-point. The type of error depends on the state of the concrete error metric. For instance, it can return an absolute or relative error metric. See RequiresEdgeSubdivision() for a description of the arguments. \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 \post positive_result: result>=0 vtkGenericSubdivisionErrorMetricvtkBiQuadraticQuadvtkCommonDataModelPython.vtkBiQuadraticQuadvtkBiQuadraticQuad - cell represents a parabolic, 9-node isoparametric quad Superclass: vtkNonLinearCell vtkQuadraticQuad is a concrete implementation of vtkNonLinearCell to represent a two-dimensional, 9-node isoparametric parabolic quadrilateral element with a Centerpoint. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node for each of the four edges of the cell and a center node at the surface. The ordering of the eight points defining the cell are point ids (0-3,4-8) where ids 0-3 define the four corner vertices of the quad; ids 4-7 define the midedge nodes (0,1), (1,2), (2,3), (3,0) and 8 define the face center node. @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticWedge vtkQuadraticPyramid vtkQuadraticQuad @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkBiQuadraticQuad C++: static vtkBiQuadraticQuad *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkBiQuadraticQuad C++: vtkBiQuadraticQuad *NewInstance() GetCellTypeV.GetCellType() -> int C++: int GetCellType() override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. GetCellDimensionV.GetCellDimension() -> int C++: int GetCellDimension() override; Return the topological dimensional of the cell (0,1,2, or 3). GetNumberOfEdgesV.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; Return the number of edges in the cell. GetNumberOfFacesV.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; Return the number of faces in the cell. GetEdgeV.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int) override; Return the edge cell from the edgeId of the cell. GetFaceV.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int) override; Return the face cell from the faceId of the cell. CellBoundaryV.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; Given parametric coordinates of a point, return the closest cell boundary, and whether the point is inside or outside of the cell. The cell boundary is defined by a list of points (pts) that specify a face (3D cell), edge (2D cell), or vertex (1D cell). If the return value of the method is != 0, then the point is inside the cell. EvaluatePositionV.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; Given a point x[3] return inside(=1), outside(=0) cell, or (-1) computational problem encountered; evaluate parametric coordinates, sub-cell id (!=0 only if cell is composite), distance squared of point x[3] to cell (in particular, the sub-cell indicated), closest point on cell to x[3] (unless closestPoint is null, in which case, the closest point and dist2 are not found), and interpolation weights in cell. (The number of weights is equal to the number of points defining the cell). Note: on rare occasions a -1 is returned from the method. This means that numerical error has occurred and all data returned from this method should be ignored. Also, inside/outside is determine parametrically. That is, a point is inside if it satisfies parametric limits. This can cause problems for cells of topological dimension 2 or less, since a point in 3D can project onto the cell within parametric limits but be "far" from the cell. Thus the value dist2 may be checked to determine true in/out. EvaluateLocationV.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; Determine global coordinate (x[3]) from subId and parametric coordinates. Also returns interpolation weights. (The number of weights is equal to the number of points in the cell.) TriangulateV.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; Generate simplices of proper dimension. If cell is 3D, tetrahedron are generated; if 2D triangles; if 1D lines; if 0D points. The form of the output is a sequence of points, each n+1 points (where n is topological cell dimension) defining a simplex. The index is a parameter that controls which triangulation to use (if more than one is possible). If numerical degeneracy encountered, 0 is returned, otherwise 1 is returned. This method does not insert new points: all the points that define the simplices are the points that define the cell. DerivativesV.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; Compute derivatives given cell subId and parametric coordinates. The values array is a series of data value(s) at the cell points. There is a one-to-one correspondence between cell point and data value(s). Dim is the number of data values per cell point. Derivs are derivatives in the x-y-z coordinate directions for each data value. Thus, if computing derivatives for a scalar function in a hexahedron, dim=1, 8 values are supplied, and 3 deriv values are returned (i.e., derivatives in x-y-z directions). On the other hand, if computing derivatives of velocity (vx,vy,vz) dim=3, 24 values are supplied ((vx,vy,vz)1, (vx,vy,vz)2, ....()8), and 9 deriv values are returned ((d(vx)/dx),(d(vx)/dy),(d(vx)/dz), (d(vy)/dx),(d(vy)/dy), (d(vy)/dz), (d(vz)/dx),(d(vz)/dy),(d(vz)/dz)). GetParametricCoordsV.GetParametricCoords() -> (float, ...) C++: double *GetParametricCoords() override; Return a contiguous array of parametric coordinates of the points defining this cell. In other words, (px,py,pz, px,py,pz, etc..) The coordinates are ordered consistent with the definition of the point ordering for the cell. This method returns a non-nullptr pointer when the cell is a primary type (i.e., IsPrimaryCell() is true). Note that 3D parametric coordinates are returned no matter what the topological dimension of the cell. ContourV.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; Generate contouring primitives. The scalar list cellScalars are scalar values at each cell point. The point locator is essentially a points list that merges points as they are inserted (i.e., prevents duplicates). Contouring primitives can be vertices, lines, or polygons. It is possible to interpolate point data along the edge by providing input and output point data - if outPd is nullptr, then no interpolation is performed. Also, if the output cell data is non-nullptr, the cell data from the contoured cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) ClipV.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this biquadratic quad using scalar value provided. Like contouring, except that it cuts the twi quads to produce linear triangles. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Line-edge intersection. Intersection has to occur within [0,1] parametric coordinates and with specified tolerance. GetParametricCenterV.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the pyramid in parametric coordinates. InterpolateFunctionsV.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[9]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) No-ops at this level. Typically overridden in subclasses. InterpolateDerivsV.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[18]) override; vtkNonLinearCellvtkCellvtkDataArrayvtkIncrementalPointLocatorvtkPointDatavtkCellDatavtkBiQuadraticQuadraticHexahedronvtkCommonDataModelPython.vtkBiQuadraticQuadraticHexahedronvtkBiQuadraticQuadraticHexahedron - cell represents a biquadratic, 24-node isoparametric hexahedron Superclass: vtkNonLinearCell vtkBiQuadraticQuadraticHexahedron is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 24-node isoparametric biquadratic hexahedron. The interpolation is the standard finite element, biquadratic-quadratic isoparametric shape function. The cell includes mid-edge and center-face nodes. The ordering of the 24 points defining the cell is point ids (0-7,8-19, 20-23) where point ids 0-7 are the eight corner vertices of the cube; followed by twelve midedge nodes (8-19), nodes 20-23 are the center-face nodes. Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,3), (3,0), (4,5), (5,6), (6,7), (7,4), (0,4), (1,5), (2,6), (3,7). The center face nodes laying in quad 22-(0,1,5,4), 21-(1,2,6,5), 23-(2,3,7,6) and 22-(3,0,4,7) top 7--14--6 | | 15 13 | | 4--12--5 middle 19--23--18 | | 20 21 | | 16--22--17 bottom 3--10--2 | | 11 9 | | 0-- 8--1 @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticQuad vtkQuadraticPyramid vtkQuadraticWedge @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkBiQuadraticQuadraticHexahedron C++: static vtkBiQuadraticQuadraticHexahedron *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkBiQuadraticQuadraticHexahedron C++: vtkBiQuadraticQuadraticHexahedron *NewInstance() V.GetCellDimension() -> int C++: int GetCellDimension() override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int) override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int) override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this biquadratic hexahedron using scalar value provided. Like contouring, except that it cuts the hex to produce linear tetrahedron. InterpolationFunctionsV.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[24]) @deprecated Replaced by vtkBiQuadraticQuadraticHexahedron::InterpolateFunctions as of VTK 5.2 InterpolationDerivsV.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[72]) @deprecated Replaced by vtkBiQuadraticQuadraticHexahedron::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[24]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[72]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) GetEdgeArrayV.GetEdgeArray(int) -> (int, ...) C++: static int *GetEdgeArray(int edgeId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. GetFaceArrayV.GetFaceArray(int) -> (int, ...) C++: static int *GetFaceArray(int faceId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. vtkBiQuadraticQuadraticWedgevtkCommonDataModelPython.vtkBiQuadraticQuadraticWedgevtkBiQuadraticQuadraticWedge - cell represents a parabolic, 18-node isoparametric wedge Superclass: vtkNonLinearCell vtkBiQuadraticQuadraticWedge is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 18-node isoparametric biquadratic wedge. The interpolation is the standard finite element, biquadratic-quadratic isoparametric shape function plus the linear functions. The cell includes a mid-edge node. The ordering of the 18 points defining the cell is point ids (0-5,6-15, 16-18) where point ids 0-5 are the six corner vertices of the wedge; followed by nine midedge nodes (6-15) and 3 center-face nodes. Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,0), (3,4), (4,5), (5,3), (0,3), (1,4), (2,5), and the center-face nodes are laying in quads 16-(0,1,4,3), 17-(1,2,5,4) and (2,0,3,5). @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticPyramid @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkBiQuadraticQuadraticWedge C++: static vtkBiQuadraticQuadraticWedge *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkBiQuadraticQuadraticWedge C++: vtkBiQuadraticQuadraticWedge *NewInstance() V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; Implement the vtkCell API. See the vtkCell API for descriptions of these methods. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic Wedge using scalar value provided. Like contouring, except that it cuts the hex to produce linear tetrahedron. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the quadratic wedge in parametric coordinates. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[15]) @deprecated Replaced by vtkBiQuadraticQuadraticWedge::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[45]) @deprecated Replaced by vtkBiQuadraticQuadraticWedge::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[15]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[45]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkBiQuadraticTrianglevtkCommonDataModelPython.vtkBiQuadraticTrianglevtkBiQuadraticTriangle - cell represents a parabolic, isoparametric triangle Superclass: vtkNonLinearCell vtkBiQuadraticTriangle is a concrete implementation of vtkNonLinearCell to represent a two-dimensional, 7-node, isoparametric parabolic triangle. The interpolation is the standard finite element, bi-quadratic isoparametric shape function. The cell includes three mid-edge nodes besides the three triangle vertices and a center node. The ordering of the three points defining the cell is point ids (0-2,3-6) where id #3 is the midedge node between points (0,1); id #4 is the midedge node between points (1,2); and id #5 is the midedge node between points (2,0). id #6 is the center node of the cell. @sa vtkTriangle vtkQuadraticTriangle vtkBiQuadraticQuad vtkBiQuadraticQuadraticWedge vtkBiQuadraticQuadraticHexahedron@par Thanks: This file has been developed by Oxalya - www.oxalya.com Copyright (c) EDF - www.edf.fr V.SafeDownCast(vtkObjectBase) -> vtkBiQuadraticTriangle C++: static vtkBiQuadraticTriangle *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkBiQuadraticTriangle C++: vtkBiQuadraticTriangle *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic triangle using scalar value provided. Like contouring, except that it cuts the triangle to produce linear triangles. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the quadratic triangle in parametric coordinates. GetParametricDistanceV.GetParametricDistance([float, float, float]) -> float C++: double GetParametricDistance(double pcoords[3]) override; Return the distance of the parametric coordinate provided to the cell. If inside the cell, a distance of zero is returned. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[7]) @deprecated Replaced by vtkBiQuadraticTriangle::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[14]) @deprecated Replaced by vtkBiQuadraticTriangle::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[7]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[14]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkBoxvtkCommonDataModelPython.vtkBoxvtkBox - implicit function for a bounding box Superclass: vtkImplicitFunction vtkBox computes the implicit function and/or gradient for a axis-aligned bounding box. (The superclasses transform can be used to modify this orientation.) Each side of the box is orthogonal to all other sides meeting along shared edges and all faces are orthogonal to the x-y-z coordinate axes. (If you wish to orient this box differently, recall that the superclass vtkImplicitFunction supports a transformation matrix.) vtkCube is a concrete implementation of vtkImplicitFunction. @sa vtkCubeSource vtkImplicitFunction V.SafeDownCast(vtkObjectBase) -> vtkBox C++: static vtkBox *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkBox C++: vtkBox *NewInstance() EvaluateFunctionV.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate function at position x-y-z and return value. You should generally not call this method directly, you should use FunctionValue() instead. This method must be implemented by any derived class. EvaluateGradientV.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate the gradient of the box. SetXMinV.SetXMin([float, float, float]) C++: void SetXMin(double p[3]) V.SetXMin(float, float, float) C++: void SetXMin(double x, double y, double z) Set / get the bounding box using various methods. GetXMinV.GetXMin([float, float, float]) C++: void GetXMin(double p[3]) V.GetXMin(float, float, float) C++: void GetXMin(double &x, double &y, double &z) Set / get the bounding box using various methods. SetXMaxV.SetXMax([float, float, float]) C++: void SetXMax(double p[3]) V.SetXMax(float, float, float) C++: void SetXMax(double x, double y, double z) GetXMaxV.GetXMax([float, float, float]) C++: void GetXMax(double p[3]) V.GetXMax(float, float, float) C++: void GetXMax(double &x, double &y, double &z) SetBoundsV.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax) V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double bounds[6]) V.GetBounds(float, float, float, float, float, float) C++: void GetBounds(double &xMin, double &xMax, double &yMin, double &yMax, double &zMin, double &zMax) V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) V.GetBounds() -> (float, float, float, float, float, float) C++: double *GetBounds() AddBoundsV.AddBounds((float, float, float, float, float, float)) C++: void AddBounds(const double bounds[6]) A special method that allows union set operation on bounding boxes. Start with a SetBounds(). Subsequent AddBounds() methods are union set operations on the original bounds. Retrieve the final bounds with a GetBounds() method. IntersectBoxV.IntersectBox([float, float, float, float, float, float], [float, float, float], [float, float, float], [float, float, float], float) -> char C++: static char IntersectBox(double bounds[6], double origin[3], double dir[3], double coord[3], double &t) Bounding box intersection with line modified from Graphics Gems Vol I. The method returns a non-zero value if the bounding box is hit. Origin[3] starts the ray, dir[3] is the vector components of the ray in the x-y-z directions, coord[3] is the location of hit, and t is the parametric coordinate along line. (Notes: the intersection ray dir[3] is NOT normalized. Valid intersections will only occur between 0<=t<=1.) V.IntersectWithLine((float, float, float, float, float, float), ( float, float, float), (float, float, float), float, float, [float, float, float], [float, float, float], int, int) -> int C++: static int IntersectWithLine(const double bounds[6], const double p1[3], const double p2[3], double &t1, double &t2, double x1[3], double x2[3], int &plane1, int &plane2) Intersect a line with the box. Give the endpoints of the line in p1 and p2. The parameteric distances from p1 to the entry and exit points are returned in t1 and t2, where t1 and t2 are clamped to the range [0,1]. The entry and exit planes are returned in plane1 and plane2 where integers (0, 1, 2, 3, 4, 5) stand for the (xmin, xmax, ymin, ymax, zmin, zmax) planes respectively, and a value of -1 means that no intersection occurred. The actual intersection coordinates are stored in x1 and x2, which can be set to nullptr of you do not need them to be returned. The function return value will be zero if the line is wholly outside of the box. IntersectWithPlaneV.IntersectWithPlane([float, float, float, float, float, float], [float, float, float], [float, float, float]) -> int C++: static int IntersectWithPlane(double bounds[6], double origin[3], double normal[3]) Plane intersection with the box. The plane is infinite in extent and defined by an origin and normal. The function indicates whether the plane intersects, not the particulars of intersection points and such. The function returns non-zero if the plane and box intersect; zero otherwise. vtkImplicitFunctionvtkBSPCutsvtkCommonDataModelPython.vtkBSPCutsvtkBSPCuts - This class represents an axis-aligned Binary Spatial Partitioning of a 3D space. Superclass: vtkDataObject This class converts between the vtkKdTree representation of a tree of vtkKdNodes (used by vtkDistributedDataFilter) and a compact array representation that might be provided by a graph partitioning library like Zoltan. Such a representation could be used in message passing. @sa vtkKdTree vtkKdNode vtkDistributedDataFilter V.SafeDownCast(vtkObjectBase) -> vtkBSPCuts C++: static vtkBSPCuts *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkBSPCuts C++: vtkBSPCuts *NewInstance() CreateCutsV.CreateCuts([float, ...], int, [int, ...], [float, ...], [int, ...], [int, ...], [float, ...], [float, ...], [int, ...]) C++: void CreateCuts(double *bounds, int ncuts, int *dim, double *coord, int *lower, int *upper, double *lowerDataCoord, double *upperDataCoord, int *npoints) V.CreateCuts(vtkKdNode) C++: void CreateCuts(vtkKdNode *kd) Initialize the cuts with arrays of information. This type of information would be obtained from a graph partitioning software package like Zoltan. * bounds - the bounds (xmin, xmax, ymin, ymax, zmin, zmax) of the * space being partitioned * ncuts - the number cuts, also the size of the following arrays * dim - the dimension along which the cut is made (x/y/z - 0/1/2) * coord - the location of the cut along the axis * lower - array index for the lower region bounded by the cut * upper - array index for the upper region bounded by the cut * lowerDataCoord - optional upper bound of the data in the lower region * upperDataCoord - optional lower bound of the data in the upper region * npoints - optional number of points in the spatial region GetKdNodeTreeV.GetKdNodeTree() -> vtkKdNode C++: vtkKdNode *GetKdNodeTree() Return a tree of vtkKdNode's representing the cuts specified in this object. This is our copy, don't delete it. GetNumberOfCutsV.GetNumberOfCuts() -> int C++: virtual int GetNumberOfCuts() Get the number of cuts in the partitioning, which also the size of the arrays in the array representation of the partitioning. GetArraysV.GetArrays(int, [int, ...], [float, ...], [int, ...], [int, ...], [float, ...], [float, ...], [int, ...]) -> int C++: int GetArrays(int len, int *dim, double *coord, int *lower, int *upper, double *lowerDataCoord, double *upperDataCoord, int *npoints) Get the arrays representing the cuts in the partitioning. EqualsV.Equals(vtkBSPCuts, float) -> int C++: int Equals(vtkBSPCuts *other, double tolerance=0.0) Compare these cuts with those of the other tree. Returns true if the two trees are the same. PrintTreeV.PrintTree() C++: void PrintTree() PrintArraysV.PrintArrays() C++: void PrintArrays() V.GetData(vtkInformation) -> vtkBSPCuts C++: static vtkBSPCuts *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkBSPCuts C++: static vtkBSPCuts *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. V.Initialize() C++: void Initialize() override; Restore data object to initial state, V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Shallow copy. These copy the data, but not any of the pipeline connections. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Shallow copy. These copy the data, but not any of the pipeline connections. vtkKdNodevtkBSPIntersectionsvtkCommonDataModelPython.vtkBSPIntersectionsvtkBSPIntersections - Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitioning. Superclass: vtkObject Given an axis aligned binary spatial partitioning described by a vtkBSPCuts object, perform intersection queries on various geometric entities with regions of the spatial partitioning. @sa vtkBSPCuts vtkKdTree V.SafeDownCast(vtkObjectBase) -> vtkBSPIntersections C++: static vtkBSPIntersections *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkBSPIntersections C++: vtkBSPIntersections *NewInstance() SetCutsV.SetCuts(vtkBSPCuts) C++: void SetCuts(vtkBSPCuts *cuts) Define the binary spatial partitioning. GetCutsV.GetCuts() -> vtkBSPCuts C++: virtual vtkBSPCuts *GetCuts() V.GetBounds([float, ...]) -> int C++: int GetBounds(double *bounds) Get the bounds of the whole space (xmin, xmax, ymin, ymax, zmin, zmax) Return 0 if OK, 1 on error. GetNumberOfRegionsV.GetNumberOfRegions() -> int C++: int GetNumberOfRegions() The number of regions in the binary spatial partitioning GetRegionBoundsV.GetRegionBounds(int, [float, float, float, float, float, float]) -> int C++: int GetRegionBounds(int regionID, double bounds[6]) Get the spatial bounds of a particular region Return 0 if OK, 1 on error. GetRegionDataBoundsV.GetRegionDataBounds(int, [float, float, float, float, float, float]) -> int C++: int GetRegionDataBounds(int regionID, double bounds[6]) Get the bounds of the data within the k-d tree region, possibly smaller than the bounds of the region. Return 0 if OK, 1 on error. IntersectsBoxV.IntersectsBox(int, [float, ...]) -> int C++: int IntersectsBox(int regionId, double *x) V.IntersectsBox(int, float, float, float, float, float, float) -> int C++: int IntersectsBox(int regionId, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax) V.IntersectsBox([int, ...], int, [float, ...]) -> int C++: int IntersectsBox(int *ids, int len, double *x) V.IntersectsBox([int, ...], int, float, float, float, float, float, float) -> int C++: int IntersectsBox(int *ids, int len, double x0, double x1, double y0, double y1, double z0, double z1) Determine whether a region of the spatial decomposition intersects an axis aligned box. IntersectsSphere2V.IntersectsSphere2(int, float, float, float, float) -> int C++: int IntersectsSphere2(int regionId, double x, double y, double z, double rSquared) V.IntersectsSphere2([int, ...], int, float, float, float, float) -> int C++: int IntersectsSphere2(int *ids, int len, double x, double y, double z, double rSquared) Determine whether a region of the spatial decomposition intersects a sphere, given the center of the sphere and the square of it's radius. IntersectsCellV.IntersectsCell(int, vtkCell, int) -> int C++: int IntersectsCell(int regionId, vtkCell *cell, int cellRegion=-1) V.IntersectsCell([int, ...], int, vtkCell, int) -> int C++: int IntersectsCell(int *ids, int len, vtkCell *cell, int cellRegion=-1) Determine whether a region of the spatial decomposition intersects the given cell. If you already know the region that the cell centroid lies in, provide that as the last argument to make the computation quicker. GetComputeIntersectionsUsingDataBoundsV.GetComputeIntersectionsUsingDataBounds() -> int C++: virtual int GetComputeIntersectionsUsingDataBounds() When computing the intersection of k-d tree regions with other objects, we use the spatial bounds of the region. To use the tighter bound of the bounding box of the data within the region, set this variable ON. (Specifying data bounds in the vtkBSPCuts object is optional. If data bounds were not specified, this option has no meaning.) SetComputeIntersectionsUsingDataBoundsV.SetComputeIntersectionsUsingDataBounds(int) C++: void SetComputeIntersectionsUsingDataBounds(int c) ComputeIntersectionsUsingDataBoundsOnV.ComputeIntersectionsUsingDataBoundsOn() C++: void ComputeIntersectionsUsingDataBoundsOn() ComputeIntersectionsUsingDataBoundsOffV.ComputeIntersectionsUsingDataBoundsOff() C++: void ComputeIntersectionsUsingDataBoundsOff() @iV|i *vtkCell@PiV|i *i *vtkCellvtkCell3DvtkCommonDataModelPython.vtkCell3DvtkCell3D - abstract class to specify 3D cell interface Superclass: vtkCell vtkCell3D is an abstract class that extends the interfaces for 3D data cells, and implements methods needed to satisfy the vtkCell API. The 3D cells include hexehedra, tetrahedra, wedge, pyramid, and voxel. @sa vtkTetra vtkHexahedron vtkVoxel vtkWedge vtkPyramid V.SafeDownCast(vtkObjectBase) -> vtkCell3D C++: static vtkCell3D *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCell3D C++: vtkCell3D *NewInstance() GetEdgePointsV.GetEdgePoints(int, [int, ...]) C++: virtual void GetEdgePoints(int edgeId, int *&pts) Get the pair of vertices that define an edge. The method returns the number of vertices, along with an array of vertices. Note that the vertices are 0-offset; that is, they refer to the ids of the cell, not the point ids of the mesh that the cell belongs to. The edgeId must range between 0<=edgeIdGetNumberOfEdges(). GetFacePointsV.GetFacePoints(int, [int, ...]) C++: virtual void GetFacePoints(int faceId, int *&pts) Get the list of vertices that define a face. The list is terminated with a negative number. Note that the vertices are 0-offset; that is, they refer to the ids of the cell, not the point ids of the mesh that the cell belongs to. The faceId must range between 0<=faceIdGetNumberOfFaces(). V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Cut (or clip) the cell based on the input cellScalars and the specified value. The output of the clip operation will be one or more cells of the same topological dimension as the original cell. The flag insideOut controls what part of the cell is considered inside - normally cell points whose scalar value is greater than "value" are considered inside. If insideOut is on, this is reversed. Also, if the output cell data is non-nullptr, the cell data from the clipped cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) (Satisfies vtkCell API.) V.GetCellDimension() -> int C++: int GetCellDimension() override; The topological dimension of the cell. (Satisfies vtkCell API.) SetMergeToleranceV.SetMergeTolerance(float) C++: virtual void SetMergeTolerance(double _arg) Set the tolerance for merging clip intersection points that are near the vertices of cells. This tolerance is used to prevent the generation of degenerate tetrahedra during clipping. GetMergeToleranceMinValueV.GetMergeToleranceMinValue() -> float C++: virtual double GetMergeToleranceMinValue() Set the tolerance for merging clip intersection points that are near the vertices of cells. This tolerance is used to prevent the generation of degenerate tetrahedra during clipping. GetMergeToleranceMaxValueV.GetMergeToleranceMaxValue() -> float C++: virtual double GetMergeToleranceMaxValue() Set the tolerance for merging clip intersection points that are near the vertices of cells. This tolerance is used to prevent the generation of degenerate tetrahedra during clipping. GetMergeToleranceV.GetMergeTolerance() -> float C++: virtual double GetMergeTolerance() Set the tolerance for merging clip intersection points that are near the vertices of cells. This tolerance is used to prevent the generation of degenerate tetrahedra during clipping. vtkCommonDataModelPython.vtkCellArrayvtkCellArray - object to represent cell connectivity Superclass: vtkObject vtkCellArray is a supporting object that explicitly represents cell connectivity. The cell array structure is a raw integer list of the form: (n,id1,id2,...,idn, n,id1,id2,...,idn, ...) where n is the number of points in the cell, and id is a zero-offset index into an associated point list. Advantages of this data structure are its compactness, simplicity, and easy interface to external data. However, it is totally inadequate for random access. This functionality (when necessary) is accomplished by using the vtkCellTypes and vtkCellLinks objects to extend the definition of the data structure. @sa vtkCellTypes vtkCellLinks V.SafeDownCast(vtkObjectBase) -> vtkCellArray C++: static vtkCellArray *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCellArray C++: vtkCellArray *NewInstance() AllocateV.Allocate(int, int) -> int C++: int Allocate(vtkIdType sz, vtkIdType ext=1000) Allocate memory and set the size to extend by. V.Initialize() C++: void Initialize() Free any memory and reset to an empty state. V.GetNumberOfCells() -> int C++: virtual vtkIdType GetNumberOfCells() Get the number of cells in the array. SetNumberOfCellsV.SetNumberOfCells(int) C++: virtual void SetNumberOfCells(vtkIdType _arg) Set the number of cells in the array. DO NOT do any kind of allocation, advanced use only. EstimateSizeV.EstimateSize(int, int) -> int C++: vtkIdType EstimateSize(vtkIdType numCells, int maxPtsPerCell) Utility routines help manage memory of cell array. EstimateSize() returns a value used to initialize and allocate memory for array based on number of cells and maximum number of points making up cell. If every cell is the same size (in terms of number of points), then the memory estimate is guaranteed exact. (If not exact, use Squeeze() to reclaim any extra memory.) InitTraversalV.InitTraversal() C++: void InitTraversal() A cell traversal methods that is more efficient than vtkDataSet traversal methods. InitTraversal() initializes the traversal of the list of cells. GetNextCellV.GetNextCell(int, [int, ...]) -> int C++: int GetNextCell(vtkIdType &npts, vtkIdType *&pts) V.GetNextCell(vtkIdList) -> int C++: int GetNextCell(vtkIdList *pts) A cell traversal methods that is more efficient than vtkDataSet traversal methods. GetNextCell() gets the next cell in the list. If end of list is encountered, 0 is returned. A value of 1 is returned whenever npts and pts have been updated without error. GetSizeV.GetSize() -> int C++: vtkIdType GetSize() Get the size of the allocated connectivity array. GetNumberOfConnectivityEntriesV.GetNumberOfConnectivityEntries() -> int C++: vtkIdType GetNumberOfConnectivityEntries() Get the total number of entries (i.e., data values) in the connectivity array. This may be much less than the allocated size (i.e., return value from GetSize().) GetCellV.GetCell(int, int, [int, ...]) C++: void GetCell(vtkIdType loc, vtkIdType &npts, vtkIdType *&pts) V.GetCell(int, vtkIdList) C++: void GetCell(vtkIdType loc, vtkIdList *pts) Internal method used to retrieve a cell given an offset into the internal array. InsertNextCellV.InsertNextCell(vtkCell) -> int C++: vtkIdType InsertNextCell(vtkCell *cell) V.InsertNextCell(int, (int, ...)) -> int C++: vtkIdType InsertNextCell(vtkIdType npts, const vtkIdType *pts) V.InsertNextCell(vtkIdList) -> int C++: vtkIdType InsertNextCell(vtkIdList *pts) V.InsertNextCell(int) -> int C++: vtkIdType InsertNextCell(int npts) Insert a cell object. Return the cell id of the cell. InsertCellPointV.InsertCellPoint(int) C++: void InsertCellPoint(vtkIdType id) Used in conjunction with InsertNextCell(int npts) to add another point to the list of cells. UpdateCellCountV.UpdateCellCount(int) C++: void UpdateCellCount(int npts) Used in conjunction with InsertNextCell(int npts) and InsertCellPoint() to update the number of points defining the cell. GetInsertLocationV.GetInsertLocation(int) -> int C++: vtkIdType GetInsertLocation(int npts) Computes the current insertion location within the internal array. Used in conjunction with GetCell(int loc,...). GetTraversalLocationV.GetTraversalLocation() -> int C++: vtkIdType GetTraversalLocation() V.GetTraversalLocation(int) -> int C++: vtkIdType GetTraversalLocation(vtkIdType npts) Get/Set the current traversal location. SetTraversalLocationV.SetTraversalLocation(int) C++: void SetTraversalLocation(vtkIdType loc) ReverseCellV.ReverseCell(int) C++: void ReverseCell(vtkIdType loc) Special method inverts ordering of current cell. Must be called carefully or the cell topology may be corrupted. ReplaceCellV.ReplaceCell(int, int, (int, ...)) C++: void ReplaceCell(vtkIdType loc, int npts, const vtkIdType *pts) Replace the point ids of the cell with a different list of point ids. Calling this method does not mark the vtkCellArray as modified. This is the responsibility of the caller and may be done after multiple calls to ReplaceCell. GetMaxCellSizeV.GetMaxCellSize() -> int C++: int GetMaxCellSize() Returns the size of the largest cell. The size is the number of points defining the cell. GetPointerV.GetPointer() -> (int, ...) C++: vtkIdType *GetPointer() Get pointer to array of cell data. WritePointerV.WritePointer(int, int) -> (int, ...) C++: vtkIdType *WritePointer(const vtkIdType ncells, const vtkIdType size) Get pointer to data array for purpose of direct writes of data. Size is the total storage consumed by the cell array. ncells is the number of cells represented in the array. SetCellsV.SetCells(int, vtkIdTypeArray) C++: void SetCells(vtkIdType ncells, vtkIdTypeArray *cells) Define multiple cells by providing a connectivity list. The list is in the form (npts,p0,p1,...p(npts-1), repeated for each cell). Be careful using this method because it discards the old cells, and anything referring these cells becomes invalid (for example, if BuildCells() has been called see vtkPolyData). The traversal location is reset to the beginning of the list; the insertion location is set to the end of the list. V.DeepCopy(vtkCellArray) C++: void DeepCopy(vtkCellArray *ca) Perform a deep copy (no reference counting) of the given cell array. V.GetData() -> vtkIdTypeArray C++: vtkIdTypeArray *GetData() Return the underlying data as a data array. ResetV.Reset() C++: void Reset() Reuse list. Reset to initial condition. SqueezeV.Squeeze() C++: void Squeeze() Reclaim any extra memory. GetActualMemorySizeV.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() Return the memory in kibibytes (1024 bytes) consumed by this cell array. Used to support streaming and reading/writing data. The value returned is guaranteed to be greater than or equal to the memory required to actually represent the data represented by this object. The information returned is valid only after the pipeline has been updated. 0 <= loc && loc < GetSize()@V *vtkCell@V *vtkIdList@ivtkIdTypeArrayVTK_CELL_SIZEVTK_TOLvtkCommonDataModelPython.vtkCellvtkCell - abstract class to specify cell behavior Superclass: vtkObject vtkCell is an abstract class that specifies the interfaces for data cells. Data cells are simple topological elements like points, lines, polygons, and tetrahedra of which visualization datasets are composed. In some cases visualization datasets may explicitly represent cells (e.g., vtkPolyData, vtkUnstructuredGrid), and in some cases, the datasets are implicitly composed of cells (e.g., vtkStructuredPoints). @warning The #define VTK_CELL_SIZE is a parameter used to construct cells and provide a general guideline for controlling object execution. This parameter is not a hard boundary: you can create cells with more points. @sa vtkHexahedron vtkLine vtkPixel vtkPolyLine vtkPolyVertex vtkPolygon vtkQuad vtkTetra vtkTriangle vtkTriangleStrip vtkVertex vtkVoxel vtkWedge vtkPyramid V.SafeDownCast(vtkObjectBase) -> vtkCell C++: static vtkCell *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCell C++: vtkCell *NewInstance() V.Initialize(int, [int, ...], vtkPoints) C++: void Initialize(int npts, vtkIdType *pts, vtkPoints *p) V.Initialize(int, vtkPoints) C++: void Initialize(int npts, vtkPoints *p) V.Initialize() C++: virtual void Initialize() Initialize cell from outside with point ids and point coordinates specified. V.ShallowCopy(vtkCell) C++: virtual void ShallowCopy(vtkCell *c) Copy this cell by reference counting the internal data structures. This is safe if you want a "read-only" copy. If you modify the cell you might wish to use DeepCopy(). V.DeepCopy(vtkCell) C++: virtual void DeepCopy(vtkCell *c) Copy this cell by completely copying internal data structures. This is slower but safer than ShallowCopy(). V.GetCellType() -> int C++: virtual int GetCellType() Return the type of cell. V.GetCellDimension() -> int C++: virtual int GetCellDimension() Return the topological dimensional of the cell (0,1,2, or 3). IsLinearV.IsLinear() -> int C++: virtual int IsLinear() Non-linear cells require special treatment beyond the usual cell type and connectivity list information. Most cells in VTK are implicit cells. RequiresInitializationV.RequiresInitialization() -> int C++: virtual int RequiresInitialization() Some cells require initialization prior to access. For example, they may have to triangulate themselves or set up internal data structures. IsExplicitCellV.IsExplicitCell() -> int C++: virtual int IsExplicitCell() Explicit cells require additional representational information beyond the usual cell type and connectivity list information. Most cells in VTK are implicit cells. RequiresExplicitFaceRepresentationV.RequiresExplicitFaceRepresentation() -> int C++: virtual int RequiresExplicitFaceRepresentation() Determine whether the cell requires explicit face representation, and methods for setting and getting the faces (see vtkPolyhedron for example usage of these methods). SetFacesV.SetFaces([int, ...]) C++: virtual void SetFaces(vtkIdType *faces) GetFacesV.GetFaces() -> (int, ...) C++: virtual vtkIdType *GetFaces() GetPointsV.GetPoints() -> vtkPoints C++: vtkPoints *GetPoints() Get the point coordinates for the cell. GetNumberOfPointsV.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() Return the number of points in the cell. V.GetNumberOfEdges() -> int C++: virtual int GetNumberOfEdges() Return the number of edges in the cell. V.GetNumberOfFaces() -> int C++: virtual int GetNumberOfFaces() Return the number of faces in the cell. GetPointIdsV.GetPointIds() -> vtkIdList C++: vtkIdList *GetPointIds() Return the list of point ids defining the cell. GetPointIdV.GetPointId(int) -> int C++: vtkIdType GetPointId(int ptId) For cell point i, return the actual point id. V.GetEdge(int) -> vtkCell C++: virtual vtkCell *GetEdge(int edgeId) Return the edge cell from the edgeId of the cell. V.GetFace(int) -> vtkCell C++: virtual vtkCell *GetFace(int faceId) Return the face cell from the faceId of the cell. V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: virtual int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) Given parametric coordinates of a point, return the closest cell boundary, and whether the point is inside or outside of the cell. The cell boundary is defined by a list of points (pts) that specify a face (3D cell), edge (2D cell), or vertex (1D cell). If the return value of the method is != 0, then the point is inside the cell. V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: virtual int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) Given a point x[3] return inside(=1), outside(=0) cell, or (-1) computational problem encountered; evaluate parametric coordinates, sub-cell id (!=0 only if cell is composite), distance squared of point x[3] to cell (in particular, the sub-cell indicated), closest point on cell to x[3] (unless closestPoint is null, in which case, the closest point and dist2 are not found), and interpolation weights in cell. (The number of weights is equal to the number of points defining the cell). Note: on rare occasions a -1 is returned from the method. This means that numerical error has occurred and all data returned from this method should be ignored. Also, inside/outside is determine parametrically. That is, a point is inside if it satisfies parametric limits. This can cause problems for cells of topological dimension 2 or less, since a point in 3D can project onto the cell within parametric limits but be "far" from the cell. Thus the value dist2 may be checked to determine true in/out. V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: virtual void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) Determine global coordinate (x[3]) from subId and parametric coordinates. Also returns interpolation weights. (The number of weights is equal to the number of points in the cell.) V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: virtual void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) Generate contouring primitives. The scalar list cellScalars are scalar values at each cell point. The point locator is essentially a points list that merges points as they are inserted (i.e., prevents duplicates). Contouring primitives can be vertices, lines, or polygons. It is possible to interpolate point data along the edge by providing input and output point data - if outPd is nullptr, then no interpolation is performed. Also, if the output cell data is non-nullptr, the cell data from the contoured cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: virtual void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) Cut (or clip) the cell based on the input cellScalars and the specified value. The output of the clip operation will be one or more cells of the same topological dimension as the original cell. The flag insideOut controls what part of the cell is considered inside - normally cell points whose scalar value is greater than "value" are considered inside. If insideOut is on, this is reversed. Also, if the output cell data is non-nullptr, the cell data from the clipped cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) Intersect with a ray. Return parametric coordinates (both line and cell) and global intersection coordinates, given ray definition p1[3], p2[3] and tolerance tol. The method returns non-zero value if intersection occurs. A parametric distance t between 0 and 1 along the ray representing the intersection point, the point coordinates x[3] in data coordinates and also pcoords[3] in parametric coordinates. subId is the index within the cell if a composed cell like a triangle strip. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: virtual int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) Generate simplices of proper dimension. If cell is 3D, tetrahedron are generated; if 2D triangles; if 1D lines; if 0D points. The form of the output is a sequence of points, each n+1 points (where n is topological cell dimension) defining a simplex. The index is a parameter that controls which triangulation to use (if more than one is possible). If numerical degeneracy encountered, 0 is returned, otherwise 1 is returned. This method does not insert new points: all the points that define the simplices are the points that define the cell. V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: virtual void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) Compute derivatives given cell subId and parametric coordinates. The values array is a series of data value(s) at the cell points. There is a one-to-one correspondence between cell point and data value(s). Dim is the number of data values per cell point. Derivs are derivatives in the x-y-z coordinate directions for each data value. Thus, if computing derivatives for a scalar function in a hexahedron, dim=1, 8 values are supplied, and 3 deriv values are returned (i.e., derivatives in x-y-z directions). On the other hand, if computing derivatives of velocity (vx,vy,vz) dim=3, 24 values are supplied ((vx,vy,vz)1, (vx,vy,vz)2, ....()8), and 9 deriv values are returned ((d(vx)/dx),(d(vx)/dy),(d(vx)/dz), (d(vy)/dx),(d(vy)/dy), (d(vy)/dz), (d(vz)/dx),(d(vz)/dy),(d(vz)/dz)). V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) V.GetBounds() -> (float, float, float, float, float, float) C++: double *GetBounds() Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Copy result into user provided array. GetLength2V.GetLength2() -> float C++: double GetLength2() Compute Length squared of cell (i.e., bounding box diagonal squared). V.GetParametricCenter([float, float, float]) -> int C++: virtual int GetParametricCenter(double pcoords[3]) Return center of the cell in parametric coordinates. Note that the parametric center is not always located at (0.5,0.5,0.5). The return value is the subId that the center is in (if a composite cell). If you want the center in x-y-z space, invoke the EvaluateLocation() method. V.GetParametricDistance([float, float, float]) -> float C++: virtual double GetParametricDistance(double pcoords[3]) Return the distance of the parametric coordinate provided to the cell. If inside the cell, a distance of zero is returned. This is used during picking to get the correct cell picked. (The tolerance will occasionally allow cells to be picked who are not really intersected "inside" the cell.) IsPrimaryCellV.IsPrimaryCell() -> int C++: virtual int IsPrimaryCell() Return whether this cell type has a fixed topology or whether the topology varies depending on the data (e.g., vtkConvexPointSet). This compares to composite cells that are typically composed of primary cells (e.g., a triangle strip composite cell is made up of triangle primary cells). V.GetParametricCoords() -> (float, ...) C++: virtual double *GetParametricCoords() Return a contiguous array of parametric coordinates of the points defining this cell. In other words, (px,py,pz, px,py,pz, etc..) The coordinates are ordered consistent with the definition of the point ordering for the cell. This method returns a non-nullptr pointer when the cell is a primary type (i.e., IsPrimaryCell() is true). Note that 3D parametric coordinates are returned no matter what the topological dimension of the cell. V.InterpolateFunctions([float, float, float], [float, ...]) C++: virtual void InterpolateFunctions(double pcoords[3], double *weight) Compute the interpolation functions/derivatives (aka shape functions/derivatives) No-ops at this level. Typically overridden in subclasses. V.InterpolateDerivs([float, float, float], [float, ...]) C++: virtual void InterpolateDerivs(double pcoords[3], double *derivs) 0 <= ptId && ptId < GetPointIds()->GetNumberOfIds()vtkCommonDataModelPython.vtkCellDatavtkCellData - represent and manipulate cell attribute data Superclass: vtkDataSetAttributes vtkCellData is a class that is used to represent and manipulate cell attribute data (e.g., scalars, vectors, normals, texture coordinates, etc.) Special methods are provided to work with filter objects, such as passing data through filter, copying data from one cell to another, and interpolating data given cell interpolation weights. V.SafeDownCast(vtkObjectBase) -> vtkCellData C++: static vtkCellData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCellData C++: vtkCellData *NewInstance() vtkDataSetAttributesvtkFieldDatavtkCellIteratorvtkCommonDataModelPython.vtkCellIteratorvtkCellIterator - Efficient cell iterator for vtkDataSet topologies. Superclass: vtkObject vtkCellIterator provides a method for traversing cells in a data set. Call the vtkDataSet::NewCellIterator() method to use this class. The cell is represented as a set of three pieces of information: The cell type, the ids of the points constituting the cell, and the points themselves. This iterator fetches these as needed. If only the cell type is used, the type is not looked up until GetCellType is called, and the point information is left uninitialized. This allows efficient screening of cells, since expensive point lookups may be skipped depending on the cell type/etc. An example usage of this class: ~~~ void myWorkerFunction(vtkDataSet *ds) { vtkCellIterator *it = ds->NewCellIterator(); for (it->InitTraversal(); !it->IsDoneWithTraversal(); it->GoToNextCell()) { if (it->GetCellType() != VTK_TETRA) { continue; // Skip non-tetrahedral cells } vtkIdList *pointIds = it->GetPointIds(); // Do screening on the point ids, maybe figure out scalar range and skip cells that do not lie in a certain range? vtkPoints *points = it->GetPoints(); // Do work using the cell points, or ... vtkGenericCell *cell = ...; it->GetCell(cell); // ... do work with a vtkCell. } it->Delete(); } ~~~ The example above pulls in bits of information as needed to filter out cells that aren't relevant. The least expensive lookups are performed first (cell type, then point ids, then points/full cell) to prevent wasted cycles fetching unnecessary data. Also note that at the end of the loop, the iterator must be deleted as these iterators are vtkObject subclasses. V.SafeDownCast(vtkObjectBase) -> vtkCellIterator C++: static vtkCellIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCellIterator C++: vtkCellIterator *NewInstance() V.InitTraversal() C++: void InitTraversal() Reset to the first cell. GoToNextCellV.GoToNextCell() C++: void GoToNextCell() Increment to next cell. Always safe to call. IsDoneWithTraversalV.IsDoneWithTraversal() -> bool C++: virtual bool IsDoneWithTraversal() Returns false while the iterator is valid. Always safe to call. V.GetCellType() -> int C++: int GetCellType() Get the current cell type (e.g. VTK_LINE, VTK_VERTEX, VTK_TETRA, etc). This should only be called when IsDoneWithTraversal() returns false. V.GetCellDimension() -> int C++: int GetCellDimension() Get the current cell dimension (0, 1, 2, or 3). This should only be called when IsDoneWithTraversal() returns false. GetCellIdV.GetCellId() -> int C++: virtual vtkIdType GetCellId() Get the id of the current cell. V.GetPointIds() -> vtkIdList C++: vtkIdList *GetPointIds() Get the ids of the points in the current cell. This should only be called when IsDoneWithTraversal() returns false. V.GetPoints() -> vtkPoints C++: vtkPoints *GetPoints() Get the points in the current cell. This is usually a very expensive call, and should be avoided when possible. This should only be called when IsDoneWithTraversal() returns false. V.GetFaces() -> vtkIdList C++: vtkIdList *GetFaces() Get the faces for a polyhedral cell. This is only valid when CellType is VTK_POLYHEDRON. V.GetCell(vtkGenericCell) C++: void GetCell(vtkGenericCell *cell) Write the current full cell information into the argument. This is usually a very expensive call, and should be avoided when possible. This should only be called when IsDoneWithTraversal() returns false. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() Return the number of points in the current cell. This should only be called when IsDoneWithTraversal() returns false. V.GetNumberOfFaces() -> int C++: vtkIdType GetNumberOfFaces() Return the number of faces in the current cell. This should only be called when IsDoneWithTraversal() returns false. Generic Warning: In /Volumes/Data/workspace/med-macos-free/ExtProjs/VTK/Common/DataModel/vtkCellIterator.h, line Unknown cell type: vtkCellLinksvtkCommonDataModelPython.vtkCellLinksvtkCellLinks - object represents upward pointers from points to list of cells using each point Superclass: vtkAbstractCellLinks vtkCellLinks is a supplemental object to vtkCellArray and vtkCellTypes, enabling access from points to the cells using the points. vtkCellLinks is a list of cell ids, each such link representing a dynamic list of cell ids using the point. The information provided by this object can be used to determine neighbors and construct other local topological information. @warning Note that this class is designed to support incremental link construction. More efficient cell links structures can be built with vtkStaticCellLinks (and vtkStaticCellLinksTemplate). However these other classes are typically meant for one-time (static) construction. @sa vtkCellArray vtkCellTypes vtkStaticCellLinks vtkStaticCellLinksTemplate V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard methods to instantiate, print, and obtain type information. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard methods to instantiate, print, and obtain type information. V.SafeDownCast(vtkObjectBase) -> vtkCellLinks C++: static vtkCellLinks *SafeDownCast(vtkObjectBase *o) Standard methods to instantiate, print, and obtain type information. V.NewInstance() -> vtkCellLinks C++: vtkCellLinks *NewInstance() Standard methods to instantiate, print, and obtain type information. V.BuildLinks(vtkDataSet) C++: void BuildLinks(vtkDataSet *data) override; V.BuildLinks(vtkDataSet, vtkCellArray) C++: void BuildLinks(vtkDataSet *data, vtkCellArray *Connectivity) Build the link list array. All subclasses of vtkAbstractCellLinks must support this method. V.Allocate(int, int) C++: void Allocate(vtkIdType numLinks, vtkIdType ext=1000) Allocate the specified number of links (i.e., number of points) that will be built. V.Initialize() C++: void Initialize() Clear out any previously allocated data structures GetNcellsV.GetNcells(int) -> int C++: unsigned short GetNcells(vtkIdType ptId) Get the number of cells using the point specified by ptId. GetCellsV.GetCells(int) -> (int, ...) C++: vtkIdType *GetCells(vtkIdType ptId) Return a list of cell ids using the point. InsertNextPointV.InsertNextPoint(int) -> int C++: vtkIdType InsertNextPoint(int numLinks) Insert a new point into the cell-links data structure. The size parameter is the initial size of the list. InsertNextCellReferenceV.InsertNextCellReference(int, int) C++: void InsertNextCellReference(vtkIdType ptId, vtkIdType cellId) Insert a cell id into the list of cells (at the end) using the cell id provided. (Make sure to extend the link list (if necessary) using the method ResizeCellList().) DeletePointV.DeletePoint(int) C++: void DeletePoint(vtkIdType ptId) Delete point (and storage) by destroying links to using cells. RemoveCellReferenceV.RemoveCellReference(int, int) C++: void RemoveCellReference(vtkIdType cellId, vtkIdType ptId) Delete the reference to the cell (cellId) from the point (ptId). This removes the reference to the cellId from the cell list, but does not resize the list (recover memory with ResizeCellList(), if necessary). AddCellReferenceV.AddCellReference(int, int) C++: void AddCellReference(vtkIdType cellId, vtkIdType ptId) Add the reference to the cell (cellId) from the point (ptId). This adds a reference to the cellId from the cell list, but does not resize the list (extend memory with ResizeCellList(), if necessary). ResizeCellListV.ResizeCellList(int, int) C++: void ResizeCellList(vtkIdType ptId, int size) Change the length of a point's link list (i.e., list of cells using a point) by the size specified. V.Squeeze() C++: void Squeeze() Reclaim any unused memory. V.Reset() C++: void Reset() Reset to a state of no entries without freeing the memory. V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() Return the memory in kibibytes (1024 bytes) consumed by this cell links array. Used to support streaming and reading/writing data. The value returned is guaranteed to be greater than or equal to the memory required to actually represent the data represented by this object. The information returned is valid only after the pipeline has been updated. V.DeepCopy(vtkCellLinks) C++: void DeepCopy(vtkCellLinks *src) Standard DeepCopy method. Since this object contains no reference to other objects, there is no ShallowCopy. vtkCellLocatorvtkCommonDataModelPython.vtkCellLocatorvtkCellLocator - octree-based spatial search object to quickly locate cells Superclass: vtkAbstractCellLocator vtkCellLocator is a spatial search object to quickly locate cells in 3D. vtkCellLocator uses a uniform-level octree subdivision, where each octant (an octant is also referred to as a bucket) carries an indication of whether it is empty or not, and each leaf octant carries a list of the cells inside of it. (An octant is not empty if it has one or more cells inside of it.) Typical operations are intersection with a line to return candidate cells, or intersection with another vtkCellLocator to return candidate cells. @warning Many other types of spatial locators have been developed, such as variable depth octrees and kd-trees. These are often more efficient for the operations described here. vtkCellLocator has been designed for subclassing; so these locators can be derived if necessary. @sa vtkLocator vtkPointLocator vtkOBBTree V.SafeDownCast(vtkObjectBase) -> vtkCellLocator C++: static vtkCellLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkCellLocator C++: vtkCellLocator *NewInstance() Standard type and print methods. SetNumberOfCellsPerBucketV.SetNumberOfCellsPerBucket(int) C++: void SetNumberOfCellsPerBucket(int N) Specify the average number of cells in each octant. GetNumberOfCellsPerBucketV.GetNumberOfCellsPerBucket() -> int C++: int GetNumberOfCellsPerBucket() V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int, vtkGenericCell) -> int C++: int IntersectWithLine(double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) override; V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) V.IntersectWithLine((float, float, float), (float, float, float), vtkPoints, vtkIdList) -> int C++: virtual int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell. For other IntersectWithLine signatures, see vtkAbstractCellLocator V.FindClosestPoint([float, float, float], [float, float, float], vtkGenericCell, int, int, float) C++: void FindClosestPoint(double x[3], double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) override; V.FindClosestPoint([float, float, float], [float, float, float], int, int, float) C++: virtual void FindClosestPoint(double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a cell is found, "cell" contains the points and ptIds for the cell "cellId" upon exit. V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float, int) -> int C++: vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2, int &inside) override; V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and dealloction can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit. If a closest point is found, inside returns the return value of the EvaluatePosition call to the closest cell; inside(=1) or outside(=0). For other FindClosestPointWithinRadius signatures, see vtkAbstractCellLocator V.GetCells(int) -> vtkIdList C++: virtual vtkIdList *GetCells(int bucket) Get the cells in a particular bucket. V.GetNumberOfBuckets() -> int C++: virtual int GetNumberOfBuckets(void) Return number of buckets available. Insure that the locator has been built before attempting to access buckets (octants). V.FindCell([float, float, float], float, vtkGenericCell, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], double tol2, vtkGenericCell *GenCell, double pcoords[3], double *weights) override; V.FindCell([float, float, float]) -> int C++: virtual vtkIdType FindCell(double x[3]) Find the cell containing a given point. returns -1 if no cell found the cell parameters are copied into the supplied variables, a cell must be provided to store the information. V.FindCellsWithinBounds([float, ...], vtkIdList) C++: void FindCellsWithinBounds(double *bbox, vtkIdList *cells) override; Return a list of unique cell ids inside of a given bounding box. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built. V.FindCellsAlongLine([float, float, float], [float, float, float], float, vtkIdList) C++: void FindCellsAlongLine(double p1[3], double p2[3], double tolerance, vtkIdList *cells) override; Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built. FreeSearchStructureV.FreeSearchStructure() C++: void FreeSearchStructure() override; Satisfy vtkLocator abstract interface. BuildLocatorV.BuildLocator() C++: void BuildLocator() override; Satisfy vtkLocator abstract interface. BuildLocatorIfNeededV.BuildLocatorIfNeeded() C++: virtual void BuildLocatorIfNeeded() Satisfy vtkLocator abstract interface. ForceBuildLocatorV.ForceBuildLocator() C++: virtual void ForceBuildLocator() Satisfy vtkLocator abstract interface. BuildLocatorInternalV.BuildLocatorInternal() C++: virtual void BuildLocatorInternal() Satisfy vtkLocator abstract interface. GenerateRepresentationV.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; Satisfy vtkLocator abstract interface. vtkPolyDatavtkCellTypesvtkCommonDataModelPython.vtkCellTypesvtkCellTypes - object provides direct access to cells in vtkCellArray and type information Superclass: vtkObject This class is a supplemental object to vtkCellArray to allow random access into cells as well as representing cell type information. The "location" field is the location in the vtkCellArray list in terms of an integer offset. An integer offset was used instead of a pointer for easy storage and inter-process communication. The type information is defined in the file vtkCellType.h. @warning Sometimes this class is used to pass type information independent of the random access (i.e., location) information. For example, see vtkDataSet::GetCellTypes(). If you use the class in this way, you can use a location value of -1. @sa vtkCellArray vtkCellLinks V.SafeDownCast(vtkObjectBase) -> vtkCellTypes C++: static vtkCellTypes *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCellTypes C++: vtkCellTypes *NewInstance() V.Allocate(int, int) -> int C++: int Allocate(int sz=512, int ext=1000) Allocate memory for this array. Delete old storage only if necessary. InsertCellV.InsertCell(int, int, int) C++: void InsertCell(vtkIdType id, unsigned char type, vtkIdType loc) Add a cell at specified id. V.InsertNextCell(int, int) -> int C++: vtkIdType InsertNextCell(unsigned char type, vtkIdType loc) Add a cell to the object in the next available slot. SetCellTypesV.SetCellTypes(int, vtkUnsignedCharArray, vtkIdTypeArray) C++: void SetCellTypes(vtkIdType ncells, vtkUnsignedCharArray *cellTypes, vtkIdTypeArray *cellLocations) V.SetCellTypes(int, vtkUnsignedCharArray, vtkIntArray) C++: void SetCellTypes(vtkIdType ncells, vtkUnsignedCharArray *cellTypes, vtkIntArray *cellLocations) Specify a group of cell types. GetCellLocationV.GetCellLocation(int) -> int C++: vtkIdType GetCellLocation(vtkIdType cellId) Return the location of the cell in the associated vtkCellArray. DeleteCellV.DeleteCell(int) C++: void DeleteCell(vtkIdType cellId) Delete cell by setting to nullptr cell type. GetNumberOfTypesV.GetNumberOfTypes() -> int C++: vtkIdType GetNumberOfTypes() Return the number of types in the list. IsTypeV.IsType(int) -> int C++: int IsType(unsigned char type) Return 1 if type specified is contained in list; 0 otherwise. InsertNextTypeV.InsertNextType(int) -> int C++: vtkIdType InsertNextType(unsigned char type) Add the type specified to the end of the list. Range checking is performed. V.GetCellType(int) -> int C++: unsigned char GetCellType(vtkIdType cellId) Return the type of cell. V.Reset() C++: void Reset() Initialize object without releasing memory. V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() Return the memory in kibibytes (1024 bytes) consumed by this cell type array. Used to support streaming and reading/writing data. The value returned is guaranteed to be greater than or equal to the memory required to actually represent the data represented by this object. The information returned is valid only after the pipeline has been updated. V.DeepCopy(vtkCellTypes) C++: void DeepCopy(vtkCellTypes *src) Standard DeepCopy method. Since this object contains no reference to other objects, there is no ShallowCopy. GetClassNameFromTypeIdV.GetClassNameFromTypeId(int) -> string C++: static const char *GetClassNameFromTypeId(int typeId) Given an int (as defined in vtkCellType.h) identifier for a class return it's classname. GetTypeIdFromClassNameV.GetTypeIdFromClassName(string) -> int C++: static int GetTypeIdFromClassName(const char *classname) Given a data object classname, return it's int identified (as defined in vtkCellType.h) V.IsLinear(int) -> int C++: static int IsLinear(unsigned char type) This convenience method is a fast check to determine if a cell type represents a linear or nonlinear cell. This is generally much more efficient than getting the appropriate vtkCell and checking its IsLinear method. @kVV *vtkUnsignedCharArray *vtkIdTypeArray@kVV *vtkUnsignedCharArray *vtkIntArrayvtkUnsignedCharArrayvtkIntArrayvtkCompositeDataSetvtkCommonDataModelPython.vtkCompositeDataSetvtkCompositeDataSet - abstract superclass for composite (multi-block or AMR) datasets Superclass: vtkDataObject vtkCompositeDataSet is an abstract class that represents a collection of datasets (including other composite datasets). It provides an interface to access the datasets through iterators. vtkCompositeDataSet provides methods that are used by subclasses to store the datasets. vtkCompositeDataSet provides the datastructure for a full tree representation. Subclasses provide the semantics for it and control how this tree is built. @sa vtkCompositeDataIterator V.SafeDownCast(vtkObjectBase) -> vtkCompositeDataSet C++: static vtkCompositeDataSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCompositeDataSet C++: vtkCompositeDataSet *NewInstance() NewIteratorV.NewIterator() -> vtkCompositeDataIterator C++: virtual vtkCompositeDataIterator *NewIterator() Return a new iterator (the iterator has to be deleted by user). V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return class name of data type (see vtkType.h for definitions). CopyStructureV.CopyStructure(vtkCompositeDataSet) C++: virtual void CopyStructure(vtkCompositeDataSet *input) Copies the tree structure from the input. All pointers to non-composite data objects are initialized to nullptr. This also shallow copies the meta data associated with all the nodes. SetDataSetV.SetDataSet(vtkCompositeDataIterator, vtkDataObject) C++: virtual void SetDataSet(vtkCompositeDataIterator *iter, vtkDataObject *dataObj) Sets the data set at the location pointed by the iterator. The iterator does not need to be iterating over this dataset itself. It can be any composite datasite with similar structure (achieved by using CopyStructure). GetDataSetV.GetDataSet(vtkCompositeDataIterator) -> vtkDataObject C++: virtual vtkDataObject *GetDataSet( vtkCompositeDataIterator *iter) Returns the dataset located at the positiong pointed by the iterator. The iterator does not need to be iterating over this dataset itself. It can be an iterator for composite dataset with similar structure (achieved by using CopyStructure). V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() override; Return the actual size of the data in kibibytes (1024 bytes). This number is valid only after the pipeline has updated. V.GetData(vtkInformation) -> vtkCompositeDataSet C++: static vtkCompositeDataSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkCompositeDataSet C++: static vtkCompositeDataSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Shallow and Deep copy. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Shallow and Deep copy. V.GetNumberOfPoints() -> int C++: virtual vtkIdType GetNumberOfPoints() Returns the total number of points of all blocks. This will iterate over all blocks and call GetNumberOfPoints() so it might be expansive. NAMEV.NAME() -> vtkInformationStringKey C++: static vtkInformationStringKey *NAME() Key used to put node name in the meta-data associated with a node. CURRENT_PROCESS_CAN_LOAD_BLOCKV.CURRENT_PROCESS_CAN_LOAD_BLOCK() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *CURRENT_PROCESS_CAN_LOAD_BLOCK( ) Key used to indicate that the current process can load the data in the node. Used for parallel readers where the nodes are assigned to the processes by the reader to indicate further down the pipeline which nodes will be on which processes. ***THIS IS AN EXPERIMENTAL KEY SUBJECT TO CHANGE WITHOUT NOTICE*** vtkCompositeDataIteratorvtkCommonDataModelPython.vtkCompositeDataIteratorvtkCompositeDataIterator - superclass for composite data iterators Superclass: vtkObject vtkCompositeDataIterator provides an interface for accessing datasets in a collection (vtkCompositeDataIterator). V.SafeDownCast(vtkObjectBase) -> vtkCompositeDataIterator C++: static vtkCompositeDataIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkCompositeDataIterator C++: vtkCompositeDataIterator *NewInstance() V.SetDataSet(vtkCompositeDataSet) C++: virtual void SetDataSet(vtkCompositeDataSet *ds) Set the composite dataset this iterator is iterating over. Must be set before traversal begins. V.GetDataSet() -> vtkCompositeDataSet C++: virtual vtkCompositeDataSet *GetDataSet() Set the composite dataset this iterator is iterating over. Must be set before traversal begins. V.InitTraversal() C++: virtual void InitTraversal() Begin iterating over the composite dataset structure. InitReverseTraversalV.InitReverseTraversal() C++: virtual void InitReverseTraversal() Begin iterating over the composite dataset structure in reverse order. GoToFirstItemV.GoToFirstItem() C++: virtual void GoToFirstItem() Move the iterator to the beginning of the collection. GoToNextItemV.GoToNextItem() C++: virtual void GoToNextItem() Move the iterator to the next item in the collection. V.IsDoneWithTraversal() -> int C++: virtual int IsDoneWithTraversal() Test whether the iterator is finished with the traversal. Returns 1 for yes, and 0 for no. It is safe to call any of the GetCurrent...() methods only when IsDoneWithTraversal() returns 0. GetCurrentDataObjectV.GetCurrentDataObject() -> vtkDataObject C++: virtual vtkDataObject *GetCurrentDataObject() Returns the current item. Valid only when IsDoneWithTraversal() returns 0. GetCurrentMetaDataV.GetCurrentMetaData() -> vtkInformation C++: virtual vtkInformation *GetCurrentMetaData() Returns the meta-data associated with the current item. This will allocate a new vtkInformation object is none is already present. Use HasCurrentMetaData to avoid unnecessary creation of vtkInformation objects. HasCurrentMetaDataV.HasCurrentMetaData() -> int C++: virtual int HasCurrentMetaData() Returns if the a meta-data information object is present for the current item. Return 1 on success, 0 otherwise. SetSkipEmptyNodesV.SetSkipEmptyNodes(int) C++: virtual void SetSkipEmptyNodes(int _arg) If SkipEmptyNodes is true, then nullptr datasets will be skipped. Default is true. GetSkipEmptyNodesV.GetSkipEmptyNodes() -> int C++: virtual int GetSkipEmptyNodes() If SkipEmptyNodes is true, then nullptr datasets will be skipped. Default is true. SkipEmptyNodesOnV.SkipEmptyNodesOn() C++: virtual void SkipEmptyNodesOn() If SkipEmptyNodes is true, then nullptr datasets will be skipped. Default is true. SkipEmptyNodesOffV.SkipEmptyNodesOff() C++: virtual void SkipEmptyNodesOff() If SkipEmptyNodes is true, then nullptr datasets will be skipped. Default is true. GetCurrentFlatIndexV.GetCurrentFlatIndex() -> int C++: virtual unsigned int GetCurrentFlatIndex() Flat index is an index to identify the data in a composite data structure GetReverseV.GetReverse() -> int C++: virtual int GetReverse() Returns if the iteration is in reverse order. vtkConevtkCommonDataModelPython.vtkConevtkCone - implicit function for a cone Superclass: vtkImplicitFunction vtkCone computes the implicit function and function gradient for a cone. vtkCone is a concrete implementation of vtkImplicitFunction. The cone vertex is located at the origin with axis of rotation coincident with x-axis. (Use the superclass' vtkImplicitFunction transformation matrix if necessary to reposition.) The angle specifies the angle between the axis of rotation and the side of the cone. @warning The cone is infinite in extent. To truncate the cone use the vtkImplicitBoolean in combination with clipping planes. V.SafeDownCast(vtkObjectBase) -> vtkCone C++: static vtkCone *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCone C++: vtkCone *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate cone equation. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate cone normal. SetAngleV.SetAngle(float) C++: virtual void SetAngle(double _arg) Set/Get the cone angle (expressed in degrees). GetAngleMinValueV.GetAngleMinValue() -> float C++: virtual double GetAngleMinValue() Set/Get the cone angle (expressed in degrees). GetAngleMaxValueV.GetAngleMaxValue() -> float C++: virtual double GetAngleMaxValue() Set/Get the cone angle (expressed in degrees). GetAngleV.GetAngle() -> float C++: virtual double GetAngle() Set/Get the cone angle (expressed in degrees). vtkConvexPointSetvtkCommonDataModelPython.vtkConvexPointSetvtkConvexPointSet - a 3D cell defined by a set of convex points Superclass: vtkCell3D vtkConvexPointSet is a concrete implementation that represents a 3D cell defined by a convex set of points. An example of such a cell is an octant (from an octree). vtkConvexPointSet uses the ordered triangulations approach (vtkOrderedTriangulator) to create triangulations guaranteed to be compatible across shared faces. This allows a general approach to processing complex, convex cell types. @sa vtkHexahedron vtkPyramid vtkTetra vtkVoxel vtkWedge V.SafeDownCast(vtkObjectBase) -> vtkConvexPointSet C++: static vtkConvexPointSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkConvexPointSet C++: vtkConvexPointSet *NewInstance() HasFixedTopologyV.HasFixedTopology() -> int C++: virtual int HasFixedTopology() See vtkCell3D API for description of this method. V.GetEdgePoints(int, [int, ...]) C++: void GetEdgePoints(int edgeId, int *&pts) override; See vtkCell3D API for description of these methods. V.GetFacePoints(int, [int, ...]) C++: void GetFacePoints(int faceId, int *&pts) override; Get the list of vertices that define a face. The list is terminated with a negative number. Note that the vertices are 0-offset; that is, they refer to the ids of the cell, not the point ids of the mesh that the cell belongs to. The faceId must range between 0<=faceIdGetNumberOfFaces(). V.GetCellType() -> int C++: int GetCellType() override; See the vtkCell API for descriptions of these methods. V.RequiresInitialization() -> int C++: int RequiresInitialization() override; This cell requires that it be initialized prior to access. V.Initialize() C++: void Initialize() override; V.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; A convex point set has no explicit cell edge or faces; however implicitly (after triangulation) it does. Currently the method GetNumberOfEdges() always returns 0 while the GetNumberOfFaces() returns the number of boundary triangles of the triangulation of the convex point set. The method GetNumberOfFaces() triggers a triangulation of the convex point set; repeated calls to GetFace() then return the boundary faces. (Note: GetNumberOfEdges() currently returns 0 because it is a rarely used method and hard to implement. It can be changed in the future. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int) override; A convex point set has no explicit cell edge or faces; however implicitly (after triangulation) it does. Currently the method GetNumberOfEdges() always returns 0 while the GetNumberOfFaces() returns the number of boundary triangles of the triangulation of the convex point set. The method GetNumberOfFaces() triggers a triangulation of the convex point set; repeated calls to GetFace() then return the boundary faces. (Note: GetNumberOfEdges() currently returns 0 because it is a rarely used method and hard to implement. It can be changed in the future. V.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; A convex point set has no explicit cell edge or faces; however implicitly (after triangulation) it does. Currently the method GetNumberOfEdges() always returns 0 while the GetNumberOfFaces() returns the number of boundary triangles of the triangulation of the convex point set. The method GetNumberOfFaces() triggers a triangulation of the convex point set; repeated calls to GetFace() then return the boundary faces. (Note: GetNumberOfEdges() currently returns 0 because it is a rarely used method and hard to implement. It can be changed in the future. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; A convex point set has no explicit cell edge or faces; however implicitly (after triangulation) it does. Currently the method GetNumberOfEdges() always returns 0 while the GetNumberOfFaces() returns the number of boundary triangles of the triangulation of the convex point set. The method GetNumberOfFaces() triggers a triangulation of the convex point set; repeated calls to GetFace() then return the boundary faces. (Note: GetNumberOfEdges() currently returns 0 because it is a rarely used method and hard to implement. It can be changed in the future. V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; Satisfy the vtkCell API. This method contours by triangulating the cell and then contouring the resulting tetrahedra. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Satisfy the vtkCell API. This method contours by triangulating the cell and then adding clip-edge intersection points into the triangulation; extracting the clipped region. V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; Satisfy the vtkCell API. This method determines the subId, pcoords, and weights by triangulating the convex point set, and then determining which tetrahedron the point lies in. V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; The inverse of EvaluatePosition. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Triangulates the cells and then intersects them to determine the intersection point. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; Triangulate using methods of vtkOrderedTriangulator. V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; Computes derivatives by triangulating and from subId and pcoords, evaluating derivatives on the resulting tetrahedron. V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; Returns the set of points forming a face of the triangulation of these points that are on the boundary of the cell that are closest parametrically to the point specified. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the cell in parametric coordinates. V.IsPrimaryCell() -> int C++: int IsPrimaryCell() override; A convex point set is triangulated prior to any operations on it so it is not a primary cell, it is a composite cell. V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double pcoords[3], double *sf) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, ...]) C++: void InterpolateDerivs(double pcoords[3], double *derivs) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCubicLinevtkCommonDataModelPython.vtkCubicLinevtkCubicLine - cell represents a cubic , isoparametric 1D line Superclass: vtkNonLinearCell vtkCubicLine is a concrete implementation of vtkNonLinearCell to represent a 1D Cubic line. The Cubic Line is the 4 nodes isoparametric parabolic line . The interpolation is the standard finite element, cubic isoparametric shape function. The cell includes two mid-edge nodes. The ordering of the four points defining the cell is point ids (0,1,2,3) where id #2 and #3 are the mid-edge nodes. Please note that the parametric coordinates lie between -1 and 1 in accordance with most standard documentations.@par Thanks: This file has been developed by Oxalya - www.oxalya.com Copyright (c) EDF - www.edf.fr V.SafeDownCast(vtkObjectBase) -> vtkCubicLine C++: static vtkCubicLine *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCubicLine C++: vtkCubicLine *NewInstance() V.GetCellDimension() -> int C++: int GetCellDimension() override; See the vtkCell API for descriptions of these methods. V.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; See the vtkCell API for descriptions of these methods. V.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; See the vtkCell API for descriptions of these methods. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int) override; See the vtkCell API for descriptions of these methods. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int) override; See the vtkCell API for descriptions of these methods. V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; See the vtkCell API for descriptions of these methods. V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; See the vtkCell API for descriptions of these methods. V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; See the vtkCell API for descriptions of these methods. V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; See the vtkCell API for descriptions of these methods. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; See the vtkCell API for descriptions of these methods. V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; See the vtkCell API for descriptions of these methods. V.GetParametricCoords() -> (float, ...) C++: double *GetParametricCoords() override; See the vtkCell API for descriptions of these methods. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *lines, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this line using scalar value provided. Like contouring, except that it cuts the line to produce other lines. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the triangle in parametric coordinates. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Line-line intersection. Intersection has to occur within [0,1] parametric coordinates and with specified tolerance. V.InterpolationFunctions([float, float, float], [float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[4]) @deprecated Replaced by vtkCubicLine::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[4]) @deprecated Replaced by vtkCubicLine::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[4]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[4]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCylindervtkCommonDataModelPython.vtkCylindervtkCylinder - implicit function for a cylinder Superclass: vtkImplicitFunction vtkCylinder computes the implicit function and function gradient for a cylinder using F(r)=r^2-Radius^2. vtkCylinder is a concrete implementation of vtkImplicitFunction. By default the Cylinder is centered at the origin and the axis of rotation is along the y-axis. You can redefine the center and axis of rotation by setting the Center and Axis data members. (Note that it is also possible to use the superclass' vtkImplicitFunction transformation matrix if necessary to reposition by using FunctionValue() and FunctionGradient().) @warning The cylinder is infinite in extent. To truncate the cylinder in modeling operations use the vtkImplicitBoolean in combination with clipping planes. V.SafeDownCast(vtkObjectBase) -> vtkCylinder C++: static vtkCylinder *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkCylinder C++: vtkCylinder *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate cylinder equation F(r) = r^2 - Radius^2. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate cylinder function gradient. SetRadiusV.SetRadius(float) C++: virtual void SetRadius(double _arg) Set/Get the cylinder radius. GetRadiusV.GetRadius() -> float C++: virtual double GetRadius() Set/Get the cylinder radius. SetCenterV.SetCenter(float, float, float) C++: void SetCenter(double, double, double) V.SetCenter((float, float, float)) C++: void SetCenter(double a[3]) GetCenterV.GetCenter() -> (float, float, float) C++: double *GetCenter() SetAxisV.SetAxis(float, float, float) C++: void SetAxis(double ax, double ay, double az) V.SetAxis([float, float, float]) C++: void SetAxis(double a[3]) Set/Get the axis of the cylinder. If the axis is not specified as a unit vector, it will be normalized. If zero-length axis vector is used as input to this method, it will be ignored. GetAxisV.GetAxis() -> (float, float, float) C++: double *GetAxis() vtkDataSetCellIteratorvtkCommonDataModelPython.vtkDataSetCellIteratorvtkDataSetCellIterator - Implementation of vtkCellIterator using vtkDataSet API. Superclass: vtkCellIterator V.SafeDownCast(vtkObjectBase) -> vtkDataSetCellIterator C++: static vtkDataSetCellIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataSetCellIterator C++: vtkDataSetCellIterator *NewInstance() V.IsDoneWithTraversal() -> bool C++: bool IsDoneWithTraversal() override; Returns false while the iterator is valid. Always safe to call. V.GetCellId() -> int C++: vtkIdType GetCellId() override; Get the id of the current cell. vtkDataObjectCollectionvtkCommonDataModelPython.vtkDataObjectCollectionvtkDataObjectCollection - maintain an unordered list of data objects Superclass: vtkCollection vtkDataObjectCollection is an object that creates and manipulates ordered lists of data objects. See also vtkCollection and subclasses. V.SafeDownCast(vtkObjectBase) -> vtkDataObjectCollection C++: static vtkDataObjectCollection *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkDataObjectCollection C++: vtkDataObjectCollection *NewInstance() AddItemV.AddItem(vtkDataObject) C++: void AddItem(vtkDataObject *ds) Add a data object to the bottom of the list. GetNextItemV.GetNextItem() -> vtkDataObject C++: vtkDataObject *GetNextItem() Get the next data object in the list. GetItemV.GetItem(int) -> vtkDataObject C++: vtkDataObject *GetItem(int i) Get the ith data object in the list. vtkCollectionFieldAssociationsAttributeTypesFieldOperationsFIELD_ASSOCIATION_POINTSFIELD_ASSOCIATION_CELLSFIELD_ASSOCIATION_NONEFIELD_ASSOCIATION_POINTS_THEN_CELLSFIELD_ASSOCIATION_VERTICESFIELD_ASSOCIATION_EDGESFIELD_ASSOCIATION_ROWSNUMBER_OF_ASSOCIATIONSPOINTCELLFIELDPOINT_THEN_CELLVERTEXEDGEROWNUMBER_OF_ATTRIBUTE_TYPESFIELD_OPERATION_PRESERVEDFIELD_OPERATION_REINTERPOLATEDFIELD_OPERATION_MODIFIEDFIELD_OPERATION_REMOVEDVTK_PIECES_EXTENTVTK_3D_EXTENTVTK_TIME_EXTENTvtkCommonDataModelPython.vtkDataObject.FieldAssociationsvtkCommonDataModelPython.vtkDataObject.AttributeTypesvtkCommonDataModelPython.vtkDataObject.FieldOperationsvtkCommonDataModelPython.vtkDataObjectvtkDataObject - general representation of visualization data Superclass: vtkObject vtkDataObject is an general representation of visualization data. It serves to encapsulate instance variables and methods for visualization network execution, as well as representing data consisting of a field (i.e., just an unstructured pile of data). This is to be compared with a vtkDataSet, which is data with geometric and/or topological structure. vtkDataObjects are used to represent arbitrary repositories of data via the vtkFieldData instance variable. These data must be eventually mapped into a concrete subclass of vtkDataSet before they can actually be displayed. @sa vtkDataSet vtkFieldData vtkDataObjectToDataSetFilter vtkFieldDataToAttributeDataFilter V.SafeDownCast(vtkObjectBase) -> vtkDataObject C++: static vtkDataObject *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataObject C++: vtkDataObject *NewInstance() GetInformationV.GetInformation() -> vtkInformation C++: virtual vtkInformation *GetInformation() Set/Get the information object associated with this data object. SetInformationV.SetInformation(vtkInformation) C++: virtual void SetInformation(vtkInformation *) Set/Get the information object associated with this data object. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Data objects are composite objects and need to check each part for MTime. The information object also needs to be considered. V.Initialize() C++: virtual void Initialize() Restore data object to initial state, ReleaseDataV.ReleaseData() C++: void ReleaseData() Release data back to system to conserve memory resource. Used during visualization network execution. Releasing this data does not make down-stream data invalid. GetDataReleasedV.GetDataReleased() -> int C++: virtual int GetDataReleased() Get the flag indicating the data has been released. SetGlobalReleaseDataFlagV.SetGlobalReleaseDataFlag(int) C++: static void SetGlobalReleaseDataFlag(int val) Turn on/off flag to control whether every object releases its data after being used by a filter. GlobalReleaseDataFlagOnV.GlobalReleaseDataFlagOn() C++: void GlobalReleaseDataFlagOn() Turn on/off flag to control whether every object releases its data after being used by a filter. GlobalReleaseDataFlagOffV.GlobalReleaseDataFlagOff() C++: void GlobalReleaseDataFlagOff() Turn on/off flag to control whether every object releases its data after being used by a filter. GetGlobalReleaseDataFlagV.GetGlobalReleaseDataFlag() -> int C++: static int GetGlobalReleaseDataFlag() Turn on/off flag to control whether every object releases its data after being used by a filter. SetFieldDataV.SetFieldData(vtkFieldData) C++: virtual void SetFieldData(vtkFieldData *) Assign or retrieve a general field data to this data object. GetFieldDataV.GetFieldData() -> vtkFieldData C++: virtual vtkFieldData *GetFieldData() Assign or retrieve a general field data to this data object. V.GetDataObjectType() -> int C++: virtual int GetDataObjectType() Return class name of data type. This is one of VTK_STRUCTURED_GRID, VTK_STRUCTURED_POINTS, VTK_UNSTRUCTURED_GRID, VTK_POLY_DATA, or VTK_RECTILINEAR_GRID (see vtkSetGet.h for definitions). THIS METHOD IS THREAD SAFE GetUpdateTimeV.GetUpdateTime() -> int C++: vtkMTimeType GetUpdateTime() Used by Threaded ports to determine if they should initiate an asynchronous update (still in development). V.GetActualMemorySize() -> int C++: virtual unsigned long GetActualMemorySize() Return the actual size of the data in kibibytes (1024 bytes). This number is valid only after the pipeline has updated. The memory size returned is guaranteed to be greater than or equal to the memory required to represent the data (e.g., extra space in arrays, etc. are not included in the return value). CopyInformationFromPipelineV.CopyInformationFromPipeline(vtkInformation) C++: virtual void CopyInformationFromPipeline( vtkInformation *info) Copy from the pipeline information to the data object's own information. Called right before the main execution pass. CopyInformationToPipelineV.CopyInformationToPipeline(vtkInformation) C++: virtual void CopyInformationToPipeline(vtkInformation *info) Copy information from this data object to the pipeline information. This is used by the vtkTrivialProducer that is created when someone calls SetInputData() to connect a data object to a pipeline. GetActiveFieldInformationV.GetActiveFieldInformation(vtkInformation, int, int) -> vtkInformation C++: static vtkInformation *GetActiveFieldInformation( vtkInformation *info, int fieldAssociation, int attributeType) Return the information object within the input information object's field data corresponding to the specified association (FIELD_ASSOCIATION_POINTS or FIELD_ASSOCIATION_CELLS) and attribute (SCALARS, VECTORS, NORMALS, TCOORDS, or TENSORS) GetNamedFieldInformationV.GetNamedFieldInformation(vtkInformation, int, string) -> vtkInformation C++: static vtkInformation *GetNamedFieldInformation( vtkInformation *info, int fieldAssociation, const char *name) Return the information object within the input information object's field data corresponding to the specified association (FIELD_ASSOCIATION_POINTS or FIELD_ASSOCIATION_CELLS) and name. RemoveNamedFieldInformationV.RemoveNamedFieldInformation(vtkInformation, int, string) C++: static void RemoveNamedFieldInformation(vtkInformation *info, int fieldAssociation, const char *name) Remove the info associated with an array SetActiveAttributeV.SetActiveAttribute(vtkInformation, int, string, int) -> vtkInformation C++: static vtkInformation *SetActiveAttribute( vtkInformation *info, int fieldAssociation, const char *attributeName, int attributeType) Set the named array to be the active field for the specified type (SCALARS, VECTORS, NORMALS, TCOORDS, or TENSORS) and association (FIELD_ASSOCIATION_POINTS or FIELD_ASSOCIATION_CELLS). Returns the active field information object and creates on entry if one not found. SetActiveAttributeInfoV.SetActiveAttributeInfo(vtkInformation, int, int, string, int, int, int) C++: static void SetActiveAttributeInfo(vtkInformation *info, int fieldAssociation, int attributeType, const char *name, int arrayType, int numComponents, int numTuples) Set the name, array type, number of components, and number of tuples within the passed information object for the active attribute of type attributeType (in specified association, FIELD_ASSOCIATION_POINTS or FIELD_ASSOCIATION_CELLS). If there is not an active attribute of the specified type, an entry in the information object is created. If arrayType, numComponents, or numTuples equal to -1, or name=nullptr the value is not changed. SetPointDataActiveScalarInfoV.SetPointDataActiveScalarInfo(vtkInformation, int, int) C++: static void SetPointDataActiveScalarInfo( vtkInformation *info, int arrayType, int numComponents) Convenience version of previous method for use (primarily) by the Imaging filters. If arrayType or numComponents == -1, the value is not changed. DataHasBeenGeneratedV.DataHasBeenGenerated() C++: void DataHasBeenGenerated() This method is called by the source when it executes to generate data. It is sort of the opposite of ReleaseData. It sets the DataReleased flag to 0, and sets a new UpdateTime. PrepareForNewDataV.PrepareForNewData() C++: virtual void PrepareForNewData() make the output data ready for new data to be inserted. For most objects we just call Initialize. But for vtkImageData we leave the old data in case the memory can be reused. V.ShallowCopy(vtkDataObject) C++: virtual void ShallowCopy(vtkDataObject *src) Shallow and Deep copy. These copy the data, but not any of the pipeline connections. V.DeepCopy(vtkDataObject) C++: virtual void DeepCopy(vtkDataObject *src) Shallow and Deep copy. These copy the data, but not any of the pipeline connections. GetExtentTypeV.GetExtentType() -> int C++: virtual int GetExtentType() The ExtentType will be left as VTK_PIECES_EXTENT for data objects such as vtkPolyData and vtkUnstructuredGrid. The ExtentType will be changed to VTK_3D_EXTENT for data objects with 3D structure such as vtkImageData (and its subclass vtkStructuredPoints), vtkRectilinearGrid, and vtkStructuredGrid. The default is the have an extent in pieces, with only one piece (no streaming possible). CropV.Crop((int, ...)) C++: virtual void Crop(const int *updateExtent) This method crops the data object (if necessary) so that the extent matches the update extent. GetAttributesV.GetAttributes(int) -> vtkDataSetAttributes C++: virtual vtkDataSetAttributes *GetAttributes(int type) Returns the attributes of the data object of the specified attribute type. The type may be: POINT - Defined in vtkDataSet subclasses. CELL - Defined in vtkDataSet subclasses. VERTEX - Defined in vtkGraph subclasses. EDGE - Defined in vtkGraph subclasses. ROW - Defined in vtkTable. The other attribute type, FIELD, will return nullptr since field data is stored as a vtkFieldData instance, not a vtkDataSetAttributes instance. To retrieve field data, use GetAttributesAsFieldData. GetAttributesAsFieldDataV.GetAttributesAsFieldData(int) -> vtkFieldData C++: virtual vtkFieldData *GetAttributesAsFieldData(int type) Returns the attributes of the data object as a vtkFieldData. This returns non-null values in all the same cases as GetAttributes, in addition to the case of FIELD, which will return the field data for any vtkDataObject subclass. GetAttributeTypeForArrayV.GetAttributeTypeForArray(vtkAbstractArray) -> int C++: virtual int GetAttributeTypeForArray(vtkAbstractArray *arr) Retrieves the attribute type that an array came from. This is useful for obtaining which attribute type a input array to an algorithm came from (retrieved from GetInputAbstractArrayToProcesss). GetNumberOfElementsV.GetNumberOfElements(int) -> int C++: virtual vtkIdType GetNumberOfElements(int type) Get the number of elements for a specific attribute type (POINT, CELL, etc.). GetAssociationTypeAsStringV.GetAssociationTypeAsString(int) -> string C++: static const char *GetAssociationTypeAsString( int associationType) Given an integer association type, this static method returns a string type for the attribute (i.e. type = 0: returns "Points"). GetAssociationTypeFromStringV.GetAssociationTypeFromString(string) -> int C++: static int GetAssociationTypeFromString( const char *associationType) Given an integer association type, this static method returns a string type for the attribute (i.e. type = 0: returns "Points"). DATA_TYPE_NAMEV.DATA_TYPE_NAME() -> vtkInformationStringKey C++: static vtkInformationStringKey *DATA_TYPE_NAME() DATA_OBJECTV.DATA_OBJECT() -> vtkInformationDataObjectKey C++: static vtkInformationDataObjectKey *DATA_OBJECT() DATA_EXTENT_TYPEV.DATA_EXTENT_TYPE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DATA_EXTENT_TYPE() DATA_EXTENTV.DATA_EXTENT() -> vtkInformationIntegerPointerKey C++: static vtkInformationIntegerPointerKey *DATA_EXTENT() ALL_PIECES_EXTENTV.ALL_PIECES_EXTENT() -> vtkInformationIntegerVectorKey C++: static vtkInformationIntegerVectorKey *ALL_PIECES_EXTENT() DATA_PIECE_NUMBERV.DATA_PIECE_NUMBER() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DATA_PIECE_NUMBER() DATA_NUMBER_OF_PIECESV.DATA_NUMBER_OF_PIECES() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DATA_NUMBER_OF_PIECES() DATA_NUMBER_OF_GHOST_LEVELSV.DATA_NUMBER_OF_GHOST_LEVELS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DATA_NUMBER_OF_GHOST_LEVELS( ) DATA_TIME_STEPV.DATA_TIME_STEP() -> vtkInformationDoubleKey C++: static vtkInformationDoubleKey *DATA_TIME_STEP() POINT_DATA_VECTORV.POINT_DATA_VECTOR() -> vtkInformationInformationVectorKey C++: static vtkInformationInformationVectorKey *POINT_DATA_VECTOR( ) CELL_DATA_VECTORV.CELL_DATA_VECTOR() -> vtkInformationInformationVectorKey C++: static vtkInformationInformationVectorKey *CELL_DATA_VECTOR() VERTEX_DATA_VECTORV.VERTEX_DATA_VECTOR() -> vtkInformationInformationVectorKey C++: static vtkInformationInformationVectorKey *VERTEX_DATA_VECTOR( ) EDGE_DATA_VECTORV.EDGE_DATA_VECTOR() -> vtkInformationInformationVectorKey C++: static vtkInformationInformationVectorKey *EDGE_DATA_VECTOR() FIELD_ARRAY_TYPEV.FIELD_ARRAY_TYPE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_ARRAY_TYPE() FIELD_ASSOCIATIONV.FIELD_ASSOCIATION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_ASSOCIATION() FIELD_ATTRIBUTE_TYPEV.FIELD_ATTRIBUTE_TYPE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_ATTRIBUTE_TYPE() FIELD_ACTIVE_ATTRIBUTEV.FIELD_ACTIVE_ATTRIBUTE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_ACTIVE_ATTRIBUTE() FIELD_NUMBER_OF_COMPONENTSV.FIELD_NUMBER_OF_COMPONENTS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_NUMBER_OF_COMPONENTS() FIELD_NUMBER_OF_TUPLESV.FIELD_NUMBER_OF_TUPLES() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_NUMBER_OF_TUPLES() FIELD_OPERATIONV.FIELD_OPERATION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_OPERATION() FIELD_RANGEV.FIELD_RANGE() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *FIELD_RANGE() PIECE_EXTENTV.PIECE_EXTENT() -> vtkInformationIntegerVectorKey C++: static vtkInformationIntegerVectorKey *PIECE_EXTENT() FIELD_NAMEV.FIELD_NAME() -> vtkInformationStringKey C++: static vtkInformationStringKey *FIELD_NAME() ORIGINV.ORIGIN() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *ORIGIN() SPACINGV.SPACING() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *SPACING() BOUNDING_BOXV.BOUNDING_BOX() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *BOUNDING_BOX() SILV.SIL() -> vtkInformationDataObjectKey C++: static vtkInformationDataObjectKey *SIL() V.GetData(vtkInformation) -> vtkDataObject C++: static vtkDataObject *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDataObject C++: static vtkDataObject *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkAbstractArrayvtkDataObjectTypesvtkCommonDataModelPython.vtkDataObjectTypesvtkDataObjectTypes - no description provided. Superclass: vtkObject V.SafeDownCast(vtkObjectBase) -> vtkDataObjectTypes C++: static vtkDataObjectTypes *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataObjectTypes C++: vtkDataObjectTypes *NewInstance() V.GetClassNameFromTypeId(int) -> string C++: static const char *GetClassNameFromTypeId(int typeId) Given an int (as defined in vtkType.h) identifier for a class return it's classname. V.GetTypeIdFromClassName(string) -> int C++: static int GetTypeIdFromClassName(const char *classname) Given a data object classname, return it's int identified (as defined in vtkType.h) NewDataObjectV.NewDataObject(string) -> vtkDataObject C++: static vtkDataObject *NewDataObject(const char *classname) V.NewDataObject(int) -> vtkDataObject C++: static vtkDataObject *NewDataObject(int typeId) Create (New) and return a data object of the given classname. zivtkDataObjectTreevtkCommonDataModelPython.vtkDataObjectTreevtkDataObjectTree - provides implementation for most abstract methods in the superclass vtkCompositeDataSet Superclass: vtkCompositeDataSet vtkDataObjectTree is represents a collection of datasets (including other composite datasets). It provides an interface to access the datasets through iterators. vtkDataObjectTree provides methods that are used by subclasses to store the datasets. vtkDataObjectTree provides the datastructure for a full tree representation. Subclasses provide the semantics for it and control how this tree is built. @sa vtkDataObjectTreeIterator V.SafeDownCast(vtkObjectBase) -> vtkDataObjectTree C++: static vtkDataObjectTree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataObjectTree C++: vtkDataObjectTree *NewInstance() NewTreeIteratorV.NewTreeIterator() -> vtkDataObjectTreeIterator C++: virtual vtkDataObjectTreeIterator *NewTreeIterator() Return a new iterator (the iterator has to be deleted by user). V.NewIterator() -> vtkCompositeDataIterator C++: vtkCompositeDataIterator *NewIterator() override; Return a new iterator (the iterator has to be deleted by user). * Use NewTreeIterator when you have a pointer to a vtkDataObjectTree * and NewIterator when you have a pointer to a vtkCompositeDataSet; * NewIterator is inherited and calls NewTreeIterator internally. V.CopyStructure(vtkCompositeDataSet) C++: void CopyStructure(vtkCompositeDataSet *input) override; Copies the tree structure from the input. All pointers to non-composite data objects are initialized to nullptr. This also shallow copies the meta data associated with all the nodes. V.SetDataSet(vtkCompositeDataIterator, vtkDataObject) C++: void SetDataSet(vtkCompositeDataIterator *iter, vtkDataObject *dataObj) override; Sets the data set at the location pointed by the iterator. The iterator does not need to be iterating over this dataset itself. It can be any composite datasite with similar structure (achieved by using CopyStructure). SetDataSetFromV.SetDataSetFrom(vtkDataObjectTreeIterator, vtkDataObject) C++: void SetDataSetFrom(vtkDataObjectTreeIterator *iter, vtkDataObject *dataObj) Sets the data at the location provided by a vtkDataObjectTreeIterator V.GetDataSet(vtkCompositeDataIterator) -> vtkDataObject C++: vtkDataObject *GetDataSet(vtkCompositeDataIterator *iter) override; Returns the dataset located at the positiong pointed by the iterator. The iterator does not need to be iterating over this dataset itself. It can be an iterator for composite dataset with similar structure (achieved by using CopyStructure). GetMetaDataV.GetMetaData(vtkCompositeDataIterator) -> vtkInformation C++: virtual vtkInformation *GetMetaData( vtkCompositeDataIterator *iter) Returns the meta-data associated with the position pointed by the iterator. This will create a new vtkInformation object if none already exists. Use HasMetaData to avoid creating the vtkInformation object unnecessarily. The iterator does not need to be iterating over this dataset itself. It can be an iterator for composite dataset with similar structure (achieved by using CopyStructure). HasMetaDataV.HasMetaData(vtkCompositeDataIterator) -> int C++: virtual int HasMetaData(vtkCompositeDataIterator *iter) Returns if any meta-data associated with the position pointed by the iterator. The iterator does not need to be iterating over this dataset itself. It can be an iterator for composite dataset with similar structure (achieved by using CopyStructure). V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Returns the total number of points of all blocks. This will iterate over all blocks and call GetNumberOfPoints() so it might be expansive. V.GetData(vtkInformation) -> vtkDataObjectTree C++: static vtkDataObjectTree *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDataObjectTree C++: static vtkDataObjectTree *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkDataObjectTreeIteratorvtkCommonDataModelPython.vtkDataObjectTreeIteratorvtkDataObjectTreeIterator - superclass for composite data iterators Superclass: vtkCompositeDataIterator vtkDataObjectTreeIterator provides an interface for accessing datasets in a collection (vtkDataObjectTreeIterator). V.SafeDownCast(vtkObjectBase) -> vtkDataObjectTreeIterator C++: static vtkDataObjectTreeIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkDataObjectTreeIterator C++: vtkDataObjectTreeIterator *NewInstance() V.GoToFirstItem() C++: void GoToFirstItem() override; Move the iterator to the beginning of the collection. V.GoToNextItem() C++: void GoToNextItem() override; Move the iterator to the next item in the collection. V.IsDoneWithTraversal() -> int C++: int IsDoneWithTraversal() override; Test whether the iterator is finished with the traversal. Returns 1 for yes, and 0 for no. It is safe to call any of the GetCurrent...() methods only when IsDoneWithTraversal() returns 0. V.GetCurrentDataObject() -> vtkDataObject C++: vtkDataObject *GetCurrentDataObject() override; Returns the current item. Valid only when IsDoneWithTraversal() returns 0. V.GetCurrentMetaData() -> vtkInformation C++: vtkInformation *GetCurrentMetaData() override; Returns the meta-data associated with the current item. Note that, depending on iterator implementation, the returned information is not necessarily stored on the current object. So modifying the information is forbidden. V.HasCurrentMetaData() -> int C++: int HasCurrentMetaData() override; Returns if the a meta-data information object is present for the current item. Return 1 on success, 0 otherwise. V.GetCurrentFlatIndex() -> int C++: unsigned int GetCurrentFlatIndex() override; Flat index is an index obtained by traversing the tree in preorder. This can be used to uniquely identify nodes in the tree. Not valid if IsDoneWithTraversal() returns true. SetVisitOnlyLeavesV.SetVisitOnlyLeaves(int) C++: virtual void SetVisitOnlyLeaves(int _arg) If VisitOnlyLeaves is true, the iterator will only visit nodes (sub-datasets) that are not composite. If it encounters a composite data set, it will automatically traverse that composite dataset until it finds non-composite datasets. With this options, it is possible to visit all non-composite datasets in tree of composite datasets (composite of composite of composite for example :-) ) If VisitOnlyLeaves is false, GetCurrentDataObject() may return vtkCompositeDataSet. By default, VisitOnlyLeaves is 1. GetVisitOnlyLeavesV.GetVisitOnlyLeaves() -> int C++: virtual int GetVisitOnlyLeaves() If VisitOnlyLeaves is true, the iterator will only visit nodes (sub-datasets) that are not composite. If it encounters a composite data set, it will automatically traverse that composite dataset until it finds non-composite datasets. With this options, it is possible to visit all non-composite datasets in tree of composite datasets (composite of composite of composite for example :-) ) If VisitOnlyLeaves is false, GetCurrentDataObject() may return vtkCompositeDataSet. By default, VisitOnlyLeaves is 1. VisitOnlyLeavesOnV.VisitOnlyLeavesOn() C++: virtual void VisitOnlyLeavesOn() If VisitOnlyLeaves is true, the iterator will only visit nodes (sub-datasets) that are not composite. If it encounters a composite data set, it will automatically traverse that composite dataset until it finds non-composite datasets. With this options, it is possible to visit all non-composite datasets in tree of composite datasets (composite of composite of composite for example :-) ) If VisitOnlyLeaves is false, GetCurrentDataObject() may return vtkCompositeDataSet. By default, VisitOnlyLeaves is 1. VisitOnlyLeavesOffV.VisitOnlyLeavesOff() C++: virtual void VisitOnlyLeavesOff() If VisitOnlyLeaves is true, the iterator will only visit nodes (sub-datasets) that are not composite. If it encounters a composite data set, it will automatically traverse that composite dataset until it finds non-composite datasets. With this options, it is possible to visit all non-composite datasets in tree of composite datasets (composite of composite of composite for example :-) ) If VisitOnlyLeaves is false, GetCurrentDataObject() may return vtkCompositeDataSet. By default, VisitOnlyLeaves is 1. SetTraverseSubTreeV.SetTraverseSubTree(int) C++: virtual void SetTraverseSubTree(int _arg) If TraverseSubTree is set to true, the iterator will visit the entire tree structure, otherwise it only visits the first level children. Set to 1 by default. GetTraverseSubTreeV.GetTraverseSubTree() -> int C++: virtual int GetTraverseSubTree() If TraverseSubTree is set to true, the iterator will visit the entire tree structure, otherwise it only visits the first level children. Set to 1 by default. TraverseSubTreeOnV.TraverseSubTreeOn() C++: virtual void TraverseSubTreeOn() If TraverseSubTree is set to true, the iterator will visit the entire tree structure, otherwise it only visits the first level children. Set to 1 by default. TraverseSubTreeOffV.TraverseSubTreeOff() C++: virtual void TraverseSubTreeOff() If TraverseSubTree is set to true, the iterator will visit the entire tree structure, otherwise it only visits the first level children. Set to 1 by default. AttributeLimitTypesCellGhostTypesPointGhostTypesAttributeCopyOperationsSCALARSVECTORSNORMALSTCOORDSTENSORSGLOBALIDSPEDIGREEIDSEDGEFLAGNUM_ATTRIBUTESMAXEXACTNOLIMITDUPLICATECELLHIGHCONNECTIVITYCELLLOWCONNECTIVITYCELLREFINEDCELLEXTERIORCELLHIDDENCELLDUPLICATEPOINTHIDDENPOINTCOPYTUPLEINTERPOLATEPASSDATAALLCOPYvtkCommonDataModelPython.vtkDataSetAttributes.AttributeTypesvtkCommonDataModelPython.vtkDataSetAttributes.AttributeLimitTypesvtkCommonDataModelPython.vtkDataSetAttributes.CellGhostTypesvtkCommonDataModelPython.vtkDataSetAttributes.PointGhostTypesvtkCommonDataModelPython.vtkDataSetAttributes.AttributeCopyOperationsvtkCommonDataModelPython.vtkDataSetAttributesvtkDataSetAttributes - represent and manipulate attribute data in a dataset Superclass: vtkFieldData vtkDataSetAttributes is a class that is used to represent and manipulate attribute data (e.g., scalars, vectors, normals, texture coordinates, tensors, global ids, pedigree ids, and field data). This adds to vtkFieldData the ability to pick one of the arrays from the field as the currently active array for each attribute type. In other words, you pick one array to be called "THE" Scalars, and then filters down the pipeline will treat that array specially. For example vtkContourFilter will contour "THE" Scalar array unless a different array is asked for. Additionally vtkDataSetAttributes provides methods that filters call to pass data through, copy data into, and interpolate from Fields. PassData passes entire arrays from the source to the destination. Copy passes through some subset of the tuples from the source to the destination. Interpolate interpolates from the chosen tuple(s) in the source data, using the provided weights, to produce new tuples in the destination. Each attribute type has pass, copy and interpolate "copy" flags that can be set in the destination to choose which attribute arrays will be transferred from the source to the destination. Finally this class provides a mechanism to determine which attributes a group of sources have in common, and to copy tuples from a source into the destination, for only those attributes that are held by all. V.SafeDownCast(vtkObjectBase) -> vtkDataSetAttributes C++: static vtkDataSetAttributes *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataSetAttributes C++: vtkDataSetAttributes *NewInstance() V.Initialize() C++: void Initialize() override; Initialize all of the object's data to nullptr Also, clear the copy flags. UpdateV.Update() C++: virtual void Update() Attributes have a chance to bring themselves up to date; right now this is ignored. V.DeepCopy(vtkFieldData) C++: void DeepCopy(vtkFieldData *pd) override; Deep copy of data (i.e., create new data arrays and copy from input data). Ignores the copy flags but preserves them in the output. V.ShallowCopy(vtkFieldData) C++: void ShallowCopy(vtkFieldData *pd) override; Shallow copy of data (i.e., use reference counting). Ignores the copy flags but preserves them in the output. GhostArrayNameV.GhostArrayName() -> string C++: static const char *GhostArrayName() SetScalarsV.SetScalars(vtkDataArray) -> int C++: int SetScalars(vtkDataArray *da) Set/Get the scalar data. SetActiveScalarsV.SetActiveScalars(string) -> int C++: int SetActiveScalars(const char *name) Set/Get the scalar data. GetScalarsV.GetScalars() -> vtkDataArray C++: vtkDataArray *GetScalars() V.GetScalars(string) -> vtkDataArray C++: vtkDataArray *GetScalars(const char *name) Set/Get the scalar data. SetVectorsV.SetVectors(vtkDataArray) -> int C++: int SetVectors(vtkDataArray *da) Set/Get the vector data. SetActiveVectorsV.SetActiveVectors(string) -> int C++: int SetActiveVectors(const char *name) Set/Get the vector data. GetVectorsV.GetVectors() -> vtkDataArray C++: vtkDataArray *GetVectors() V.GetVectors(string) -> vtkDataArray C++: vtkDataArray *GetVectors(const char *name) Set/Get the vector data. SetNormalsV.SetNormals(vtkDataArray) -> int C++: int SetNormals(vtkDataArray *da) Set/get the normal data. SetActiveNormalsV.SetActiveNormals(string) -> int C++: int SetActiveNormals(const char *name) Set/get the normal data. GetNormalsV.GetNormals() -> vtkDataArray C++: vtkDataArray *GetNormals() V.GetNormals(string) -> vtkDataArray C++: vtkDataArray *GetNormals(const char *name) Set/get the normal data. SetTCoordsV.SetTCoords(vtkDataArray) -> int C++: int SetTCoords(vtkDataArray *da) Set/Get the texture coordinate data. SetActiveTCoordsV.SetActiveTCoords(string) -> int C++: int SetActiveTCoords(const char *name) Set/Get the texture coordinate data. GetTCoordsV.GetTCoords() -> vtkDataArray C++: vtkDataArray *GetTCoords() V.GetTCoords(string) -> vtkDataArray C++: vtkDataArray *GetTCoords(const char *name) Set/Get the texture coordinate data. SetTensorsV.SetTensors(vtkDataArray) -> int C++: int SetTensors(vtkDataArray *da) Set/Get the tensor data. SetActiveTensorsV.SetActiveTensors(string) -> int C++: int SetActiveTensors(const char *name) Set/Get the tensor data. GetTensorsV.GetTensors() -> vtkDataArray C++: vtkDataArray *GetTensors() V.GetTensors(string) -> vtkDataArray C++: vtkDataArray *GetTensors(const char *name) Set/Get the tensor data. SetGlobalIdsV.SetGlobalIds(vtkDataArray) -> int C++: int SetGlobalIds(vtkDataArray *da) Set/Get the global id data. SetActiveGlobalIdsV.SetActiveGlobalIds(string) -> int C++: int SetActiveGlobalIds(const char *name) Set/Get the global id data. GetGlobalIdsV.GetGlobalIds() -> vtkDataArray C++: vtkDataArray *GetGlobalIds() V.GetGlobalIds(string) -> vtkDataArray C++: vtkDataArray *GetGlobalIds(const char *name) Set/Get the global id data. SetPedigreeIdsV.SetPedigreeIds(vtkAbstractArray) -> int C++: int SetPedigreeIds(vtkAbstractArray *da) Set/Get the pedigree id data. SetActivePedigreeIdsV.SetActivePedigreeIds(string) -> int C++: int SetActivePedigreeIds(const char *name) Set/Get the pedigree id data. GetPedigreeIdsV.GetPedigreeIds() -> vtkAbstractArray C++: vtkAbstractArray *GetPedigreeIds() V.GetPedigreeIds(string) -> vtkAbstractArray C++: vtkAbstractArray *GetPedigreeIds(const char *name) Set/Get the pedigree id data. V.SetActiveAttribute(string, int) -> int C++: int SetActiveAttribute(const char *name, int attributeType) V.SetActiveAttribute(int, int) -> int C++: int SetActiveAttribute(int index, int attributeType) Make the array with the given name the active attribute. Attribute types are: vtkDataSetAttributes::SCALARS = 0 vtkDataSetAttributes::VECTORS = 1 vtkDataSetAttributes::NORMALS = 2 vtkDataSetAttributes::TCOORDS = 3 vtkDataSetAttributes::TENSORS = 4 vtkDataSetAttributes::GLOBALIDS = 5 vtkDataSetAttributes::PEDIGREEIDS = 6 vtkDataSetAttributes::EDGEFLAG = 7 Returns the index of the array if successful, -1 if the array is not in the list of arrays. GetAttributeIndicesV.GetAttributeIndices([int, ...]) C++: void GetAttributeIndices(int *indexArray) Get the field data array indices corresponding to scalars, vectors, tensors, etc. IsArrayAnAttributeV.IsArrayAnAttribute(int) -> int C++: int IsArrayAnAttribute(int idx) Determine whether a data array of index idx is considered a data set attribute (i.e., scalar, vector, tensor, etc). Return less-than zero if it is, otherwise an index 0<=idx int C++: int SetAttribute(vtkAbstractArray *aa, int attributeType) Set an array to use as the given attribute type (i.e., vtkDataSetAttributes::SCALAR, vtkDataSetAttributes::VECTOR, vtkDataSetAttributes::TENSOR, etc.). If this attribute was previously set to another array, that array is removed from the vtkDataSetAttributes object and the array aa is used as the attribute. * Returns the index of aa within the vtkDataSetAttributes object * (i.e., the index to pass to the method GetArray(int) to obtain * aa) if the attribute was set to aa successfully. If aa was * already set as the given attributeType, returns the index of * aa. * Returns -1 in the following cases: * - aa is nullptr (used to unset an attribute; not an error indicator) * - aa is not a subclass of vtkDataArray, unless the attributeType * is vtkDataSetAttributes::PEDIGREEIDS (error indicator) * - aa has a number of components incompatible with the attribute type * (error indicator) GetAttributeV.GetAttribute(int) -> vtkDataArray C++: vtkDataArray *GetAttribute(int attributeType) Return an attribute given the attribute type (see vtkDataSetAttributes::AttributeTypes). Some attributes (such as PEDIGREEIDS) may not be vtkDataArray subclass, so in that case use GetAbstractAttribute(). GetAbstractAttributeV.GetAbstractAttribute(int) -> vtkAbstractArray C++: vtkAbstractArray *GetAbstractAttribute(int attributeType) Return an attribute given the attribute type (see vtkDataSetAttributes::AttributeTypes). This is the same as GetAttribute(), except that the returned array is a vtkAbstractArray instead of vtkDataArray. Some attributes (such as PEDIGREEIDS) may not be vtkDataArray subclass. RemoveArrayV.RemoveArray(int) C++: void RemoveArray(int index) override; V.RemoveArray(string) C++: virtual void RemoveArray(const char *name) Remove an array (with the given name) from the list of arrays. GetAttributeTypeAsStringV.GetAttributeTypeAsString(int) -> string C++: static const char *GetAttributeTypeAsString( int attributeType) Given an integer attribute type, this static method returns a string type for the attribute (i.e. type = 0: returns "Scalars"). GetLongAttributeTypeAsStringV.GetLongAttributeTypeAsString(int) -> string C++: static const char *GetLongAttributeTypeAsString( int attributeType) Given an integer attribute type, this static method returns a string type for the attribute (i.e. type = 0: returns "Scalars"). SetCopyAttributeV.SetCopyAttribute(int, int, int) C++: void SetCopyAttribute(int index, int value, int ctype=vtkDataSetAttributes::ALLCOPY) Turn on/off the copying of attribute data. ctype is one of the AttributeCopyOperations, and controls copy, interpolate and passdata behavior. For set, ctype=ALLCOPY means set all three flags to the same value. For get, ctype=ALLCOPY returns true only if all three flags are true. * During copying, interpolation and passdata, the following rules are * followed for each array: * 1. If the copy/interpolate/pass flag for an attribute is set (on or off), * it is applied. This overrides rules 2 and 3. * 2. If the copy flag for an array is set (on or off), it is applied * This overrides rule 3. * 3. If CopyAllOn is set, copy the array. * If CopyAllOff is set, do not copy the array * For interpolation, the flag values can be as follows: * 0: Do not interpolate. * 1: Weighted interpolation. * 2: Nearest neighbor interpolation. GetCopyAttributeV.GetCopyAttribute(int, int) -> int C++: int GetCopyAttribute(int index, int ctype) Get the attribute copy flag for copy operation of attribute . SetCopyScalarsV.SetCopyScalars(int, int) C++: void SetCopyScalars(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyScalarsV.GetCopyScalars(int) -> int C++: int GetCopyScalars(int ctype=vtkDataSetAttributes::ALLCOPY) CopyScalarsOnV.CopyScalarsOn() C++: virtual void CopyScalarsOn() CopyScalarsOffV.CopyScalarsOff() C++: virtual void CopyScalarsOff() SetCopyVectorsV.SetCopyVectors(int, int) C++: void SetCopyVectors(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyVectorsV.GetCopyVectors(int) -> int C++: int GetCopyVectors(int ctype=vtkDataSetAttributes::ALLCOPY) CopyVectorsOnV.CopyVectorsOn() C++: virtual void CopyVectorsOn() CopyVectorsOffV.CopyVectorsOff() C++: virtual void CopyVectorsOff() SetCopyNormalsV.SetCopyNormals(int, int) C++: void SetCopyNormals(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyNormalsV.GetCopyNormals(int) -> int C++: int GetCopyNormals(int ctype=vtkDataSetAttributes::ALLCOPY) CopyNormalsOnV.CopyNormalsOn() C++: virtual void CopyNormalsOn() CopyNormalsOffV.CopyNormalsOff() C++: virtual void CopyNormalsOff() SetCopyTCoordsV.SetCopyTCoords(int, int) C++: void SetCopyTCoords(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyTCoordsV.GetCopyTCoords(int) -> int C++: int GetCopyTCoords(int ctype=vtkDataSetAttributes::ALLCOPY) CopyTCoordsOnV.CopyTCoordsOn() C++: virtual void CopyTCoordsOn() CopyTCoordsOffV.CopyTCoordsOff() C++: virtual void CopyTCoordsOff() SetCopyTensorsV.SetCopyTensors(int, int) C++: void SetCopyTensors(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyTensorsV.GetCopyTensors(int) -> int C++: int GetCopyTensors(int ctype=vtkDataSetAttributes::ALLCOPY) CopyTensorsOnV.CopyTensorsOn() C++: virtual void CopyTensorsOn() CopyTensorsOffV.CopyTensorsOff() C++: virtual void CopyTensorsOff() SetCopyGlobalIdsV.SetCopyGlobalIds(int, int) C++: void SetCopyGlobalIds(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyGlobalIdsV.GetCopyGlobalIds(int) -> int C++: int GetCopyGlobalIds(int ctype=vtkDataSetAttributes::ALLCOPY) CopyGlobalIdsOnV.CopyGlobalIdsOn() C++: virtual void CopyGlobalIdsOn() CopyGlobalIdsOffV.CopyGlobalIdsOff() C++: virtual void CopyGlobalIdsOff() SetCopyPedigreeIdsV.SetCopyPedigreeIds(int, int) C++: void SetCopyPedigreeIds(int i, int ctype=vtkDataSetAttributes::ALLCOPY) @copydoc vtkDataSetAttributes::SetCopyAttribute() GetCopyPedigreeIdsV.GetCopyPedigreeIds(int) -> int C++: int GetCopyPedigreeIds( int ctype=vtkDataSetAttributes::ALLCOPY) CopyPedigreeIdsOnV.CopyPedigreeIdsOn() C++: virtual void CopyPedigreeIdsOn() CopyPedigreeIdsOffV.CopyPedigreeIdsOff() C++: virtual void CopyPedigreeIdsOff() CopyAllOnV.CopyAllOn(int) C++: void CopyAllOn(int ctype=vtkDataSetAttributes::ALLCOPY) override; @copydoc vtkDataSetAttributes::SetCopyAttribute() CopyAllOffV.CopyAllOff(int) C++: void CopyAllOff(int ctype=vtkDataSetAttributes::ALLCOPY) override; @copydoc vtkDataSetAttributes::SetCopyAttribute() PassDataV.PassData(vtkFieldData) C++: void PassData(vtkFieldData *fd) override; Pass entire arrays of input data through to output. Obey the "copy" flags. When passing a field, the following copying rules are followed: 1) Check if a field is an attribute, if yes and if there is a PASSDATA copy flag for that attribute (on or off), obey the flag for that attribute, ignore (2) and (3), 2) if there is a copy field for that field (on or off), obey the flag, ignore (3) 3) obey CopyAllOn/Off CopyAllocateV.CopyAllocate(vtkDataSetAttributes, int, int) C++: void CopyAllocate(vtkDataSetAttributes *pd, vtkIdType sze=0, vtkIdType ext=1000) V.CopyAllocate(vtkDataSetAttributes, int, int, int) C++: void CopyAllocate(vtkDataSetAttributes *pd, vtkIdType sze, vtkIdType ext, int shallowCopyArrays) Allocates point data for point-by-point (or cell-by-cell) copy operation. If sze=0, then use the input DataSetAttributes to create (i.e., find initial size of) new objects; otherwise use the sze variable. Note that pd HAS to be the vtkDataSetAttributes object which will later be used with CopyData. If this is not the case, consider using the alternative forms of CopyAllocate and CopyData. ext is no longer used. If shallowCopyArrays is true, input arrays are copied to the output instead of new ones being allocated. SetupForCopyV.SetupForCopy(vtkDataSetAttributes) C++: void SetupForCopy(vtkDataSetAttributes *pd) Create a mapping between the input attributes and this object so that methods like CopyData() and CopyStructuredData() can be called. This method assumes that this object has the same arrays as the input and that they are ordered the same way (same array indices). CopyStructuredDataV.CopyStructuredData(vtkDataSetAttributes, (int, ...), (int, ...), bool) C++: void CopyStructuredData(vtkDataSetAttributes *inDsa, const int *inExt, const int *outExt, bool setSize=true) This method is used to copy data arrays in images. You should call CopyAllocate or SetupForCopy before calling this method. If setSize is true, this method will set the size of the output arrays according to the output extent. This is required when CopyAllocate() was used to setup output arrays. CopyDataV.CopyData(vtkDataSetAttributes, int, int) C++: void CopyData(vtkDataSetAttributes *fromPd, vtkIdType fromId, vtkIdType toId) V.CopyData(vtkDataSetAttributes, vtkIdList, vtkIdList) C++: void CopyData(vtkDataSetAttributes *fromPd, vtkIdList *fromIds, vtkIdList *toIds) V.CopyData(vtkDataSetAttributes, int, int, int) C++: void CopyData(vtkDataSetAttributes *fromPd, vtkIdType dstStart, vtkIdType n, vtkIdType srcStart) Copy the attribute data from one id to another. Make sure CopyAllocate() has been invoked before using this method. When copying a field, the following copying rules are followed: 1) Check if a field is an attribute, if yes and if there is a COPYTUPLE copy flag for that attribute (on or off), obey the flag for that attribute, ignore (2) and (3), 2) if there is a copy field for that field (on or off), obey the flag, ignore (3) 3) obey CopyAllOn/Off CopyTupleV.CopyTuple(vtkAbstractArray, vtkAbstractArray, int, int) C++: void CopyTuple(vtkAbstractArray *fromData, vtkAbstractArray *toData, vtkIdType fromId, vtkIdType toId) Copy a tuple (or set of tuples) of data from one data array to another. This method assumes that the fromData and toData objects are of the same type, and have the same number of components. This is true if you invoke CopyAllocate() or InterpolateAllocate(). CopyTuplesV.CopyTuples(vtkAbstractArray, vtkAbstractArray, vtkIdList, vtkIdList) C++: void CopyTuples(vtkAbstractArray *fromData, vtkAbstractArray *toData, vtkIdList *fromIds, vtkIdList *toIds) V.CopyTuples(vtkAbstractArray, vtkAbstractArray, int, int, int) C++: void CopyTuples(vtkAbstractArray *fromData, vtkAbstractArray *toData, vtkIdType dstStart, vtkIdType n, vtkIdType srcStart) Copy a tuple (or set of tuples) of data from one data array to another. This method assumes that the fromData and toData objects are of the same type, and have the same number of components. This is true if you invoke CopyAllocate() or InterpolateAllocate(). InterpolateAllocateV.InterpolateAllocate(vtkDataSetAttributes, int, int) C++: void InterpolateAllocate(vtkDataSetAttributes *pd, vtkIdType sze=0, vtkIdType ext=1000) V.InterpolateAllocate(vtkDataSetAttributes, int, int, int) C++: void InterpolateAllocate(vtkDataSetAttributes *pd, vtkIdType sze, vtkIdType ext, int shallowCopyArrays) Initialize point interpolation method. Note that pd HAS to be the vtkDataSetAttributes object which will later be used with InterpolatePoint or InterpolateEdge. ext is no longer used. If shallowCopyArrays is true, input arrays are copied to the output instead of new ones being allocated. InterpolatePointV.InterpolatePoint(vtkDataSetAttributes, int, vtkIdList, [float, ...]) C++: void InterpolatePoint(vtkDataSetAttributes *fromPd, vtkIdType toId, vtkIdList *ids, double *weights) Interpolate data set attributes from other data set attributes given cell or point ids and associated interpolation weights. If the INTERPOLATION copy flag is set to 0 for an array, interpolation is prevented. If the flag is set to 1, weighted interpolation occurs. If the flag is set to 2, nearest neighbor interpolation is used. InterpolateEdgeV.InterpolateEdge(vtkDataSetAttributes, int, int, int, float) C++: void InterpolateEdge(vtkDataSetAttributes *fromPd, vtkIdType toId, vtkIdType p1, vtkIdType p2, double t) Interpolate data from the two points p1,p2 (forming an edge) and an interpolation factor, t, along the edge. The weight ranges from (0,1), with t=0 located at p1. Make sure that the method InterpolateAllocate() has been invoked before using this method. If the INTERPOLATION copy flag is set to 0 for an array, interpolation is prevented. If the flag is set to 1, weighted interpolation occurs. If the flag is set to 2, nearest neighbor interpolation is used. InterpolateTimeV.InterpolateTime(vtkDataSetAttributes, vtkDataSetAttributes, int, float) C++: void InterpolateTime(vtkDataSetAttributes *from1, vtkDataSetAttributes *from2, vtkIdType id, double t) Interpolate data from the same id (point or cell) at different points in time (parameter t). Two input data set attributes objects are input. The parameter t lies between (0<=t<=1). IMPORTANT: it is assumed that the number of attributes and number of components is the same for both from1 and from2, and the type of data for from1 and from2 are the same. Make sure that the method InterpolateAllocate() has been invoked before using this method. If the INTERPOLATION copy flag is set to 0 for an array, interpolation is prevented. If the flag is set to 1, weighted interpolation occurs. If the flag is set to 2, nearest neighbor interpolation is used. vtkGhostType@zi@ii@z@Vkk *vtkDataSetAttributes@VVV *vtkDataSetAttributes *vtkIdList *vtkIdListvtkDataSetCollectionvtkCommonDataModelPython.vtkDataSetCollectionvtkDataSetCollection - maintain an unordered list of dataset objects Superclass: vtkCollection vtkDataSetCollection is an object that creates and manipulates ordered lists of datasets. See also vtkCollection and subclasses. V.SafeDownCast(vtkObjectBase) -> vtkDataSetCollection C++: static vtkDataSetCollection *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataSetCollection C++: vtkDataSetCollection *NewInstance() V.AddItem(vtkDataSet) C++: void AddItem(vtkDataSet *ds) Add a dataset to the bottom of the list. V.GetNextItem() -> vtkDataSet C++: vtkDataSet *GetNextItem() Get the next dataset in the list. GetNextDataSetV.GetNextDataSet() -> vtkDataSet C++: vtkDataSet *GetNextDataSet() Get the next dataset in the list. V.GetItem(int) -> vtkDataSet C++: vtkDataSet *GetItem(int i) Get the ith dataset in the list. V.GetDataSet(int) -> vtkDataSet C++: vtkDataSet *GetDataSet(int i) Get the ith dataset in the list. FieldDataTypeDATA_OBJECT_FIELDPOINT_DATA_FIELDCELL_DATA_FIELDvtkCommonDataModelPython.vtkDataSet.FieldDataTypevtkCommonDataModelPython.vtkDataSetvtkDataSet - abstract class to specify dataset behavior Superclass: vtkDataObject vtkDataSet is an abstract class that specifies an interface for dataset objects. vtkDataSet also provides methods to provide information about the data, such as center, bounding box, and representative length. In vtk a dataset consists of a structure (geometry and topology) and attribute data. The structure is defined implicitly or explicitly as a collection of cells. The geometry of the structure is contained in point coordinates plus the cell interpolation functions. The topology of the dataset structure is defined by cell types and how the cells share their defining points. Attribute data in vtk is either point data (data at points) or cell data (data at cells). Typically filters operate on point data, but some may operate on cell data, both cell and point data, either one, or none. @sa vtkPointSet vtkStructuredPoints vtkStructuredGrid vtkUnstructuredGrid vtkRectilinearGrid vtkPolyData vtkPointData vtkCellData vtkDataObject vtkFieldData V.SafeDownCast(vtkObjectBase) -> vtkDataSet C++: static vtkDataSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDataSet C++: vtkDataSet *NewInstance() V.CopyStructure(vtkDataSet) C++: virtual void CopyStructure(vtkDataSet *ds) Copy the geometric and topological structure of an object. Note that the invoking object and the object pointed to by the parameter ds must be of the same type. THIS METHOD IS NOT THREAD SAFE. CopyAttributesV.CopyAttributes(vtkDataSet) C++: virtual void CopyAttributes(vtkDataSet *ds) Copy the attributes associated with the specified dataset to this instance of vtkDataSet. THIS METHOD IS NOT THREAD SAFE. V.GetNumberOfPoints() -> int C++: virtual vtkIdType GetNumberOfPoints() Determine the number of points composing the dataset. THIS METHOD IS THREAD SAFE V.GetNumberOfCells() -> int C++: virtual vtkIdType GetNumberOfCells() Determine the number of cells composing the dataset. THIS METHOD IS THREAD SAFE GetPointV.GetPoint(int) -> (float, float, float) C++: virtual double *GetPoint(vtkIdType ptId) V.GetPoint(int, [float, float, float]) C++: virtual void GetPoint(vtkIdType id, double x[3]) Get point coordinates with ptId such that: 0 <= ptId < NumberOfPoints. THIS METHOD IS NOT THREAD SAFE. NewCellIteratorV.NewCellIterator() -> vtkCellIterator C++: virtual vtkCellIterator *NewCellIterator() Return an iterator that traverses the cells in this data set. V.GetCell(int) -> vtkCell C++: virtual vtkCell *GetCell(vtkIdType cellId) V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) V.GetCell(int, vtkGenericCell) C++: virtual void GetCell(vtkIdType cellId, vtkGenericCell *cell) Get cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS NOT THREAD SAFE. GetCellBoundsV.GetCellBounds(int, [float, float, float, float, float, float]) C++: virtual void GetCellBounds(vtkIdType cellId, double bounds[6]) Get the bounds of the cell with cellId such that: 0 <= cellId < NumberOfCells. A subclass may be able to determine the bounds of cell without using an expensive GetCell() method. A default implementation is provided that actually uses a GetCell() call. This is to ensure the method is available to all datasets. Subclasses should override this method to provide an efficient implementation. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellType(int) -> int C++: virtual int GetCellType(vtkIdType cellId) Get type of cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED GetCellTypesV.GetCellTypes(vtkCellTypes) C++: virtual void GetCellTypes(vtkCellTypes *types) Get a list of types of cells in a dataset. The list consists of an array of types (not necessarily in any order), with a single entry per type. For example a dataset 5 triangles, 3 lines, and 100 hexahedra would result a list of three entries, corresponding to the types VTK_TRIANGLE, VTK_LINE, and VTK_HEXAHEDRON. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED GetCellPointsV.GetCellPoints(int, vtkIdList) C++: virtual void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) Topological inquiry to get points defining cell. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED GetPointCellsV.GetPointCells(int, vtkIdList) C++: virtual void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) Topological inquiry to get cells using point. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED GetCellNeighborsV.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: virtual void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) Topological inquiry to get all cells using list of points exclusive of cell specified (e.g., cellId). Note that the list consists of only cells that use ALL the points provided. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED FindPointV.FindPoint(float, float, float) -> int C++: vtkIdType FindPoint(double x, double y, double z) V.FindPoint([float, float, float]) -> int C++: virtual vtkIdType FindPoint(double x[3]) Locate the closest point to the global coordinate x. Return the point id. If point id < 0; then no point found. (This may arise when point is outside of dataset.) THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: virtual vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: virtual vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) Locate cell based on global coordinate x and tolerance squared. If cell and cellId is non-nullptr, then search starts from this cell and looks at immediate neighbors. Returns cellId >= 0 if inside, < 0 otherwise. The parametric coordinates are provided in pcoords[3]. The interpolation weights are returned in weights[]. (The number of weights is equal to the number of points in the found cell). Tolerance is used to control how close the point is to be considered "in" the cell. THIS METHOD IS NOT THREAD SAFE. FindAndGetCellV.FindAndGetCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> vtkCell C++: virtual vtkCell *FindAndGetCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) Locate the cell that contains a point and return the cell. Also returns the subcell id, parametric coordinates and weights for subsequent interpolation. This method combines the derived class methods int FindCell and vtkCell *GetCell. Derived classes may provide a more efficient implementation. See for example vtkStructuredPoints. THIS METHOD IS NOT THREAD SAFE. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Datasets are composite objects and need to check each part for MTime THIS METHOD IS THREAD SAFE GetCellDataV.GetCellData() -> vtkCellData C++: vtkCellData *GetCellData() Return a pointer to this dataset's cell data. THIS METHOD IS THREAD SAFE GetPointDataV.GetPointData() -> vtkPointData C++: vtkPointData *GetPointData() Return a pointer to this dataset's point data. THIS METHOD IS THREAD SAFE V.Squeeze() C++: virtual void Squeeze() Reclaim any extra memory used to store data. THIS METHOD IS NOT THREAD SAFE. ComputeBoundsV.ComputeBounds() C++: virtual void ComputeBounds() Compute the data bounding box from data points. THIS METHOD IS NOT THREAD SAFE. V.GetBounds() -> (float, float, float, float, float, float) C++: double *GetBounds() V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,zmax). THIS METHOD IS NOT THREAD SAFE. V.GetCenter() -> (float, float, float) C++: double *GetCenter() V.GetCenter([float, float, float]) C++: void GetCenter(double center[3]) Get the center of the bounding box. THIS METHOD IS NOT THREAD SAFE. GetLengthV.GetLength() -> float C++: double GetLength() Return the length of the diagonal of the bounding box. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.Initialize() C++: void Initialize() override; Restore data object to initial state. THIS METHOD IS NOT THREAD SAFE. GetScalarRangeV.GetScalarRange([float, float]) C++: virtual void GetScalarRange(double range[2]) V.GetScalarRange() -> (float, float) C++: double *GetScalarRange() Convenience method to get the range of the first component (and only the first component) of any scalars in the data set. If the data has both point data and cell data, it returns the (min/max) range of combined point and cell data. If there are no point or cell scalars the method will return (0,1). Note: It might be necessary to call Update to create or refresh the scalars before calling this method. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetMaxCellSize() -> int C++: virtual int GetMaxCellSize() Convenience method returns largest cell size in dataset. This is generally used to allocate memory for supporting data structures. THIS METHOD IS THREAD SAFE V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() override; Return the actual size of the data in kibibytes (1024 bytes). This number is valid only after the pipeline has updated. The memory size returned is guaranteed to be greater than or equal to the memory required to represent the data (e.g., extra space in arrays, etc. are not included in the return value). THIS METHOD IS THREAD SAFE. V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return the type of data object. CheckAttributesV.CheckAttributes() -> int C++: int CheckAttributes() This method checks to see if the cell and point attributes match the geometry. Many filters will crash if the number of tupples in an array is less than the number of points/cells. This method returns 1 if there is a mismatch, and 0 if everything is ok. It prints an error if an array is too short, and a warning if an array is too long. GenerateGhostArrayV.GenerateGhostArray([int, int, int, int, int, int]) C++: virtual void GenerateGhostArray(int zeroExt[6]) V.GenerateGhostArray([int, int, int, int, int, int], bool) C++: virtual void GenerateGhostArray(int zeroExt[6], bool cellOnly) Normally called by pipeline executives or algorithms only. This method computes the ghost arrays for a given dataset. The zeroExt argument specifies the extent of the region which ghost type = 0. V.GetData(vtkInformation) -> vtkDataSet C++: static vtkDataSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDataSet C++: static vtkDataSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. V.GetAttributesAsFieldData(int) -> vtkFieldData C++: vtkFieldData *GetAttributesAsFieldData(int type) override; Returns the attributes of the data object as a vtkFieldData. This returns non-null values in all the same cases as GetAttributes, in addition to the case of FIELD, which will return the field data for any vtkDataObject subclass. V.GetNumberOfElements(int) -> int C++: vtkIdType GetNumberOfElements(int type) override; Get the number of elements for a specific attribute type (POINT, CELL, etc.). HasAnyGhostCellsV.HasAnyGhostCells() -> bool C++: bool HasAnyGhostCells() Returns 1 if there are any ghost cells 0 otherwise. HasAnyGhostPointsV.HasAnyGhostPoints() -> bool C++: bool HasAnyGhostPoints() Returns 1 if there are any ghost points 0 otherwise. HasAnyBlankCellsV.HasAnyBlankCells() -> bool C++: virtual bool HasAnyBlankCells() Returns 1 if there are any blanking cells 0 otherwise. Blanking is supported only for vtkStructuredGrid and vtkUniformGrid HasAnyBlankPointsV.HasAnyBlankPoints() -> bool C++: virtual bool HasAnyBlankPoints() Returns 1 if there are any blanking points 0 otherwise. Blanking is supported only for vtkStructuredGrid and vtkUniformGrid GetPointGhostArrayV.GetPointGhostArray() -> vtkUnsignedCharArray C++: vtkUnsignedCharArray *GetPointGhostArray() Gets the array that defines the ghost type of each point. We cache the pointer to the array to save a lookup involving string comparisons UpdatePointGhostArrayCacheV.UpdatePointGhostArrayCache() C++: void UpdatePointGhostArrayCache() Updates the pointer to the point ghost array. AllocatePointGhostArrayV.AllocatePointGhostArray() -> vtkUnsignedCharArray C++: vtkUnsignedCharArray *AllocatePointGhostArray() Allocate ghost array for points. GetCellGhostArrayV.GetCellGhostArray() -> vtkUnsignedCharArray C++: vtkUnsignedCharArray *GetCellGhostArray() Get the array that defines the ghost type of each cell. We cache the pointer to the array to save a lookup involving string comparisons UpdateCellGhostArrayCacheV.UpdateCellGhostArrayCache() C++: void UpdateCellGhostArrayCache() Updates the pointer to the cell ghost array. AllocateCellGhostArrayV.AllocateCellGhostArray() -> vtkUnsignedCharArray C++: vtkUnsignedCharArray *AllocateCellGhostArray() Allocate ghost array for cells. ERROR: In /Volumes/Data/workspace/med-macos-free/ExtProjs/VTK/Common/DataModel/vtkDataSet.h, line (): ijk indices are only valid with structured data!ErrorEventvtkDirectedAcyclicGraphvtkCommonDataModelPython.vtkDirectedAcyclicGraphvtkDirectedAcyclicGraph - A rooted tree data structure. Superclass: vtkDirectedGraph vtkDirectedAcyclicGraph is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms. vtkDirectedAcyclicGraph is a read-only data structure. To construct a tree, create an instance of vtkMutableDirectedGraph. Add vertices and edges with AddVertex() and AddEdge(). You may alternately start by adding a single vertex as the root then call graph->AddChild(parent) which adds a new vertex and connects the parent to the child. The tree MUST have all edges in the proper direction, from parent to child. After building the tree, call tree->CheckedShallowCopy(graph) to copy the structure into a vtkDirectedAcyclicGraph. This method will return false if the graph is an invalid tree. vtkDirectedAcyclicGraph provides some convenience methods for obtaining the parent and children of a vertex, for finding the root, and determining if a vertex is a leaf (a vertex with no children). @sa vtkDirectedGraph vtkMutableDirectedGraph vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkDirectedAcyclicGraph C++: vtkDirectedAcyclicGraph *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. V.GetData(vtkInformation) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDirectedAcyclicGraph C++: static vtkDirectedAcyclicGraph *GetData( vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. vtkDirectedGraphvtkCommonDataModelPython.vtkDirectedGraphvtkDirectedGraph - A directed graph. Superclass: vtkGraph vtkDirectedGraph is a collection of vertices along with a collection of directed edges (edges that have a source and target). ShallowCopy() and DeepCopy() (and CheckedShallowCopy(), CheckedDeepCopy()) accept instances of vtkTree and vtkMutableDirectedGraph. vtkDirectedGraph is read-only. To create an undirected graph, use an instance of vtkMutableDirectedGraph, then you may set the structure to a vtkDirectedGraph using ShallowCopy(). @sa vtkGraph vtkMutableDirectedGraph V.SafeDownCast(vtkObjectBase) -> vtkDirectedGraph C++: static vtkDirectedGraph *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkDirectedGraph C++: vtkDirectedGraph *NewInstance() V.GetData(vtkInformation) -> vtkDirectedGraph C++: static vtkDirectedGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkDirectedGraph C++: static vtkDirectedGraph *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. IsStructureValidV.IsStructureValid(vtkGraph) -> bool C++: bool IsStructureValid(vtkGraph *g) override; Check the storage, and accept it if it is a valid undirected graph. This is public to allow the ToDirected/UndirectedGraph to work. vtkDistributedGraphHelpervtkCommonDataModelPython.vtkDistributedGraphHelpervtkVertexPedigreeIdDistributionFunction - The type of a function used to determine how to distribute vertex pedigree IDs across processors in a vtkGraph. The pedigree ID distribution function takes the pedigree ID of the vertex and a user-supplied void pointer and returns a hash value V. A vertex with that pedigree ID will reside on processor V % P, where P is the number of processors. This type is used in conjunction with the vtkDistributedGraphHelper class. Superclass: vtkObject V.SafeDownCast(vtkObjectBase) -> vtkDistributedGraphHelper C++: static vtkDistributedGraphHelper *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkDistributedGraphHelper C++: vtkDistributedGraphHelper *NewInstance() GetVertexOwnerV.GetVertexOwner(int) -> int C++: vtkIdType GetVertexOwner(vtkIdType v) Returns owner of vertex v, by extracting top ceil(log2 P) bits of v. GetVertexIndexV.GetVertexIndex(int) -> int C++: vtkIdType GetVertexIndex(vtkIdType v) Returns local index of vertex v, by masking off top ceil(log2 P) bits of v. GetEdgeOwnerV.GetEdgeOwner(int) -> int C++: vtkIdType GetEdgeOwner(vtkIdType e_id) Returns owner of edge with ID e_id, by extracting top ceil(log2 P) bits of e_id. GetEdgeIndexV.GetEdgeIndex(int) -> int C++: vtkIdType GetEdgeIndex(vtkIdType e_id) Returns local index of edge with ID e_id, by masking off top ceil(log2 P) bits of e_id. MakeDistributedIdV.MakeDistributedId(int, int) -> int C++: vtkIdType MakeDistributedId(int owner, vtkIdType local) Builds a distributed ID consisting of the given owner and the local ID. GetVertexOwnerByPedigreeIdV.GetVertexOwnerByPedigreeId(vtkVariant) -> int C++: vtkIdType GetVertexOwnerByPedigreeId( const vtkVariant &pedigreeId) Determine which processor owns the vertex with the given pedigree ID. SynchronizeV.Synchronize() C++: virtual void Synchronize() Synchronizes all of the processors involved in this distributed graph, so that all processors have a consistent view of the distributed graph for the computation that follows. This routine should be invoked after adding new edges into the distributed graph, so that other processors will see those edges (or their corresponding back-edges). CloneV.Clone() -> vtkDistributedGraphHelper C++: virtual vtkDistributedGraphHelper *Clone() Clones the distributed graph helper, returning another distributed graph helper of the same kind that can be used in another vtkGraph. DISTRIBUTEDVERTEXIDSV.DISTRIBUTEDVERTEXIDS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DISTRIBUTEDVERTEXIDS() Information Keys that distributed graphs can append to attribute arrays to flag them as containing distributed IDs. These can be used to let routines that migrate vertices (either repartitioning or collecting graphs to single nodes) to also modify the ids contained in the attribute arrays to maintain consistency. DISTRIBUTEDEDGEIDSV.DISTRIBUTEDEDGEIDS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DISTRIBUTEDEDGEIDS() Information Keys that distributed graphs can append to attribute arrays to flag them as containing distributed IDs. These can be used to let routines that migrate vertices (either repartitioning or collecting graphs to single nodes) to also modify the ids contained in the attribute arrays to maintain consistency. vtkVariantvtkEdgeListIteratorvtkCommonDataModelPython.vtkEdgeListIteratorvtkEdgeListIterator - Iterates through all edges in a graph. Superclass: vtkObject vtkEdgeListIterator iterates through all the edges in a graph, by traversing the adjacency list for each vertex. You may instantiate this class directly and call SetGraph() to traverse a certain graph. You may also call the graph's GetEdges() method to set up the iterator for a certain graph. Note that this class does NOT guarantee that the edges will be processed in order of their ids (i.e. it will not necessarily return edge 0, then edge 1, etc.). @sa vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkEdgeListIterator C++: static vtkEdgeListIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkEdgeListIterator C++: vtkEdgeListIterator *NewInstance() V.GetGraph() -> vtkGraph C++: virtual vtkGraph *GetGraph() SetGraphV.SetGraph(vtkGraph) C++: virtual void SetGraph(vtkGraph *graph) V.Next() -> vtkEdgeType C++: vtkEdgeType Next() Returns the next edge in the graph. NextGraphEdgeV.NextGraphEdge() -> vtkGraphEdge C++: vtkGraphEdge *NextGraphEdge() Just like Next(), but returns heavy-weight vtkGraphEdge object instead of the vtkEdgeType struct, for use with wrappers. The graph edge is owned by this iterator, and changes after each call to NextGraphEdge(). vtkEdgeTypevtkEdgeTablevtkCommonDataModelPython.vtkEdgeTablevtkEdgeTable - keep track of edges (edge is pair of integer id's) Superclass: vtkObject vtkEdgeTable is a general object for keeping track of lists of edges. An edge is defined by the pair of point id's (p1,p2). Methods are available to insert edges, check if edges exist, and traverse the list of edges. Also, it's possible to associate attribute information with each edge. The attribute information may take the form of vtkIdType id's, void* pointers, or points. To store attributes, make sure that InitEdgeInsertion() is invoked with the storeAttributes flag set properly. If points are inserted, use the methods InitPointInsertion() and InsertUniquePoint(). V.SafeDownCast(vtkObjectBase) -> vtkEdgeTable C++: static vtkEdgeTable *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkEdgeTable C++: vtkEdgeTable *NewInstance() V.Initialize() C++: void Initialize() Free memory and return to the initially instantiated state. InitEdgeInsertionV.InitEdgeInsertion(int, int) -> int C++: int InitEdgeInsertion(vtkIdType numPoints, int storeAttributes=0) Initialize the edge insertion process. Provide an estimate of the number of points in a dataset (the maximum range value of p1 or p2). The storeAttributes variable controls whether attributes are to be stored with the edge, and what type of attributes. If storeAttributes==1, then attributes of vtkIdType can be stored. If storeAttributes==2, then attributes of type void* can be stored. In either case, additional memory will be required by the data structure to store attribute data per each edge. This method is used in conjunction with one of the three InsertEdge() methods described below (don't mix the InsertEdge() methods---make sure that the one used is consistent with the storeAttributes flag set in InitEdgeInsertion()). InsertEdgeV.InsertEdge(int, int) -> int C++: vtkIdType InsertEdge(vtkIdType p1, vtkIdType p2) V.InsertEdge(int, int, int) C++: void InsertEdge(vtkIdType p1, vtkIdType p2, vtkIdType attributeId) V.InsertEdge(int, int, void) C++: void InsertEdge(vtkIdType p1, vtkIdType p2, void *ptr) Insert the edge (p1,p2) into the table. It is the user's responsibility to check if the edge has already been inserted (use IsEdge()). If the storeAttributes flag in InitEdgeInsertion() has been set, then the method returns a unique integer id (i.e., the edge id) that can be used to set and get edge attributes. Otherwise, the method will return 1. Do not mix this method with the InsertEdge() method that follows. IsEdgeV.IsEdge(int, int) -> int C++: vtkIdType IsEdge(vtkIdType p1, vtkIdType p2) Return an integer id for the edge, or an attribute id of the edge (p1,p2) if the edge has been previously defined (it depends upon which version of InsertEdge() is being used); otherwise -1. The unique integer id can be used to set and retrieve attributes to the edge. InitPointInsertionV.InitPointInsertion(vtkPoints, int) -> int C++: int InitPointInsertion(vtkPoints *newPts, vtkIdType estSize) Initialize the point insertion process. The newPts is an object representing point coordinates into which incremental insertion methods place their data. The points are associated with the edge. InsertUniquePointV.InsertUniquePoint(int, int, [float, float, float], int) -> int C++: int InsertUniquePoint(vtkIdType p1, vtkIdType p2, double x[3], vtkIdType &ptId) Insert a unique point on the specified edge. Invoke this method only after InitPointInsertion() has been called. Return 0 if point was already in the list, otherwise return 1. V.GetNumberOfEdges() -> int C++: virtual vtkIdType GetNumberOfEdges() Return the number of edges that have been inserted thus far. V.InitTraversal() C++: void InitTraversal() Initialize traversal of edges in table. GetNextEdgeV.GetNextEdge(int, int) -> int C++: vtkIdType GetNextEdge(vtkIdType &p1, vtkIdType &p2) Traverse list of edges in table. Return the edge as (p1,p2), where p1 and p2 are point id's. Method return value is <0 if list is exhausted; non-zero otherwise. The value of p1 is guaranteed to be <= p2. V.Reset() C++: void Reset() Reset the object and prepare for reinsertion of edges. Does not delete memory like the Initialize() method. @kkk@kkvvtkEmptyCellvtkCommonDataModelPython.vtkEmptyCellvtkEmptyCell - an empty cell used as a place-holder during processing Superclass: vtkCell vtkEmptyCell is a concrete implementation of vtkCell. It is used during processing to represented a deleted element. V.SafeDownCast(vtkObjectBase) -> vtkEmptyCell C++: static vtkEmptyCell *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkEmptyCell C++: vtkEmptyCell *NewInstance() V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts1, vtkCellArray *lines, vtkCellArray *verts2, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; See the vtkCell API for descriptions of these methods. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *pts, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Intersect with a ray. Return parametric coordinates (both line and cell) and global intersection coordinates, given ray definition p1[3], p2[3] and tolerance tol. The method returns non-zero value if intersection occurs. A parametric distance t between 0 and 1 along the ray representing the intersection point, the point coordinates x[3] in data coordinates and also pcoords[3] in parametric coordinates. subId is the index within the cell if a composed cell like a triangle strip. vtkExtractStructuredGridHelpervtkCommonDataModelPython.vtkExtractStructuredGridHelpervtkExtractStructuredGridHelper - helper for extracting/sub-sampling structured datasets. Superclass: vtkObject vtkExtractStructuredGridHelper provides some common functionality that is used by filters that extract and sub-sample structured data. Specifically, it provides functionality for calculating the mapping from the output extent of each process to the input extent. @sa vtkExtractGrid vtkExtractVOI vtkExtractRectilinearGrid V.SafeDownCast(vtkObjectBase) -> vtkExtractStructuredGridHelper C++: static vtkExtractStructuredGridHelper *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkExtractStructuredGridHelper C++: vtkExtractStructuredGridHelper *NewInstance() GetOutputWholeExtentV.GetOutputWholeExtent() -> (int, int, int, int, int, int) C++: int *GetOutputWholeExtent() V.Initialize([int, int, int, int, int, int], [int, int, int, int, int, int], [int, int, int], bool) C++: void Initialize(int voi[6], int wholeExt[6], int sampleRate[3], bool includeBoundary) Initializes the index map. \param voi the extent of the volume of interest \param wholeExt the whole extent of the domain \param smapleRate the sampling rate \param includeBoundary indicates whether to include the boundary or not. IsValidV.IsValid() -> bool C++: bool IsValid() Returns true if the helper is properly initialized. V.GetSize(int) -> int C++: int GetSize(const int dim) Returns the size along a given dimension \param dim the dimension in query \pre dim >= 0 && dim < 3 GetMappedIndexV.GetMappedIndex(int, int) -> int C++: int GetMappedIndex(int dim, int outIdx) Given a dimension and output index, return the corresponding extent index. This method should be used to convert array indices, such as the coordinate arrays for rectilinear grids. \param dim the data dimension \param outIdx The output index along the given dimension. \pre dim >= 0 && dim < 3 \pre outIdx >= 0 && outIdx < this->GetSize( dim ) \return The input extent index along the given dimension. \sa GetMappedExtentValue \sa GetMappedExtentValueFromIndex GetMappedIndexFromExtentValueV.GetMappedIndexFromExtentValue(int, int) -> int C++: int GetMappedIndexFromExtentValue(int dim, int outExtVal) Given a dimension and output extent value, return the corresponding input extent index. This method should be used to compute extent indices from extent values. \param dim the data dimension \param outExtVal The output extent value along the given dimension. \pre dim >= 0 && dim < 3 \pre outExtVal >= this->GetOutputWholeExtent()[2*dim] && outExtVal <= this->GetOutputWholeExtent()[2*dim+1] \return The input extent index along the given dimension. \sa GetMappedExtentValue \sa GetMappedExtentValueFromIndex GetMappedExtentValueV.GetMappedExtentValue(int, int) -> int C++: int GetMappedExtentValue(int dim, int outExtVal) Given a dimension and output extent value, return the corresponding input extent value. This method should be used to convert extent values. \param dim the data dimension. \param outExtVal The output extent value along the given dimension. \pre dim >= 0 && dim < 3 \pre outExtVal >= this->GetOutputWholeExtent()[2*dim] && outExtVal <= this->GetOutputWholeExtent()[2*dim+1] \return The input extent value along the given dimension. \sa GetMappedIndex \sa GetMappedExtentValueFromIndex GetMappedExtentValueFromIndexV.GetMappedExtentValueFromIndex(int, int) -> int C++: int GetMappedExtentValueFromIndex(int dim, int outIdx) Given a dimension and output extent index, return the corresponding input extent value. This method should be used to compute extent values from extent indices. \param dim the data dimension. \param outIdx The output index along the given dimension. \pre dim >= 0 && dim < 3 \pre outIdx >= 0 && outIdx < this->GetSize( dim ) \return The input extent value along the given dimension. \sa GetMappedIndex \sa GetMappedExtentValue ComputeBeginAndEndV.ComputeBeginAndEnd([int, int, int, int, int, int], [int, int, int, int, int, int], [int, int, int], [int, int, int]) C++: void ComputeBeginAndEnd(int inExt[6], int voi[6], int begin[3], int end[3]) Returns the begin & end extent that intersects with the VOI \param inExt the input extent \param voi the volume of interest \param begin the begin extent \param end the end extent CopyPointsAndPointDataV.CopyPointsAndPointData([int, int, int, int, int, int], [int, int, int, int, int, int], vtkPointData, vtkPoints, vtkPointData, vtkPoints) C++: void CopyPointsAndPointData(int inExt[6], int outExt[6], vtkPointData *pd, vtkPoints *inpnts, vtkPointData *outPD, vtkPoints *outpnts) Copies the points & point data to the output. \param inExt the input grid extent. \param outExt the output grid extent. \param pd pointer to the input point data. \param inpnts pointer to the input points, or nullptr if uniform grid. \param outPD point to the output point data. \param outpnts pointer to the output points, or nullptr if uniform grid. \pre pd != nullptr. \pre outPD != nullptr. CopyCellDataV.CopyCellData([int, int, int, int, int, int], [int, int, int, int, int, int], vtkCellData, vtkCellData) C++: void CopyCellData(int inExt[6], int outExt[6], vtkCellData *cd, vtkCellData *outCD) Copies the cell data to the output. \param inExt the input grid extent. \param outExt the output grid extent. \param cd the input cell data. \param outCD the output cell data. \pre cd != nullptr. \pre outCD != nullptr. GetPartitionedVOIV.GetPartitionedVOI((int, int, int, int, int, int), (int, int, int, int, int, int), (int, int, int), bool, [int, int, int, int, int, int]) C++: static void GetPartitionedVOI(const int globalVOI[6], const int partitionedExtent[6], const int sampleRate[3], bool includeBoundary, int partitionedVOI[6]) Calculate the VOI for a partitioned structured dataset. This method setspartitionedVOI to the VOI that extracts as much of thepartitionedExtent as possible while considering the globalVOI, thesampleRate, and the boundary conditions. \param globalVOI The full VOI for the entire distributed dataset. \param partitionedExtent Extent of the process's partitioned input data. \param sampleRate The sampling rate in each dimension. \param includeBoundary Whether or not to include the boundary of the VOI, even if it doesn't fit the spacing. \param partitionedVOI The extent of the process's partitioned dataset that should be extracted by a serial extraction filter. GetPartitionedOutputExtentV.GetPartitionedOutputExtent((int, int, int, int, int, int), (int, int, int, int, int, int), (int, int, int, int, int, int), ( int, int, int), bool, [int, int, int, int, int, int]) C++: static void GetPartitionedOutputExtent( const int globalVOI[6], const int partitionedVOI[6], const int outputWholeExtent[6], const int sampleRate[3], bool includeBoundary, int partitionedOutputExtent[6]) Calculate the partitioned output extent for a partitioned structured dataset. This method sets partitionedOutputExtent to the correct extent of an extracted dataset, such that it properly fits with the other partitioned pieces while considering the globalVOI, thesampleRate, and the boundary conditions. \param globalVOI The full VOI for the entire distributed dataset. \param partitionedVOI The VOI used in the serial extraction. \param outputWholeExtent The output extent of the full dataset. \param sampleRate The sampling rate in each dimension. \param includeBoundary Whether or not to include the boundary of the VOI, even if it doesn't fit the spacing. \param partitionedOutputExtent The correct output extent of the extracted dataset. vtkCommonDataModelPython.vtkFieldDatavtkFieldData - represent and manipulate fields of data Superclass: vtkObject vtkFieldData represents and manipulates fields of data. The model of a field is a m x n matrix of data values, where m is the number of tuples, and n is the number of components. (A tuple is a row of n components in the matrix.) The field is assumed to be composed of a set of one or more data arrays, where the data in the arrays are of different types (e.g., int, double, char, etc.), and there may be variable numbers of components in each array. Note that each data array is assumed to be "m" in length (i.e., number of tuples), which typically corresponds to the number of points or cells in a dataset. Also, each data array must have a character-string name. (This is used to manipulate data.) There are two ways of manipulating and interfacing to fields. You can do it generically by manipulating components/tuples via a double-type data exchange, or you can do it by grabbing the arrays and manipulating them directly. The former is simpler but performs type conversion, which is bad if your data has non-castable types like (void) pointers, or you lose information as a result of the cast. The, more efficient method means managing each array in the field. Using this method you can create faster, more efficient algorithms that do not lose information. @sa vtkAbstractArray vtkDataSetAttributes vtkPointData vtkCellData V.SafeDownCast(vtkObjectBase) -> vtkFieldData C++: static vtkFieldData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkFieldData C++: vtkFieldData *NewInstance() V.Initialize() C++: virtual void Initialize() Release all data but do not delete object. Also, clear the copy flags. V.Allocate(int, int) -> int C++: int Allocate(vtkIdType sz, vtkIdType ext=1000) Allocate data for each array. Note that ext is no longer used. V.CopyStructure(vtkFieldData) C++: void CopyStructure(vtkFieldData *) Copy data array structure from a given field. The same arrays will exist with the same types, but will contain nothing in the copy. AllocateArraysV.AllocateArrays(int) C++: void AllocateArrays(int num) AllocateOfArrays actually sets the number of vtkAbstractArray pointers in the vtkFieldData object, not the number of used pointers (arrays). Adding more arrays will cause the object to dynamically adjust the number of pointers if it needs to extend. Although AllocateArrays can be used if the number of arrays which will be added is known, it can be omitted with a small computation cost. V.GetNumberOfArrays() -> int C++: int GetNumberOfArrays() Get the number of arrays of data available. This does not include nullptr array pointers therefore after fd->AllocateArray(n); nArrays = GetNumberOfArrays() nArrays is not necessarily equal to n. V.AddArray(vtkAbstractArray) -> int C++: int AddArray(vtkAbstractArray *array) Add an array to the array list. If an array with the same name already exists - then the added array will replace it. Return the index of the added array. V.RemoveArray(string) C++: virtual void RemoveArray(const char *name) V.RemoveArray(int) C++: virtual void RemoveArray(int index) Remove an array (with the given name or index) from the list of arrays. V.GetArray(int) -> vtkDataArray C++: vtkDataArray *GetArray(int i) V.GetArray(string, int) -> vtkDataArray C++: vtkDataArray *GetArray(const char *arrayName, int &index) V.GetArray(string) -> vtkDataArray C++: vtkDataArray *GetArray(const char *arrayName) Not recommended for use. Use GetAbstractArray(int i) instead. Return the ith array in the field. A nullptr is returned if the index i is out of range, or if the array at the given index is not a vtkDataArray. To access vtkStringArray, vtkUnicodeStringArray, or vtkVariantArray, use GetAbstractArray(int i). GetAbstractArrayV.GetAbstractArray(int) -> vtkAbstractArray C++: vtkAbstractArray *GetAbstractArray(int i) V.GetAbstractArray(string, int) -> vtkAbstractArray C++: vtkAbstractArray *GetAbstractArray(const char *arrayName, int &index) V.GetAbstractArray(string) -> vtkAbstractArray C++: vtkAbstractArray *GetAbstractArray(const char *arrayName) Returns the ith array in the field. Unlike GetArray(), this method returns a vtkAbstractArray and can be used to access any array type. A nullptr is returned only if the index i is out of range. HasArrayV.HasArray(string) -> int C++: int HasArray(const char *name) Return 1 if an array with the given name could be found. 0 otherwise. GetArrayNameV.GetArrayName(int) -> string C++: const char *GetArrayName(int i) Get the name of ith array. Note that this is equivalent to: GetAbstractArray(i)->GetName() if ith array pointer is not nullptr V.PassData(vtkFieldData) C++: virtual void PassData(vtkFieldData *fd) Pass entire arrays of input data through to output. Obey the "copy" flags. CopyFieldOnV.CopyFieldOn(string) C++: void CopyFieldOn(const char *name) Turn on/off the copying of the field specified by name. During the copying/passing, the following rules are followed for each array: 1. If the copy flag for an array is set (on or off), it is applied This overrides rule 2. 2. If CopyAllOn is set, copy the array. If CopyAllOff is set, do not copy the array CopyFieldOffV.CopyFieldOff(string) C++: void CopyFieldOff(const char *name) V.CopyAllOn(int) C++: virtual void CopyAllOn(int unused=0) Turn on copying of all data. During the copying/passing, the following rules are followed for each array: 1. If the copy flag for an array is set (on or off), it is applied This overrides rule 2. 2. If CopyAllOn is set, copy the array. If CopyAllOff is set, do not copy the array V.CopyAllOff(int) C++: virtual void CopyAllOff(int unused=0) Turn off copying of all data. During the copying/passing, the following rules are followed for each array: 1. If the copy flag for an array is set (on or off), it is applied This overrides rule 2. 2. If CopyAllOn is set, copy the array. If CopyAllOff is set, do not copy the array V.DeepCopy(vtkFieldData) C++: virtual void DeepCopy(vtkFieldData *da) Copy a field by creating new data arrays (i.e., duplicate storage). V.ShallowCopy(vtkFieldData) C++: virtual void ShallowCopy(vtkFieldData *da) Copy a field by reference counting the data arrays. V.Squeeze() C++: void Squeeze() Squeezes each data array in the field (Squeeze() reclaims unused memory.) V.Reset() C++: void Reset() Resets each data array in the field (Reset() does not release memory but it makes the arrays look like they are empty.) V.GetActualMemorySize() -> int C++: virtual unsigned long GetActualMemorySize() Return the memory in kibibytes (1024 bytes) consumed by this field data. Used to support streaming and reading/writing data. The value returned is guaranteed to be greater than or equal to the memory required to actually represent the data represented by this object. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Check object's components for modified times. GetFieldV.GetField(vtkIdList, vtkFieldData) C++: void GetField(vtkIdList *ptId, vtkFieldData *f) Get a field from a list of ids. Supplied field f should have same types and number of data arrays as this one (i.e., like CopyStructure() creates). This method should not be used if the instance is from a subclass of vtkFieldData (vtkPointData or vtkCellData). This is because in those cases, the attribute data is stored with the other fields and will cause the method to behave in an unexpected way. GetArrayContainingComponentV.GetArrayContainingComponent(int, int) -> int C++: int GetArrayContainingComponent(int i, int &arrayComp) Return the array containing the ith component of the field. The return value is an integer number n 0<=nNumberOfArrays. Also, an integer value is returned indicating the component in the array is returned. Method returns -1 if specified component is not in the field. GetNumberOfComponentsV.GetNumberOfComponents() -> int C++: int GetNumberOfComponents() Get the number of components in the field. This is determined by adding up the components in each non-nullptr array. This method should not be used if the instance is from a subclass of vtkFieldData (vtkPointData or vtkCellData). This is because in those cases, the attribute data is stored with the other fields and will cause the method to behave in an unexpected way. GetNumberOfTuplesV.GetNumberOfTuples() -> int C++: vtkIdType GetNumberOfTuples() Get the number of tuples in the field. Note: some fields have arrays with different numbers of tuples; this method returns the number of tuples in the first array. Mixed-length arrays may have to be treated specially. This method should not be used if the instance is from a subclass of vtkFieldData (vtkPointData or vtkCellData). This is because in those cases, the attribute data is stored with the other fields and will cause the method to behave in an unexpected way. SetNumberOfTuplesV.SetNumberOfTuples(int) C++: void SetNumberOfTuples(const vtkIdType number) Set the number of tuples for each data array in the field. This method should not be used if the instance is from a subclass of vtkFieldData (vtkPointData or vtkCellData). This is because in those cases, the attribute data is stored with the other fields and will cause the method to behave in an unexpected way. SetTupleV.SetTuple(int, int, vtkFieldData) C++: void SetTuple(const vtkIdType i, const vtkIdType j, vtkFieldData *source) Set the jth tuple in source field data at the ith location. Set operations mean that no range checking is performed, so they're faster. InsertTupleV.InsertTuple(int, int, vtkFieldData) C++: void InsertTuple(const vtkIdType i, const vtkIdType j, vtkFieldData *source) Insert the jth tuple in source field data at the ith location. Range checking is performed and memory allocates as necessary. InsertNextTupleV.InsertNextTuple(int, vtkFieldData) -> int C++: vtkIdType InsertNextTuple(const vtkIdType j, vtkFieldData *source) Insert the jth tuple in source field data at the end of the tuple matrix. Range checking is performed and memory is allocated as necessary. vtkGenericAdaptorCellvtkCommonDataModelPython.vtkGenericAdaptorCellvtkGenericAdaptorCell - defines cell interface Superclass: vtkObject In VTK, spatial-temporal data is defined in terms of a dataset which is composed of cells. The cells are topological entities over which an interpolation field is applied. Cells are defined in terms of a topology (e.g., vertices, lines, triangles, polygons, tetrahedra, etc.), points that instantiate the geometry of the cells, and interpolation fields (in the general case one interpolation field is for geometry, the other is for attribute data associated with the cell). Currently most algorithms in VTK use vtkCell and vtkDataSet, which make assumptions about the nature of datasets, cells, and attributes. In particular, this abstraction assumes that cell interpolation functions are linear, or products of linear functions. Further, VTK implements most of the interpolation functions. This implementation starts breaking down as the complexity of the interpolation (or basis) functions increases. vtkGenericAdaptorCell addresses these issues by providing more general abstraction for cells. It also adopts modern C++ practices including using iterators. The vtkGenericAdaptorCell is designed to fit within the adaptor framework; meaning that it is meant to adapt VTK to external simulation systems (see the GenericFiltering/README.html). Please note that most cells are defined in terms of other cells (the boundary cells). They are also defined in terms of points, which are not the same as vertices (vertices are a 0-D cell; points represent a position in space). Another important concept is the notion of DOFNodes. These concept supports cell types with complex interpolation functions. For example, higher-order p-method finite elements may have different functions on each of their topological features (edges, faces, region). The coefficients of these polynomial functions are associated with DOFNodes. (There is a single DOFNode for each topological feature.) Note that from this perspective, points are used to establish the topological form of the cell; mid-side nodes and such are considered DOFNodes. @sa vtkGenericDataSet V.SafeDownCast(vtkObjectBase) -> vtkGenericAdaptorCell C++: static vtkGenericAdaptorCell *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGenericAdaptorCell C++: vtkGenericAdaptorCell *NewInstance() GetIdV.GetId() -> int C++: virtual vtkIdType GetId() Unique identification number of the cell over the whole data set. This unique key may not be contiguous. IsInDataSetV.IsInDataSet() -> int C++: virtual int IsInDataSet() Does `this' a cell of a dataset? (otherwise, it is a boundary cell) GetTypeV.GetType() -> int C++: virtual int GetType() Return the type of the current cell. \post (result==VTK_HIGHER_ORDER_EDGE)|| (result==VTK_HIGHER_ORDER_TRIANGLE)|| (result==VTK_HIGHER_ORDER_TETRAHEDRON) GetDimensionV.GetDimension() -> int C++: virtual int GetDimension() Return the topological dimension of the current cell. \post valid_result: result>=0 && result<=3 GetGeometryOrderV.GetGeometryOrder() -> int C++: virtual int GetGeometryOrder() Return the interpolation order of the geometry. \post positive_result: result>=0 IsGeometryLinearV.IsGeometryLinear() -> int C++: int IsGeometryLinear() Does the cell have a non-linear interpolation for the geometry? \post definition: result==(GetGeometryOrder()==1) GetAttributeOrderV.GetAttributeOrder(vtkGenericAttribute) -> int C++: virtual int GetAttributeOrder(vtkGenericAttribute *a) Return the interpolation order of attribute `a' on the cell (may differ by cell). \pre a_exists: a!=0 \post positive_result: result>=0 GetHighestOrderAttributeV.GetHighestOrderAttribute(vtkGenericAttributeCollection) -> int C++: virtual int GetHighestOrderAttribute( vtkGenericAttributeCollection *ac) Return the index of the first point centered attribute with the highest order in `ac'. \pre ac_exists: ac!=0 \post valid_result: result>=-1 && resultGetNumberOfAttributes() IsAttributeLinearV.IsAttributeLinear(vtkGenericAttribute) -> int C++: int IsAttributeLinear(vtkGenericAttribute *a) Does the attribute `a' have a non-linear interpolation? \pre a_exists: a!=0 \post definition: result==(GetAttributeOrder()==1) IsPrimaryV.IsPrimary() -> int C++: virtual int IsPrimary() Is the cell primary (i.e. not composite) ? V.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Return the number of corner points that compose the cell. \post positive_result: result>=0 GetNumberOfBoundariesV.GetNumberOfBoundaries(int) -> int C++: virtual int GetNumberOfBoundaries(int dim=-1) Return the number of boundaries of dimension `dim' (or all dimensions greater than 0 and less than GetDimension() if -1) of the cell. When dim is -1, the number of vertices is not included in the count because vertices are a special case: a vertex will have at most a single field value associated with it; DOF nodes may have an arbitrary number of field values associated with them. \pre valid_dim_range: (dim==-1) || ((dim>=0)&&(dim=0 GetNumberOfDOFNodesV.GetNumberOfDOFNodes() -> int C++: virtual int GetNumberOfDOFNodes() Accumulated number of DOF nodes of the current cell. A DOF node is a component of cell with a given topological dimension. e.g.: a triangle has 4 DOF: 1 face and 3 edges. An hexahedron has 19 DOF: 1 region, 6 faces, and 12 edges. * The number of vertices is not included in the * count because vertices are a special case: a vertex will have * at most a single field value associated with it; DOF nodes may have * an arbitrary number of field values associated with them. * \post valid_result: result==GetNumberOfBoundaries(-1)+1 GetPointIteratorV.GetPointIterator(vtkGenericPointIterator) C++: virtual void GetPointIterator(vtkGenericPointIterator *it) Return the points of cell into `it'. \pre it_exists: it!=0 V.NewCellIterator() -> vtkGenericCellIterator C++: virtual vtkGenericCellIterator *NewCellIterator() Create an empty cell iterator. The user is responsible for deleting it. \post result_exists: result!=0 GetBoundaryIteratorV.GetBoundaryIterator(vtkGenericCellIterator, int) C++: virtual void GetBoundaryIterator( vtkGenericCellIterator *boundaries, int dim=-1) Return the `boundaries' cells of dimension `dim' (or all dimensions less than GetDimension() if -1) that are part of the boundary of the cell. \pre valid_dim_range: (dim==-1) || ((dim>=0)&&(dim int C++: virtual int CountNeighbors(vtkGenericAdaptorCell *boundary) Number of cells (dimension>boundary->GetDimension()) of the dataset that share the boundary `boundary' of `this'. `this' IS NOT INCLUDED. \pre boundary_exists: boundary!=0 \pre real_boundary: !boundary->IsInDataSet() \pre cell_of_the_dataset: IsInDataSet() \pre boundary: HasBoundary(boundary) \post positive_result: result>=0 CountEdgeNeighborsV.CountEdgeNeighbors([int, ...]) C++: virtual void CountEdgeNeighbors(int *sharing) Number of cells (dimension>boundary->GetDimension()) of the dataset that share the boundary `boundary' of `this'. `this' IS NOT INCLUDED. \pre boundary_exists: boundary!=0 \pre real_boundary: !boundary->IsInDataSet() \pre cell_of_the_dataset: IsInDataSet() \pre boundary: HasBoundary(boundary) \post positive_result: result>=0 GetNeighborsV.GetNeighbors(vtkGenericAdaptorCell, vtkGenericCellIterator) C++: virtual void GetNeighbors(vtkGenericAdaptorCell *boundary, vtkGenericCellIterator *neighbors) Put into `neighbors' the cells (dimension>boundary->GetDimension()) of the dataset that share the boundary `boundary' with this cell. `this' IS NOT INCLUDED. \pre boundary_exists: boundary!=0 \pre real_boundary: !boundary->IsInDataSet() \pre cell_of_the_dataset: IsInDataSet() \pre boundary: HasBoundary(boundary) \pre neighbors_exist: neighbors!=0 V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float) -> int C++: virtual int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2) Is `x' inside the current cell? It also evaluates parametric coordinates `pcoords', sub-cell id `subId' (0 means primary cell), distance squared to the sub-cell in `dist2' and closest corner point `closestPoint'. `dist2' and `closestPoint' are not evaluated if `closestPoint'==0. If a numerical error occurred, -1 is returned and all other results should be ignored. \post valid_result: result==-1 || result==0 || result==1 \post positive_distance: result!=-1 implies (closestPoint!=0 implies dist2>=0) V.EvaluateLocation(int, [float, float, float], [float, float, float]) C++: virtual void EvaluateLocation(int subId, double pcoords[3], double x[3]) Determine the global coordinates `x' from sub-cell `subId' and parametric coordinates `pcoords' in the cell. \pre positive_subId: subId>=0 \pre clamped_pcoords: (0<=pcoords[0])&&(pcoords[0]<=1)&&(0<=pcoords[1]) &&(pcoords[1]<=1)&&(0<=pcoords[2])&&(pcoords[2]<=1) InterpolateTupleV.InterpolateTuple(vtkGenericAttribute, [float, float, float], [float, ...]) C++: virtual void InterpolateTuple(vtkGenericAttribute *a, double pcoords[3], double *val) V.InterpolateTuple(vtkGenericAttributeCollection, [float, float, float], [float, ...]) C++: virtual void InterpolateTuple( vtkGenericAttributeCollection *c, double pcoords[3], double *val) Interpolate the attribute `a' at local position `pcoords' of the cell into `val'. \pre a_exists: a!=0 \pre a_is_point_centered: a->GetCentering()==vtkPointCentered \pre clamped_point: pcoords[0]>=0 && pcoords[0]<=1 && pcoords[1]>=0 && pcoords[1]<=1 && pcoords[2]>=0 && pcoords[2]<=1 \pre val_exists: val!=0 \pre valid_size: sizeof(val)==a->GetNumberOfComponents() V.Contour(vtkContourValues, vtkImplicitFunction, vtkGenericAttributeCollection, vtkGenericCellTessellator, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkCellData, vtkPointData, vtkPointData, vtkCellData) C++: virtual void Contour(vtkContourValues *values, vtkImplicitFunction *f, vtkGenericAttributeCollection *attributes, vtkGenericCellTessellator *tess, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *outPd, vtkCellData *outCd, vtkPointData *internalPd, vtkPointData *secondaryPd, vtkCellData *secondaryCd) Generate a contour (contouring primitives) for each `values' or with respect to an implicit function `f'. Contouring is performed on the scalar attribute (`attributes->GetActiveAttribute()' `attributes->GetActiveComponent()'). Contouring interpolates the `attributes->GetNumberOfattributesToInterpolate()' attributes `attributes->GetAttributesToInterpolate()'. The `locator', `verts', `lines', `polys', `outPd' and `outCd' are cumulative data arrays over cell iterations: they store the result of each call to Contour(): - `locator' is a points list that merges points as they are inserted (i.e., prevents duplicates). - `verts' is an array of generated vertices - `lines' is an array of generated lines - `polys' is an array of generated polygons - `outPd' is an array of interpolated point data along the edge (if not-nullptr) - `outCd' is an array of copied cell data of the current cell (if not-nullptr) `internalPd', `secondaryPd' and `secondaryCd' are initialized by the filter that call it from `attributes'. - `internalPd' stores the result of the tessellation pass: the higher-order cell is tessellated into linear sub-cells. - `secondaryPd' and `secondaryCd' are used internally as inputs to the Contour() method on linear sub-cells. Note: the CopyAllocate() method must be invoked on both `outPd' ... [Truncated] V.Clip(float, vtkImplicitFunction, vtkGenericAttributeCollection, vtkGenericCellTessellator, int, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkCellData, vtkPointData, vtkPointData, vtkCellData) C++: virtual void Clip(double value, vtkImplicitFunction *f, vtkGenericAttributeCollection *attributes, vtkGenericCellTessellator *tess, int insideOut, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *outPd, vtkCellData *outCd, vtkPointData *internalPd, vtkPointData *secondaryPd, vtkCellData *secondaryCd) Cut (or clip) the current cell with respect to the contour defined by the `value' or the implicit function `f' of the scalar attribute (`attributes->GetActiveAttribute()',`attributes->GetActiveComponent()' ). If `f' exists, `value' is not used. The output is the part of the current cell which is inside the contour. The output is a set of zero, one or more cells of the same topological dimension as the current cell. Normally, cell points whose scalar value is greater than "value" are considered inside. If `insideOut' is on, this is reversed. Clipping interpolates the `attributes->GetNumberOfattributesToInterpolate()' attributes `attributes->GetAttributesToInterpolate()'. `locator', `connectivity', `outPd' and `outCd' are cumulative data arrays over cell iterations: they store the result of each call to Clip(): - `locator' is a points list that merges points as they are inserted (i.e., prevents duplicates). - `connectivity' is an array of generated cells - `outPd' is an array of interpolated point data along the edge (if not-nullptr) - `outCd' is an array of copied cell data of the current cell (if not-nullptr) `internalPd', `secondaryPd' and `secondaryCd' are initialized by the filter that call it from `attributes'. - `internalPd' stores the result of the tessellation pass: the higher-order cell is tessellated into linear sub-cells. - `secondaryPd' and `secondaryCd' a ... [Truncated] V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) Is there an intersection between the current cell and the ray (`p1',`p2') according to a tolerance `tol'? If true, `x' is the global intersection, `t' is the parametric coordinate for the line, `pcoords' are the parametric coordinates for cell. `subId' is the sub-cell where the intersection occurs. \pre positive_tolerance: tol>0 V.Derivatives(int, [float, float, float], vtkGenericAttribute, [float, ...]) C++: virtual void Derivatives(int subId, double pcoords[3], vtkGenericAttribute *attribute, double *derivs) Compute derivatives `derivs' of the attribute `attribute' (from its values at the corner points of the cell) given sub-cell `subId' (0 means primary cell) and parametric coordinates `pcoords'. Derivatives are in the x-y-z coordinate directions for each data value. \pre positive_subId: subId>=0 \pre clamped_pcoords: (0<=pcoords[0])&&(pcoords[0]<=1)&&(0<=pcoords[1]) &&(pcoords[1]<=1)&&(0<=pcoords[2])%%(pcoords[2]<=1) \pre attribute_exists: attribute!=0 \pre derivs_exists: derivs!=0 \pre valid_size: sizeof(derivs)>=attribute->GetNumberOfComponents()*3 V.GetBounds([float, float, float, float, float, float]) C++: virtual void GetBounds(double bounds[6]) V.GetBounds() -> (float, ...) C++: virtual double *GetBounds() Compute the bounding box of the current cell in `bounds' in global coordinates. THREAD SAFE V.GetLength2() -> float C++: virtual double GetLength2() Return the bounding box diagonal squared of the current cell. \post positive_result: result>=0 V.GetParametricCenter([float, float, float]) -> int C++: virtual int GetParametricCenter(double pcoords[3]) Get the center of the current cell (in parametric coordinates) and place it in `pcoords'. If the current cell is a composite, the return value is the sub-cell id that the center is in. \post valid_result: (result>=0) && (IsPrimary() implies result==0) V.GetParametricDistance([float, float, float]) -> float C++: virtual double GetParametricDistance(double pcoords[3]) Return the distance of the parametric coordinate `pcoords' to the current cell. If inside the cell, a distance of zero is returned. This is used during picking to get the correct cell picked. (The tolerance will occasionally allow cells to be picked who are not really intersected "inside" the cell.) \post positive_result: result>=0 V.GetParametricCoords() -> (float, ...) C++: virtual double *GetParametricCoords() Return a contiguous array of parametric coordinates of the corrner points defining the current cell. In other words, (px,py,pz, px,py,pz, etc..) The coordinates are ordered consistent with the definition of the point ordering for the cell. Note that 3D parametric coordinates are returned no matter what the topological dimension of the cell. \post valid_result_exists: ((IsPrimary()) && (result!=0)) || ((!IsPrimary()) && (result==0)) result!=0 implies sizeof(result)==GetNumberOfPoints() TessellateV.Tessellate(vtkGenericAttributeCollection, vtkGenericCellTessellator, vtkPoints, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, vtkUnsignedCharArray) C++: virtual void Tessellate( vtkGenericAttributeCollection *attributes, vtkGenericCellTessellator *tess, vtkPoints *points, vtkIncrementalPointLocator *locator, vtkCellArray *cellArray, vtkPointData *internalPd, vtkPointData *pd, vtkCellData *cd, vtkUnsignedCharArray *types) Tessellate the cell if it is not linear or if at least one attribute of `attributes' is not linear. The output are linear cells of the same dimension than the cell. If the cell is linear and all attributes are linear, the output is just a copy of the current cell. `points', `cellArray', `pd' and `cd' are cumulative output data arrays over cell iterations: they store the result of each call to Tessellate(). `internalPd' is initialized by the calling filter and stores the result of the tessellation. If it is not null, `types' is filled with the types of the linear cells. `types' is null when it is called from vtkGenericGeometryFilter and not null when it is called from vtkGenericDatasetTessellator. \pre attributes_exist: attributes!=0 \pre tessellator_exists: tess!=0 \pre points_exist: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 \pre pd_exist: pd!=0 \pre cd_exists: cd!=0 IsFaceOnBoundaryV.IsFaceOnBoundary(int) -> int C++: virtual int IsFaceOnBoundary(vtkIdType faceId) Is the face `faceId' of the current cell on the exterior boundary of the dataset? \pre 3d: GetDimension()==3 IsOnBoundaryV.IsOnBoundary() -> int C++: virtual int IsOnBoundary() Is the cell on the exterior boundary of the dataset? \pre 2d: GetDimension()==2 V.GetPointIds([int, ...]) C++: virtual void GetPointIds(vtkIdType *id) Put into `id' the list of the dataset points that define the corner points of the cell. \pre id_exists: id!=0 \pre valid_size: sizeof(id)==GetNumberOfPoints(); TriangulateFaceV.TriangulateFace(vtkGenericAttributeCollection, vtkGenericCellTessellator, int, vtkPoints, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData) C++: virtual void TriangulateFace( vtkGenericAttributeCollection *attributes, vtkGenericCellTessellator *tess, int index, vtkPoints *points, vtkIncrementalPointLocator *locator, vtkCellArray *cellArray, vtkPointData *internalPd, vtkPointData *pd, vtkCellData *cd) Tessellate face `index' of the cell. See Tessellate() for further explanations. \pre cell_is_3d: GetDimension()==3 \pre attributes_exist: attributes!=0 \pre tessellator_exists: tess!=0 \pre valid_face: index>=0 \pre points_exist: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 \pre pd_exist: pd!=0 \pre cd_exists: cd!=0 V.GetFaceArray(int) -> (int, ...) C++: virtual int *GetFaceArray(int faceId) Return the ids of the vertices defining face `faceId'. Ids are related to the cell, not to the dataset. \pre is_3d: this->GetDimension()==3 \pre valid_faceId_range: faceId>=0 && faceIdGetNumberOfBoundaries(2) \post result_exists: result!=0 \post valid_size: sizeof(result)>=GetNumberOfVerticesOnFace(faceId) GetNumberOfVerticesOnFaceV.GetNumberOfVerticesOnFace(int) -> int C++: virtual int GetNumberOfVerticesOnFace(int faceId) Return the number of vertices defining face `faceId'. \pre is_3d: this->GetDimension()==3 \pre valid_faceId_range: faceId>=0 && faceIdGetNumberOfBoundaries(2) \post positive_result: && result>0 V.GetEdgeArray(int) -> (int, ...) C++: virtual int *GetEdgeArray(int edgeId) Return the ids of the vertices defining edge `edgeId'. Ids are related to the cell, not to the dataset. \pre valid_dimension: this->GetDimension()>=2 \pre valid_edgeId_range: edgeId>=0 && edgeIdGetNumberOfBoundaries(1) \post result_exists: result!=0 \post valid_size: sizeof(result)==2 vtkGenericAttributevtkGenericAttributeCollectionvtkGenericPointIteratorvtkGenericCellIterator@VPP *vtkGenericAttribute *d *d@VPP *vtkGenericAttributeCollection *d *dvtkContourValuesvtkGenericCellTessellatorvtkCommonDataModelPython.vtkGenericAttributeCollectionvtkGenericAttributeCollection - a collection of attributes Superclass: vtkObject vtkGenericAttributeCollection is a class that collects attributes (represented by vtkGenericAttribute). V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard type definition and print methods for a VTK class. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard type definition and print methods for a VTK class. V.SafeDownCast(vtkObjectBase) -> vtkGenericAttributeCollection C++: static vtkGenericAttributeCollection *SafeDownCast( vtkObjectBase *o) Standard type definition and print methods for a VTK class. V.NewInstance() -> vtkGenericAttributeCollection C++: vtkGenericAttributeCollection *NewInstance() Standard type definition and print methods for a VTK class. GetNumberOfAttributesV.GetNumberOfAttributes() -> int C++: int GetNumberOfAttributes() Return the number of attributes (e.g., instances of vtkGenericAttribute) in the collection. \post positive_result: result>=0 V.GetNumberOfComponents() -> int C++: int GetNumberOfComponents() Return the number of components. This is the sum of all components found in all attributes. \post positive_result: result>=0 GetNumberOfPointCenteredComponentsV.GetNumberOfPointCenteredComponents() -> int C++: int GetNumberOfPointCenteredComponents() Return the number of components. This is the sum of all components found in all point centered attributes. \post positive_result: result>=0 GetMaxNumberOfComponentsV.GetMaxNumberOfComponents() -> int C++: int GetMaxNumberOfComponents() Maximum number of components encountered among all attributes. \post positive_result: result>=0 \post valid_result: result<=GetNumberOfComponents() V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() Actual size of the data in kibibytes (1024 bytes); only valid after the pipeline has updated. It is guaranteed to be greater than or equal to the memory required to represent the data. IsEmptyV.IsEmpty() -> int C++: int IsEmpty() Indicate whether the collection contains any attributes. \post definition: result==(GetNumberOfAttributes()==0) V.GetAttribute(int) -> vtkGenericAttribute C++: vtkGenericAttribute *GetAttribute(int i) Return a pointer to the ith instance of vtkGenericAttribute. \pre not_empty: !IsEmpty() \pre valid_i: i>=0 && i int C++: int FindAttribute(const char *name) Return the index of the attribute named `name'. Return the non-negative index if found. Return -1 otherwise. \pre name_exists: name!=0 \post valid_result: (result==-1) || (result>=0) && (result<=GetNumberOfAttributes()) GetAttributeIndexV.GetAttributeIndex(int) -> int C++: int GetAttributeIndex(int i) Return the index of the first component of attribute `i' in an array of format attrib0comp0 attrib0comp1 ... attrib4comp0 ... \pre valid_i: i>=0 && iGetCentering()==vtkPointCentered InsertNextAttributeV.InsertNextAttribute(vtkGenericAttribute) C++: void InsertNextAttribute(vtkGenericAttribute *a) Add the attribute `a' to the end of the collection. \pre a_exists: a!=0 \post more_items: GetNumberOfAttributes()==old GetNumberOfAttributes()+1 \post a_is_set: GetAttribute(GetNumberOfAttributes()-1)==a InsertAttributeV.InsertAttribute(int, vtkGenericAttribute) C++: void InsertAttribute(int i, vtkGenericAttribute *a) Replace the attribute at index `i' by `a'. \pre not_empty: !IsEmpty() \pre a_exists: a!=0 \pre valid_i: i>=0 && i=0 && iGetNumberOfAttributes() V.ShallowCopy(vtkGenericAttributeCollection) C++: void ShallowCopy(vtkGenericAttributeCollection *other) Copy, via reference counting, the other attribute array. \pre other_exists: other!=0 \pre not_self: other!=this \post same_size: GetNumberOfAttributes()==other->GetNumberOfAttributes() V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; vtkAttributeCollection is a composite object and needs to check each member of its collection for modified time. GetActiveAttributeV.GetActiveAttribute() -> int C++: virtual int GetActiveAttribute() Index of the attribute to be processed (not necessarily scalar). \pre not_empty: !IsEmpty() \post valid_result: result>=0 && result int C++: virtual int GetActiveComponent() Component of the active attribute to be processed. -1 means module. \pre not_empty: GetNumberOfAttributes()>0 \post valid_result: result>=-1 && resultGetNumberOfComponents() V.SetActiveAttribute(int, int) C++: void SetActiveAttribute(int attribute, int component=0) Set the scalar attribute to be processed. -1 means module. \pre not_empty: !IsEmpty() \pre valid_attribute: attribute>=0 && attribute=-1 && componentGetNumberOfComponents() \post is_set: GetActiveAttribute()==attribute && GetActiveComponent()==component GetNumberOfAttributesToInterpolateV.GetNumberOfAttributesToInterpolate() -> int C++: virtual int GetNumberOfAttributesToInterpolate() Number of attributes to interpolate. \pre not_empty: !IsEmpty() \post positive_result: result>=0 GetAttributesToInterpolateV.GetAttributesToInterpolate() -> (int, ...) C++: int *GetAttributesToInterpolate() Indices of attributes to interpolate. \pre not_empty: !IsEmpty() \post valid_result: GetNumberOfAttributesToInterpolate()>0 HasAttributeV.HasAttribute(int, [int, ...], int) -> int C++: int HasAttribute(int size, int *attributes, int attribute) Does the array `attributes' of size `size' have `attribute'? \pre positive_size: size>=0 \pre valid_attributes: size>0 implies attributes!=0 SetAttributesToInterpolateV.SetAttributesToInterpolate(int, [int, ...]) C++: void SetAttributesToInterpolate(int size, int *attributes) Set the attributes to interpolate. \pre not_empty: !IsEmpty() \pre positive_size: size>=0 \pre valid_attributes: size>0 implies attributes!=0 \pre valid_attributes_contents: attributes!=0 implies !HasAttributes(size,attributes,GetActiveAttribute()) \post is_set: (GetNumberOfAttributesToInterpolate()==size)&& (GetAttributesToInterpolate()==attributes) SetAttributesToInterpolateToAllV.SetAttributesToInterpolateToAll() C++: void SetAttributesToInterpolateToAll() Set the attributes to interpolate. \pre not_empty: !IsEmpty() \pre positive_size: size>=0 \pre valid_attributes: size>0 implies attributes!=0 \pre valid_attributes_contents: attributes!=0 implies !HasAttributes(size,attributes,GetActiveAttribute()) \post is_set: (GetNumberOfAttributesToInterpolate()==size)&& (GetAttributesToInterpolate()==attributes) vtkPointCenteredvtkCellCenteredvtkBoundaryCenteredvtkCommonDataModelPython.vtkGenericAttributevtkGenericAttribute - abstract class defined API for attribute data Superclass: vtkObject vtkGenericAttribute is an abstract class that defines an API for attribute data. Attribute data is data associated with the topology or geometry of a dataset (i.e., points, cells, etc.). vtkGenericAttribute is part of the adaptor framework (see GenericFiltering/README.html). vtkGenericAttribute provides a more general interface to attribute data than its counterpart vtkDataArray (which assumes a linear, contiguous array). It adopts an iterator interface, and allows attributes to be associated with points, edges, faces, or edges. V.SafeDownCast(vtkObjectBase) -> vtkGenericAttribute C++: static vtkGenericAttribute *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGenericAttribute C++: vtkGenericAttribute *NewInstance() GetNameV.GetName() -> string C++: virtual const char *GetName() Name of the attribute. (e.g. "velocity") \post result_may_not_exist: result!=0 || result==0 V.GetNumberOfComponents() -> int C++: virtual int GetNumberOfComponents() Dimension of the attribute. (1 for scalar, 3 for velocity) \post positive_result: result>=0 \post GetType()==VTK_SCALARS implies result==1 \post (GetType()==VTK_VECTORS||(GetType()==VTK_NORMALS)||(GetType()= =VTK_TCOORDS) implies result==3 \post GetType()==VTK_TENSORS implies result==6 GetCenteringV.GetCentering() -> int C++: virtual int GetCentering() Is the attribute centered either on points, cells or boundaries? \post valid_result: (result==vtkPointCentered)||(result==vtkCellCentered) V.GetType() -> int C++: virtual int GetType() Type of the attribute: scalar, vector, normal, texture coordinate, tensor \post valid_result: (result==vtkDataSetAttributes::SCALARS) ||(result==vtkDataSetAttributes::VECTORS) ||(result==vtkDataSetAttributes::NORMALS) ||(result==vtkDataSetAttributes::TCOORDS) ||(result==vtkDataSetAttributes::TENSORS) GetComponentTypeV.GetComponentType() -> int C++: virtual int GetComponentType() Type of the components of the attribute: int, float, double \post valid_result: (result==VTK_BIT) ||(result==VTK_CHAR) ||(result==VTK_UNSIGNED_CHAR) ||(result==VTK_SHORT) ||(result==VTK_UNSIGNED_SHORT)||(result==VTK_INT) ||(result==VTK_UNSIGNED_INT) ||(result==VTK_LONG) ||(result==VTK_UNSIGNED_LONG) ||(result==VTK_FLOAT) ||(result==VTK_DOUBLE) ||(result==VTK_ID_TYPE) V.GetSize() -> int C++: virtual vtkIdType GetSize() Number of tuples. \post valid_result: result>=0 V.GetActualMemorySize() -> int C++: virtual unsigned long GetActualMemorySize() Size in kibibytes (1024 bytes) taken by the attribute. GetRangeV.GetRange(int) -> (float, ...) C++: virtual double *GetRange(int component=0) V.GetRange(int, [float, float]) C++: virtual void GetRange(int component, double range[2]) Range of the attribute component `component'. If `component'==-1, it returns the range of the magnitude (euclidean norm). It returns double, even if GetType()==VTK_INT. NOT THREAD SAFE \pre valid_component: (component>=-1)&&(component float C++: virtual double GetMaxNorm() Return the maximum euclidean norm for the tuples. \post positive_result: result>=0 GetTupleV.GetTuple(vtkGenericAdaptorCell) -> (float, ...) C++: virtual double *GetTuple(vtkGenericAdaptorCell *c) V.GetTuple(vtkGenericAdaptorCell, [float, ...]) C++: virtual void GetTuple(vtkGenericAdaptorCell *c, double *tuple) V.GetTuple(vtkGenericCellIterator) -> (float, ...) C++: virtual double *GetTuple(vtkGenericCellIterator *c) V.GetTuple(vtkGenericCellIterator, [float, ...]) C++: virtual void GetTuple(vtkGenericCellIterator *c, double *tuple) V.GetTuple(vtkGenericPointIterator) -> (float, ...) C++: virtual double *GetTuple(vtkGenericPointIterator *p) V.GetTuple(vtkGenericPointIterator, [float, ...]) C++: virtual void GetTuple(vtkGenericPointIterator *p, double *tuple) Attribute at all points of cell `c'. \pre c_exists: c!=0 \pre c_valid: !c->IsAtEnd() \post result_exists: result!=0 \post valid_result: sizeof(result)==GetNumberOfComponents()*c->GetCell()->GetNumbe rOfPoints() GetComponentV.GetComponent(int, vtkGenericCellIterator, [float, ...]) C++: virtual void GetComponent(int i, vtkGenericCellIterator *c, double *values) V.GetComponent(int, vtkGenericPointIterator) -> float C++: virtual double GetComponent(int i, vtkGenericPointIterator *p) Put component `i' of the attribute at all points of cell `c' in `values'. \pre valid_component: (i>=0) && (iIsAtEnd() \pre values_exist: values!=0 \pre valid_values: sizeof(values)>=c->GetCell()->GetNumberOfPoints() V.DeepCopy(vtkGenericAttribute) C++: virtual void DeepCopy(vtkGenericAttribute *other) Recursive duplication of `other' in `this'. \pre other_exists: other!=0 \pre not_self: other!=this V.ShallowCopy(vtkGenericAttribute) C++: virtual void ShallowCopy(vtkGenericAttribute *other) Update `this' using fields of `other'. \pre other_exists: other!=0 \pre not_self: other!=this @V *vtkGenericAdaptorCell@VP *vtkGenericAdaptorCell *d@V *vtkGenericCellIterator@VP *vtkGenericCellIterator *d@V *vtkGenericPointIterator@VP *vtkGenericPointIterator *dvtkCommonDataModelPython.vtkGenericCellvtkGenericCell - provides thread-safe access to cells Superclass: vtkCell vtkGenericCell is a class that provides access to concrete types of cells. It's main purpose is to allow thread-safe access to cells, supporting the vtkDataSet::GetCell(vtkGenericCell *) method. vtkGenericCell acts like any type of cell, it just dereferences an internal representation. The SetCellType() methods use #define constants; these are defined in the file vtkCellType.h. @sa vtkCell vtkDataSet V.SafeDownCast(vtkObjectBase) -> vtkGenericCell C++: static vtkGenericCell *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGenericCell C++: vtkGenericCell *NewInstance() SetPointsV.SetPoints(vtkPoints) C++: void SetPoints(vtkPoints *points) Set the points object to use for this cell. This updates the internal cell storage as well as the public member variable Points. SetPointIdsV.SetPointIds(vtkIdList) C++: void SetPointIds(vtkIdList *pointIds) Set the point ids to use for this cell. This updates the internal cell storage as well as the public member variable PointIds. V.ShallowCopy(vtkCell) C++: void ShallowCopy(vtkCell *c) override; See the vtkCell API for descriptions of these methods. V.DeepCopy(vtkCell) C++: void DeepCopy(vtkCell *c) override; See the vtkCell API for descriptions of these methods. V.IsLinear() -> int C++: int IsLinear() override; See the vtkCell API for descriptions of these methods. V.RequiresInitialization() -> int C++: int RequiresInitialization() override; See the vtkCell API for descriptions of these methods. V.Initialize() C++: void Initialize() override; See the vtkCell API for descriptions of these methods. V.RequiresExplicitFaceRepresentation() -> int C++: int RequiresExplicitFaceRepresentation() override; See the vtkCell API for descriptions of these methods. V.SetFaces([int, ...]) C++: void SetFaces(vtkIdType *faces) override; See the vtkCell API for descriptions of these methods. V.GetFaces() -> (int, ...) C++: vtkIdType *GetFaces() override; See the vtkCell API for descriptions of these methods. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; See the vtkCell API for descriptions of these methods. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; See the vtkCell API for descriptions of these methods. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; See the vtkCell API for descriptions of these methods. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; See the vtkCell API for descriptions of these methods. V.IsPrimaryCell() -> int C++: int IsPrimaryCell() override; See the vtkCell API for descriptions of these methods. V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double pcoords[3], double *weights) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) SetCellTypeV.SetCellType(int) C++: void SetCellType(int cellType) This method is used to support the vtkDataSet::GetCell(vtkGenericCell *) method. It allows vtkGenericCell to act like any cell type by dereferencing an internal instance of a concrete cell type. When you set the cell type, you are resetting a pointer to an internal cell which is then used for computation. SetCellTypeToEmptyCellV.SetCellTypeToEmptyCell() C++: void SetCellTypeToEmptyCell() SetCellTypeToVertexV.SetCellTypeToVertex() C++: void SetCellTypeToVertex() SetCellTypeToPolyVertexV.SetCellTypeToPolyVertex() C++: void SetCellTypeToPolyVertex() SetCellTypeToLineV.SetCellTypeToLine() C++: void SetCellTypeToLine() SetCellTypeToPolyLineV.SetCellTypeToPolyLine() C++: void SetCellTypeToPolyLine() SetCellTypeToTriangleV.SetCellTypeToTriangle() C++: void SetCellTypeToTriangle() SetCellTypeToTriangleStripV.SetCellTypeToTriangleStrip() C++: void SetCellTypeToTriangleStrip() SetCellTypeToPolygonV.SetCellTypeToPolygon() C++: void SetCellTypeToPolygon() SetCellTypeToPixelV.SetCellTypeToPixel() C++: void SetCellTypeToPixel() SetCellTypeToQuadV.SetCellTypeToQuad() C++: void SetCellTypeToQuad() SetCellTypeToTetraV.SetCellTypeToTetra() C++: void SetCellTypeToTetra() SetCellTypeToVoxelV.SetCellTypeToVoxel() C++: void SetCellTypeToVoxel() SetCellTypeToHexahedronV.SetCellTypeToHexahedron() C++: void SetCellTypeToHexahedron() SetCellTypeToWedgeV.SetCellTypeToWedge() C++: void SetCellTypeToWedge() SetCellTypeToPyramidV.SetCellTypeToPyramid() C++: void SetCellTypeToPyramid() SetCellTypeToPentagonalPrismV.SetCellTypeToPentagonalPrism() C++: void SetCellTypeToPentagonalPrism() SetCellTypeToHexagonalPrismV.SetCellTypeToHexagonalPrism() C++: void SetCellTypeToHexagonalPrism() SetCellTypeToPolyhedronV.SetCellTypeToPolyhedron() C++: void SetCellTypeToPolyhedron() SetCellTypeToConvexPointSetV.SetCellTypeToConvexPointSet() C++: void SetCellTypeToConvexPointSet() SetCellTypeToQuadraticEdgeV.SetCellTypeToQuadraticEdge() C++: void SetCellTypeToQuadraticEdge() SetCellTypeToCubicLineV.SetCellTypeToCubicLine() C++: void SetCellTypeToCubicLine() SetCellTypeToQuadraticTriangleV.SetCellTypeToQuadraticTriangle() C++: void SetCellTypeToQuadraticTriangle() SetCellTypeToBiQuadraticTriangleV.SetCellTypeToBiQuadraticTriangle() C++: void SetCellTypeToBiQuadraticTriangle() SetCellTypeToQuadraticQuadV.SetCellTypeToQuadraticQuad() C++: void SetCellTypeToQuadraticQuad() SetCellTypeToQuadraticPolygonV.SetCellTypeToQuadraticPolygon() C++: void SetCellTypeToQuadraticPolygon() SetCellTypeToQuadraticTetraV.SetCellTypeToQuadraticTetra() C++: void SetCellTypeToQuadraticTetra() SetCellTypeToQuadraticHexahedronV.SetCellTypeToQuadraticHexahedron() C++: void SetCellTypeToQuadraticHexahedron() SetCellTypeToQuadraticWedgeV.SetCellTypeToQuadraticWedge() C++: void SetCellTypeToQuadraticWedge() SetCellTypeToQuadraticPyramidV.SetCellTypeToQuadraticPyramid() C++: void SetCellTypeToQuadraticPyramid() SetCellTypeToQuadraticLinearQuadV.SetCellTypeToQuadraticLinearQuad() C++: void SetCellTypeToQuadraticLinearQuad() SetCellTypeToBiQuadraticQuadV.SetCellTypeToBiQuadraticQuad() C++: void SetCellTypeToBiQuadraticQuad() SetCellTypeToQuadraticLinearWedgeV.SetCellTypeToQuadraticLinearWedge() C++: void SetCellTypeToQuadraticLinearWedge() SetCellTypeToBiQuadraticQuadraticWedgeV.SetCellTypeToBiQuadraticQuadraticWedge() C++: void SetCellTypeToBiQuadraticQuadraticWedge() SetCellTypeToTriQuadraticHexahedronV.SetCellTypeToTriQuadraticHexahedron() C++: void SetCellTypeToTriQuadraticHexahedron() SetCellTypeToBiQuadraticQuadraticHexahedronV.SetCellTypeToBiQuadraticQuadraticHexahedron() C++: void SetCellTypeToBiQuadraticQuadraticHexahedron() SetCellTypeToLagrangeTriangleV.SetCellTypeToLagrangeTriangle() C++: void SetCellTypeToLagrangeTriangle() SetCellTypeToLagrangeTetraV.SetCellTypeToLagrangeTetra() C++: void SetCellTypeToLagrangeTetra() SetCellTypeToLagrangeCurveV.SetCellTypeToLagrangeCurve() C++: void SetCellTypeToLagrangeCurve() SetCellTypeToLagrangeQuadrilateralV.SetCellTypeToLagrangeQuadrilateral() C++: void SetCellTypeToLagrangeQuadrilateral() SetCellTypeToLagrangeHexahedronV.SetCellTypeToLagrangeHexahedron() C++: void SetCellTypeToLagrangeHexahedron() SetCellTypeToLagrangeWedgeV.SetCellTypeToLagrangeWedge() C++: void SetCellTypeToLagrangeWedge() InstantiateCellV.InstantiateCell(int) -> vtkCell C++: static vtkCell *InstantiateCell(int cellType) Instantiate a new vtkCell based on it's cell type value GetRepresentativeCellV.GetRepresentativeCell() -> vtkCell C++: vtkCell *GetRepresentativeCell() vtkCommonDataModelPython.vtkGenericCellIteratorvtkGenericCellIterator - iterator used to traverse cells Superclass: vtkObject This class (and subclasses) are used to iterate over cells. Use it only in conjunction with vtkGenericDataSet (i.e., the adaptor framework). Typical use is: vtkGenericDataSet *dataset; vtkGenericCellIterator *it = dataset->NewCellIterator(2); for (it->Begin(); !it->IsAtEnd(); it->Next()); { spec=it->GetCell(); } V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard VTK construction and type macros. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard VTK construction and type macros. V.SafeDownCast(vtkObjectBase) -> vtkGenericCellIterator C++: static vtkGenericCellIterator *SafeDownCast(vtkObjectBase *o) Standard VTK construction and type macros. V.NewInstance() -> vtkGenericCellIterator C++: vtkGenericCellIterator *NewInstance() Standard VTK construction and type macros. BeginV.Begin() C++: virtual void Begin() Move iterator to first position if any (loop initialization). IsAtEndV.IsAtEnd() -> int C++: virtual int IsAtEnd() Is the iterator at the end of traversal? NewCellV.NewCell() -> vtkGenericAdaptorCell C++: virtual vtkGenericAdaptorCell *NewCell() Create an empty cell. The user is responsible for deleting it. \post result_exists: result!=0 V.GetCell(vtkGenericAdaptorCell) C++: virtual void GetCell(vtkGenericAdaptorCell *c) V.GetCell() -> vtkGenericAdaptorCell C++: virtual vtkGenericAdaptorCell *GetCell() Get the cell at current position. The cell should be instantiated with the NewCell() method. \pre not_at_end: !IsAtEnd() \pre c_exists: c!=0 THREAD SAFE V.Next() C++: virtual void Next() Move the iterator to the next position in the list. \pre not_at_end: !IsAtEnd() vtkCommonDataModelPython.vtkGenericCellTessellatorvtkGenericCellTessellator - helper class to perform cell tessellation Superclass: vtkObject vtkGenericCellTessellator is a helper class to perform adaptive tessellation of particular cell topologies. The major purpose for this class is to transform higher-order cell types (e.g., higher-order finite elements) into linear cells that can then be easily visualized by VTK. This class works in conjunction with the vtkGenericDataSet and vtkGenericAdaptorCell classes. This algorithm is based on edge subdivision. An error metric along each edge is evaluated, and if the error is greater than some tolerance, the edge is subdivided (as well as all connected 2D and 3D cells). The process repeats until the error metric is satisfied. A significant issue addressed by this algorithm is to insure face compatibility across neigboring cells. That is, diagonals due to face triangulation must match to insure that the mesh is compatible. The algorithm employs a precomputed table to accelerate the tessellation process. The table was generated with the help of vtkOrderedTriangulator; the basic idea is that the choice of diagonal is made by considering the relative value of the point ids. V.SafeDownCast(vtkObjectBase) -> vtkGenericCellTessellator C++: static vtkGenericCellTessellator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkGenericCellTessellator C++: vtkGenericCellTessellator *NewInstance() TessellateFaceV.TessellateFace(vtkGenericAdaptorCell, vtkGenericAttributeCollection, int, vtkDoubleArray, vtkCellArray, vtkPointData) C++: virtual void TessellateFace(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkIdType index, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) Tessellate a face of a 3D `cell'. The face is specified by the index value. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==3 \pre valid_index_range: (index>=0) && (indexGetNumberOfBoundaries(2)) \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 V.Tessellate(vtkGenericAdaptorCell, vtkGenericAttributeCollection, vtkDoubleArray, vtkCellArray, vtkPointData) C++: virtual void Tessellate(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) Tessellate a 3D `cell'. The result is a set of smaller linear tetrahedra in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==3 \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 V.Triangulate(vtkGenericAdaptorCell, vtkGenericAttributeCollection, vtkDoubleArray, vtkCellArray, vtkPointData) C++: virtual void Triangulate(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) Triangulate a 2D `cell'. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==2 \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 SetErrorMetricsV.SetErrorMetrics(vtkCollection) C++: virtual void SetErrorMetrics(vtkCollection *someErrorMetrics) Specify the list of error metrics used to decide if an edge has to be splitted or not. It is a collection of vtkGenericSubdivisionErrorMetric-s. GetErrorMetricsV.GetErrorMetrics() -> vtkCollection C++: virtual vtkCollection *GetErrorMetrics() Specify the list of error metrics used to decide if an edge has to be splitted or not. It is a collection of vtkGenericSubdivisionErrorMetric-s. V.Initialize(vtkGenericDataSet) C++: virtual void Initialize(vtkGenericDataSet *ds) Initialize the tessellator with a data set `ds'. InitErrorMetricsV.InitErrorMetrics(vtkGenericDataSet) C++: void InitErrorMetrics(vtkGenericDataSet *ds) Init the error metric with the dataset. Should be called in each filter before any tessellation of any cell. GetMeasurementV.GetMeasurement() -> int C++: virtual int GetMeasurement() If true, measure the quality of the fixed subdivision. SetMeasurementV.SetMeasurement(int) C++: virtual void SetMeasurement(int _arg) If true, measure the quality of the fixed subdivision. GetMaxErrorsV.GetMaxErrors([float, ...]) C++: void GetMaxErrors(double *errors) Get the maximum error measured after the fixed subdivision. \pre errors_exists: errors!=0 \pre valid_size: sizeof(errors)==GetErrorMetrics()->GetNumberOfItems() vtkDoubleArrayvtkGenericDataSetvtkCommonDataModelPython.vtkGenericDataSetvtkGenericDataSet - defines dataset interface Superclass: vtkDataObject In VTK, spatial-temporal data is defined in terms of a dataset. The dataset consists of geometry (e.g., points), topology (e.g., cells), and attributes (e.g., scalars, vectors, etc.) vtkGenericDataSet is an abstract class defining this abstraction. Since vtkGenericDataSet provides a general interface to manipulate data, algorithms that process it tend to be slower than those specialized for a particular data type. For this reason, there are concrete, non-abstract subclasses that represent and provide access to data more efficiently. Note that filters to process this dataset type are currently found in the VTK/GenericFiltering/ subdirectory. Unlike the vtkDataSet class, vtkGenericDataSet provides a more flexible interface including support for iterators. vtkGenericDataSet is also designed to interface VTK to external simulation packages without the penalty of copying memory (see VTK/GenericFiltering/README.html) for more information. Thus vtkGenericDataSet plays a central role in the adaptor framework. Please note that this class introduces the concepts of "boundary cells". This refers to the boundaries of a cell (e.g., face of a tetrahedron) which may in turn be represented as a cell. Boundary cells are derivative topological features of cells, and are therefore never explicitly represented in the dataset. Often in visualization algorithms, looping over boundaries (edges or faces) is employed, while the actual dataset cells may not traversed. Thus there are methods to loop over these boundary cells. Finally, as a point of clarification, points are not the same as vertices. Vertices refer to points, and points specify a position is space. Vertices are a type of 0-D cell. Also, the concept of a DOFNode, which is where coefficients for higher-order cells are kept, is a new concept introduced by the adaptor framework (see vtkGenericAdaptorCell for more information). @sa vtkGenericAdaptorCell vtkDataSet V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard VTK type and print macros. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard VTK type and print macros. V.SafeDownCast(vtkObjectBase) -> vtkGenericDataSet C++: static vtkGenericDataSet *SafeDownCast(vtkObjectBase *o) Standard VTK type and print macros. V.NewInstance() -> vtkGenericDataSet C++: vtkGenericDataSet *NewInstance() Standard VTK type and print macros. V.GetNumberOfPoints() -> int C++: virtual vtkIdType GetNumberOfPoints() Return the number of points composing the dataset. See NewPointIterator() for more details. \post positive_result: result>=0 V.GetNumberOfCells(int) -> int C++: virtual vtkIdType GetNumberOfCells(int dim=-1) Return the number of cells that explicitly define the dataset. See NewCellIterator() for more details. \pre valid_dim_range: (dim>=-1) && (dim<=3) \post positive_result: result>=0 V.GetCellDimension() -> int C++: virtual int GetCellDimension() Return -1 if the dataset is explicitly defined by cells of varying dimensions or if there are no cells. If the dataset is explicitly defined by cells of a unique dimension, return this dimension. \post valid_range: (result>=-1) && (result<=3) V.GetCellTypes(vtkCellTypes) C++: virtual void GetCellTypes(vtkCellTypes *types) Get a list of types of cells in a dataset. The list consists of an array of types (not necessarily in any order), with a single entry per type. For example a dataset 5 triangles, 3 lines, and 100 hexahedra would result a list of three entries, corresponding to the types VTK_TRIANGLE, VTK_LINE, and VTK_HEXAHEDRON. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED \pre types_exist: types!=0 V.NewCellIterator(int) -> vtkGenericCellIterator C++: virtual vtkGenericCellIterator *NewCellIterator(int dim=-1) Return an iterator to traverse cells of dimension `dim' (or all dimensions if -1) that explicitly define the dataset. For instance, it will return only tetrahedra if the mesh is defined by tetrahedra. If the mesh is composed of two parts, one with tetrahedra and another part with triangles, it will return both, but will not return the boundary edges and vertices of these cells. The user is responsible for deleting the iterator. \pre valid_dim_range: (dim>=-1) && (dim<=3) \post result_exists: result!=0 NewBoundaryIteratorV.NewBoundaryIterator(int, int) -> vtkGenericCellIterator C++: virtual vtkGenericCellIterator *NewBoundaryIterator( int dim=-1, int exteriorOnly=0) Return an iterator to traverse cell boundaries of dimension `dim' (or all dimensions if -1) of the dataset. If `exteriorOnly' is true, only the exterior cell boundaries of the dataset will be returned, otherwise it will return exterior and interior cell boundaries. The user is responsible for deleting the iterator. \pre valid_dim_range: (dim>=-1) && (dim<=2) \post result_exists: result!=0 NewPointIteratorV.NewPointIterator() -> vtkGenericPointIterator C++: virtual vtkGenericPointIterator *NewPointIterator() Return an iterator to traverse the points composing the dataset; they can be points that define a cell (corner points) or isolated points. The user is responsible for deleting the iterator. \post result_exists: result!=0 V.FindPoint([float, float, float], vtkGenericPointIterator) C++: virtual void FindPoint(double x[3], vtkGenericPointIterator *p) Locate the closest point `p' to position `x' (global coordinates). \pre not_empty: GetNumberOfPoints()>0 \pre p_exists: p!=0 V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Datasets are composite objects and need to check each part for their modified time. V.ComputeBounds() C++: virtual void ComputeBounds() Compute the geometry bounding box. V.GetBounds() -> (float, ...) C++: virtual double *GetBounds() V.GetBounds([float, float, float, float, float, float]) C++: virtual void GetBounds(double bounds[6]) Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,zmax). The return value is VOLATILE. \post result_exists: result!=0 V.GetCenter() -> (float, ...) C++: virtual double *GetCenter() V.GetCenter([float, float, float]) C++: virtual void GetCenter(double center[3]) Get the center of the bounding box in global coordinates. The return value is VOLATILE. \post result_exists: result!=0 V.GetLength() -> float C++: virtual double GetLength() Return the length of the diagonal of the bounding box. \post positive_result: result>=0 V.GetAttributes() -> vtkGenericAttributeCollection C++: virtual vtkGenericAttributeCollection *GetAttributes() V.GetAttributes(int) -> vtkDataSetAttributes C++: vtkDataSetAttributes *GetAttributes(int type) override; Get the collection of attributes associated with this dataset. SetTessellatorV.SetTessellator(vtkGenericCellTessellator) C++: virtual void SetTessellator( vtkGenericCellTessellator *tessellator) Set/Get a cell tessellator if cells must be tessellated during processing. \pre tessellator_exists: tessellator!=0 GetTessellatorV.GetTessellator() -> vtkGenericCellTessellator C++: virtual vtkGenericCellTessellator *GetTessellator() Set/Get a cell tessellator if cells must be tessellated during processing. \pre tessellator_exists: tessellator!=0 V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() override; Actual size of the data in kibibytes (1024 bytes); only valid after the pipeline has updated. It is guaranteed to be greater than or equal to the memory required to represent the data. GetEstimatedSizeV.GetEstimatedSize() -> int C++: virtual vtkIdType GetEstimatedSize() Estimated size needed after tessellation (or special operation) V.GetData(vtkInformation) -> vtkGenericDataSet C++: static vtkGenericDataSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkGenericDataSet C++: static vtkGenericDataSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkGenericEdgeTablevtkCommonDataModelPython.vtkGenericEdgeTablevtkGenericEdgeTable - keep track of edges (defined by pair of integer id's) Superclass: vtkObject vtkGenericEdgeTable is used to indicate the existence of and hold information about edges. Similar to vtkEdgeTable, this class is more sophisticated in that it uses reference counting to keep track of when information about an edge should be deleted. vtkGenericEdgeTable is a helper class used in the adaptor framework. It is used during the tessellation process to hold information about the error metric on each edge. This avoids recomputing the error metric each time the same edge is visited. V.SafeDownCast(vtkObjectBase) -> vtkGenericEdgeTable C++: static vtkGenericEdgeTable *SafeDownCast(vtkObjectBase *o) Standard VTK type and print macros. V.NewInstance() -> vtkGenericEdgeTable C++: vtkGenericEdgeTable *NewInstance() Standard VTK type and print macros. V.InsertEdge(int, int, int, int, int) C++: void InsertEdge(vtkIdType e1, vtkIdType e2, vtkIdType cellId, int ref, vtkIdType &ptId) V.InsertEdge(int, int, int, int) C++: void InsertEdge(vtkIdType e1, vtkIdType e2, vtkIdType cellId, int ref=1) Split the edge with the indicated point id. RemoveEdgeV.RemoveEdge(int, int) -> int C++: int RemoveEdge(vtkIdType e1, vtkIdType e2) Method to remove an edge from the table. The method returns the current reference count. CheckEdgeV.CheckEdge(int, int, int) -> int C++: int CheckEdge(vtkIdType e1, vtkIdType e2, vtkIdType &ptId) Method to determine whether an edge is in the table (0 or 1), or not (-1). It returns whether the edge was split (1) or not (0), and the point id exists. IncrementEdgeReferenceCountV.IncrementEdgeReferenceCount(int, int, int) -> int C++: int IncrementEdgeReferenceCount(vtkIdType e1, vtkIdType e2, vtkIdType cellId) Method that increments the referencecount and returns it. CheckEdgeReferenceCountV.CheckEdgeReferenceCount(int, int) -> int C++: int CheckEdgeReferenceCount(vtkIdType e1, vtkIdType e2) Return the edge reference count. V.Initialize(int) C++: void Initialize(vtkIdType start) To specify the starting point id. It will initialize LastPointId This is very sensitive the start point should be cautiously chosen V.GetNumberOfComponents() -> int C++: int GetNumberOfComponents() Return the total number of components for the point-centered attributes. \post positive_result: result>0 SetNumberOfComponentsV.SetNumberOfComponents(int) C++: void SetNumberOfComponents(int count) Set the total number of components for the point-centered attributes. \pre positive_count: count>0 CheckPointV.CheckPoint(int) -> int C++: int CheckPoint(vtkIdType ptId) V.CheckPoint(int, [float, float, float], [float, ...]) -> int C++: int CheckPoint(vtkIdType ptId, double point[3], double *scalar) Check if a point is already in the point table. InsertPointV.InsertPoint(int, [float, float, float]) C++: void InsertPoint(vtkIdType ptId, double point[3]) Insert point associated with an edge. InsertPointAndScalarV.InsertPointAndScalar(int, [float, float, float], [float, ...]) C++: void InsertPointAndScalar(vtkIdType ptId, double pt[3], double *s) RemovePointV.RemovePoint(int) C++: void RemovePoint(vtkIdType ptId) Remove a point from the point table. IncrementPointReferenceCountV.IncrementPointReferenceCount(int) C++: void IncrementPointReferenceCount(vtkIdType ptId) Increment the reference count for the indicated point. DumpTableV.DumpTable() C++: void DumpTable() For debugging purposes. It is particularly useful to dump the table and check that nothing is left after a complete iteration. LoadFactor should ideally be very low to be able to have a constant time access LoadFactorV.LoadFactor() C++: void LoadFactor() For debugging purposes. It is particularly useful to dump the table and check that nothing is left after a complete iteration. LoadFactor should ideally be very low to be able to have a constant time access vtkGenericInterpolatedVelocityFieldvtkCommonDataModelPython.vtkGenericInterpolatedVelocityFieldvtkGenericInterpolatedVelocityField - Interface for obtaining interpolated velocity values Superclass: vtkFunctionSet vtkGenericInterpolatedVelocityField acts as a continuous velocity field by performing cell interpolation on the underlying vtkDataSet. This is a concrete sub-class of vtkFunctionSet with NumberOfIndependentVariables = 4 (x,y,z,t) and NumberOfFunctions = 3 (u,v,w). Normally, every time an evaluation is performed, the cell which contains the point (x,y,z) has to be found by calling FindCell. This is a computationally expansive operation. In certain cases, the cell search can be avoided or shortened by providing a guess for the cell iterator. For example, in streamline integration, the next evaluation is usually in the same or a neighbour cell. For this reason, vtkGenericInterpolatedVelocityField stores the last cell iterator. If caching is turned on, it uses this iterator as the starting point. @warning vtkGenericInterpolatedVelocityField is not thread safe. A new instance should be created by each thread. @sa vtkFunctionSet vtkGenericStreamTracer V.SafeDownCast(vtkObjectBase) -> vtkGenericInterpolatedVelocityField C++: static vtkGenericInterpolatedVelocityField *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkGenericInterpolatedVelocityField C++: vtkGenericInterpolatedVelocityField *NewInstance() FunctionValuesV.FunctionValues([float, ...], [float, ...]) -> int C++: int FunctionValues(double *x, double *f) override; Evaluate the velocity field, f, at (x, y, z, t). For now, t is ignored. AddDataSetV.AddDataSet(vtkGenericDataSet) C++: virtual void AddDataSet(vtkGenericDataSet *dataset) Add a dataset used for the implicit function evaluation. If more than one dataset is added, the evaluation point is searched in all until a match is found. THIS FUNCTION DOES NOT CHANGE THE REFERENCE COUNT OF dataset FOR THREAD SAFETY REASONS. ClearLastCellV.ClearLastCell() C++: void ClearLastCell() Set the last cell id to -1 so that the next search does not start from the previous cell GetLastCellV.GetLastCell() -> vtkGenericAdaptorCell C++: vtkGenericAdaptorCell *GetLastCell() Return the cell cached from last evaluation. GetLastLocalCoordinatesV.GetLastLocalCoordinates([float, float, float]) -> int C++: int GetLastLocalCoordinates(double pcoords[3]) Returns the interpolation weights cached from last evaluation if the cached cell is valid (returns 1). Otherwise, it does not change w and returns 0. GetCachingV.GetCaching() -> int C++: virtual int GetCaching() Turn caching on/off. SetCachingV.SetCaching(int) C++: virtual void SetCaching(int _arg) Turn caching on/off. CachingOnV.CachingOn() C++: virtual void CachingOn() Turn caching on/off. CachingOffV.CachingOff() C++: virtual void CachingOff() Turn caching on/off. GetCacheHitV.GetCacheHit() -> int C++: virtual int GetCacheHit() Caching statistics. GetCacheMissV.GetCacheMiss() -> int C++: virtual int GetCacheMiss() Caching statistics. GetVectorsSelectionV.GetVectorsSelection() -> string C++: virtual char *GetVectorsSelection() If you want to work with an arbitrary vector array, then set its name here. By default this in nullptr and the filter will use the active vector array. SelectVectorsV.SelectVectors(string) C++: void SelectVectors(const char *fieldName) If you want to work with an arbitrary vector array, then set its name here. By default this in nullptr and the filter will use the active vector array. GetLastDataSetV.GetLastDataSet() -> vtkGenericDataSet C++: virtual vtkGenericDataSet *GetLastDataSet() Returns the last dataset that was visited. Can be used as a first guess as to where the next point will be as well as to avoid searching through all datasets to get more information about the point. CopyParametersV.CopyParameters(vtkGenericInterpolatedVelocityField) C++: virtual void CopyParameters( vtkGenericInterpolatedVelocityField *from) Copy the user set parameters from source. This copies the Caching parameters. Sub-classes can add more after chaining. vtkFunctionSetvtkCommonDataModelPython.vtkGenericPointIteratorvtkGenericPointIterator - iterator used to traverse points Superclass: vtkObject This class (and subclasses) are used to iterate over points. Use it only in conjunction with vtkGenericDataSet (i.e., the adaptor framework). Typical use is: vtkGenericDataSet *dataset; vtkGenericPointIterator *it = dataset->NewPointIterator(); for (it->Begin(); !it->IsAtEnd(); it->Next()); { x=it->GetPosition(); } V.SafeDownCast(vtkObjectBase) -> vtkGenericPointIterator C++: static vtkGenericPointIterator *SafeDownCast( vtkObjectBase *o) Standard VTK construction and type macros. V.NewInstance() -> vtkGenericPointIterator C++: vtkGenericPointIterator *NewInstance() Standard VTK construction and type macros. V.Next() C++: virtual void Next() Move the iterator to the next position in the list. \pre not_off: !IsAtEnd() GetPositionV.GetPosition() -> (float, ...) C++: virtual double *GetPosition() V.GetPosition([float, float, float]) C++: virtual void GetPosition(double x[3]) Get the coordinates of the point at the current iterator position. \pre not_off: !IsAtEnd() \post result_exists: result!=0 V.GetId() -> int C++: virtual vtkIdType GetId() Return the unique identifier for the point, could be non-contiguous. \pre not_off: !IsAtEnd() vtkCommonDataModelPython.vtkGenericSubdivisionErrorMetricvtkGenericSubdivisionErrorMetric - Objects that compute error during cell tessellation. Superclass: vtkObject Objects of that class answer the following question during the cell subdivision: "does the edge need to be subdivided?" through RequiresEdgeSubdivision(). The answer depends on the criterium actually used in the subclass of this abstract class: a geometric-based error metric (variation of edge from a straight line), an attribute-based error metric (variation of the active attribute/component value from a linear ramp) , a view-depend error metric, ... Cell subdivision is performed in the context of the adaptor framework: higher-order, or complex cells, are automatically tessellated into simplices so that they can be processed with conventional visualization algorithms. @sa vtkGenericCellTessellator V.SafeDownCast(vtkObjectBase) -> vtkGenericSubdivisionErrorMetric C++: static vtkGenericSubdivisionErrorMetric *SafeDownCast( vtkObjectBase *o) Standard VTK type and error macros. V.NewInstance() -> vtkGenericSubdivisionErrorMetric C++: vtkGenericSubdivisionErrorMetric *NewInstance() Standard VTK type and error macros. V.RequiresEdgeSubdivision([float, ...], [float, ...], [float, ...], float) -> int C++: virtual int RequiresEdgeSubdivision(double *leftPoint, double *midPoint, double *rightPoint, double alpha) Does the edge need to be subdivided according to the implemented computation? The edge is defined by its `leftPoint' and its `rightPoint'. `leftPoint', `midPoint' and `rightPoint' have to be initialized before calling RequiresEdgeSubdivision(). Their format is global coordinates, parametric coordinates and point centered attributes: xyx rst abc de... `alpha' is the normalized abscissa of the midpoint along the edge. (close to 0 means close to the left point, close to 1 means close to the right point) \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 V.GetError([float, ...], [float, ...], [float, ...], float) -> float C++: virtual double GetError(double *leftPoint, double *midPoint, double *rightPoint, double alpha) Return the error at the mid-point. The type of error depends on the state of the concrete error metric. For instance, it can return an absolute or relative error metric. See RequiresEdgeSubdivision() for a description of the arguments. \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 \post positive_result: result>=0 SetGenericCellV.SetGenericCell(vtkGenericAdaptorCell) C++: void SetGenericCell(vtkGenericAdaptorCell *cell) The cell that the edge belongs to. GetGenericCellV.GetGenericCell() -> vtkGenericAdaptorCell C++: virtual vtkGenericAdaptorCell *GetGenericCell() The cell that the edge belongs to. V.SetDataSet(vtkGenericDataSet) C++: void SetDataSet(vtkGenericDataSet *ds) Set/Get the dataset to be tessellated. V.GetDataSet() -> vtkGenericDataSet C++: virtual vtkGenericDataSet *GetDataSet() Set/Get the dataset to be tessellated. vtkGeometricErrorMetricvtkCommonDataModelPython.vtkGeometricErrorMetricvtkGeometricErrorMetric - Objects that compute geometry-based error during cell tessellation. Superclass: vtkGenericSubdivisionErrorMetric It is a concrete error metric, based on a geometric criterium: the variation of the edge from a straight line. @sa vtkGenericCellTessellator vtkGenericSubdivisionErrorMetric V.SafeDownCast(vtkObjectBase) -> vtkGeometricErrorMetric C++: static vtkGeometricErrorMetric *SafeDownCast( vtkObjectBase *o) Standard VTK type and error macros. V.NewInstance() -> vtkGeometricErrorMetric C++: vtkGeometricErrorMetric *NewInstance() Standard VTK type and error macros. GetAbsoluteGeometricToleranceV.GetAbsoluteGeometricTolerance() -> float C++: virtual double GetAbsoluteGeometricTolerance() Return the squared absolute geometric accuracy. See SetAbsoluteGeometricTolerance() for details. \post positive_result: result>0 SetAbsoluteGeometricToleranceV.SetAbsoluteGeometricTolerance(float) C++: void SetAbsoluteGeometricTolerance(double value) Set the geometric accuracy with a squared absolute value. This is the geometric object-based accuracy. Subdivision will be required if the square distance between the real point and the straight line passing through the vertices of the edge is greater than `value'. For instance 0.01 will give better result than 0.1. \pre positive_value: value>0 SetRelativeGeometricToleranceV.SetRelativeGeometricTolerance(float, vtkGenericDataSet) C++: void SetRelativeGeometricTolerance(double value, vtkGenericDataSet *ds) Set the geometric accuracy with a value relative to the length of the bounding box of the dataset. Internally compute the absolute tolerance. For instance 0.01 will give better result than 0.1. \pre valid_range_value: value>0 && value<1 \pre ds_exists: ds!=0 V.RequiresEdgeSubdivision([float, ...], [float, ...], [float, ...], float) -> int C++: int RequiresEdgeSubdivision(double *leftPoint, double *midPoint, double *rightPoint, double alpha) override; Does the edge need to be subdivided according to the distance between the line passing through its endpoints and the mid point? The edge is defined by its `leftPoint' and its `rightPoint'. `leftPoint', `midPoint' and `rightPoint' have to be initialized before calling RequiresEdgeSubdivision(). Their format is global coordinates, parametric coordinates and point centered attributes: xyx rst abc de... `alpha' is the normalized abscissa of the midpoint along the edge. (close to 0 means close to the left point, close to 1 means close to the right point) \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 V.GetError([float, ...], [float, ...], [float, ...], float) -> float C++: double GetError(double *leftPoint, double *midPoint, double *rightPoint, double alpha) override; Return the error at the mid-point. It will return an error relative to the bounding box size if GetRelative() is true, a square absolute error otherwise. See RequiresEdgeSubdivision() for a description of the arguments. \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 \post positive_result: result>=0 GetRelativeV.GetRelative() -> int C++: int GetRelative() Return the type of output of GetError() vtkEdgeBasevtkOutEdgeTypevtkInEdgeTypevtkCommonDataModelPython.vtkEdgeBasevtkEdgeBase - no description provided. this class cannot be instantiatedvtkCommonDataModelPython.vtkOutEdgeTypevtkOutEdgeType - no description provided. Superclass: vtkEdgeBase vtkOutEdgeType() vtkOutEdgeType(vtkIdType t, vtkIdType id) vtkOutEdgeType(const &vtkOutEdgeType) @W vtkOutEdgeTypevtkCommonDataModelPython.vtkInEdgeTypevtkInEdgeType - no description provided. Superclass: vtkEdgeBase vtkInEdgeType() vtkInEdgeType(vtkIdType s, vtkIdType id) vtkInEdgeType(const &vtkInEdgeType) @W vtkInEdgeTypevtkCommonDataModelPython.vtkEdgeTypevtkEdgeType - no description provided. Superclass: vtkEdgeBase vtkEdgeType() vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id) vtkEdgeType(const &vtkEdgeType) @W vtkEdgeTypevtkCommonDataModelPython.vtkGraphvtkGraph - Base class for graph data types. Superclass: vtkDataObject vtkGraph is the abstract base class that provides all read-only API for graph data types. A graph consists of a collection of vertices and a collection of edges connecting pairs of vertices. The vtkDirectedGraph subclass represents a graph whose edges have inherent order from source vertex to target vertex, while vtkUndirectedGraph is a graph whose edges have no inherent ordering. Graph vertices may be traversed in two ways. In the current implementation, all vertices are assigned consecutive ids starting at zero, so they may be traversed in a simple for loop from 0 to graph->GetNumberOfVertices() - 1. You may alternately create a vtkVertexListIterator and call graph->GetVertices(it). it->Next() will return the id of the next vertex, while it->HasNext() indicates whether there are more vertices in the graph. This is the preferred method, since in the future graphs may support filtering or subsetting where the vertex ids may not be contiguous. Graph edges must be traversed through iterators. To traverse all edges in a graph, create an instance of vtkEdgeListIterator and call graph->GetEdges(it). it->Next() returns lightweight vtkEdgeType structures, which contain the public fields Id, Source and Target. Id is the identifier for the edge, which may be used to look up values in assiciated edge data arrays. Source and Target store the ids of the source and target vertices of the edge. Note that the edge list iterator DOES NOT necessarily iterate over edges in order of ascending id. To traverse edges from wrapper code (Python, Tcl, Java), use it->NextGraphEdge() instead of it->Next(). This will return a heavyweight, wrappable vtkGraphEdge object, which has the same fields as vtkEdgeType accessible through getter methods. To traverse all edges outgoing from a vertex, create a vtkOutEdgeIterator and call graph->GetOutEdges(v, it). it->Next() returns a lightweight vtkOutEdgeType containing the fields Id and Target. The source of the edge is always the vertex that was passed as an argument to GetOutEdges(). Incoming edges may be similarly traversed with vtkInEdgeIterator, which returns vtkInEdgeType structures with Id and Source fields. Both vtkOutEdgeIterator and vtkInEdgeIterator also provide the wrapper functions NextGraphEdge() which return vtkGraphEdge objects. An additional iterator, vtkAdjacentVertexIterator can traverse outgoing vertices directly, instead needing to parse through edges. Initialize the iterator by calling graph->GetAdjacentVertices(v, it). vtkGraph has two instances of vtkDataSetAttributes for associated vertex and edge data. It also has a vtkPoints instance which may store x,y,z locations for each vertex. This is populated by filters such as vtkGraphLayout and vtkAssignCoordinates. All graph types share the same implementation, so the structure of one may be shared among multiple graphs, even graphs of different types. Structures from vtkUndirectedGraph and vtkMutableUndirectedGraph may be shared directly. Structures from vtkDirectedGraph, vtkMutableDirectedGraph, and vtkTree may be shared directly with the exception that setting a structure to a tree requires that a "is a tree" test passes. For graph types that are known to be compatible, calling ShallowCopy() or DeepCopy() will work as expected. When the outcome of a conversion is unknown (i.e. setting a graph to a tree), CheckedShallowCopy() and CheckedDeepCopy() exist which are identical to ShallowCopy() and DeepCopy(), except that instead of emitting an error for an incompatible structure, the function returns false. This allows you to programmatically check structure compatibility without causing error messages. To construct a graph, use vtkMutableDirectedGraph or vtkMutableUndirectedGraph. You may then use CheckedShallowCopy to set the contents of a mutable graph type into one of the non-mutable types vtkDirectedGraph, vtkUndirectedGraph. To construct a tree, use vtkMutableDirectedGraph, with directed edges which point from the parent to the child, then use CheckedShallowCopy to set the structure to a vtkTree. @warning All copy operations implement copy-on-write. The structures are initially shared, but if one of the graphs is modified, the structure is copied so that to the user they function as if they were deep copied. This means that care must be taken if different threads are accessing different graph instances that share the same structure. Race conditions may develop if one thread is modifying the graph at the same time that another graph is copying the structure. @par Vertex pedigree IDs: The vertices in a vtkGraph can be associated with pedigree IDs through GetVertexData()->SetPedigreeIds. In this case, there is a 1-1 mapping between pedigree Ids and vertices. One can query the vertex ID based on the pedigree ID using FindVertex, add new vertices by pedigree ID with AddVertex, and add edges based on the pedigree IDs of the source and target vertices. For example, AddEdge("Here", "There") will find (or add) vertices with pedigree ID "Here" and "There" and then introduce an edge from "Here" to "There". @par Vertex pedigree IDs: To configure the vtkGraph with a pedigree ID mapping, create a vtkDataArray that will store the pedigree IDs and set that array as the pedigree ID array for the vertices via GetVertexData()->SetPedigreeIds(). @par Distributed graphs: vtkGraph instances can be distributed across multiple machines, to allow the construction and manipulation of graphs larger than a single machine could handle. A distributed graph will typically be distributed across many different nodes within a cluster, using the Message Passing Interface (MPI) to allow those cluster nodes to communicate. @par Distributed graphs: An empty vtkGraph can be made into a distributed graph by attaching an instance of a vtkDistributedGraphHelper via the SetDistributedGraphHelper() method. To determine whether a graph is distributed or not, call GetDistributedGraphHelper() and check whether the result is non-nullptr. For a distributed graph, the number of processors across which the graph is distributed can be retrieved by extracting the value for the DATA_NUMBER_OF_PIECES key in the vtkInformation object (retrieved by GetInformation()) associated with the graph. Similarly, the value corresponding to the DATA_PIECE_NUMBER key of the vtkInformation object describes which piece of the data this graph instance provides. @par Distributed graphs: Distributed graphs behave somewhat differently from non-distributed graphs, and will require special care. In a distributed graph, each of the processors will contain a subset of the vertices in the graph. That subset of vertices can be accessed via the vtkVertexListIterator produced by GetVertices(). GetNumberOfVertices(), therefore, returns the number of vertices stored locally: it does not account for vertices stored on other processors. A vertex (or edge) is identified by both the rank of its owning processor and by its index within that processor, both of which are encoded within the vtkIdType value that describes that vertex (or edge). The owning processor is a value between 0 and P-1, where P is the number of processors across which the vtkGraph has been distributed. The local index will be a value between 0 and GetNumberOfVertices(), for vertices, or GetNumberOfEdges(), for edges, and can be used to access the local parts of distributed data arrays. When given a vtkIdType identifying a vertex, one can determine the owner of the vertex with vtkDistributedGraphHelper::GetVertexOwner() and the local index with vtkDistributedGraphHelper::GetVertexIndex(). With edges, the appropriate methods are vtkDistributedGraphHelper::GetEdgeOwner() and vtkDistributedGraphHelper::GetEdgeIndex(), respectively. To construct a vtkIdType representing either a vertex or edge given only its owner and local index, use vtkDistributedGraphHelper::MakeDistributedId(). @par Distributed graphs: The edges in a distributed graph are always stored on the processors that own the vertices named by the edge. For example, given a directed edge (u, v), the edge will be stored in the out-edges list for vertex u on the processor that owns u, and in the in-edges list for vertex v on the processor that owns v. This "row-wise" decomposition of the graph means that, for any vertex that is local to a processor, that processor can look at all of the incoming and outgoing edges of the graph. Processors cannot, however, access the incoming or outgoing edge lists of vertex owned by other processors. Vertices owned by other processors will not be encountered when traversing the vertex list via GetVertices(), but may be encountered by traversing the in- and out-edge lists of local vertices or the edge list. @par Distributed graphs: Distributed graphs can have pedigree IDs for the vertices in the same way that non-distributed graphs can. In this case, the distribution of the vertices in the graph is based on pedigree ID. For example, a vertex with the pedigree ID "Here" might land on processor 0 while a vertex pedigree ID "There" would end up on processor 3. By default, the pedigree IDs themselves are hashed to give a random (and, hopefully, even) distribution of the vertices. However, one can provide a different vertex distribution function by calling vtkDistributedGraphHelper::SetVertexPedigreeIdDistribution. Once a distributed graph has pedigree IDs, the no-argument AddVertex() method can no longer be used. Additionally, once a vertex has a pedigree ID, that pedigree ID should not be changed unless the user can guarantee that the vertex distribution will still map that vertex to the same processor where it already resides. @sa vtkDirectedGraph vtkUndirectedGraph vtkMutableDirectedGraph vtkMutableUndirectedGraph vtkTree vtkDistributedGraphHelper @par Thanks: Thanks to Brian Wylie, Timothy Shead, Ken Moreland of Sandia National Laboratories and Douglas Gregor of Indiana University for designing these classes. V.SafeDownCast(vtkObjectBase) -> vtkGraph C++: static vtkGraph *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGraph C++: vtkGraph *NewInstance() GetVertexDataV.GetVertexData() -> vtkDataSetAttributes C++: virtual vtkDataSetAttributes *GetVertexData() Get the vertex or edge data. GetEdgeDataV.GetEdgeData() -> vtkDataSetAttributes C++: virtual vtkDataSetAttributes *GetEdgeData() Get the vertex or edge data. V.Initialize() C++: void Initialize() override; Initialize to an empty graph. V.GetPoint(int) -> (float, ...) C++: double *GetPoint(vtkIdType ptId) V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType ptId, double x[3]) These methods return the point (0,0,0) until the points structure is created, when it returns the actual point position. In a distributed graph, only the points for local vertices can be retrieved. V.GetPoints() -> vtkPoints C++: vtkPoints *GetPoints() Returns the points array for this graph. If points is not yet constructed, generates and returns a new points array filled with (0,0,0) coordinates. In a distributed graph, only the points for local vertices can be retrieved or modified. V.SetPoints(vtkPoints) C++: virtual void SetPoints(vtkPoints *points) Returns the points array for this graph. If points is not yet constructed, generates and returns a new points array filled with (0,0,0) coordinates. In a distributed graph, only the points for local vertices can be retrieved or modified. V.ComputeBounds() C++: void ComputeBounds() Compute the bounds of the graph. In a distributed graph, this computes the bounds around the local part of the graph. V.GetBounds() -> (float, ...) C++: double *GetBounds() V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,zmax). In a distributed graph, this computes the bounds around the local part of the graph. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; The modified time of the graph. GetOutEdgesV.GetOutEdges(int, vtkOutEdgeIterator) C++: virtual void GetOutEdges(vtkIdType v, vtkOutEdgeIterator *it) Initializes the out edge iterator to iterate over all outgoing edges of vertex v. For an undirected graph, returns all incident edges. In a distributed graph, the vertex v must be local to this processor. GetDegreeV.GetDegree(int) -> int C++: virtual vtkIdType GetDegree(vtkIdType v) The total of all incoming and outgoing vertices for vertex v. For undirected graphs, this is simply the number of edges incident to v. In a distributed graph, the vertex v must be local to this processor. GetOutDegreeV.GetOutDegree(int) -> int C++: virtual vtkIdType GetOutDegree(vtkIdType v) The number of outgoing edges from vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor. GetOutEdgeV.GetOutEdge(int, int) -> vtkOutEdgeType C++: virtual vtkOutEdgeType GetOutEdge(vtkIdType v, vtkIdType index) V.GetOutEdge(int, int, vtkGraphEdge) C++: virtual void GetOutEdge(vtkIdType v, vtkIdType index, vtkGraphEdge *e) Random-access method for retrieving outgoing edges from vertex v. GetInEdgesV.GetInEdges(int, vtkInEdgeIterator) C++: virtual void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) Initializes the in edge iterator to iterate over all incoming edges to vertex v. For an undirected graph, returns all incident edges. In a distributed graph, the vertex v must be local to this processor. GetInDegreeV.GetInDegree(int) -> int C++: virtual vtkIdType GetInDegree(vtkIdType v) The number of incoming edges to vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor. GetInEdgeV.GetInEdge(int, int) -> vtkInEdgeType C++: virtual vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType index) V.GetInEdge(int, int, vtkGraphEdge) C++: virtual void GetInEdge(vtkIdType v, vtkIdType index, vtkGraphEdge *e) Random-access method for retrieving incoming edges to vertex v. GetAdjacentVerticesV.GetAdjacentVertices(int, vtkAdjacentVertexIterator) C++: virtual void GetAdjacentVertices(vtkIdType v, vtkAdjacentVertexIterator *it) Initializes the adjacent vertex iterator to iterate over all outgoing vertices from vertex v. For an undirected graph, returns all adjacent vertices. In a distributed graph, the vertex v must be local to this processor. GetEdgesV.GetEdges(vtkEdgeListIterator) C++: virtual void GetEdges(vtkEdgeListIterator *it) Initializes the edge list iterator to iterate over all edges in the graph. Edges may not be traversed in order of increasing edge id. In a distributed graph, this returns edges that are stored locally. V.GetNumberOfEdges() -> int C++: virtual vtkIdType GetNumberOfEdges() The number of edges in the graph. In a distributed graph, this returns the number of edges stored locally. GetVerticesV.GetVertices(vtkVertexListIterator) C++: virtual void GetVertices(vtkVertexListIterator *it) Initializes the vertex list iterator to iterate over all vertices in the graph. In a distributed graph, the iterator traverses all local vertices. GetNumberOfVerticesV.GetNumberOfVertices() -> int C++: virtual vtkIdType GetNumberOfVertices() The number of vertices in the graph. In a distributed graph, returns the number of local vertices in the graph. SetDistributedGraphHelperV.SetDistributedGraphHelper(vtkDistributedGraphHelper) C++: void SetDistributedGraphHelper( vtkDistributedGraphHelper *helper) Sets the distributed graph helper of this graph, turning it into a distributed graph. This operation can only be executed on an empty graph. GetDistributedGraphHelperV.GetDistributedGraphHelper() -> vtkDistributedGraphHelper C++: vtkDistributedGraphHelper *GetDistributedGraphHelper() Retrieves the distributed graph helper for this graph FindVertexV.FindVertex(vtkVariant) -> int C++: vtkIdType FindVertex(const vtkVariant &pedigreeID) Retrieve the vertex with the given pedigree ID. If successful, returns the ID of the vertex. Otherwise, either the vertex data does not have a pedigree ID array or there is no vertex with the given pedigree ID, so this function returns -1. If the graph is a distributed graph, this method will return the Distributed-ID of the vertex. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *obj) override; Shallow copies the data object into this graph. If it is an incompatible graph, reports an error. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *obj) override; Deep copies the data object into this graph. If it is an incompatible graph, reports an error. V.CopyStructure(vtkGraph) C++: virtual void CopyStructure(vtkGraph *g) Does a shallow copy of the topological information, but not the associated attributes. CheckedShallowCopyV.CheckedShallowCopy(vtkGraph) -> bool C++: virtual bool CheckedShallowCopy(vtkGraph *g) Performs the same operation as ShallowCopy(), but instead of reporting an error for an incompatible graph, returns false. CheckedDeepCopyV.CheckedDeepCopy(vtkGraph) -> bool C++: virtual bool CheckedDeepCopy(vtkGraph *g) Performs the same operation as DeepCopy(), but instead of reporting an error for an incompatible graph, returns false. V.Squeeze() C++: virtual void Squeeze() Reclaim unused memory. V.GetData(vtkInformation) -> vtkGraph C++: static vtkGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkGraph C++: static vtkGraph *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. ReorderOutVerticesV.ReorderOutVertices(int, vtkIdTypeArray) C++: void ReorderOutVertices(vtkIdType v, vtkIdTypeArray *vertices) Reorder the outgoing vertices of a vertex. The vertex list must have the same elements as the current out edge list, just in a different order. This method does not change the topology of the graph. In a distributed graph, the vertex v must be local. IsSameStructureV.IsSameStructure(vtkGraph) -> bool C++: bool IsSameStructure(vtkGraph *other) Returns true if both graphs point to the same adjacency structure. Can be used to test the copy-on-write feature of the graph. GetSourceVertexV.GetSourceVertex(int) -> int C++: vtkIdType GetSourceVertex(vtkIdType e) Retrieve the source and target vertices for an edge id. NOTE: The first time this is called, the graph will build a mapping array from edge id to source/target that is the same size as the number of edges in the graph. If you have access to a vtkOutEdgeType, vtkInEdgeType, vtkEdgeType, or vtkGraphEdge, you should directly use these structures to look up the source or target instead of this method. GetTargetVertexV.GetTargetVertex(int) -> int C++: vtkIdType GetTargetVertex(vtkIdType e) Retrieve the source and target vertices for an edge id. NOTE: The first time this is called, the graph will build a mapping array from edge id to source/target that is the same size as the number of edges in the graph. If you have access to a vtkOutEdgeType, vtkInEdgeType, vtkEdgeType, or vtkGraphEdge, you should directly use these structures to look up the source or target instead of this method. SetEdgePointsV.SetEdgePoints(int, int, [float, ...]) C++: void SetEdgePoints(vtkIdType e, vtkIdType npts, double *pts) Get/Set the internal edge control points associated with each edge. The size of the pts array is 3*npts, and holds the x,y,z location of each edge control point. V.GetEdgePoints(int, int, [float, ...]) C++: void GetEdgePoints(vtkIdType e, vtkIdType &npts, double *&pts) Get/Set the internal edge control points associated with each edge. The size of the pts array is 3*npts, and holds the x,y,z location of each edge control point. GetNumberOfEdgePointsV.GetNumberOfEdgePoints(int) -> int C++: vtkIdType GetNumberOfEdgePoints(vtkIdType e) Get the number of edge points associated with an edge. GetEdgePointV.GetEdgePoint(int, int) -> (float, float, float) C++: double *GetEdgePoint(vtkIdType e, vtkIdType i) Get the x,y,z location of a point along edge e. ClearEdgePointsV.ClearEdgePoints(int) C++: void ClearEdgePoints(vtkIdType e) Clear all points associated with an edge. SetEdgePointV.SetEdgePoint(int, int, [float, float, float]) C++: void SetEdgePoint(vtkIdType e, vtkIdType i, double x[3]) V.SetEdgePoint(int, int, float, float, float) C++: void SetEdgePoint(vtkIdType e, vtkIdType i, double x, double y, double z) Set an x,y,z location of a point along an edge. This assumes there is already a point at location i, and simply overwrites it. AddEdgePointV.AddEdgePoint(int, [float, float, float]) C++: void AddEdgePoint(vtkIdType e, double x[3]) V.AddEdgePoint(int, float, float, float) C++: void AddEdgePoint(vtkIdType e, double x, double y, double z) Adds a point to the end of the list of edge points for a certain edge. ShallowCopyEdgePointsV.ShallowCopyEdgePoints(vtkGraph) C++: void ShallowCopyEdgePoints(vtkGraph *g) Copy the internal edge point data from another graph into this graph. Both graphs must have the same number of edges. DeepCopyEdgePointsV.DeepCopyEdgePoints(vtkGraph) C++: void DeepCopyEdgePoints(vtkGraph *g) Copy the internal edge point data from another graph into this graph. Both graphs must have the same number of edges. GetGraphInternalsV.GetGraphInternals(bool) -> vtkGraphInternals C++: vtkGraphInternals *GetGraphInternals(bool modifying) Returns the internal representation of the graph. If modifying is true, then the returned vtkGraphInternals object will be unique to this vtkGraph object. GetInducedEdgesV.GetInducedEdges(vtkIdTypeArray, vtkIdTypeArray) C++: void GetInducedEdges(vtkIdTypeArray *verts, vtkIdTypeArray *edges) Fills a list of edge indices with the edges contained in the induced subgraph formed by the vertices in the vertex list. V.GetNumberOfElements(int) -> int C++: vtkIdType GetNumberOfElements(int type) override; Get the number of elements for a specific attribute type (VERTEX, EDGE, etc.). DumpV.Dump() C++: void Dump() Dump the contents of the graph to standard output. GetEdgeIdV.GetEdgeId(int, int) -> int C++: vtkIdType GetEdgeId(vtkIdType a, vtkIdType b) Returns the Id of the edge between vertex a and vertex b. This is independent of directionality of the edge, that is, if edge A->B exists or if edge B->A exists, this function will return its Id. If multiple edges exist between a and b, here is no guarantee about which one will be returned. Returns -1 if no edge exists between a and b. ToDirectedGraphV.ToDirectedGraph(vtkDirectedGraph) -> bool C++: bool ToDirectedGraph(vtkDirectedGraph *g) Convert the graph to a directed graph. ToUndirectedGraphV.ToUndirectedGraph(vtkUndirectedGraph) -> bool C++: bool ToUndirectedGraph(vtkUndirectedGraph *g) Convert the graph to an undirected graph. vtkOutEdgeIteratorvtkGraphEdgevtkInEdgeIteratorvtkVertexListIteratorvtkUndirectedGraphvtkCommonDataModelPython.vtkGraphEdgevtkGraphEdge - Representation of a single graph edge. Superclass: vtkObject A heavy-weight (vtkObject subclass) graph edge object that may be used instead of the vtkEdgeType struct, for use with wrappers. The edge contains the source and target vertex ids, and the edge id. @sa vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkGraphEdge C++: static vtkGraphEdge *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGraphEdge C++: vtkGraphEdge *NewInstance() SetSourceV.SetSource(int) C++: virtual void SetSource(vtkIdType _arg) The source of the edge. GetSourceV.GetSource() -> int C++: virtual vtkIdType GetSource() The source of the edge. SetTargetV.SetTarget(int) C++: virtual void SetTarget(vtkIdType _arg) The target of the edge. GetTargetV.GetTarget() -> int C++: virtual vtkIdType GetTarget() The target of the edge. SetIdV.SetId(int) C++: virtual void SetId(vtkIdType _arg) The id of the edge. V.GetId() -> int C++: virtual vtkIdType GetId() The id of the edge. vtkGraphInternalsvtkVertexAdjacencyListvtkCommonDataModelPython.vtkVertexAdjacencyListvtkVertexAdjacencyList - no description provided. vtkVertexAdjacencyList() vtkVertexAdjacencyList(const &vtkVertexAdjacencyList) @W vtkVertexAdjacencyListvtkCommonDataModelPython.vtkGraphInternalsvtkGraphInternals - Internal representation of vtkGraph Superclass: vtkObject This is the internal representation of vtkGraph, used only in rare cases where one must modify that representation. V.SafeDownCast(vtkObjectBase) -> vtkGraphInternals C++: static vtkGraphInternals *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkGraphInternals C++: vtkGraphInternals *NewInstance() vtkHexagonalPrismvtkCommonDataModelPython.vtkHexagonalPrismvtkHexagonalPrism - a 3D cell that represents a prism with hexagonal base Superclass: vtkCell3D vtkHexagonalPrism is a concrete implementation of vtkCell to represent a linear 3D prism with hexagonal base. Such prism is defined by the twelve points (0-12) where (0,1,2,3,4,5) is the base of the prism which, using the right hand rule, forms a hexagon whose normal points is in the direction of the opposite face (6,7,8,9,10,11). @par Thanks: Thanks to Philippe Guerville who developed this class. Thanks to Charles Pignerol (CEA-DAM, France) who ported this class under VTK 4. Thanks to Jean Favre (CSCS, Switzerland) who contributed to integrate this class in VTK. Please address all comments to Jean Favre (jfavre at cscs.ch). V.SafeDownCast(vtkObjectBase) -> vtkHexagonalPrism C++: static vtkHexagonalPrism *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHexagonalPrism C++: vtkHexagonalPrism *NewInstance() V.GetFacePoints(int, [int, ...]) C++: void GetFacePoints(int faceId, int *&pts) override; See vtkCell3D API for description of these methods. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the wedge in parametric coordinates. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[12]) @deprecated Replaced by vtkHexagonalPrism::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[36]) @deprecated Replaced by vtkHexagonalPrism::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[12]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[36]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkHexahedronvtkCommonDataModelPython.vtkHexahedronvtkHexahedron - a cell that represents a linear 3D hexahedron Superclass: vtkCell3D vtkHexahedron is a concrete implementation of vtkCell to represent a linear, 3D rectangular hexahedron (e.g., "brick" topology). vtkHexahedron uses the standard isoparametric shape functions for a linear hexahedron. The hexahedron is defined by the eight points (0-7) where (0,1,2,3) is the base of the hexahedron which, using the right hand rule, forms a quadrilaterial whose normal points in the direction of the opposite face (4,5,6,7). @sa vtkConvexPointSet vtkPyramid vtkTetra vtkVoxel vtkWedge V.SafeDownCast(vtkObjectBase) -> vtkHexahedron C++: static vtkHexahedron *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHexahedron C++: vtkHexahedron *NewInstance() V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[8]) @deprecated Replaced by vtkHexahedron::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[24]) @deprecated Replaced by vtkHexahedron::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[8]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[24]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.GetEdgeArray(int) -> (int, int) C++: static int *GetEdgeArray(int edgeId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. V.GetFaceArray(int) -> (int, int, int, int) C++: static int *GetFaceArray(int faceId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. vtkHierarchicalBoxDataIteratorvtkCommonDataModelPython.vtkHierarchicalBoxDataIteratorvtkHierarchicalBoxDataIterator - Empty class for backwards compatibility. Superclass: vtkUniformGridAMRDataIterator V.SafeDownCast(vtkObjectBase) -> vtkHierarchicalBoxDataIterator C++: static vtkHierarchicalBoxDataIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkHierarchicalBoxDataIterator C++: vtkHierarchicalBoxDataIterator *NewInstance() vtkUniformGridAMRDataIteratorvtkHierarchicalBoxDataSetvtkCommonDataModelPython.vtkHierarchicalBoxDataSetvtkHierarchicalBoxDataSet - Backwards compatibility class Superclass: vtkOverlappingAMR An empty class for backwards compatibility @sa vtkUniformGridAM vtkOverlappingAMR vtkNonOverlappingAMR V.SafeDownCast(vtkObjectBase) -> vtkHierarchicalBoxDataSet C++: static vtkHierarchicalBoxDataSet *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkHierarchicalBoxDataSet C++: vtkHierarchicalBoxDataSet *NewInstance() V.NewIterator() -> vtkCompositeDataIterator C++: vtkCompositeDataIterator *NewIterator() override; Return a new iterator (the iterator has to be deleted by user). V.GetData(vtkInformation) -> vtkHierarchicalBoxDataSet C++: static vtkHierarchicalBoxDataSet *GetData( vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkHierarchicalBoxDataSet C++: static vtkHierarchicalBoxDataSet *GetData( vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkUniformGridAMRvtkHyperTreevtkCommonDataModelPython.vtkHyperTreevtkHyperTree - An object structured as a tree where each node has exactly either 2^d or 3^d children. Superclass: vtkObject An hypertree is a dataset where each node has either exactly f^d children or no child at all if the node is a leaf, where f in {2,3} is the branching factor of the tree and d in {1,2,3} is the dimension of the dataset. Such trees have particular names when f=2: bintree (d=1), quadtree (d=2), and octree (d=2). When f=3, we respectively call them 3-tree, 9-tree, and 27-tree. The original octree class name came from the following paper: @ARTICLE{yau-srihari-1983, author={Mann-May Yau and Sargur N. Srihari}, title={A Hierarchical Data Structure for Multidimensional Digital Images}, journal={Communications of the ACM}, month={July}, year={1983}, volume={26}, number={7}, pages={504--515} } Each node is a cell. Attributes are associated with cells, not with points. The geometry is implicitly given by the size of the root node on each axis and position of the center and the orientation. (TODO: review center position and orientation). The geometry is then not limited to an hybercube but can have a rectangular shape. Attributes are associated with leaves. For LOD (Level-Of-Detail) purpose, attributes can be computed on none-leaf nodes by computing the average values from its children (which can be leaves or not). By construction, an hypertree is efficient in memory usage when the geometry is sparse. The LOD feature allows for quick culling of part of the dataset. This is an abstract class used as a superclass by a templated compact class. All methods are pure virtual. This is done to hide templates. @par Case with f=2: * d=3 case (octree) for each node, each child index (from 0 to 7) is encoded in the following orientation. It is easy to access each child as a cell of a grid. Note also that the binary representation is relevant, each bit code a side: bit 0 encodes -x side (0) or +x side (1) bit 1 encodes -y side (0) or +y side (1) bit 2 encodes -z side (0) or +z side (2) -z side is first, in counter-clockwise order: 0: -y -x sides 1: -y +x sides 2: +y -x sides 3: +y +x sides +y +-+-+ ^ |2|3| | +-+-+ O +z +-> +x |0|1| +-+-+ @par Case with f=2: +z side is last, in counter-clockwise order: 4: -y -x sides 5: -y +x sides 6: +y -x sides 7: +y +x sides +y +-+-+ ^ |6|7| | +-+-+ O +z +-> +x |4|5| +-+-+ @par Case with f=2: The cases with fewer dimensions are consistent with the octree case: @par Case with f=2: * d=2 case (quadtree): in counter-clockwise order: 0: -y -x edges 1: -y +x edges 2: +y -x edges 3: +y +x edges +y +-+-+ ^ |2|3| | +-+-+ O+-> +x |0|1| +-+-+ @par Case with f=2: * d=1 case (bintree): +0+1+ O+-> +x @warning It is not a spatial search object. If you are looking for this kind of octree see vtkCellLocator instead. @par Thanks: This class was written by Philippe Pebay, Joachim Pouderoux, and Charles Law, Kitware 2013 This class was modified by Guenole Harel and Jacques-Bernard Lekien 2014 This class was modified by Philippe Pebay, 2016 This work was supported by Commissariat a l'Energie Atomique (CEA/DIF) V.SafeDownCast(vtkObjectBase) -> vtkHyperTree C++: static vtkHyperTree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperTree C++: vtkHyperTree *NewInstance() V.Initialize() C++: virtual void Initialize() Restore the initial state: only one node and one leaf: the root. GetNumberOfLevelsV.GetNumberOfLevels() -> int C++: virtual vtkIdType GetNumberOfLevels() Return the number of levels. V.GetNumberOfVertices() -> int C++: virtual vtkIdType GetNumberOfVertices() Return the number of vertices in the tree. V.GetNumberOfNodes() -> int C++: virtual vtkIdType GetNumberOfNodes() Return the number of nodes (non-leaf vertices) in the tree. GetNumberOfLeavesV.GetNumberOfLeaves() -> int C++: virtual vtkIdType GetNumberOfLeaves() Return the number of leaf vertices in the tree. GetBranchFactorV.GetBranchFactor() -> int C++: virtual int GetBranchFactor() Return the branch factor of the tree. V.GetDimension() -> int C++: virtual int GetDimension() Return the dimension of the tree. GetNumberOfChildrenV.GetNumberOfChildren() -> int C++: virtual vtkIdType GetNumberOfChildren() Return the number of children per node of the tree. SetScaleV.SetScale([float, float, float]) C++: virtual void SetScale(double[3]) Set/Get scale of the tree in each direction. GetScaleV.GetScale([float, float, float]) C++: virtual void GetScale(double[3]) V.GetScale(int) -> float C++: virtual double GetScale(unsigned int) Set/Get scale of the tree in each direction. CreateInstanceV.CreateInstance(int, int) -> vtkHyperTree C++: static vtkHyperTree *CreateInstance( unsigned int branchFactor, unsigned int dimension) Return an instance of a templated hypertree for given branch factor and dimension. This is done to hide templates. FindParentIndexV.FindParentIndex(int) C++: virtual void FindParentIndex(vtkIdType &) Find the Index of the parent of a vertex in the hypertree. This is done to hide templates. FindChildParametersV.FindChildParameters(int, int, bool) C++: virtual void FindChildParameters(int, vtkIdType &, bool &) Find the Index, Parent Index and IsLeaf() parameters of the child of a node in the hypertree. This is done to hide templates. NewCursorV.NewCursor() -> vtkHyperTreeCursor C++: virtual vtkHyperTreeCursor *NewCursor() Return pointer to new instance of hyper tree cursor SubdivideLeafV.SubdivideLeaf(vtkHyperTreeCursor) C++: virtual void SubdivideLeaf(vtkHyperTreeCursor *leaf) Subdivide node pointed by cursor, only if its a leaf. At the end, cursor points on the node that used to be leaf. \pre leaf_exists: leaf!=0 \pre is_a_leaf: leaf->CurrentIsLeaf() V.GetActualMemorySize() -> int C++: virtual unsigned int GetActualMemorySize() Return memory used in kibibytes (1024 bytes). NB: Ignore the attribute array because its size is added by the data set. SetGlobalIndexStartV.SetGlobalIndexStart(int) C++: virtual void SetGlobalIndexStart(vtkIdType) Set the start global index for the current tree. The global index of a node will be this index + the node index. SetGlobalIndexFromLocalV.SetGlobalIndexFromLocal(int, int) C++: virtual void SetGlobalIndexFromLocal(vtkIdType local, vtkIdType global) Set the mapping between local & global Ids used by HyperTreeGrids. GetGlobalIndexFromLocalV.GetGlobalIndexFromLocal(int) -> int C++: virtual vtkIdType GetGlobalIndexFromLocal(vtkIdType local) Get the global id of a local node. Use the mapping function if available or the start global index. @P *d@IvtkHyperTreeCursorvtkCommonDataModelPython.vtkHyperTreeCursorvtkHyperTreeCursor - Objects for depth-first traversal HyperTrees. Superclass: vtkObject Objects that can perform depth-first traversal of HyperTrees. This is an abstract class. Cursors are created by the HyperTree implementation. @sa vtkObject vtkHyperTree vtkHyperTreeGrid @par Thanks: This class was written by Philippe Pebay, Joachim Pouderoux, and Charles Law, Kitware 2013 This class was modified by Guenole Harel and Jacques-Bernard Lekien 2014 This class was revised by Philippe Pebay, 2016 This work was supported by Commissariat a l'Energie Atomique (CEA/DIF) V.SafeDownCast(vtkObjectBase) -> vtkHyperTreeCursor C++: static vtkHyperTreeCursor *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperTreeCursor C++: vtkHyperTreeCursor *NewInstance() SetTreeV.SetTree(vtkHyperTree) C++: virtual void SetTree(vtkHyperTree *) Set the HyperTree to which the cursor is pointing. GetTreeV.GetTree() -> vtkHyperTree C++: virtual vtkHyperTree *GetTree() Return the HyperTree to which the cursor is pointing. GetVertexIdV.GetVertexId() -> int C++: virtual vtkIdType GetVertexId() Return the index of the current vertex in the tree. IsLeafV.IsLeaf() -> bool C++: virtual bool IsLeaf() Is the cursor pointing to a leaf? IsRootV.IsRoot() -> bool C++: virtual bool IsRoot() Is the cursor at tree root? GetLevelV.GetLevel() -> int C++: virtual unsigned int GetLevel() Return the level of the vertex pointed by the cursor. \post positive_result: result>=0 GetChildIndexV.GetChildIndex() -> int C++: virtual int GetChildIndex() Return the child number of the current vertex relative to its parent. \pre not_root: !IsRoot(). \post valid_range: result>=0 && result=0 && childGetNumberOfChildren() ToSameVertexV.ToSameVertex(vtkHyperTreeCursor) C++: virtual void ToSameVertex(vtkHyperTreeCursor *other) Move the cursor to the same vertex pointed by `other'. \pre other_exists: other!=0 \pre same_hypertree: this->SameTree(other); \post equal: this->IsEqual(other) IsEqualV.IsEqual(vtkHyperTreeCursor) -> bool C++: virtual bool IsEqual(vtkHyperTreeCursor *other) Is `this' equal to `other'? \pre other_exists: other!=0 \pre same_hypertree: this->SameTree(other); V.Clone() -> vtkHyperTreeCursor C++: virtual vtkHyperTreeCursor *Clone() Create a copy of `this'. \post results_exists:result!=0 \post same_tree: result->SameTree(this) SameTreeV.SameTree(vtkHyperTreeCursor) -> int C++: virtual int SameTree(vtkHyperTreeCursor *other) Are `this' and `other' pointing on the same hypertree? \pre other_exists: other!=0 V.GetNumberOfChildren() -> int C++: virtual int GetNumberOfChildren() Return the number of children for each node (non-vertex leaf) of the tree. \post positive_number: result>0 V.GetDimension() -> int C++: virtual int GetDimension() Return the dimension of the tree. \post positive_result: result>0 vtkHyperTreeGridvtkCommonDataModelPython.vtkHyperTreeGridvtkHyperTreeGrid - A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid. Superclass: vtkDataSet An hypertree grid is a dataset containing a rectilinear grid of root nodes, each of which can be refined as a vtkHyperTree grid. This organization of the root nodes allows for the definition of tree-based AMR grids that do not have uniform geometry. Some filters can be applied on this dataset: contour, outline, geometry. @warning It is not a spatial search object. If you are looking for this kind of octree see vtkCellLocator instead. Extent support is not finished yet. @sa vtkHyperTree vtkRectilinearGrid @par Thanks: This class was written by Philippe Pebay, Joachim Pouderoux, and Charles Law, Kitware 2013 This class was modified by Guenole Harel and Jacques-Bernard Lekien 2014 This class was rewritten by Philippe Pebay, 2016 This work was supported by Commissariat a l'Energie Atomique (CEA/DIF) LEVELSV.LEVELS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *LEVELS() DIMENSIONV.DIMENSION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DIMENSION() ORIENTATIONV.ORIENTATION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *ORIENTATION() SIZESV.SIZES() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *SIZES() V.SafeDownCast(vtkObjectBase) -> vtkHyperTreeGrid C++: static vtkHyperTreeGrid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperTreeGrid C++: vtkHyperTreeGrid *NewInstance() V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *) override; Copy the internal geometric and topological structure of a vtkHyperTreeGrid object. SetGridSizeV.SetGridSize([int, int, int]) C++: void SetGridSize(unsigned int[3]) V.SetGridSize(int, int, int) C++: void SetGridSize(unsigned int, unsigned int, unsigned int) Set/Get sizes of this rectilinear grid dataset GetGridSizeV.GetGridSize() -> (int, int, int) C++: unsigned int *GetGridSize() SetGridExtentV.SetGridExtent([int, int, int, int, int, int]) C++: void SetGridExtent(int extent[6]) V.SetGridExtent(int, int, int, int, int, int) C++: void SetGridExtent(int, int, int, int, int, int) Set/Get extent of this rectilinear grid dataset. SetTransposedRootIndexingV.SetTransposedRootIndexing(bool) C++: virtual void SetTransposedRootIndexing(bool _arg) Specify whether indexing mode of grid root cells must be transposed to x-axis first, z-axis last, instead of the default z-axis first, k-axis last GetTransposedRootIndexingV.GetTransposedRootIndexing() -> bool C++: virtual bool GetTransposedRootIndexing() Specify whether indexing mode of grid root cells must be transposed to x-axis first, z-axis last, instead of the default z-axis first, k-axis last SetIndexingModeToKJIV.SetIndexingModeToKJI() C++: void SetIndexingModeToKJI() Specify whether indexing mode of grid root cells must be transposed to x-axis first, z-axis last, instead of the default z-axis first, k-axis last SetIndexingModeToIJKV.SetIndexingModeToIJK() C++: void SetIndexingModeToIJK() Specify whether indexing mode of grid root cells must be transposed to x-axis first, z-axis last, instead of the default z-axis first, k-axis last SetDimensionV.SetDimension(int) C++: void SetDimension(unsigned int) Set/Get the dimensionality of the grid. V.GetDimension() -> int C++: virtual unsigned int GetDimension() Set/Get the dimensionality of the grid. SetOrientationV.SetOrientation(int) C++: virtual void SetOrientation(unsigned int) Set/Get the orientation of 1D or 2D grids: . in 1D: 0, 1, 2 = aligned along X, Y, Z axis . in 2D: 0, 1, 2 = normal to X, Y, Z axis NB: Not used in 3D GetOrientationV.GetOrientation() -> int C++: virtual unsigned int GetOrientation() Set/Get the orientation of 1D or 2D grids: . in 1D: 0, 1, 2 = aligned along X, Y, Z axis . in 2D: 0, 1, 2 = normal to X, Y, Z axis NB: Not used in 3D SetBranchFactorV.SetBranchFactor(int) C++: void SetBranchFactor(unsigned int) Set/Get the subdivision factor in the grid refinement scheme V.GetBranchFactor() -> int C++: virtual unsigned int GetBranchFactor() Set/Get the subdivision factor in the grid refinement scheme GetNumberOfTreesV.GetNumberOfTrees() -> int C++: vtkIdType GetNumberOfTrees() Return the number of trees in the level 0 grid. V.GetNumberOfVertices() -> int C++: vtkIdType GetNumberOfVertices() Get the number of vertices in the primal tree grid. V.GetNumberOfLeaves() -> int C++: vtkIdType GetNumberOfLeaves() Get the number of leaves in the primal tree grid. V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Return the number of cells in the dual grid. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Return the number of points in the dual grid. V.GetNumberOfLevels(int) -> int C++: vtkIdType GetNumberOfLevels(vtkIdType) V.GetNumberOfLevels() -> int C++: vtkIdType GetNumberOfLevels() Return the number of levels in an individual (primal) tree. SetXCoordinatesV.SetXCoordinates(vtkDataArray) C++: void SetXCoordinates(vtkDataArray *) Set/Get the grid coordinates in the x-direction. GetXCoordinatesV.GetXCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetXCoordinates() Set/Get the grid coordinates in the x-direction. SetYCoordinatesV.SetYCoordinates(vtkDataArray) C++: void SetYCoordinates(vtkDataArray *) Set/Get the grid coordinates in the y-direction. GetYCoordinatesV.GetYCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetYCoordinates() Set/Get the grid coordinates in the y-direction. SetZCoordinatesV.SetZCoordinates(vtkDataArray) C++: void SetZCoordinates(vtkDataArray *) Set/Get the grid coordinates in the z-direction. GetZCoordinatesV.GetZCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetZCoordinates() Set/Get the grid coordinates in the z-direction. SetMaterialMaskV.SetMaterialMask(vtkBitArray) C++: void SetMaterialMask(vtkBitArray *) Set/Get the blanking mask of primal leaf cells GetMaterialMaskV.GetMaterialMask() -> vtkBitArray C++: virtual vtkBitArray *GetMaterialMask() Set/Get the blanking mask of primal leaf cells HasMaterialMaskV.HasMaterialMask() -> bool C++: bool HasMaterialMask() Determine whether blanking mask is empty or not SetMaterialMaskIndexV.SetMaterialMaskIndex(vtkIdTypeArray) C++: virtual void SetMaterialMaskIndex(vtkIdTypeArray *) Set/Get the visibility mask of primal leaf cells GetMaterialMaskIndexV.GetMaterialMaskIndex() -> vtkIdTypeArray C++: virtual vtkIdTypeArray *GetMaterialMaskIndex() Set/Get the visibility mask of primal leaf cells SetHasInterfaceV.SetHasInterface(bool) C++: virtual void SetHasInterface(bool _arg) Set/Get presence or absence of interface GetHasInterfaceV.GetHasInterface() -> bool C++: virtual bool GetHasInterface() Set/Get presence or absence of interface HasInterfaceOnV.HasInterfaceOn() C++: virtual void HasInterfaceOn() Set/Get presence or absence of interface HasInterfaceOffV.HasInterfaceOff() C++: virtual void HasInterfaceOff() Set/Get presence or absence of interface SetInterfaceNormalsNameV.SetInterfaceNormalsName(string) C++: virtual void SetInterfaceNormalsName(const char *_arg) Set/Get names of interface normal vectors arrays GetInterfaceNormalsNameV.GetInterfaceNormalsName() -> string C++: virtual char *GetInterfaceNormalsName() Set/Get names of interface normal vectors arrays SetInterfaceInterceptsNameV.SetInterfaceInterceptsName(string) C++: virtual void SetInterfaceInterceptsName(const char *_arg) Set/Get names of interface intercepts arrays GetInterfaceInterceptsNameV.GetInterfaceInterceptsName() -> string C++: virtual char *GetInterfaceInterceptsName() Set/Get names of interface intercepts arrays GenerateTreesV.GenerateTrees() C++: virtual void GenerateTrees() This method must be called once the tree settings change. V.NewCursor(int, bool) -> vtkHyperTreeCursor C++: vtkHyperTreeCursor *NewCursor(vtkIdType, bool create=false) Create a new hyper tree cursor: an object that can traverse the cells of an individual hyper tree at given index. If no hyper tree is present at given location, then one will be created only if 'create' flag is true. NewGridCursorV.NewGridCursor(int, bool) -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *NewGridCursor(vtkIdType, bool create=false) Create a new hyper tree grid cursor: an object that can traverse the cells of an hyper tree grid, starting at given tree root index. If no hyper tree is present at given location, then one will be created only if 'create' flag is true. NewGeometricCursorV.NewGeometricCursor(int, bool) -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *NewGeometricCursor(vtkIdType, bool create=false) Create a new hyper tree grid geometric cursor: an object that can traverse the cells of an hyper tree grid, starting at given tree root index, managing the geometric properties. If no hyper tree is present at given location, then one will be created only if 'create' flag is true. NewVonNeumannSuperCursorV.NewVonNeumannSuperCursor(int, bool) -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *NewVonNeumannSuperCursor(vtkIdType, bool create=false) Create a new hyper tree grid Von Neumann super cursor: an object that can traverse the cells of an hyper tree grid, starting at given tree root index, managing geometric properties and von Neumann neighborhood with basic hyper tree grid cursors. If no hyper tree is present at given location, then one will be created only if 'create' flag is true. NewMooreSuperCursorV.NewMooreSuperCursor(int, bool) -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *NewMooreSuperCursor(vtkIdType, bool create=false) Create a new hyper tree grid Moore super cursor: an object that can traverse the cells of an hyper tree grid, starting at given tree root index, managing geometric properties and Moore neighborhood with basic hyper tree grid cursors. If no hyper tree is present at given location, then one will be created only if 'create' flag is true. V.SubdivideLeaf(vtkHyperTreeCursor, int) C++: void SubdivideLeaf(vtkHyperTreeCursor *, vtkIdType) Subdivide node pointed by cursor, only if its a leaf. At the end, cursor points on the node that used to be leaf. \pre leaf_exists: leaf!=0 \pre is_a_leaf: leaf->CurrentIsLeaf() V.GetPoint(int) -> (float, ...) C++: double *GetPoint(vtkIdType) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType, double[3]) override; This method should be avoided in favor of cell/point iterators. Random access to points requires that arrays are created explicitly. Get point coordinates with ptId such that: 0 <= ptId < NumberOfPoints. THIS METHOD IS NOT THREAD SAFE. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType) override; V.GetCell(int, int, int) -> vtkCell C++: vtkCell *GetCell(int i, int j, int k) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType, vtkGenericCell *) override; This method should be avoided in favor of cell/point iterators. Random access to cells requires that connectivity arrays are created explicitly. Get cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS NOT THREAD SAFE. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType) override; All cell types are 2: quadrilaters,3d: hexahedrons. They may be degenerate though. Get type of cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType, vtkIdList *) override; V.GetCellPoints(int, int, [int, ...]) C++: void GetCellPoints(vtkIdType, vtkIdType &, vtkIdType *&) This method should be avoided in favor of cell/point iterators. Random access to cells requires that connectivity arrays are created explicitly. Topological inquiry to get points defining cell. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType, vtkIdList *) override; This method should be avoided in favor of cell/point iterators. Random access to cells requires that connectivity arrays are created explicitly. Topological inquiry to get cells using point. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType, vtkIdList *, vtkIdList *) override; This method should be avoided in favor of cell/point iterators. Random access to cells requires that connectivity arrays are created explicitly. Topological inquiry to get all cells using list of points exclusive of cell specified (e.g., cellId). Note that the list consists of only cells that use ALL the points provided. This is exactly the same as GetCellNeighbors in unstructured grid. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; Find cell to which this point belongs, or at least closest one, even if the point is outside the grid. Since dual points are leaves, use the structure of the Tree instead of a point locator. V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; Locate cell based on global coordinate x and tolerance squared. If cell and cellId is non-nullptr, then search starts from this cell and looks at immediate neighbors. Returns cellId >= 0 if inside, < 0 otherwise. The parametric coordinates are provided in pcoords[3]. The interpolation weights are returned in weights[]. (The number of weights is equal to the number of points in the found cell). Tolerance is used to control how close the point is to be considered "in" the cell. NB: There is actually no need for a starting cell, just use the point, as the tree structure is efficient enough. THIS METHOD IS NOT THREAD SAFE. V.Initialize() C++: void Initialize() override; Restore data object to initial state. V.GetTree(int) -> vtkHyperTree C++: vtkHyperTree *GetTree(vtkIdType) Return tree located at given index of hyper tree grid NB: This will return nullptr if grid slot is empty. V.SetTree(int, vtkHyperTree) C++: void SetTree(vtkIdType, vtkHyperTree *) Assign given tree to given index of hyper tree grid NB: This will create a new slot in the grid if needed. V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Convenience method to return largest cell size in dataset. Generally used to allocate memory for supporting data structures. This is the number of points of a cell. THIS METHOD IS THREAD SAFE V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *) override; Create shallow copy of hyper tree grid. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *) override; Create deep copy of hyper tree grid. V.GetExtentType() -> int C++: int GetExtentType() override; Structured extent. The extent type is a 3D extent. V.GetNumberOfChildren() -> int C++: virtual unsigned int GetNumberOfChildren() The number of children each node can have. RecursivelyInitializePureMaterialMaskV.RecursivelyInitializePureMaterialMask(vtkHyperTreeGridCursor) -> bool C++: bool RecursivelyInitializePureMaterialMask( vtkHyperTreeGridCursor *cursor) Recursively initialize pure material mask GetPureMaterialMaskV.GetPureMaterialMask() -> vtkBitArray C++: vtkBitArray *GetPureMaterialMask() Get or create pure material mask GetChildMaskV.GetChildMask(int) -> int C++: unsigned int GetChildMask(unsigned int) Return hard-coded bitcode correspondng to child mask Dimension 1: Factor 2: 0: 100, 1: 001 Factor 3: 0: 100, 1: 010, 2: 001 Dimension 2: Factor 2: 0: 1101 0000 0, 1: 0110 0100 0 2: 0001 0011 0, 3: 0000 0101 1 Factor 3: 0: 1101 0000 0, 1: 0100 0000 0, 2: 0110 0100 0 3: 0001 0000 0, 4: 0000 1000 0, 5: 0000 0100 0 6: 0001 0011 0, 7: 0000 0001 0, 8: 0000 0101 1 Dimension 3: Factor 2: 0: 1101 1000 0110 1000 0000 0000 000, 1: 0110 1100 0011 0010 0000 0000 000 2: 0001 1011 0000 1001 1000 0000 000, 3: 0000 1101 1000 0010 1100 0000 000 4: 0000 0000 0110 1000 0011 0110 000, 5: 0000 0000 0011 0010 0001 1011 000 6: 0000 0000 0000 1001 1000 0110 110, 7: 0000 0000 0000 0010 1100 0011 011 Factor 3: 0: 1101 1000 0110 1000 0000 0000 000 1: 0100 1000 0010 0000 0000 0000 000 2: 0110 1100 0011 0010 0000 0000 000 3: 0001 1000 0000 1000 0000 0000 000 4: 0000 1000 0000 0000 0000 0000 000 5: 0000 1100 0000 0010 0000 0000 000 6: 0001 1011 0000 1001 1000 0000 000 7: 0000 1001 0000 0000 1000 0000 000 8: 0000 1101 1000 0010 1100 0000 000 9: 0000 0000 0110 1000 0000 0000 000 10: 0000 0000 0010 0000 0000 0000 000 11: 0000 0000 0011 0010 0000 0000 000 12: 0000 0000 0000 1000 0000 0000 000 13: 0000 0000 0000 0100 0000 0000 000 14: 0000 0000 0000 0010 0000 0000 000 15: 0000 0000 0000 1001 1000 0000 000 16: 0000 0000 0000 0000 1000 0000 000 17: 0000 0000 0000 0010 1100 0000 000 18: 0000 0000 0110 1000 0011 0110 000 19: 0000 0000 0010 0000 0001 0010 000 20: 0000 0000 0011 0010 0001 1011 000 21: 0000 0000 0000 1000 0000 0110 000 22: 0000 0000 0000 0000 0000 0010 000 23: 0000 0000 0000 0010 0000 0011 000 24: 0000 0000 0000 1001 1000 0110 110 25: 0000 0000 0000 0000 1000 0010 010 26: 0000 0000 0000 0010 1100 0011 011 GetLevelZeroCoordinatesFromIndexV.GetLevelZeroCoordinatesFromIndex(int, int, int, int) C++: void GetLevelZeroCoordinatesFromIndex(vtkIdType, unsigned int &, unsigned int &, unsigned int &) Convert the global index of a root to its Cartesian coordinates in the grid. GetIndexFromLevelZeroCoordinatesV.GetIndexFromLevelZeroCoordinates(int, int, int, int) C++: void GetIndexFromLevelZeroCoordinates(vtkIdType &, unsigned int, unsigned int, unsigned int) Convert the Cartesian coordinates of a root in the grid to its global index. GetShiftedLevelZeroIndexV.GetShiftedLevelZeroIndex(int, int, int, int) -> int C++: unsigned int GetShiftedLevelZeroIndex(vtkIdType, int, int, int) Return the root index of a root cell with given index displaced. by a Cartesian vector in the grid. NB: No boundary checks are performed. V.GetData(vtkInformation) -> vtkHyperTreeGrid C++: static vtkHyperTreeGrid *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkHyperTreeGrid C++: static vtkHyperTreeGrid *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object vtkBitArrayvtkHyperTreeGridCursorvtkCommonDataModelPython.vtkHyperTreeGridCursorvtkHyperTreeGridCursor - Objects for depth-first traversal HyperTreeGrids. Superclass: vtkHyperTreeCursor Objects that can perform depth-first traversal of hyper tree grids, take into account more parameters (related to the grid structure) than the compact hyper tree cursor implemented in vtkHyperTree can. This is an abstract class. Cursors are created by the HyperTreeGrid implementation. @sa vtkHyperTreeCursor vtkHyperTree vtkHyperTreeGrid @par Thanks: This class was written by Guénolé Harel and Jacques-Bernard Lekien, 2014 This class was re-written by Philippe Pebay, 2016 This work was supported by Commissariat a l'Energie Atomique (CEA/DIF) V.SafeDownCast(vtkObjectBase) -> vtkHyperTreeGridCursor C++: static vtkHyperTreeGridCursor *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *NewInstance() V.Clone() -> vtkHyperTreeGridCursor C++: vtkHyperTreeGridCursor *Clone() override; Create a copy of `this'. \post results_exists:result!=0 V.Initialize(vtkHyperTreeGrid, int) C++: virtual void Initialize(vtkHyperTreeGrid *, vtkIdType) Initialize cursor at root of given tree index in grid. SetGridV.SetGrid(vtkHyperTreeGrid) C++: virtual void SetGrid(vtkHyperTreeGrid *) Set the hyper tree grid to which the cursor is pointing. GetGridV.GetGrid() -> vtkHyperTreeGrid C++: virtual vtkHyperTreeGrid *GetGrid() Set the hyper tree grid to which the cursor is pointing. V.SetTree(vtkHyperTree) C++: void SetTree(vtkHyperTree *) override; Set the hyper tree to which the cursor is pointing. V.GetTree() -> vtkHyperTree C++: vtkHyperTree *GetTree() override; Set the hyper tree to which the cursor is pointing. V.GetVertexId() -> int C++: vtkIdType GetVertexId() override; Return the index of the current vertex in the tree. GetGlobalNodeIndexV.GetGlobalNodeIndex() -> int C++: virtual vtkIdType GetGlobalNodeIndex() Return the global index (relative to the grid) of the current vertex in the tree. V.IsLeaf() -> bool C++: bool IsLeaf() override; Is the cursor pointing to a leaf? V.IsRoot() -> bool C++: bool IsRoot() override; Is the cursor at tree root? V.GetLevel() -> int C++: unsigned int GetLevel() override; Get the level of the tree vertex pointed by the cursor. V.GetChildIndex() -> int C++: int GetChildIndex() override; Return the child number of the current vertex relative to its parent. \pre not_root: !IsRoot(). \post valid_range: result>=0 && result=0 && childGetNumberOfChildren() V.ToSameVertex(vtkHyperTreeCursor) C++: void ToSameVertex(vtkHyperTreeCursor *other) override; Move the cursor to the same vertex pointed by `other'. \pre other_exists: other!=0 \pre same_hypertree: this->SameTree(other); \post equal: this->IsEqual(other) NB: not implemented V.IsEqual(vtkHyperTreeCursor) -> bool C++: bool IsEqual(vtkHyperTreeCursor *other) override; Is `this' equal to `other'? \pre other_exists: other!=0 \pre same_hypertree: this->SameTree(other); NB: not implemented V.SameTree(vtkHyperTreeCursor) -> int C++: int SameTree(vtkHyperTreeCursor *other) override; Are `this' and `other' pointing on the same hypertree? \pre other_exists: other!=0 NB: not implemented V.GetNumberOfChildren() -> int C++: int GetNumberOfChildren() override; Return the number of children for each node (non-vertex leaf) of the tree. \post positive_number: result>0 V.GetDimension() -> int C++: int GetDimension() override; Return the dimension of the tree. \post positive_result: result>0 GetOriginV.GetOrigin() -> (float, ...) C++: virtual double *GetOrigin() Compute the origin of the cursor. NB: The basic hyper tree grid cursor does not have an origin. V.GetSize() -> (float, ...) C++: virtual double *GetSize() Compute the size of the cursor. NB: The basic hyper tree grid cursor does not have a size. V.GetBounds([float, float, float, float, float, float]) C++: virtual void GetBounds(double pt[6]) Compute the bounds of the cursor. NB: The basic hyper tree grid cursor does not have bounds. V.GetPoint([float, float, float]) C++: virtual void GetPoint(double pt[3]) Compute the center coordinates of the cursor. NB: The basic hyper tree grid cursor is always centered at 0. GetNumberOfCursorsV.GetNumberOfCursors() -> int C++: virtual unsigned int GetNumberOfCursors() Return the number of neighborhood cursors The neighborhood definition depends on the type of cursor. NB: Only super cursors keep track of neighborhoods. GetCursorV.GetCursor(int) -> vtkHyperTreeGridCursor C++: virtual vtkHyperTreeGridCursor *GetCursor(unsigned int) Return the cursor pointing into i-th neighbor. The neighborhood definition depends on the type of cursor. NB: Only super cursors keep track of neighborhoods. GetCornerCursorsV.GetCornerCursors(int, int, vtkIdList) -> bool C++: virtual bool GetCornerCursors(unsigned int, unsigned int, vtkIdList *) Return the list of cursors pointing to the leaves touching a given corner of the cell. Return whether the considered cell is the owner of said corner. NB: Only the Moore super cursor implements this functionality. vtkImageDatavtkCommonDataModelPython.vtkImageDatavtkImageData - topologically and geometrically regular array of data Superclass: vtkDataSet vtkImageData is a data object that is a concrete implementation of vtkDataSet. vtkImageData represents a geometric structure that is a topological and geometrical regular array of points. Examples include volumes (voxel data) and pixmaps. V.SafeDownCast(vtkObjectBase) -> vtkImageData C++: static vtkImageData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImageData C++: vtkImageData *NewInstance() V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Copy the geometric and topological structure of an input image data object. V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType id, double x[3]) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, int, int) -> vtkCell C++: vtkCell *GetCell(int i, int j, int k) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCellBounds(int, [float, float, float, float, float, float]) C++: void GetCellBounds(vtkIdType cellId, double bounds[6]) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.FindPoint(float, float, float) -> int C++: virtual vtkIdType FindPoint(double x, double y, double z) V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.FindAndGetCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> vtkCell C++: vtkCell *FindAndGetCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType cellId) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.ComputeBounds() C++: void ComputeBounds() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.SetDimensions(int, int, int) C++: virtual void SetDimensions(int i, int j, int k) V.SetDimensions((int, int, int)) C++: virtual void SetDimensions(const int dims[3]) Same as SetExtent(0, i-1, 0, j-1, 0, k-1) V.GetDimensions() -> (int, int, int) C++: virtual int *GetDimensions() V.GetDimensions([int, int, int]) C++: virtual void GetDimensions(int dims[3]) Get dimensions of this structured points dataset. It is the number of points on each axis. Dimensions are computed from Extents during this call. \warning Non thread-safe, use second signature if you want it to be. V.ComputeStructuredCoordinates((float, float, float), [int, int, int], [float, float, float]) -> int C++: virtual int ComputeStructuredCoordinates(const double x[3], int ijk[3], double pcoords[3]) V.ComputeStructuredCoordinates((float, float, float), [int, int, int], [float, float, float], (int, ...), (float, ...), (float, ...), (float, ...)) -> int C++: static int ComputeStructuredCoordinates(const double x[3], int ijk[3], double pcoords[3], const int *extent, const double *spacing, const double *origin, const double *bounds) Convenience function computes the structured coordinates for a point x[3]. The voxel is specified by the array ijk[3], and the parametric coordinates in the cell are specified with pcoords[3]. The function returns a 0 if the point x is outside of the volume, and a 1 if inside the volume. GetVoxelGradientV.GetVoxelGradient(int, int, int, vtkDataArray, vtkDataArray) C++: virtual void GetVoxelGradient(int i, int j, int k, vtkDataArray *s, vtkDataArray *g) Given structured coordinates (i,j,k) for a voxel cell, compute the eight gradient values for the voxel corners. The order in which the gradient vectors are arranged corresponds to the ordering of the voxel points. Gradient vector is computed by central differences (except on edges of volume where forward difference is used). The scalars s are the scalars from which the gradient is to be computed. This method will treat only 3D structured point datasets (i.e., volumes). GetPointGradientV.GetPointGradient(int, int, int, vtkDataArray, [float, float, float]) C++: virtual void GetPointGradient(int i, int j, int k, vtkDataArray *s, double g[3]) Given structured coordinates (i,j,k) for a point in a structured point dataset, compute the gradient vector from the scalar data at that point. The scalars s are the scalars from which the gradient is to be computed. This method will treat structured point datasets of any dimension. GetDataDimensionV.GetDataDimension() -> int C++: virtual int GetDataDimension() Return the dimensionality of the data. ComputePointIdV.ComputePointId([int, int, int]) -> int C++: virtual vtkIdType ComputePointId(int ijk[3]) Given a location in structured coordinates (i-j-k), return the point id. ComputeCellIdV.ComputeCellId([int, int, int]) -> int C++: virtual vtkIdType ComputeCellId(int ijk[3]) Given a location in structured coordinates (i-j-k), return the cell id. SetAxisUpdateExtentV.SetAxisUpdateExtent(int, int, int, (int, ...), [int, ...]) C++: virtual void SetAxisUpdateExtent(int axis, int min, int max, const int *updateExtent, int *axisUpdateExtent) Set / Get the extent on just one axis GetAxisUpdateExtentV.GetAxisUpdateExtent(int, int, int, (int, ...)) C++: virtual void GetAxisUpdateExtent(int axis, int &min, int &max, const int *updateExtent) Set / Get the extent on just one axis SetExtentV.SetExtent([int, int, int, int, int, int]) C++: virtual void SetExtent(int extent[6]) V.SetExtent(int, int, int, int, int, int) C++: virtual void SetExtent(int x1, int x2, int y1, int y2, int z1, int z2) Set/Get the extent. On each axis, the extent is defined by the index of the first point and the index of the last point. The extent should be set before the "Scalars" are set or allocated. The Extent is stored in the order (X, Y, Z). The dataset extent does not have to start at (0,0,0). (0,0,0) is just the extent of the origin. The first point (the one with Id=0) is at extent (Extent[0],Extent[2],Extent[4]). As for any dataset, a data array on point data starts at Id=0. GetExtentV.GetExtent() -> (int, int, int, int, int, int) C++: int *GetExtent() GetScalarTypeMinV.GetScalarTypeMin(vtkInformation) -> float C++: virtual double GetScalarTypeMin(vtkInformation *meta_data) V.GetScalarTypeMin() -> float C++: virtual double GetScalarTypeMin() These returns the minimum and maximum values the ScalarType can hold without overflowing. GetScalarTypeMaxV.GetScalarTypeMax(vtkInformation) -> float C++: virtual double GetScalarTypeMax(vtkInformation *meta_data) V.GetScalarTypeMax() -> float C++: virtual double GetScalarTypeMax() These returns the minimum and maximum values the ScalarType can hold without overflowing. GetScalarSizeV.GetScalarSize(vtkInformation) -> int C++: virtual int GetScalarSize(vtkInformation *meta_data) V.GetScalarSize() -> int C++: virtual int GetScalarSize() Get the size of the scalar type in bytes. GetIncrementsV.GetIncrements() -> (int, int, int) C++: virtual vtkIdType *GetIncrements() V.GetIncrements(int, int, int) C++: virtual void GetIncrements(vtkIdType &incX, vtkIdType &incY, vtkIdType &incZ) V.GetIncrements([int, int, int]) C++: virtual void GetIncrements(vtkIdType inc[3]) V.GetIncrements(vtkDataArray) -> (int, int, int) C++: virtual vtkIdType *GetIncrements(vtkDataArray *scalars) V.GetIncrements(vtkDataArray, int, int, int) C++: virtual void GetIncrements(vtkDataArray *scalars, vtkIdType &incX, vtkIdType &incY, vtkIdType &incZ) V.GetIncrements(vtkDataArray, [int, int, int]) C++: virtual void GetIncrements(vtkDataArray *scalars, vtkIdType inc[3]) Different ways to get the increments for moving around the data. GetIncrements() calls ComputeIncrements() to ensure the increments are up to date. The first three methods compute the increments based on the active scalar field while the next three, the scalar field is passed in. GetContinuousIncrementsV.GetContinuousIncrements([int, int, int, int, int, int], int, int, int) C++: virtual void GetContinuousIncrements(int extent[6], vtkIdType &incX, vtkIdType &incY, vtkIdType &incZ) V.GetContinuousIncrements(vtkDataArray, [int, int, int, int, int, int], int, int, int) C++: virtual void GetContinuousIncrements(vtkDataArray *scalars, int extent[6], vtkIdType &incX, vtkIdType &incY, vtkIdType &incZ) Different ways to get the increments for moving around the data. incX is always returned with 0. incY is returned with the increment needed to move from the end of one X scanline of data to the start of the next line. incZ is filled in with the increment needed to move from the end of one image to the start of the next. The proper way to use these values is to for a loop over Z, Y, X, C, incrementing the pointer by 1 after each component. When the end of the component is reached, the pointer is set to the beginning of the next pixel, thus incX is properly set to 0. The first form of GetContinuousIncrements uses the active scalar field while the second form allows the scalar array to be passed in. GetScalarPointerForExtentV.GetScalarPointerForExtent([int, int, int, int, int, int]) -> void C++: virtual void *GetScalarPointerForExtent(int extent[6]) Access the native pointer for the scalar data GetScalarPointerV.GetScalarPointer([int, int, int]) -> void C++: virtual void *GetScalarPointer(int coordinates[3]) V.GetScalarPointer(int, int, int) -> void C++: virtual void *GetScalarPointer(int x, int y, int z) V.GetScalarPointer() -> void C++: virtual void *GetScalarPointer() Access the native pointer for the scalar data GetScalarComponentAsFloatV.GetScalarComponentAsFloat(int, int, int, int) -> float C++: virtual float GetScalarComponentAsFloat(int x, int y, int z, int component) For access to data from tcl SetScalarComponentFromFloatV.SetScalarComponentFromFloat(int, int, int, int, float) C++: virtual void SetScalarComponentFromFloat(int x, int y, int z, int component, float v) For access to data from tcl GetScalarComponentAsDoubleV.GetScalarComponentAsDouble(int, int, int, int) -> float C++: virtual double GetScalarComponentAsDouble(int x, int y, int z, int component) For access to data from tcl SetScalarComponentFromDoubleV.SetScalarComponentFromDouble(int, int, int, int, float) C++: virtual void SetScalarComponentFromDouble(int x, int y, int z, int component, double v) For access to data from tcl AllocateScalarsV.AllocateScalars(int, int) C++: virtual void AllocateScalars(int dataType, int numComponents) V.AllocateScalars(vtkInformation) C++: virtual void AllocateScalars(vtkInformation *pipeline_info) Allocate the point scalars for this dataset. The data type determines the type of the array (VTK_FLOAT, VTK_INT etc.) where as numComponents determines its number of components. CopyAndCastFromV.CopyAndCastFrom(vtkImageData, [int, int, int, int, int, int]) C++: virtual void CopyAndCastFrom(vtkImageData *inData, int extent[6]) V.CopyAndCastFrom(vtkImageData, int, int, int, int, int, int) C++: virtual void CopyAndCastFrom(vtkImageData *inData, int x0, int x1, int y0, int y1, int z0, int z1) This method is passed a input and output region, and executes the filter algorithm to fill the output from the input. It just executes a switch statement to call the correct function for the regions data types. V.Crop((int, ...)) C++: void Crop(const int *updateExtent) override; Reallocates and copies to set the Extent to updateExtent. This is used internally when the exact extent is requested, and the source generated more than the update extent. SetSpacingV.SetSpacing(float, float, float) C++: void SetSpacing(double, double, double) V.SetSpacing((float, float, float)) C++: void SetSpacing(double a[3]) GetSpacingV.GetSpacing() -> (float, float, float) C++: double *GetSpacing() SetOriginV.SetOrigin(float, float, float) C++: void SetOrigin(double, double, double) V.SetOrigin((float, float, float)) C++: void SetOrigin(double a[3]) V.GetOrigin() -> (float, float, float) C++: double *GetOrigin() SetScalarTypeV.SetScalarType(int, vtkInformation) C++: static void SetScalarType(int, vtkInformation *meta_data) GetScalarTypeV.GetScalarType(vtkInformation) -> int C++: static int GetScalarType(vtkInformation *meta_data) V.GetScalarType() -> int C++: int GetScalarType() HasScalarTypeV.HasScalarType(vtkInformation) -> bool C++: static bool HasScalarType(vtkInformation *meta_data) GetScalarTypeAsStringV.GetScalarTypeAsString() -> string C++: const char *GetScalarTypeAsString() SetNumberOfScalarComponentsV.SetNumberOfScalarComponents(int, vtkInformation) C++: static void SetNumberOfScalarComponents(int n, vtkInformation *meta_data) Set/Get the number of scalar components for points. As with the SetScalarType method this is setting pipeline info. GetNumberOfScalarComponentsV.GetNumberOfScalarComponents(vtkInformation) -> int C++: static int GetNumberOfScalarComponents( vtkInformation *meta_data) V.GetNumberOfScalarComponents() -> int C++: int GetNumberOfScalarComponents() Set/Get the number of scalar components for points. As with the SetScalarType method this is setting pipeline info. HasNumberOfScalarComponentsV.HasNumberOfScalarComponents(vtkInformation) -> bool C++: static bool HasNumberOfScalarComponents( vtkInformation *meta_data) Set/Get the number of scalar components for points. As with the SetScalarType method this is setting pipeline info. V.CopyInformationFromPipeline(vtkInformation) C++: void CopyInformationFromPipeline(vtkInformation *information) override; Override these to handle origin, spacing, scalar type, and scalar number of components. See vtkDataObject for details. V.CopyInformationToPipeline(vtkInformation) C++: void CopyInformationToPipeline(vtkInformation *information) override; Copy information from this data object to the pipeline information. This is used by the vtkTrivialProducer that is created when someone calls SetInputData() to connect the image to a pipeline. V.PrepareForNewData() C++: void PrepareForNewData() override; make the output data ready for new data to be inserted. For most objects we just call Initialize. But for image data we leave the old data in case the memory can be reused. GetArrayPointerForExtentV.GetArrayPointerForExtent(vtkDataArray, [int, int, int, int, int, int]) -> void C++: void *GetArrayPointerForExtent(vtkDataArray *array, int extent[6]) These are convenience methods for getting a pointer from any filed array. It is a start at expanding image filters to process any array (not just scalars). GetArrayPointerV.GetArrayPointer(vtkDataArray, [int, int, int]) -> void C++: void *GetArrayPointer(vtkDataArray *array, int coordinates[3]) These are convenience methods for getting a pointer from any filed array. It is a start at expanding image filters to process any array (not just scalars). GetArrayIncrementsV.GetArrayIncrements(vtkDataArray, [int, int, int]) C++: void GetArrayIncrements(vtkDataArray *array, vtkIdType increments[3]) Since various arrays have different number of components, the will have different increments. ComputeInternalExtentV.ComputeInternalExtent([int, ...], [int, ...], [int, ...]) C++: void ComputeInternalExtent(int *intExt, int *tgtExt, int *bnds) Given how many pixel are required on a side for bounrary conditions (in bnds), the target extent to traverse, compute the internal extent (the extent for this ImageData that does not suffer from any boundary conditions) and place it in intExt V.GetExtentType() -> int C++: int GetExtentType() override; The extent type is a 3D extent V.GetData(vtkInformation) -> vtkImageData C++: static vtkImageData *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkImageData C++: static vtkImageData *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. @P *k@V *vtkDataArrayvoidbitcharsigned charunsigned charshortunsigned shortintunsigned intlongunsigned longlong longunsigned long long__int64unsigned __int64floatdoubleidtypestringunicode stringvariantobjectUndefinedvtkImplicitBooleanOperationTypeVTK_UNIONVTK_INTERSECTIONVTK_DIFFERENCEVTK_UNION_OF_MAGNITUDESvtkCommonDataModelPython.vtkImplicitBoolean.OperationTypevtkCommonDataModelPython.vtkImplicitBooleanvtkImplicitBoolean - implicit function consisting of boolean combinations of implicit functions Superclass: vtkImplicitFunction vtkImplicitBoolean is an implicit function consisting of boolean combinations of implicit functions. The class has a list of functions (FunctionList) that are combined according to a specified operator (VTK_UNION or VTK_INTERSECTION or VTK_DIFFERENCE). You can use nested combinations of vtkImplicitFunction's (and/or vtkImplicitBoolean) to create elaborate implicit functions. vtkImplicitBoolean is a concrete implementation of vtkImplicitFunction. The operators work as follows. The VTK_UNION operator takes the minimum value of all implicit functions. The VTK_INTERSECTION operator takes the maximum value of all implicit functions. The VTK_DIFFERENCE operator subtracts the 2nd through last implicit functions from the first. The VTK_UNION_OF_MAGNITUDES takes the minimum absolute value of the implicit functions. V.SafeDownCast(vtkObjectBase) -> vtkImplicitBoolean C++: static vtkImplicitBoolean *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitBoolean C++: vtkImplicitBoolean *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate boolean combinations of implicit function using current operator. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate gradient of boolean combination. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Override modified time retrieval because of object dependencies. AddFunctionV.AddFunction(vtkImplicitFunction) C++: void AddFunction(vtkImplicitFunction *in) Add another implicit function to the list of functions. RemoveFunctionV.RemoveFunction(vtkImplicitFunction) C++: void RemoveFunction(vtkImplicitFunction *in) Remove a function from the list of implicit functions to boolean. GetFunctionV.GetFunction() -> vtkImplicitFunctionCollection C++: vtkImplicitFunctionCollection *GetFunction() Return the collection of implicit functions. SetOperationTypeV.SetOperationType(int) C++: virtual void SetOperationType(int _arg) Specify the type of boolean operation. GetOperationTypeMinValueV.GetOperationTypeMinValue() -> int C++: virtual int GetOperationTypeMinValue() Specify the type of boolean operation. GetOperationTypeMaxValueV.GetOperationTypeMaxValue() -> int C++: virtual int GetOperationTypeMaxValue() Specify the type of boolean operation. GetOperationTypeV.GetOperationType() -> int C++: virtual int GetOperationType() Specify the type of boolean operation. SetOperationTypeToUnionV.SetOperationTypeToUnion() C++: void SetOperationTypeToUnion() Specify the type of boolean operation. SetOperationTypeToIntersectionV.SetOperationTypeToIntersection() C++: void SetOperationTypeToIntersection() Specify the type of boolean operation. SetOperationTypeToDifferenceV.SetOperationTypeToDifference() C++: void SetOperationTypeToDifference() Specify the type of boolean operation. SetOperationTypeToUnionOfMagnitudesV.SetOperationTypeToUnionOfMagnitudes() C++: void SetOperationTypeToUnionOfMagnitudes() Specify the type of boolean operation. GetOperationTypeAsStringV.GetOperationTypeAsString() -> string C++: const char *GetOperationTypeAsString() Specify the type of boolean operation. UnionIntersectionDifferenceUnionOfMagnitudesvtkImplicitDataSetvtkCommonDataModelPython.vtkImplicitDataSetvtkImplicitDataSet - treat a dataset as if it were an implicit function Superclass: vtkImplicitFunction vtkImplicitDataSet treats any type of dataset as if it were an implicit function. This means it computes a function value and gradient. vtkImplicitDataSet is a concrete implementation of vtkImplicitFunction. vtkImplicitDataSet computes the function (at the point x) by performing cell interpolation. That is, it finds the cell containing x, and then uses the cell's interpolation functions to compute an interpolated scalar value at x. (A similar approach is used to find the gradient, if requested.) Points outside of the dataset are assigned the value of the ivar OutValue, and the gradient value OutGradient. @warning Any type of dataset can be used as an implicit function as long as it has scalar data associated with it. @sa vtkImplicitFunction vtkImplicitVolume vtkClipPolyData vtkCutter vtkImplicitWindowFunction V.SafeDownCast(vtkObjectBase) -> vtkImplicitDataSet C++: static vtkImplicitDataSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitDataSet C++: vtkImplicitDataSet *NewInstance() V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Return the MTime also considering the DataSet dependency. V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate the implicit function. This returns the interpolated scalar value at x[3]. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate implicit function gradient. V.SetDataSet(vtkDataSet) C++: virtual void SetDataSet(vtkDataSet *) Set / get the dataset used for the implicit function evaluation. V.GetDataSet() -> vtkDataSet C++: virtual vtkDataSet *GetDataSet() Set / get the dataset used for the implicit function evaluation. SetOutValueV.SetOutValue(float) C++: virtual void SetOutValue(double _arg) Set / get the function value to use for points outside of the dataset. GetOutValueV.GetOutValue() -> float C++: virtual double GetOutValue() Set / get the function value to use for points outside of the dataset. SetOutGradientV.SetOutGradient(float, float, float) C++: void SetOutGradient(double, double, double) V.SetOutGradient((float, float, float)) C++: void SetOutGradient(double a[3]) GetOutGradientV.GetOutGradient() -> (float, float, float) C++: double *GetOutGradient() vtkImplicitFunctionCollectionvtkCommonDataModelPython.vtkImplicitFunctionCollectionvtkImplicitFunctionCollection - maintain a list of implicit functions Superclass: vtkCollection vtkImplicitFunctionCollection is an object that creates and manipulates lists of objects of type vtkImplicitFunction. @sa vtkCollection vtkPlaneCollection V.SafeDownCast(vtkObjectBase) -> vtkImplicitFunctionCollection C++: static vtkImplicitFunctionCollection *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkImplicitFunctionCollection C++: vtkImplicitFunctionCollection *NewInstance() V.AddItem(vtkImplicitFunction) C++: void AddItem(vtkImplicitFunction *) Add an implicit function to the list. V.GetNextItem() -> vtkImplicitFunction C++: vtkImplicitFunction *GetNextItem() Get the next implicit function in the list. vtkCommonDataModelPython.vtkImplicitFunctionvtkImplicitFunction - abstract interface for implicit functions Superclass: vtkObject vtkImplicitFunction specifies an abstract interface for implicit functions. Implicit functions are real valued functions defined in 3D space, w = F(x,y,z). Two primitive operations are required: the ability to evaluate the function, and the function gradient at a given point. The implicit function divides space into three regions: on the surface (F(x,y,z)=w), outside of the surface (F(x,y,z)>c), and inside the surface (F(x,y,z) vtkImplicitFunction C++: static vtkImplicitFunction *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitFunction C++: vtkImplicitFunction *NewInstance() V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Overload standard modified time function. If Transform is modified, then this object is modified as well. FunctionValueV.FunctionValue(vtkDataArray, vtkDataArray) C++: virtual void FunctionValue(vtkDataArray *input, vtkDataArray *output) V.FunctionValue((float, float, float)) -> float C++: double FunctionValue(const double x[3]) V.FunctionValue(float, float, float) -> float C++: double FunctionValue(double x, double y, double z) Evaluate function at position x-y-z and return value. Point x[3] is transformed through transform (if provided). FunctionGradientV.FunctionGradient((float, float, float), [float, float, float]) C++: void FunctionGradient(const double x[3], double g[3]) V.FunctionGradient((float, float, float)) -> (float, float, float) C++: double *FunctionGradient(const double x[3]) V.FunctionGradient(float, float, float) -> (float, float, float) C++: double *FunctionGradient(double x, double y, double z) Evaluate function gradient at position x-y-z and pass back vector. Point x[3] is transformed through transform (if provided). SetTransformV.SetTransform(vtkAbstractTransform) C++: virtual void SetTransform(vtkAbstractTransform *) V.SetTransform((float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float) ) C++: virtual void SetTransform(const double elements[16]) Set/Get a transformation to apply to input points before executing the implicit function. GetTransformV.GetTransform() -> vtkAbstractTransform C++: virtual vtkAbstractTransform *GetTransform() Set/Get a transformation to apply to input points before executing the implicit function. V.EvaluateFunction([float, float, float]) -> float C++: virtual double EvaluateFunction(double x[3]) V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate function at position x-y-z and return value. You should generally not call this method directly, you should use FunctionValue() instead. This method must be implemented by any derived class. V.EvaluateGradient([float, float, float], [float, float, float]) C++: virtual void EvaluateGradient(double x[3], double g[3]) Evaluate function gradient at position x-y-z and pass back vector. You should generally not call this method directly, you should use FunctionGradient() instead. This method must be implemented by any derived class. @V *vtkAbstractTransformvtkAbstractTransformvtkImplicitHalovtkCommonDataModelPython.vtkImplicitHalovtkImplicitHalo - implicit function for an halo Superclass: vtkImplicitFunction vtkImplicitHalo evaluates to 1.0 for each position in the sphere of a given center and radius Radius*(1-FadeOut). It evaluates to 0.0 for each position out the sphere of a given Center and radius Radius. It fades out linearly from 1.0 to 0.0 for points in a radius from Radius*(1-FadeOut) to Radius. vtkImplicitHalo is a concrete implementation of vtkImplicitFunction. It is useful as an input to vtkSampleFunction to generate an 2D image of an halo. It is used this way by vtkShadowMapPass. @warning It does not implement the gradient. V.SafeDownCast(vtkObjectBase) -> vtkImplicitHalo C++: static vtkImplicitHalo *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitHalo C++: vtkImplicitHalo *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate the equation. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate normal. Not implemented. V.SetRadius(float) C++: virtual void SetRadius(double _arg) Radius of the sphere. V.GetRadius() -> float C++: virtual double GetRadius() Radius of the sphere. SetFadeOutV.SetFadeOut(float) C++: virtual void SetFadeOut(double _arg) FadeOut ratio. Valid values are between 0.0 and 1.0. GetFadeOutV.GetFadeOut() -> float C++: virtual double GetFadeOut() FadeOut ratio. Valid values are between 0.0 and 1.0. vtkImplicitSelectionLoopvtkCommonDataModelPython.vtkImplicitSelectionLoopvtkImplicitSelectionLoop - implicit function for a selection loop Superclass: vtkImplicitFunction vtkImplicitSelectionLoop computes the implicit function value and function gradient for a irregular, cylinder-like object whose cross section is defined by a set of points forming a loop. The loop need not be convex nor its points coplanar. However, the loop must be non-self-intersecting when projected onto the plane defined by the accumulated cross product around the loop (i.e., the axis of the loop). (Alternatively, you can specify the normal to use.) The following procedure is used to compute the implicit function value for a point x. Each point of the loop is first projected onto the plane defined by the loop normal. This forms a polygon. Then, to evaluate the implicit function value, inside/outside tests are used to determine if x is inside the polygon, and the distance to the loop boundary is computed (negative values are inside the loop). One example application of this implicit function class is to draw a loop on the surface of a mesh, and use the loop to clip or extract cells from within the loop. Remember, the selection loop is "infinite" in length, you can use a plane (in boolean combination) to cap the extent of the selection loop. Another trick is to use a connectivity filter to extract the closest region to a given point (i.e., one of the points used to define the selection loop). @sa vtkImplicitFunction vtkImplicitBoolean vtkExtractGeometry vtkClipPolyData vtkConnectivityFilter vtkPolyDataConnectivityFilter V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard VTK methods for printing and type information. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard VTK methods for printing and type information. V.SafeDownCast(vtkObjectBase) -> vtkImplicitSelectionLoop C++: static vtkImplicitSelectionLoop *SafeDownCast( vtkObjectBase *o) Standard VTK methods for printing and type information. V.NewInstance() -> vtkImplicitSelectionLoop C++: vtkImplicitSelectionLoop *NewInstance() Standard VTK methods for printing and type information. V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate selection loop returning a signed distance. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate selection loop returning the gradient. V.SetLoop(vtkPoints) C++: virtual void SetLoop(vtkPoints *) Set/Get the array of point coordinates defining the loop. There must be at least three points used to define a loop. V.GetLoop() -> vtkPoints C++: virtual vtkPoints *GetLoop() Set/Get the array of point coordinates defining the loop. There must be at least three points used to define a loop. SetAutomaticNormalGenerationV.SetAutomaticNormalGeneration(int) C++: virtual void SetAutomaticNormalGeneration(int _arg) Turn on/off automatic normal generation. By default, the normal is computed from the accumulated cross product of the edges. You can also specify the normal to use. GetAutomaticNormalGenerationV.GetAutomaticNormalGeneration() -> int C++: virtual int GetAutomaticNormalGeneration() Turn on/off automatic normal generation. By default, the normal is computed from the accumulated cross product of the edges. You can also specify the normal to use. AutomaticNormalGenerationOnV.AutomaticNormalGenerationOn() C++: virtual void AutomaticNormalGenerationOn() Turn on/off automatic normal generation. By default, the normal is computed from the accumulated cross product of the edges. You can also specify the normal to use. AutomaticNormalGenerationOffV.AutomaticNormalGenerationOff() C++: virtual void AutomaticNormalGenerationOff() Turn on/off automatic normal generation. By default, the normal is computed from the accumulated cross product of the edges. You can also specify the normal to use. SetNormalV.SetNormal(float, float, float) C++: void SetNormal(double, double, double) V.SetNormal((float, float, float)) C++: void SetNormal(double a[3]) GetNormalV.GetNormal() -> (float, float, float) C++: double *GetNormal() Set / get the normal used to determine whether a point is inside or outside the selection loop. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Overload GetMTime() because we depend on the Loop vtkImplicitSumvtkCommonDataModelPython.vtkImplicitSumvtkImplicitSum - implicit sum of other implicit functions Superclass: vtkImplicitFunction vtkImplicitSum produces a linear combination of other implicit functions. The contribution of each function is weighted by a scalar coefficient. The NormalizeByWeight option normalizes the output so that the scalar weights add up to 1. Note that this function gives accurate sums and gradients only if the input functions are linear. V.SafeDownCast(vtkObjectBase) -> vtkImplicitSum C++: static vtkImplicitSum *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitSum C++: vtkImplicitSum *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate implicit function using current functions and weights. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate gradient of the weighted sum of functions. Input functions should be linear. V.AddFunction(vtkImplicitFunction, float) C++: void AddFunction(vtkImplicitFunction *in, double weight) V.AddFunction(vtkImplicitFunction) C++: void AddFunction(vtkImplicitFunction *in) Add another implicit function to the list of functions, along with a weighting factor. RemoveAllFunctionsV.RemoveAllFunctions() C++: void RemoveAllFunctions() Remove all functions from the list. SetFunctionWeightV.SetFunctionWeight(vtkImplicitFunction, float) C++: void SetFunctionWeight(vtkImplicitFunction *f, double weight) Set the weight (coefficient) of the given function to be weight. SetNormalizeByWeightV.SetNormalizeByWeight(int) C++: virtual void SetNormalizeByWeight(int _arg) When calculating the function and gradient values of the composite function, setting NormalizeByWeight on will divide the final result by the total weight of the component functions. This process does not otherwise normalize the gradient vector. By default, NormalizeByWeight is off. GetNormalizeByWeightV.GetNormalizeByWeight() -> int C++: virtual int GetNormalizeByWeight() When calculating the function and gradient values of the composite function, setting NormalizeByWeight on will divide the final result by the total weight of the component functions. This process does not otherwise normalize the gradient vector. By default, NormalizeByWeight is off. NormalizeByWeightOnV.NormalizeByWeightOn() C++: virtual void NormalizeByWeightOn() When calculating the function and gradient values of the composite function, setting NormalizeByWeight on will divide the final result by the total weight of the component functions. This process does not otherwise normalize the gradient vector. By default, NormalizeByWeight is off. NormalizeByWeightOffV.NormalizeByWeightOff() C++: virtual void NormalizeByWeightOff() When calculating the function and gradient values of the composite function, setting NormalizeByWeight on will divide the final result by the total weight of the component functions. This process does not otherwise normalize the gradient vector. By default, NormalizeByWeight is off. vtkImplicitVolumevtkCommonDataModelPython.vtkImplicitVolumevtkImplicitVolume - treat a volume as if it were an implicit function Superclass: vtkImplicitFunction vtkImplicitVolume treats a volume (e.g., structured point dataset) as if it were an implicit function. This means it computes a function value and gradient. vtkImplicitVolume is a concrete implementation of vtkImplicitFunction. vtkImplicitDataSet computes the function (at the point x) by performing cell interpolation. That is, it finds the cell containing x, and then uses the cell's interpolation functions to compute an interpolated scalar value at x. (A similar approach is used to find the gradient, if requested.) Points outside of the dataset are assigned the value of the ivar OutValue, and the gradient value OutGradient. @warning The input volume data is only updated when GetMTime() is called. Works for 3D structured points datasets, 0D-2D datasets won't work properly. @sa vtkImplicitFunction vtkImplicitDataSet vtkClipPolyData vtkCutter vtkImplicitWindowFunction V.SafeDownCast(vtkObjectBase) -> vtkImplicitVolume C++: static vtkImplicitVolume *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkImplicitVolume C++: vtkImplicitVolume *NewInstance() V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Returns the mtime also considering the volume. This also calls Update on the volume, and it therefore must be called before the function is evaluated. V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate the ImplicitVolume. This returns the interpolated scalar value at x[3]. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate ImplicitVolume gradient. SetVolumeV.SetVolume(vtkImageData) C++: virtual void SetVolume(vtkImageData *) Specify the volume for the implicit function. GetVolumeV.GetVolume() -> vtkImageData C++: virtual vtkImageData *GetVolume() Specify the volume for the implicit function. V.SetOutValue(float) C++: virtual void SetOutValue(double _arg) Set the function value to use for points outside of the dataset. V.GetOutValue() -> float C++: virtual double GetOutValue() Set the function value to use for points outside of the dataset. vtkImplicitWindowFunctionvtkCommonDataModelPython.vtkImplicitWindowFunctionvtkImplicitWindowFunction - implicit function maps another implicit function to lie within a specified range Superclass: vtkImplicitFunction vtkImplicitWindowFunction is used to modify the output of another implicit function to lie within a specified "window", or function range. This can be used to add "thickness" to cutting or clipping functions. This class works as follows. First, it evaluates the function value of the user-specified implicit function. Then, based on the window range specified, it maps the function value into the window values specified. @sa vtkImplicitFunction V.SafeDownCast(vtkObjectBase) -> vtkImplicitWindowFunction C++: static vtkImplicitWindowFunction *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkImplicitWindowFunction C++: vtkImplicitWindowFunction *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate window function. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate window function gradient. Just return implicit function gradient. SetImplicitFunctionV.SetImplicitFunction(vtkImplicitFunction) C++: virtual void SetImplicitFunction(vtkImplicitFunction *) Specify an implicit function to operate on. GetImplicitFunctionV.GetImplicitFunction() -> vtkImplicitFunction C++: virtual vtkImplicitFunction *GetImplicitFunction() Specify an implicit function to operate on. SetWindowRangeV.SetWindowRange(float, float) C++: void SetWindowRange(double, double) V.SetWindowRange((float, float)) C++: void SetWindowRange(double a[2]) GetWindowRangeV.GetWindowRange() -> (float, float) C++: double *GetWindowRange() Specify the range of function values which are considered to lie within the window. WindowRange[0] is assumed to be less than WindowRange[1]. SetWindowValuesV.SetWindowValues(float, float) C++: void SetWindowValues(double, double) V.SetWindowValues((float, float)) C++: void SetWindowValues(double a[2]) GetWindowValuesV.GetWindowValues() -> (float, float) C++: double *GetWindowValues() Specify the range of output values that the window range is mapped into. This is effectively a scaling and shifting of the original function values. vtkIncrementalOctreeNodevtkCommonDataModelPython.vtkIncrementalOctreeNodevtkIncrementalOctreeNode - Octree node constituting incremental octree (in support of both point location and point insertion) Superclass: vtkObject Octree nodes serve as spatial sub-division primitives to build the search structure of an incremental octree in a recursive top-down manner. The hierarchy takes the form of a tree-like representation by which a parent node contains eight mutually non-overlapping child nodes. Each child is assigned with an axis-aligned rectangular volume (Spatial Bounding Box) and the eight children together cover exactly the same region as governed by their parent. The eight child nodes / octants are ordered as { (xBBoxMin, xBBoxMid] & (yBBoxMin, yBBoxMid] & (zBBoxMin, zBBoxMid] }, { (xBBoxMid, xBBoxMax] & (yBBoxMin, yBBoxMid] & (zBBoxMin, zBBoxMid] }, { (xBBoxMin, xBBoxMid] & (yBBoxMid, yBBoxMax] & (zBBoxMin, zBBoxMid] }, { (xBBoxMid, xBBoxMax] & (yBBoxMid, yBBoxMax] & (zBBoxMin, zBBoxMid] }, { (xBBoxMin, xBBoxMid] & (yBBoxMin, yBBoxMid] & (zBBoxMid, zBBoxMax] }, { (xBBoxMid, xBBoxMax] & (yBBoxMin, yBBoxMid] & (zBBoxMid, zBBoxMax] }, { (xBBoxMin, xBBoxMid] & (yBBoxMid, yBBoxMax] & (zBBoxMid, zBBoxMax] }, { (xBBoxMid, xBBoxMax] & (yBBoxMid, yBBoxMax] & (zBBoxMid, zBBoxMax] }, where { xrange & yRange & zRange } defines the region of each 3D octant. In addition, the points falling within and registered, by means of point indices, in the parent node are distributed to the child nodes for delegated maintenance. In fact, only leaf nodes, i.e., those without any descendants, actually store point indices while each node, regardless of a leaf or non- leaf node, keeps a dynamically updated Data Bounding Box of the inhabitant points, if any. Given a maximum number of points per leaf node, an octree is initialized with an empty leaf node that is then recursively sub-divided, but only on demand as points are incrementally inserted, to construct a populated tree. Please note that this octree node class is able to handle a large number of EXACTLY duplicate points that is greater than the specified maximum number of points per leaf node. In other words, as an exception, a leaf node may maintain an arbitrary number of exactly duplicate points to deal with possible extreme cases. @sa vtkIncrementalOctreePointLocator V.SafeDownCast(vtkObjectBase) -> vtkIncrementalOctreeNode C++: static vtkIncrementalOctreeNode *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkIncrementalOctreeNode C++: vtkIncrementalOctreeNode *NewInstance() V.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Get the number of points inside or under this node. GetPointIdSetV.GetPointIdSet() -> vtkIdList C++: virtual vtkIdList *GetPointIdSet() Get the list of point indices, nullptr for a non-leaf node. DeleteChildNodesV.DeleteChildNodes() C++: void DeleteChildNodes() Delete the eight child nodes. V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double x1, double x2, double y1, double y2, double z1, double z2) Set the spatial bounding box of the node. This function sets a default data bounding box. V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) Get the spatial bounding box of the node. The values are returned via an array in order of: x_min, x_max, y_min, y_max, z_min, z_max. GetMinBoundsV.GetMinBounds() -> (float, float, float) C++: double *GetMinBounds() GetMaxBoundsV.GetMaxBounds() -> (float, float, float) C++: double *GetMaxBounds() GetMinDataBoundsV.GetMinDataBounds() -> (float, ...) C++: double *GetMinDataBounds() Get access to MinDataBounds. Note that MinDataBounds is not valid until point insertion. GetMaxDataBoundsV.GetMaxDataBounds() -> (float, ...) C++: double *GetMaxDataBounds() Get access to MaxDataBounds. Note that MaxDataBounds is not valid until point insertion. V.IsLeaf() -> int C++: int IsLeaf() Determine whether or not this node is a leaf. V.GetChildIndex((float, float, float)) -> int C++: int GetChildIndex(const double point[3]) Determine which specific child / octant contains a given point. Note that the point is assumed to be inside this node and no checking is performed on the inside issue. GetChildV.GetChild(int) -> vtkIncrementalOctreeNode C++: vtkIncrementalOctreeNode *GetChild(int i) Get quick access to a child of this node. Note that this node is assumed to be a non-leaf one and no checking is performed on the node type. ContainsPointV.ContainsPoint((float, float, float)) -> int C++: int ContainsPoint(const double pnt[3]) A point is in a node if and only if MinBounds[i] < p[i] <= MaxBounds[i], which allows a node to be divided into eight non-overlapping children. ContainsPointByDataV.ContainsPointByData((float, float, float)) -> int C++: int ContainsPointByData(const double pnt[3]) A point is in a node, in terms of data, if and only if MinDataBounds[i] <= p[i] <= MaxDataBounds[i]. V.InsertPoint(vtkPoints, (float, float, float), int, [int, ...], int) -> int C++: int InsertPoint(vtkPoints *points, const double newPnt[3], int maxPts, vtkIdType *pntId, int ptMode) This function is called after a successful point-insertion check and only applies to a leaf node. Prior to a call to this function, the octree should have been retrieved top-down to find the specific leaf node in which this new point (newPt) will be inserted. The actual index of the new point (to be inserted to points) is stored in pntId. Argument ptMode specifies whether the point is not inserted at all but instead only the point index is provided upon 0, the point is inserted via vtkPoints:: InsertPoint() upon 1, or it is inserted via vtkPoints::InsertNextPoint() upon 2. For case 0, pntId needs to be specified. For cases 1 and 2, the actual point index is returned via pntId. Note that this function always returns 1 to indicate the success of point insertion. GetDistance2ToInnerBoundaryV.GetDistance2ToInnerBoundary((float, float, float), vtkIncrementalOctreeNode) -> float C++: double GetDistance2ToInnerBoundary(const double point[3], vtkIncrementalOctreeNode *rootNode) Given a point inside this node, get the minimum squared distance to all inner boundaries. An inner boundary is a node's face that is shared by another non-root node. GetDistance2ToBoundaryV.GetDistance2ToBoundary((float, float, float), vtkIncrementalOctreeNode, int) -> float C++: double GetDistance2ToBoundary(const double point[3], vtkIncrementalOctreeNode *rootNode, int checkData) V.GetDistance2ToBoundary((float, float, float), [float, float, float], vtkIncrementalOctreeNode, int) -> float C++: double GetDistance2ToBoundary(const double point[3], double closest[3], vtkIncrementalOctreeNode *rootNode, int checkData) Compute the minimum squared distance from a point to this node, with all six boundaries considered. The data bounding box is checked if checkData is non-zero. ExportAllPointIdsByInsertionV.ExportAllPointIdsByInsertion(vtkIdList) C++: void ExportAllPointIdsByInsertion(vtkIdList *idList) Export all the indices of the points (contained in or under this node) by inserting them to an allocated vtkIdList via vtkIdList::InsertNextId(). ExportAllPointIdsByDirectSetV.ExportAllPointIdsByDirectSet([int, ...], vtkIdList) C++: void ExportAllPointIdsByDirectSet(vtkIdType *pntIdx, vtkIdList *idList) Export all the indices of the points (contained in or under this node) by directly setting them in an allocated vtkIdList object. pntIdx indicates the starting location (in terms of vtkIdList) from which new point indices are added to vtkIdList by vtkIdList::SetId(). vtkIncrementalOctreePointLocatorvtkCommonDataModelPython.vtkIncrementalOctreePointLocatorvtkIncrementalOctreePointLocator - Incremental octree in support of both point location and point insertion. Superclass: vtkIncrementalPointLocator As opposed to the uniform bin-based search structure (adopted in class vtkPointLocator) with a fixed spatial resolution, an octree mechanism employs a hierarchy of tree-like sub-division of the 3D data domain. Thus it enables data-aware multi-resolution and accordingly accelerated point location as well as insertion, particularly when handling a radically imbalanced layout of points as not uncommon in datasets defined on adaptive meshes. Compared to a static point locator supporting pure location functionalities through some search structure established from a fixed set of points, an incremental point locator allows for, in addition, point insertion capabilities, with the search structure maintaining a dynamically increasing number of points. Class vtkIncrementalOctreePointLocator is an octree-based accelerated implementation of the functionalities of the uniform bin-based incremental point locator vtkPointLocator. For point location, an octree is built by accessing a vtkDataSet, specifically a vtkPointSet. For point insertion, an empty octree is inited and then incrementally populated as points are inserted. Three increasingly complex point insertion modes, i.e., direct check-free insertion, zero tolerance insertion, and non-zero tolerance insertion, are supported. In fact, the octree used in the point location mode is actually constructed via direct check-free point insertion. This class also provides a polygonal representation of the octree boundary. @sa vtkAbstractPointLocator, vtkIncrementalPointLocator, vtkPointLocator, vtkMergePoints V.SafeDownCast(vtkObjectBase) -> vtkIncrementalOctreePointLocator C++: static vtkIncrementalOctreePointLocator *SafeDownCast( vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkIncrementalOctreePointLocator C++: vtkIncrementalOctreePointLocator *NewInstance() Standard type and print methods. SetMaxPointsPerLeafV.SetMaxPointsPerLeaf(int) C++: virtual void SetMaxPointsPerLeaf(int _arg) Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. GetMaxPointsPerLeafMinValueV.GetMaxPointsPerLeafMinValue() -> int C++: virtual int GetMaxPointsPerLeafMinValue() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. GetMaxPointsPerLeafMaxValueV.GetMaxPointsPerLeafMaxValue() -> int C++: virtual int GetMaxPointsPerLeafMaxValue() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. GetMaxPointsPerLeafV.GetMaxPointsPerLeaf() -> int C++: virtual int GetMaxPointsPerLeaf() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. SetBuildCubicOctreeV.SetBuildCubicOctree(int) C++: virtual void SetBuildCubicOctree(int _arg) Set/Get whether the search octree is built as a cubic shape or not. GetBuildCubicOctreeV.GetBuildCubicOctree() -> int C++: virtual int GetBuildCubicOctree() Set/Get whether the search octree is built as a cubic shape or not. BuildCubicOctreeOnV.BuildCubicOctreeOn() C++: virtual void BuildCubicOctreeOn() Set/Get whether the search octree is built as a cubic shape or not. BuildCubicOctreeOffV.BuildCubicOctreeOff() C++: virtual void BuildCubicOctreeOff() Set/Get whether the search octree is built as a cubic shape or not. GetLocatorPointsV.GetLocatorPoints() -> vtkPoints C++: virtual vtkPoints *GetLocatorPoints() Get access to the vtkPoints object in which point coordinates are stored for either point location or point insertion. V.Initialize() C++: void Initialize() override; Delete the octree search structure. V.FreeSearchStructure() C++: void FreeSearchStructure() override; Delete the octree search structure. V.GetBounds([float, ...]) C++: void GetBounds(double *bounds) override; V.GetBounds() -> (float, ...) C++: double *GetBounds() override; Get the spatial bounding box of the octree. V.GetNumberOfPoints() -> int C++: int GetNumberOfPoints() Get the number of points maintained by the octree. FindClosestInsertedPointV.FindClosestInsertedPoint((float, float, float)) -> int C++: vtkIdType FindClosestInsertedPoint(const double x[3]) override; Given a point x assumed to be covered by the octree, return the index of the closest in-octree point regardless of the associated minimum squared distance relative to the squared insertion-tolerance distance. This method is used when performing incremental point insertion. Note -1 indicates that no point is found. InitPointInsertion() should have been called in advance. V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int nodeLevel, vtkPolyData *polysData) override; Create a polygonal representation of the octree boundary (from the root node to a specified level). V.BuildLocator() C++: void BuildLocator() override; Load points from a dataset to construct an octree for point location. This function resorts to InitPointInsertion() to fulfill some of the work. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float) -> int C++: virtual vtkIdType FindClosestPoint(double x, double y, double z) V.FindClosestPoint((float, float, float), [float, ...]) -> int C++: virtual vtkIdType FindClosestPoint(const double x[3], double *miniDist2) V.FindClosestPoint(float, float, float, [float, ...]) -> int C++: virtual vtkIdType FindClosestPoint(double x, double y, double z, double *miniDist2) Given a point x, return the id of the closest point. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; Given a point x and a radius, return the id of the closest point within the radius and the associated minimum squared distance (via dist2, this returned distance is valid only if the point id is not -1). Note that BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. FindClosestPointWithinSquaredRadiusV.FindClosestPointWithinSquaredRadius(float, (float, float, float) , float) -> int C++: vtkIdType FindClosestPointWithinSquaredRadius(double radius2, const double x[3], double &dist2) Given a point x and a squared radius radius2, return the id of the closest point within the radius and the associated minimum squared distance (via dist2, note this returned distance is valid only if the point id is not -1). BuildLocator() should have been called prior to this function.This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) override; Find all points within a radius R relative to a given point x. The returned point ids (stored in result) are not sorted in any way. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. FindPointsWithinSquaredRadiusV.FindPointsWithinSquaredRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinSquaredRadius(double R2, const double x[3], vtkIdList *result) Find all points within a squared radius R2 relative to a given point x. The returned point ids (stored in result) are not sorted in any way. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; Find the closest N points to a given point. The returned point ids (via result) are sorted from closest to farthest. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float)) -> int C++: int InitPointInsertion(vtkPoints *points, const double bounds[6]) override; V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float), int) -> int C++: int InitPointInsertion(vtkPoints *points, const double bounds[6], vtkIdType estSize) override; Initialize the point insertion process. points is an object, storing 3D point coordinates, to which incremental point insertion put coordinates. It is created and provided by an external VTK class. Argument bounds represents the spatial bounding box, into which the points fall. In fact, an adjusted version of the bounding box is used to build the octree to make sure no any point (to be inserted) falls outside the octree. This function is not thread safe. IsInsertedPointV.IsInsertedPoint((float, float, float)) -> int C++: vtkIdType IsInsertedPoint(const double x[3]) override; V.IsInsertedPoint(float, float, float) -> int C++: vtkIdType IsInsertedPoint(double x, double y, double z) override; Determine whether or not a given point has been inserted into the octree. Return the id of the already inserted point if true, otherwise return -1. InitPointInsertion() should have been called in advance. V.InsertUniquePoint((float, float, float), int) -> int C++: int InsertUniquePoint(const double point[3], vtkIdType &pntId) override; Insert a point to the octree unless there has been a duplciate point. Whether the point is actually inserted (return 1) or not (return 0 upon a rejection by an existing duplicate), the index of the point (either new or the duplicate) is returned via pntId. Note that InitPointInsertion() should have been called prior to this function. vtkPoints::InsertNextPoint() is invoked. This method is not thread safe. V.InsertPoint(int, (float, float, float)) C++: void InsertPoint(vtkIdType ptId, const double x[3]) override; Insert a given point into the octree with a specified point index ptId. InitPointInsertion() should have been called prior to this function. In addition, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed (Note that in this case, this function involves a repeated leaf container location). vtkPoints::InsertPoint() is invoked. V.InsertNextPoint((float, float, float)) -> int C++: vtkIdType InsertNextPoint(const double x[3]) override; Insert a given point into the octree and return the point index. Note that InitPointInsertion() should have been called prior to this function. In addition, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed (in this case, this function invovles a repeated leaf container location). vtkPoints::InsertNextPoint() is invoked. InsertPointWithoutCheckingV.InsertPointWithoutChecking((float, float, float), int, int) C++: void InsertPointWithoutChecking(const double point[3], vtkIdType &pntId, int insert) "Insert" a point to the octree without any checking. Argument insert means whether vtkPoints::InsertNextPoint() upon 1 is called or the point itself is not inserted to the vtkPoints at all but instead only the point index is inserted to a vtkIdList upon 0. For case 0, the point index needs to be specified via pntId. For case 1, the actual point index is returned via pntId. InitPointInsertion() should have been called. vtkCommonDataModelPython.vtkIncrementalPointLocatorvtkIncrementalPointLocator - Abstract class in support of both point location and point insertion. Superclass: vtkAbstractPointLocator Compared to a static point locator for pure location functionalities through some search structure established from a fixed set of points, an incremental point locator allows for, in addition, point insertion capabilities, with the search structure maintaining a dynamically increasing number of points. There are two incremental point locators, i.e., vtkPointLocator and vtkIncrementalOctreePointLocator. As opposed to the uniform bin-based search structure (adopted in vtkPointLocator) with a fixed spatial resolution, an octree mechanism (employed in vtkIncrementalOctreePointlocator) resorts to a hierarchy of tree-like sub-division of the 3D data domain. Thus it enables data-aware multi- resolution and accordingly accelerated point location as well as point insertion, particularly when handling a radically imbalanced layout of points as not uncommon in datasets defined on adaptive meshes. In other words, vtkIncrementalOctreePointLocator is an octree-based accelerated implementation of all functionalities of vtkPointLocator. @sa vtkLocator, vtkIncrementalOctreePointLocator, vtkPointLocator, vtkMergePoints vtkStaticPointLocator V.SafeDownCast(vtkObjectBase) -> vtkIncrementalPointLocator C++: static vtkIncrementalPointLocator *SafeDownCast( vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkIncrementalPointLocator C++: vtkIncrementalPointLocator *NewInstance() Standard type and print methods. V.FindClosestInsertedPoint((float, float, float)) -> int C++: virtual vtkIdType FindClosestInsertedPoint(const double x[3]) Given a point x assumed to be covered by the search structure, return the index of the closest point (already inserted to the search structure) regardless of the associated minimum squared distance relative to the squared insertion-tolerance distance. This method is used when performing incremental point insertion. Note -1 indicates that no point is found. InitPointInsertion() should have been called in advance. V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float)) -> int C++: virtual int InitPointInsertion(vtkPoints *newPts, const double bounds[6]) V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float), int) -> int C++: virtual int InitPointInsertion(vtkPoints *newPts, const double bounds[6], vtkIdType estSize) Initialize the point insertion process. newPts is an object, storing 3D point coordinates, to which incremental point insertion puts coordinates. It is created and provided by an external VTK class. Argument bounds represents the spatial bounding box, into which the points fall. V.IsInsertedPoint(float, float, float) -> int C++: virtual vtkIdType IsInsertedPoint(double x, double y, double z) V.IsInsertedPoint((float, float, float)) -> int C++: virtual vtkIdType IsInsertedPoint(const double x[3]) Determine whether or not a given point has been inserted. Return the id of the already inserted point if true, else return -1. InitPointInsertion() should have been called in advance. V.InsertUniquePoint((float, float, float), int) -> int C++: virtual int InsertUniquePoint(const double x[3], vtkIdType &ptId) Insert a point unless there has been a duplciate in the search structure. This method is not thread safe. V.InsertPoint(int, (float, float, float)) C++: virtual void InsertPoint(vtkIdType ptId, const double x[3]) Insert a given point with a specified point index ptId. InitPointInsertion() should have been called prior to this function. Also, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed. V.InsertNextPoint((float, float, float)) -> int C++: virtual vtkIdType InsertNextPoint(const double x[3]) Insert a given point and return the point index. InitPointInsertion() should have been called prior to this function. Also, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed. vtkCommonDataModelPython.vtkInEdgeIteratorvtkInEdgeIterator - Iterates through all incoming edges to a vertex. Superclass: vtkObject vtkInEdgeIterator iterates through all edges whose target is a particular vertex. Instantiate this class directly and call Initialize() to traverse the vertex of a graph. Alternately, use GetInEdges() on the graph to initialize the iterator. it->Next() returns a vtkInEdgeType structure, which contains Id, the edge's id, and Source, the edge's source vertex. @sa vtkGraph vtkOutEdgeIterator V.SafeDownCast(vtkObjectBase) -> vtkInEdgeIterator C++: static vtkInEdgeIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkInEdgeIterator C++: vtkInEdgeIterator *NewInstance() V.Next() -> vtkInEdgeType C++: vtkInEdgeType Next() Returns the next edge in the graph. vtkInformationQuadratureSchemeDefinitionVectorKeyvtkCommonDataModelPython.vtkInformationQuadratureSchemeDefinitionVectorKeyvtkInformationQuadratureSchemeDefinitionVectorKey - Key for vtkQuadratureSchemeDefinition vector values. Superclass: vtkInformationKey vtkInformationQuadratureSchemeDefinitionVectorKey is used to represent keys for double vector values in vtkInformation.h. NOTE the interface in this key differs from that in other similar keys because of our internal use of smart pointers. V.SafeDownCast(vtkObjectBase) -> vtkInformationQuadratureSchemeDefinitionVectorKey C++: static vtkInformationQuadratureSchemeDefinitionVectorKey *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkInformationQuadratureSchemeDefinitionVectorKey C++: vtkInformationQuadratureSchemeDefinitionVectorKey *NewInstance( ) ClearV.Clear(vtkInformation) C++: void Clear(vtkInformation *info) Clear the vector. ResizeV.Resize(vtkInformation, int) C++: void Resize(vtkInformation *info, int n) Resize (extend) the vector to hold n objects. Any new elements created will be null initialized. SizeV.Size(vtkInformation) -> int C++: int Size(vtkInformation *info) Get the vector's length. LengthV.Length(vtkInformation) -> int C++: int Length(vtkInformation *info) AppendV.Append(vtkInformation, vtkQuadratureSchemeDefinition) C++: void Append(vtkInformation *info, vtkQuadratureSchemeDefinition *value) Put the value on the back of the vector, with reference counting. SetV.Set(vtkInformation, vtkQuadratureSchemeDefinition, int) C++: void Set(vtkInformation *info, vtkQuadratureSchemeDefinition *value, int i) Set element i of the vector to value. Resizes the vector if needed. GetV.Get(vtkInformation, int) -> vtkQuadratureSchemeDefinition C++: vtkQuadratureSchemeDefinition *Get(vtkInformation *info, int idx) Get the vtkQuadratureSchemeDefinition at a specific location in the vector. V.ShallowCopy(vtkInformation, vtkInformation) C++: void ShallowCopy(vtkInformation *from, vtkInformation *to) override; Copy the entry associated with this key from one information object to another. If there is no entry in the first information object for this key, the value is removed from the second. V.DeepCopy(vtkInformation, vtkInformation) C++: void DeepCopy(vtkInformation *from, vtkInformation *to) override; Copy the entry associated with this key from one information object to another. If there is no entry in the first information object for this key, the value is removed from the second. SaveStateV.SaveState(vtkInformation, vtkXMLDataElement) -> int C++: int SaveState(vtkInformation *info, vtkXMLDataElement *element) Generate an XML representation of the object. Each key/value pair will be nested in the resulting XML hierarchy. The element passed in is assumed to be empty. RestoreStateV.RestoreState(vtkInformation, vtkXMLDataElement) -> int C++: int RestoreState(vtkInformation *info, vtkXMLDataElement *element) Load key/value pairs from an XML state representation created with SaveState. Duplicate keys will generate a fatal error. vtkInformationKeyvtkQuadratureSchemeDefinitionvtkXMLDataElementvtkIterativeClosestPointTransformVTK_ICP_MODE_RMSVTK_ICP_MODE_AVvtkCommonDataModelPython.vtkIterativeClosestPointTransformvtkIterativeClosestPointTransform - Implementation of the ICP algorithm. Superclass: vtkLinearTransform Match two surfaces using the iterative closest point (ICP) algorithm. The core of the algorithm is to match each vertex in one surface with the closest surface point on the other, then apply the transformation that modify one surface to best match the other (in a least square sense). This has to be iterated to get proper convergence of the surfaces.@attention Use vtkTransformPolyDataFilter to apply the resulting ICP transform to your data. You might also set it to your actor's user transform.@attention This class makes use of vtkLandmarkTransform internally to compute the best fit. Use the GetLandmarkTransform member to get a pointer to that transform and set its parameters. You might, for example, constrain the number of degrees of freedom of the solution (i.e. rigid body, similarity, etc.) by checking the vtkLandmarkTransform documentation for its SetMode member. @sa vtkLandmarkTransform V.SafeDownCast(vtkObjectBase) -> vtkIterativeClosestPointTransform C++: static vtkIterativeClosestPointTransform *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkIterativeClosestPointTransform C++: vtkIterativeClosestPointTransform *NewInstance() V.SetSource(vtkDataSet) C++: void SetSource(vtkDataSet *source) Specify the source and target data sets. V.SetTarget(vtkDataSet) C++: void SetTarget(vtkDataSet *target) Specify the source and target data sets. V.GetSource() -> vtkDataSet C++: virtual vtkDataSet *GetSource() Specify the source and target data sets. V.GetTarget() -> vtkDataSet C++: virtual vtkDataSet *GetTarget() Specify the source and target data sets. SetLocatorV.SetLocator(vtkCellLocator) C++: void SetLocator(vtkCellLocator *locator) Set/Get a spatial locator for speeding up the search process. An instance of vtkCellLocator is used by default. GetLocatorV.GetLocator() -> vtkCellLocator C++: virtual vtkCellLocator *GetLocator() Set/Get a spatial locator for speeding up the search process. An instance of vtkCellLocator is used by default. SetMaximumNumberOfIterationsV.SetMaximumNumberOfIterations(int) C++: virtual void SetMaximumNumberOfIterations(int _arg) Set/Get the maximum number of iterations. Default is 50. GetMaximumNumberOfIterationsV.GetMaximumNumberOfIterations() -> int C++: virtual int GetMaximumNumberOfIterations() Set/Get the maximum number of iterations. Default is 50. GetNumberOfIterationsV.GetNumberOfIterations() -> int C++: virtual int GetNumberOfIterations() Get the number of iterations since the last update SetCheckMeanDistanceV.SetCheckMeanDistance(int) C++: virtual void SetCheckMeanDistance(int _arg) Force the algorithm to check the mean distance between two iterations. Default is Off. GetCheckMeanDistanceV.GetCheckMeanDistance() -> int C++: virtual int GetCheckMeanDistance() Force the algorithm to check the mean distance between two iterations. Default is Off. CheckMeanDistanceOnV.CheckMeanDistanceOn() C++: virtual void CheckMeanDistanceOn() Force the algorithm to check the mean distance between two iterations. Default is Off. CheckMeanDistanceOffV.CheckMeanDistanceOff() C++: virtual void CheckMeanDistanceOff() Force the algorithm to check the mean distance between two iterations. Default is Off. SetMeanDistanceModeV.SetMeanDistanceMode(int) C++: virtual void SetMeanDistanceMode(int _arg) Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS GetMeanDistanceModeMinValueV.GetMeanDistanceModeMinValue() -> int C++: virtual int GetMeanDistanceModeMinValue() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS GetMeanDistanceModeMaxValueV.GetMeanDistanceModeMaxValue() -> int C++: virtual int GetMeanDistanceModeMaxValue() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS GetMeanDistanceModeV.GetMeanDistanceMode() -> int C++: virtual int GetMeanDistanceMode() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS SetMeanDistanceModeToRMSV.SetMeanDistanceModeToRMS() C++: void SetMeanDistanceModeToRMS() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS SetMeanDistanceModeToAbsoluteValueV.SetMeanDistanceModeToAbsoluteValue() C++: void SetMeanDistanceModeToAbsoluteValue() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS GetMeanDistanceModeAsStringV.GetMeanDistanceModeAsString() -> string C++: const char *GetMeanDistanceModeAsString() Specify the mean distance mode. This mode expresses how the mean distance is computed. The RMS mode is the square root of the average of the sum of squares of the closest point distances. The Absolute Value mode is the mean of the sum of absolute values of the closest point distances. The default is VTK_ICP_MODE_RMS SetMaximumMeanDistanceV.SetMaximumMeanDistance(float) C++: virtual void SetMaximumMeanDistance(double _arg) Set/Get the maximum mean distance between two iteration. If the mean distance is lower than this, the convergence stops. The default is 0.01. GetMaximumMeanDistanceV.GetMaximumMeanDistance() -> float C++: virtual double GetMaximumMeanDistance() Set/Get the maximum mean distance between two iteration. If the mean distance is lower than this, the convergence stops. The default is 0.01. GetMeanDistanceV.GetMeanDistance() -> float C++: virtual double GetMeanDistance() Get the mean distance between the last two iterations. SetMaximumNumberOfLandmarksV.SetMaximumNumberOfLandmarks(int) C++: virtual void SetMaximumNumberOfLandmarks(int _arg) Set/Get the maximum number of landmarks sampled in your dataset. If your dataset is dense, then you will typically not need all the points to compute the ICP transform. The default is 200. GetMaximumNumberOfLandmarksV.GetMaximumNumberOfLandmarks() -> int C++: virtual int GetMaximumNumberOfLandmarks() Set/Get the maximum number of landmarks sampled in your dataset. If your dataset is dense, then you will typically not need all the points to compute the ICP transform. The default is 200. SetStartByMatchingCentroidsV.SetStartByMatchingCentroids(int) C++: virtual void SetStartByMatchingCentroids(int _arg) Starts the process by translating source centroid to target centroid. The default is Off. GetStartByMatchingCentroidsV.GetStartByMatchingCentroids() -> int C++: virtual int GetStartByMatchingCentroids() Starts the process by translating source centroid to target centroid. The default is Off. StartByMatchingCentroidsOnV.StartByMatchingCentroidsOn() C++: virtual void StartByMatchingCentroidsOn() Starts the process by translating source centroid to target centroid. The default is Off. StartByMatchingCentroidsOffV.StartByMatchingCentroidsOff() C++: virtual void StartByMatchingCentroidsOff() Starts the process by translating source centroid to target centroid. The default is Off. GetLandmarkTransformV.GetLandmarkTransform() -> vtkLandmarkTransform C++: virtual vtkLandmarkTransform *GetLandmarkTransform() Get the internal landmark transform. Use it to constrain the number of degrees of freedom of the solution (i.e. rigid body, similarity, etc.). InverseV.Inverse() C++: void Inverse() override; Invert the transformation. This is done by switching the source and target. MakeTransformV.MakeTransform() -> vtkAbstractTransform C++: vtkAbstractTransform *MakeTransform() override; Make another transform of the same type. vtkLinearTransformvtkHomogeneousTransformvtkCommonDataModelPython.vtkKdNodevtkKdNode - This class represents a single spatial region in an 3D axis aligned binary spatial partitioning. Superclass: vtkObject It is assumed the region bounds some set of points. Regions are represented as nodes in a binary tree. @sa vtkKdTree vtkOBSPCuts V.SafeDownCast(vtkObjectBase) -> vtkKdNode C++: static vtkKdNode *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkKdNode C++: vtkKdNode *NewInstance() SetDimV.SetDim(int) C++: virtual void SetDim(int _arg) Set/Get the dimension along which this region is divided. (0 - x, 1 - y, 2 - z, 3 - leaf node (default)). GetDimV.GetDim() -> int C++: virtual int GetDim() Set/Get the dimension along which this region is divided. (0 - x, 1 - y, 2 - z, 3 - leaf node (default)). GetDivisionPositionV.GetDivisionPosition() -> float C++: virtual double GetDivisionPosition() Get the location of the division plane along the axis the region is divided. See also GetDim(). The result is undertermined if this node is not divided (a leaf node). SetNumberOfPointsV.SetNumberOfPoints(int) C++: virtual void SetNumberOfPoints(int _arg) Set/Get the number of points contained in this region. V.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Set/Get the number of points contained in this region. V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double x1, double x2, double y1, double y2, double z1, double z2) V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double b[6]) Set/Get the bounds of the spatial region represented by this node. Caller allocates storage for 6-vector in GetBounds. V.GetBounds([float, ...]) C++: void GetBounds(double *b) Set/Get the bounds of the spatial region represented by this node. Caller allocates storage for 6-vector in GetBounds. SetDataBoundsV.SetDataBounds(float, float, float, float, float, float) C++: void SetDataBounds(double x1, double x2, double y1, double y2, double z1, double z2) V.SetDataBounds([float, ...]) C++: void SetDataBounds(float *v) Set/Get the bounds of the points contained in this spatial region. This may be smaller than the bounds of the region itself. Caller allocates storage for 6-vector in GetDataBounds. GetDataBoundsV.GetDataBounds([float, ...]) C++: void GetDataBounds(double *b) Set/Get the bounds of the points contained in this spatial region. This may be smaller than the bounds of the region itself. Caller allocates storage for 6-vector in GetDataBounds. V.GetMinBounds() -> (float, float, float) C++: double *GetMinBounds() Get a pointer to the 3 bound minima (xmin, ymin and zmin) or the 3 bound maxima (xmax, ymax, zmax). Don't free this pointer. SetMinBoundsV.SetMinBounds((float, ...)) C++: void SetMinBounds(const double *mb) Set the xmin, ymin and zmin value of the bounds of this region SetMaxBoundsV.SetMaxBounds((float, ...)) C++: void SetMaxBounds(const double *mb) Set the xmax, ymax and zmax value of the bounds of this region V.GetMinDataBounds() -> (float, float, float) C++: double *GetMinDataBounds() Get a pointer to the 3 data bound minima (xmin, ymin and zmin) or the 3 data bound maxima (xmax, ymax, zmax). Don't free this pointer. V.GetMaxDataBounds() -> (float, float, float) C++: double *GetMaxDataBounds() SetMinDataBoundsV.SetMinDataBounds((float, ...)) C++: void SetMinDataBounds(const double *mb) Set the xmin, ymin and zmin value of the bounds of this data within this region SetMaxDataBoundsV.SetMaxDataBounds((float, ...)) C++: void SetMaxDataBounds(const double *mb) Set the xmax, ymax and zmax value of the bounds of this data within this region SetIDV.SetID(int) C++: virtual void SetID(int _arg) Set/Get the ID associated with the region described by this node. If this is not a leaf node, this value should be -1. GetIDV.GetID() -> int C++: virtual int GetID() Set/Get the ID associated with the region described by this node. If this is not a leaf node, this value should be -1. GetMinIDV.GetMinID() -> int C++: virtual int GetMinID() If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. GetMaxIDV.GetMaxID() -> int C++: virtual int GetMaxID() If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. SetMinIDV.SetMinID(int) C++: virtual void SetMinID(int _arg) If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. SetMaxIDV.SetMaxID(int) C++: virtual void SetMaxID(int _arg) If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Set/Get the range of the IDs of the leaf nodes below this node. If this is already a leaf node, these values should be the same as the ID. AddChildNodesV.AddChildNodes(vtkKdNode, vtkKdNode) C++: void AddChildNodes(vtkKdNode *left, vtkKdNode *right) Add the left and right children. V.DeleteChildNodes() C++: void DeleteChildNodes() Delete the left and right children. GetLeftV.GetLeft() -> vtkKdNode C++: virtual vtkKdNode *GetLeft() Set/Get a pointer to the left child of this node. SetLeftV.SetLeft(vtkKdNode) C++: void SetLeft(vtkKdNode *left) Set/Get a pointer to the left child of this node. GetRightV.GetRight() -> vtkKdNode C++: virtual vtkKdNode *GetRight() Set/Get a pointer to the right child of this node. SetRightV.SetRight(vtkKdNode) C++: void SetRight(vtkKdNode *right) Set/Get a pointer to the right child of this node. GetUpV.GetUp() -> vtkKdNode C++: virtual vtkKdNode *GetUp() Set/Get a pointer to the parent of this node. SetUpV.SetUp(vtkKdNode) C++: void SetUp(vtkKdNode *up) Set/Get a pointer to the parent of this node. V.IntersectsBox(float, float, float, float, float, float, int) -> int C++: int IntersectsBox(double x1, double x2, double y1, double y2, double z1, double z2, int useDataBounds) Return 1 if this spatial region intersects the axis-aligned box given by the bounds passed in. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. V.IntersectsSphere2(float, float, float, float, int) -> int C++: int IntersectsSphere2(double x, double y, double z, double rSquared, int useDataBounds) Return 1 if this spatial region intersects a sphere described by it's center and the square of it's radius. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. IntersectsRegionV.IntersectsRegion(vtkPlanesIntersection, int) -> int C++: int IntersectsRegion(vtkPlanesIntersection *pi, int useDataBounds) A vtkPlanesIntersection object represents a convex 3D region bounded by planes, and it is capable of computing intersections of boxes with itself. Return 1 if this spatial region intersects the spatial region described by the vtkPlanesIntersection object. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. V.IntersectsCell(vtkCell, int, int, [float, ...]) -> int C++: int IntersectsCell(vtkCell *cell, int useDataBounds, int cellRegion=-1, double *cellBounds=nullptr) Return 1 if the cell specified intersects this region. If you already know the ID of the region containing the cell's centroid, provide that as an argument. If you already know the bounds of the cell, provide that as well, in the form of xmin,xmax,ymin,ymax,zmin, zmax. Either of these may speed the calculation. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. ContainsBoxV.ContainsBox(float, float, float, float, float, float, int) -> int C++: int ContainsBox(double x1, double x2, double y1, double y2, double z1, double z2, int useDataBounds) Return 1 if this spatial region entirely contains a box specified by it's bounds. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. V.ContainsPoint(float, float, float, int) -> int C++: int ContainsPoint(double x, double y, double z, int useDataBounds) Return 1 if this spatial region entirely contains the given point. Use the possibly smaller bounds of the points within the region if useDataBounds is non-zero. V.GetDistance2ToBoundary(float, float, float, int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, int useDataBounds) V.GetDistance2ToBoundary(float, float, float, [float, ...], int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, double *boundaryPt, int useDataBounds) Calculate the distance squared from any point to the boundary of this region. Use the boundary of the points within the region if useDataBounds is non-zero. V.GetDistance2ToInnerBoundary(float, float, float) -> float C++: double GetDistance2ToInnerBoundary(double x, double y, double z) Calculate the distance from the specified point (which is required to be inside this spatial region) to an interior boundary. An interior boundary is one that is not also an boundary of the entire space partitioned by the tree of vtkKdNode's. PrintNodeV.PrintNode(int) C++: void PrintNode(int depth) For debugging purposes, print out this node. PrintVerboseNodeV.PrintVerboseNode(int) C++: void PrintVerboseNode(int depth) For debugging purposes, print out this node. vtkPlanesIntersectionvtkKdTreevtkCommonDataModelPython.vtkKdTreevtkKdTree - a Kd-tree spatial decomposition of a set of points Superclass: vtkLocator Given one or more vtkDataSets, create a load balancing k-d tree decomposition of the points at the center of the cells. Or, create a k-d tree point locator from a list of points. This class can also generate a PolyData representation of the boundaries of the spatial regions in the decomposition. It can sort the regions with respect to a viewing direction, and it can decompose a list of regions into subsets, each of which represent a convex spatial region (since many algorithms require a convex region). If the points were derived from cells, vtkKdTree can create a list of cell Ids for each region for each data set. Two lists are available - all cells with centroid in the region, and all cells that intersect the region but whose centroid lies in another region. For the purpose of removing duplicate points quickly from large data sets, or for finding nearby points, we added another mode for building the locator. BuildLocatorFromPoints will build a k-d tree from one or more vtkPoints objects. This can be followed by BuildMapForDuplicatePoints which returns a mapping from the original ids to a subset of the ids that is unique within a supplied tolerance, or you can use FindPoint and FindClosestPoint to locate points in the original set that the tree was built from. @sa vtkLocator vtkCellLocator vtkPKdTree V.SafeDownCast(vtkObjectBase) -> vtkKdTree C++: static vtkKdTree *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkKdTree C++: vtkKdTree *NewInstance() Standard type and print methods. TimingOnV.TimingOn() C++: virtual void TimingOn() Turn on timing of the k-d tree build TimingOffV.TimingOff() C++: virtual void TimingOff() Turn on timing of the k-d tree build SetTimingV.SetTiming(int) C++: virtual void SetTiming(int _arg) Turn on timing of the k-d tree build GetTimingV.GetTiming() -> int C++: virtual int GetTiming() Turn on timing of the k-d tree build SetMinCellsV.SetMinCells(int) C++: virtual void SetMinCells(int _arg) Minimum number of cells per spatial region. Default is 100. GetMinCellsV.GetMinCells() -> int C++: virtual int GetMinCells() Minimum number of cells per spatial region. Default is 100. GetNumberOfRegionsOrLessV.GetNumberOfRegionsOrLess() -> int C++: virtual int GetNumberOfRegionsOrLess() Set/Get the number of spatial regions you want to get close to without going over. (The number of spatial regions is normally a power of two.) Call this before BuildLocator(). Default is unset (0). SetNumberOfRegionsOrLessV.SetNumberOfRegionsOrLess(int) C++: virtual void SetNumberOfRegionsOrLess(int _arg) GetNumberOfRegionsOrMoreV.GetNumberOfRegionsOrMore() -> int C++: virtual int GetNumberOfRegionsOrMore() Set/Get the number of spatial regions you want to get close to while having at least this many regions. (The number of spatial regions is normally a power of two.) Default is unset (0). SetNumberOfRegionsOrMoreV.SetNumberOfRegionsOrMore(int) C++: virtual void SetNumberOfRegionsOrMore(int _arg) GetFudgeFactorV.GetFudgeFactor() -> float C++: virtual double GetFudgeFactor() Some algorithms on k-d trees require a value that is a very small distance relative to the diameter of the entire space divided by the k-d tree. This factor is the maximum axis-aligned width of the space multiplied by 10e-6. SetFudgeFactorV.SetFudgeFactor(float) C++: virtual void SetFudgeFactor(double _arg) V.GetCuts() -> vtkBSPCuts C++: virtual vtkBSPCuts *GetCuts() Get a vtkBSPCuts object, a general object representing an axis- aligned spatial partitioning. Used by vtkBSPIntersections. V.SetCuts(vtkBSPCuts) C++: void SetCuts(vtkBSPCuts *cuts) Normally the k-d tree is computed from the dataset(s) provided in SetDataSet. Alternatively, you can provide the cuts that will be applied by calling SetCuts. OmitXPartitioningV.OmitXPartitioning() C++: void OmitXPartitioning() Omit partitions along the X axis, yielding shafts in the X direction OmitYPartitioningV.OmitYPartitioning() C++: void OmitYPartitioning() Omit partitions along the Y axis, yielding shafts in the Y direction OmitZPartitioningV.OmitZPartitioning() C++: void OmitZPartitioning() Omit partitions along the Z axis, yielding shafts in the Z direction OmitXYPartitioningV.OmitXYPartitioning() C++: void OmitXYPartitioning() Omit partitions along the X and Y axes, yielding slabs along Z OmitYZPartitioningV.OmitYZPartitioning() C++: void OmitYZPartitioning() Omit partitions along the Y and Z axes, yielding slabs along X OmitZXPartitioningV.OmitZXPartitioning() C++: void OmitZXPartitioning() Omit partitions along the Z and X axes, yielding slabs along Y OmitNoPartitioningV.OmitNoPartitioning() C++: void OmitNoPartitioning() Partition along all three axes - this is the default V.SetDataSet(vtkDataSet) C++: void SetDataSet(vtkDataSet *set) override; This class can compute a spatial decomposition based on the cells in a list of one or more input data sets. SetDataSet sets the first data set in the list to the named set. SetNthDataSet sets the data set at index N to the data set named. RemoveData set takes either the data set itself or an index and removes that data set from the list of data sets. AddDataSet adds a data set to the list of data sets. Clear out all data sets and replace with single data set. For backward compatibility with superclass. V.AddDataSet(vtkDataSet) C++: virtual void AddDataSet(vtkDataSet *set) This class can compute a spatial decomposition based on the cells in a list of one or more input data sets. Add them one at a time with this method. RemoveDataSetV.RemoveDataSet(int) C++: virtual void RemoveDataSet(int index) V.RemoveDataSet(vtkDataSet) C++: virtual void RemoveDataSet(vtkDataSet *set) Remove the given data set. RemoveAllDataSetsV.RemoveAllDataSets() C++: virtual void RemoveAllDataSets() Remove the given data set. GetNumberOfDataSetsV.GetNumberOfDataSets() -> int C++: int GetNumberOfDataSets() Get the number of data sets included in spatial paritioning V.GetDataSet(int) -> vtkDataSet C++: vtkDataSet *GetDataSet(int n) V.GetDataSet() -> vtkDataSet C++: vtkDataSet *GetDataSet() override; Get the nth defined data set in the spatial partitioning. (If you used SetNthDataSet to define 0,1 and 3 and ask for data set 2, you get 3.) Return the n'th data set. GetDataSetsV.GetDataSets() -> vtkDataSetCollection C++: virtual vtkDataSetCollection *GetDataSets() Return a collection of all the data sets. GetDataSetIndexV.GetDataSetIndex(vtkDataSet) -> int C++: int GetDataSetIndex(vtkDataSet *set) Return the index of the given data set. Returns -1 if that data set does not exist. V.GetBounds([float, ...]) C++: void GetBounds(double *bounds) Get the spatial bounds of the entire k-d tree space. Sets bounds array to xmin, xmax, ymin, ymax, zmin, zmax. SetNewBoundsV.SetNewBounds([float, ...]) C++: void SetNewBounds(double *bounds) There are certain applications where you want the bounds of the k-d tree space to be at least as large as a specified box. If the k-d tree has been built, you can expand it's bounds with this method. If the bounds supplied are smaller than those computed, they will be ignored. V.GetNumberOfRegions() -> int C++: virtual int GetNumberOfRegions() The number of leaf nodes of the tree, the spatial regions V.GetRegionBounds(int, [float, float, float, float, float, float]) C++: void GetRegionBounds(int regionID, double bounds[6]) Get the spatial bounds of k-d tree region V.GetRegionDataBounds(int, [float, float, float, float, float, float]) C++: void GetRegionDataBounds(int regionID, double bounds[6]) Get the bounds of the data within the k-d tree region V.PrintTree() C++: void PrintTree() Print out nodes of kd tree PrintVerboseTreeV.PrintVerboseTree() C++: void PrintVerboseTree() Print out nodes of kd tree PrintRegionV.PrintRegion(int) C++: void PrintRegion(int id) Print out leaf node data for given id CreateCellListsV.CreateCellLists(int, [int, ...], int) C++: void CreateCellLists(int dataSetIndex, int *regionReqList, int reqListSize) V.CreateCellLists(vtkDataSet, [int, ...], int) C++: void CreateCellLists(vtkDataSet *set, int *regionReqList, int reqListSize) V.CreateCellLists([int, ...], int) C++: void CreateCellLists(int *regionReqList, int listSize) V.CreateCellLists() C++: void CreateCellLists() Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created. * When CreateCellLists is called again, the lists created * on the previous call are deleted. SetIncludeRegionBoundaryCellsV.SetIncludeRegionBoundaryCells(int) C++: virtual void SetIncludeRegionBoundaryCells(int _arg) If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF. GetIncludeRegionBoundaryCellsV.GetIncludeRegionBoundaryCells() -> int C++: virtual int GetIncludeRegionBoundaryCells() If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF. IncludeRegionBoundaryCellsOnV.IncludeRegionBoundaryCellsOn() C++: virtual void IncludeRegionBoundaryCellsOn() If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF. IncludeRegionBoundaryCellsOffV.IncludeRegionBoundaryCellsOff() C++: virtual void IncludeRegionBoundaryCellsOff() If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF. DeleteCellListsV.DeleteCellLists() C++: void DeleteCellLists() Free the memory used by the cell lists. GetCellListV.GetCellList(int) -> vtkIdList C++: vtkIdList *GetCellList(int regionID) Get the cell list for a region. This returns a pointer to vtkKdTree's memory, so don't free it. GetBoundaryCellListV.GetBoundaryCellList(int) -> vtkIdList C++: vtkIdList *GetBoundaryCellList(int regionID) The cell list obtained with GetCellList is the list of all cells such that their centroid is contained in the spatial region. It may also be desirable to get a list of all cells intersecting a spatial region, but with centroid in some other region. This is that list. This list is computed in CreateCellLists() if and only if IncludeRegionBoundaryCells is ON. This returns a pointer to KdTree's memory, so don't free it. GetCellListsV.GetCellLists(vtkIntArray, int, vtkIdList, vtkIdList) -> int C++: vtkIdType GetCellLists(vtkIntArray *regions, int set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells) V.GetCellLists(vtkIntArray, vtkDataSet, vtkIdList, vtkIdList) -> int C++: vtkIdType GetCellLists(vtkIntArray *regions, vtkDataSet *set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells) V.GetCellLists(vtkIntArray, vtkIdList, vtkIdList) -> int C++: vtkIdType GetCellLists(vtkIntArray *regions, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells) * For a list of regions, get two cell lists. The first lists * the IDs all cells whose centroids lie in one of the regions. * The second lists the IDs of all cells that intersect the regions, * but whose centroid lies in a region not on the list. * The total number of cell IDs written to both lists is returned. * Either list pointer passed in can be nullptr, and it will be ignored. * If there are multiple data sets, you must specify which data set * you wish cell IDs for. * The caller should delete these two lists when done. This method * uses the cell lists created in CreateCellLists(). * If the cell list for any of the requested regions does not * exist, then this method will call CreateCellLists() to create * cell lists for *every* region of the k-d tree. You must remember * to DeleteCellLists() when done with all calls to this method, as * cell lists can require a great deal of memory. GetRegionContainingCellV.GetRegionContainingCell(vtkDataSet, int) -> int C++: int GetRegionContainingCell(vtkDataSet *set, vtkIdType cellID) V.GetRegionContainingCell(int, int) -> int C++: int GetRegionContainingCell(int set, vtkIdType cellID) V.GetRegionContainingCell(int) -> int C++: int GetRegionContainingCell(vtkIdType cellID) Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient. AllGetRegionContainingCellV.AllGetRegionContainingCell() -> (int, ...) C++: int *AllGetRegionContainingCell() Get a list (in order by data set by cell id) of the region IDs of the region containing the centroid for each cell. This is faster than calling GetRegionContainingCell for each cell in the DataSet. vtkKdTree uses this list, so don't delete it. GetRegionContainingPointV.GetRegionContainingPoint(float, float, float) -> int C++: int GetRegionContainingPoint(double x, double y, double z) Get the id of the region containing the specified location. V.BuildLocator() C++: void BuildLocator() override; Create the k-d tree decomposition of the cells of the data set or data sets. Cells are assigned to k-d tree spatial regions based on the location of their centroids. ViewOrderAllRegionsInDirectionV.ViewOrderAllRegionsInDirection((float, float, float), vtkIntArray) -> int C++: int ViewOrderAllRegionsInDirection( const double directionOfProjection[3], vtkIntArray *orderedList) Given a direction of projection (typically obtained with vtkCamera::GetDirectionOfProjection()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection. ViewOrderRegionsInDirectionV.ViewOrderRegionsInDirection(vtkIntArray, (float, float, float), vtkIntArray) -> int C++: int ViewOrderRegionsInDirection(vtkIntArray *regionIds, const double directionOfProjection[3], vtkIntArray *orderedList) Given a direction of projection and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection. ViewOrderAllRegionsFromPositionV.ViewOrderAllRegionsFromPosition((float, float, float), vtkIntArray) -> int C++: int ViewOrderAllRegionsFromPosition( const double directionOfProjection[3], vtkIntArray *orderedList) Given a camera position (typically obtained with vtkCamera::GetPosition()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection. ViewOrderRegionsFromPositionV.ViewOrderRegionsFromPosition(vtkIntArray, (float, float, float), vtkIntArray) -> int C++: int ViewOrderRegionsFromPosition(vtkIntArray *regionIds, const double directionOfProjection[3], vtkIntArray *orderedList) Given a camera position and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection. BuildLocatorFromPointsV.BuildLocatorFromPoints(vtkPointSet) C++: void BuildLocatorFromPoints(vtkPointSet *pointset) V.BuildLocatorFromPoints(vtkPoints) C++: void BuildLocatorFromPoints(vtkPoints *ptArray) This is a special purpose locator that builds a k-d tree to find duplicate and near-by points. It builds the tree from one or more vtkPoints objects instead of from the cells of a vtkDataSet. This build would normally be followed by BuildMapForDuplicatePoints, FindPoint, or FindClosestPoint. Since this will build a normal k-d tree, all the region intersection queries will still work, as will most other calls except those that have "Cell" in the name. * This method works most efficiently when the point arrays are * float arrays. BuildMapForDuplicatePointsV.BuildMapForDuplicatePoints(float) -> vtkIdTypeArray C++: vtkIdTypeArray *BuildMapForDuplicatePoints(float tolerance) This call returns a mapping from the original point IDs supplied to BuildLocatorFromPoints to a subset of those IDs that is unique within the specified tolerance. If points 2, 5, and 12 are the same, then IdMap[2] = IdMap[5] = IdMap[12] = 2 (or 5 or 12). * "original point IDs" - For point IDs we start at 0 for the first * point in the first vtkPoints object, and increase by 1 for subsequent * points and subsequent vtkPoints objects. * You must have called BuildLocatorFromPoints() before calling this. * You are responsible for deleting the returned array. V.FindPoint([float, ...]) -> int C++: vtkIdType FindPoint(double *x) V.FindPoint(float, float, float) -> int C++: vtkIdType FindPoint(double x, double y, double z) Find the Id of the point that was previously supplied to BuildLocatorFromPoints(). Returns -1 if the point was not in the original array. V.FindClosestPoint([float, ...], float) -> int C++: vtkIdType FindClosestPoint(double *x, double &dist2) V.FindClosestPoint(float, float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z, double &dist2) Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to the given point. Set the square of the distance between the two points. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) Given a position x and a radius r, return the id of the point closest to the point in that radius. dist2 returns the squared distance to the point. FindClosestPointInRegionV.FindClosestPointInRegion(int, [float, ...], float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double *x, double &dist2) V.FindClosestPointInRegion(int, float, float, float, float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double &dist2) Find the Id of the point in the given region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. GetPointsInRegionV.GetPointsInRegion(int) -> vtkIdTypeArray C++: vtkIdTypeArray *GetPointsInRegion(int regionId) Get a list of the original IDs of all points in a region. You must have called BuildLocatorFromPoints before calling this. V.FreeSearchStructure() C++: void FreeSearchStructure() override; Delete the k-d tree data structure. Also delete any cell lists that were computed with CreateCellLists(). V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; V.GenerateRepresentation([int, ...], int, vtkPolyData) C++: void GenerateRepresentation(int *regionList, int len, vtkPolyData *pd) Create a polydata representation of the boundaries of the k-d tree regions. If level equals GetLevel(), the leaf nodes are represented. GenerateRepresentationUsingDataBoundsOnV.GenerateRepresentationUsingDataBoundsOn() C++: virtual void GenerateRepresentationUsingDataBoundsOn() The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON. GenerateRepresentationUsingDataBoundsOffV.GenerateRepresentationUsingDataBoundsOff() C++: virtual void GenerateRepresentationUsingDataBoundsOff() The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON. SetGenerateRepresentationUsingDataBoundsV.SetGenerateRepresentationUsingDataBounds(int) C++: virtual void SetGenerateRepresentationUsingDataBounds( int _arg) The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON. GetGenerateRepresentationUsingDataBoundsV.GetGenerateRepresentationUsingDataBounds() -> int C++: virtual int GetGenerateRepresentationUsingDataBounds() The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON. NewGeometryV.NewGeometry() -> int C++: virtual int NewGeometry() Return 1 if the geometry of the input data sets has changed since the last time the k-d tree was built. InvalidateGeometryV.InvalidateGeometry() C++: virtual void InvalidateGeometry() Forget about the last geometry used. The next call to NewGeometry will return 1. A new k-d tree will be built the next time BuildLocator is called. CopyTreeV.CopyTree(vtkKdNode) -> vtkKdNode C++: static vtkKdNode *CopyTree(vtkKdNode *kd) Create a copy of the binary tree representation of the k-d tree spatial partitioning provided. FindPointsInAreaV.FindPointsInArea([float, ...], vtkIdTypeArray, bool) C++: void FindPointsInArea(double *area, vtkIdTypeArray *ids, bool clearArray=true) Fill ids with points found in area. The area is a 6-tuple containing (xmin, xmax, ymin, ymax, zmin, zmax). This method will clear the array by default. To append ids to an array, set clearArray to false. @V *vtkDataSet@iPi *i@VPi *vtkDataSet *i@ViVV *vtkIntArray *vtkIdList *vtkIdList@VVVV *vtkIntArray *vtkDataSet *vtkIdList *vtkIdList@Vk *vtkDataSet@ik@V *vtkPointSet@V *vtkPointsvtkPointSetvtkKdTreePointLocatorvtkCommonDataModelPython.vtkKdTreePointLocatorvtkKdTreePointLocator - class to quickly locate points in 3-space Superclass: vtkAbstractPointLocator vtkKdTreePointLocator is a wrapper class that derives from vtkAbstractPointLocator and calls the search functions in vtkKdTree. @sa vtkKdTree V.SafeDownCast(vtkObjectBase) -> vtkKdTreePointLocator C++: static vtkKdTreePointLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkKdTreePointLocator C++: vtkKdTreePointLocator *NewInstance() Standard type and print methods. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; Given a position x, return the id of the point closest to it. Alternative method requires separate x-y-z values. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; Given a position x and a radius r, return the id of the point closest to the point in that radius. dist2 returns the squared distance to the point. V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) override; Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FreeSearchStructure() C++: void FreeSearchStructure() override; See vtkLocator interface documentation. These methods are not thread safe. V.BuildLocator() C++: void BuildLocator() override; See vtkLocator interface documentation. These methods are not thread safe. V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; See vtkLocator interface documentation. These methods are not thread safe. vtkLagrangeCurvevtkCommonDataModelPython.vtkLagrangeCurvevtkLagrangeCurve Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeCurve C++: static vtkLagrangeCurve *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLagrangeCurve C++: vtkLagrangeCurve *NewInstance() V.GetCellType() -> int C++: int GetCellType() override; Return the type of cell. V.RequiresInitialization() -> int C++: int RequiresInitialization() override; Some cells require initialization prior to access. For example, they may have to triangulate themselves or set up internal data structures. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Cut (or clip) the cell based on the input cellScalars and the specified value. The output of the clip operation will be one or more cells of the same topological dimension as the original cell. The flag insideOut controls what part of the cell is considered inside - normally cell points whose scalar value is greater than "value" are considered inside. If insideOut is on, this is reversed. Also, if the output cell data is non-nullptr, the cell data from the clipped cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double center[3]) override; Return center of the cell in parametric coordinates. Note that the parametric center is not always located at (0.5,0.5,0.5). The return value is the subId that the center is in (if a composite cell). If you want the center in x-y-z space, invoke the EvaluateLocation() method. V.GetParametricDistance([float, float, float]) -> float C++: double GetParametricDistance(double pcoords[3]) override; Return the distance of the parametric coordinate provided to the cell. If inside the cell, a distance of zero is returned. This is used during picking to get the correct cell picked. (The tolerance will occasionally allow cells to be picked who are not really intersected "inside" the cell.) GetOrderV.GetOrder() -> (int, ...) C++: const int *GetOrder() V.GetOrder(int) -> int C++: int GetOrder(int i) V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double pcoords[3], double *weights) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) No-ops at this level. Typically overridden in subclasses. V.InterpolateDerivs([float, float, float], [float, ...]) C++: void InterpolateDerivs(double pcoords[3], double *derivs) override; SubCellCoordinatesFromIdV.SubCellCoordinatesFromId(vtkVector3i, int) -> bool C++: bool SubCellCoordinatesFromId(vtkVector3i &ijk, int subId) V.SubCellCoordinatesFromId(int, int) -> bool C++: bool SubCellCoordinatesFromId(int &i, int subId) PointIndexFromIJKV.PointIndexFromIJK(int, int, int) -> int C++: int PointIndexFromIJK(int i, int, int) TransformApproxToCellParamsV.TransformApproxToCellParams(int, [float, ...]) -> bool C++: bool TransformApproxToCellParams(int subCell, double *pcoords) @Wi &vtkVector3ivtkVector3ivtkLagrangeHexahedronvtkCommonDataModelPython.vtkLagrangeHexahedronvtkLagrangeHexahedron Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeHexahedron C++: static vtkLagrangeHexahedron *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLagrangeHexahedron C++: vtkLagrangeHexahedron *NewInstance() V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; Return the edge cell from the edgeId of the cell. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; Return the face cell from the faceId of the cell. V.SubCellCoordinatesFromId(vtkVector3i, int) -> bool C++: bool SubCellCoordinatesFromId(vtkVector3i &ijk, int subId) V.SubCellCoordinatesFromId(int, int, int, int) -> bool C++: bool SubCellCoordinatesFromId(int &i, int &j, int &k, int subId) V.PointIndexFromIJK(int, int, int, (int, ...)) -> int C++: static int PointIndexFromIJK(int i, int j, int k, const int *order) V.PointIndexFromIJK(int, int, int) -> int C++: int PointIndexFromIJK(int i, int j, int k) TransformFaceToCellParamsV.TransformFaceToCellParams(int, [float, ...]) -> bool C++: bool TransformFaceToCellParams(int bdyFace, double *pcoords) iiiP *ivtkLagrangeInterpolationConstantsMaxDegreeVTK_21_POINT_WEDGEvtkCommonDataModelPython.vtkLagrangeInterpolation.ConstantsvtkCommonDataModelPython.vtkLagrangeInterpolationvtkLagrangeInterpolation - no description provided. Superclass: vtkObject V.SafeDownCast(vtkObjectBase) -> vtkLagrangeInterpolation C++: static vtkLagrangeInterpolation *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkLagrangeInterpolation C++: vtkLagrangeInterpolation *NewInstance() EvaluateShapeFunctionsV.EvaluateShapeFunctions(int, float, [float, ...]) C++: static void EvaluateShapeFunctions(int order, double pcoord, double *shape) EvaluateShapeAndGradientV.EvaluateShapeAndGradient(int, float, [float, ...], [float, ...]) C++: static void EvaluateShapeAndGradient(int order, double pcoord, double *shape, double *grad) Tensor1ShapeFunctionsV.Tensor1ShapeFunctions((int), (float, ...), [float, ...]) -> int C++: static int Tensor1ShapeFunctions(const int order[1], const double *pcoords, double *shape) Tensor1ShapeDerivativesV.Tensor1ShapeDerivatives((int), (float, ...), [float, ...]) -> int C++: static int Tensor1ShapeDerivatives(const int order[1], const double *pcoords, double *derivs) Tensor2ShapeFunctionsV.Tensor2ShapeFunctions((int, int), (float, ...), [float, ...]) -> int C++: static int Tensor2ShapeFunctions(const int order[2], const double *pcoords, double *shape) Tensor2ShapeDerivativesV.Tensor2ShapeDerivatives((int, int), (float, ...), [float, ...]) -> int C++: static int Tensor2ShapeDerivatives(const int order[2], const double *pcoords, double *derivs) Tensor3ShapeFunctionsV.Tensor3ShapeFunctions((int, int, int), (float, ...), [float, ...]) -> int C++: static int Tensor3ShapeFunctions(const int order[3], const double *pcoords, double *shape) Tensor3ShapeDerivativesV.Tensor3ShapeDerivatives((int, int, int), (float, ...), [float, ...]) -> int C++: static int Tensor3ShapeDerivatives(const int order[3], const double *pcoords, double *derivs) Tensor3EvaluateDerivativeV.Tensor3EvaluateDerivative((int, int, int, int), (float, ...), [float, ...], int, [float, ...]) C++: void Tensor3EvaluateDerivative(const int order[4], const double *pcoords, double *fieldVals, int fieldDim, double *fieldDerivs) WedgeShapeFunctionsV.WedgeShapeFunctions((int, int, int, int), (float, ...), [float, ...]) C++: static void WedgeShapeFunctions(const int order[4], const double *pcoords, double *shape) WedgeShapeDerivativesV.WedgeShapeDerivatives((int, int, int, int), (float, ...), [float, ...]) C++: static void WedgeShapeDerivatives(const int order[4], const double *pcoords, double *derivs) WedgeEvaluateV.WedgeEvaluate((int, int, int, int), (float, ...), [float, ...], int, [float, ...]) C++: void WedgeEvaluate(const int order[4], const double *pcoords, double *fieldVals, int fieldDim, double *fieldAtPCoords) WedgeEvaluateDerivativeV.WedgeEvaluateDerivative((int, int, int, int), (float, ...), [float, ...], int, [float, ...]) C++: void WedgeEvaluateDerivative(const int order[4], const double *pcoords, double *fieldVals, int fieldDim, double *fieldDerivs) GetParametricHexCoordinatesV.GetParametricHexCoordinates(int) -> vtkVector3d C++: static vtkVector3d GetParametricHexCoordinates(int vertexId) GetPointIndicesBoundingHexEdgeV.GetPointIndicesBoundingHexEdge(int) -> vtkVector2i C++: static vtkVector2i GetPointIndicesBoundingHexEdge(int edgeId) GetVaryingParameterOfHexEdgeV.GetVaryingParameterOfHexEdge(int) -> int C++: static int GetVaryingParameterOfHexEdge(int edgeId) GetFixedParametersOfHexEdgeV.GetFixedParametersOfHexEdge(int) -> vtkVector2i C++: static vtkVector2i GetFixedParametersOfHexEdge(int edgeId) GetPointIndicesBoundingHexFaceV.GetPointIndicesBoundingHexFace(int) -> (int, int, int, int) C++: static const int *GetPointIndicesBoundingHexFace(int faceId) GetEdgeIndicesBoundingHexFaceV.GetEdgeIndicesBoundingHexFace(int) -> (int, int, int, int) C++: static const int *GetEdgeIndicesBoundingHexFace(int faceId) GetVaryingParametersOfHexFaceV.GetVaryingParametersOfHexFace(int) -> vtkVector2i C++: static vtkVector2i GetVaryingParametersOfHexFace(int faceId) GetFixedParameterOfHexFaceV.GetFixedParameterOfHexFace(int) -> int C++: static int GetFixedParameterOfHexFace(int faceId) GetParametricWedgeCoordinatesV.GetParametricWedgeCoordinates(int) -> vtkVector3d C++: static vtkVector3d GetParametricWedgeCoordinates( int vertexId) GetPointIndicesBoundingWedgeEdgeV.GetPointIndicesBoundingWedgeEdge(int) -> vtkVector2i C++: static vtkVector2i GetPointIndicesBoundingWedgeEdge( int edgeId) GetVaryingParameterOfWedgeEdgeV.GetVaryingParameterOfWedgeEdge(int) -> int C++: static int GetVaryingParameterOfWedgeEdge(int edgeId) GetFixedParametersOfWedgeEdgeV.GetFixedParametersOfWedgeEdge(int) -> vtkVector2i C++: static vtkVector2i GetFixedParametersOfWedgeEdge(int edgeId) GetPointIndicesBoundingWedgeFaceV.GetPointIndicesBoundingWedgeFace(int) -> (int, int, int, int) C++: static const int *GetPointIndicesBoundingWedgeFace( int faceId) GetEdgeIndicesBoundingWedgeFaceV.GetEdgeIndicesBoundingWedgeFace(int) -> (int, int, int, int) C++: static const int *GetEdgeIndicesBoundingWedgeFace(int faceId) GetVaryingParametersOfWedgeFaceV.GetVaryingParametersOfWedgeFace(int) -> vtkVector2i C++: static vtkVector2i GetVaryingParametersOfWedgeFace( int faceId) GetFixedParameterOfWedgeFaceV.GetFixedParameterOfWedgeFace(int) -> int C++: static int GetFixedParameterOfWedgeFace(int faceId) vtkVector3dvtkVector2ivtkLagrangeQuadrilateralvtkCommonDataModelPython.vtkLagrangeQuadrilateralvtkLagrangeQuadrilateral Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeQuadrilateral C++: static vtkLagrangeQuadrilateral *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkLagrangeQuadrilateral C++: vtkLagrangeQuadrilateral *NewInstance() V.PointIndexFromIJK(int, int, int) -> int C++: int PointIndexFromIJK(int i, int j, int k) V.PointIndexFromIJK(int, int, (int, ...)) -> int C++: static int PointIndexFromIJK(int i, int j, const int *order) @iiiiiP *ivtkLagrangeTetraVTK_LAGRANGE_TETRAHEDRON_MAX_ORDERvtkCommonDataModelPython.vtkLagrangeTetravtkLagrangeTetra Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeTetra C++: static vtkLagrangeTetra *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLagrangeTetra C++: vtkLagrangeTetra *NewInstance() MaximumOrderV.MaximumOrder() -> int C++: static int MaximumOrder() MaximumNumberOfPointsV.MaximumNumberOfPoints() -> int C++: static int MaximumNumberOfPoints() V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return center of the cell in parametric coordinates. Note that the parametric center is not always located at (0.5,0.5,0.5). The return value is the subId that the center is in (if a composite cell). If you want the center in x-y-z space, invoke the EvaluateLocation() method. V.GetOrder() -> int C++: vtkIdType GetOrder() ComputeOrderV.ComputeOrder() -> int C++: vtkIdType ComputeOrder() ToBarycentricIndexV.ToBarycentricIndex(int, [int, ...]) C++: void ToBarycentricIndex(vtkIdType index, vtkIdType *bindex) ToIndexV.ToIndex((int, ...)) -> int C++: vtkIdType ToIndex(const vtkIdType *bindex) BarycentricIndexV.BarycentricIndex(int, [int, ...], int) C++: static void BarycentricIndex(vtkIdType index, vtkIdType *bindex, vtkIdType order) IndexV.Index((int, ...), int) -> int C++: static vtkIdType Index(const vtkIdType *bindex, vtkIdType order) vtkLagrangeTriangleVTK_LAGRANGE_TRIANGLE_MAX_ORDERvtkCommonDataModelPython.vtkLagrangeTrianglevtkLagrangeTriangle Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeTriangle C++: static vtkLagrangeTriangle *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLagrangeTriangle C++: vtkLagrangeTriangle *NewInstance() ComputeParametricCoordsV.ComputeParametricCoords([float, ...], int) C++: static void ComputeParametricCoords(double *, vtkIdType) etaV.eta(int, int, float) -> float C++: static double eta(vtkIdType n, vtkIdType chi, double sigma) d_etaV.d_eta(int, int, float) -> float C++: static double d_eta(vtkIdType n, vtkIdType chi, double sigma) vtkLagrangeWedgevtkCommonDataModelPython.vtkLagrangeWedgevtkLagrangeWedge Superclass: vtkNonLinearCell See Also: V.SafeDownCast(vtkObjectBase) -> vtkLagrangeWedge C++: static vtkLagrangeWedge *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLagrangeWedge C++: vtkLagrangeWedge *NewInstance() GetNumberOfApproximatingWedgesV.GetNumberOfApproximatingWedges((int, ...)) -> int C++: static int GetNumberOfApproximatingWedges(const int *order) V.GetNumberOfApproximatingWedges() -> int C++: int GetNumberOfApproximatingWedges() P *ivtkLinevtkCommonDataModelPython.vtkLinevtkLine - cell represents a 1D line Superclass: vtkCell vtkLine is a concrete implementation of vtkCell to represent a 1D line. V.SafeDownCast(vtkObjectBase) -> vtkLine C++: static vtkLine *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkLine C++: vtkLine *NewInstance() V.Intersection((float, float, float), (float, float, float), ( float, float, float), (float, float, float), float, float) -> int C++: static int Intersection(const double p1[3], const double p2[3], const double x1[3], const double x2[3], double &u, double &v) Performs intersection of the projection of two finite 3D lines onto a 2D plane. An intersection is found if the projection of the two lines onto the plane perpendicular to the cross product of the two lines intersect. The parameters (u,v) are the parametric coordinates of the lines at the position of closest approach. Intersection3DV.Intersection3D([float, float, float], [float, float, float], [float, float, float], [float, float, float], float, float) -> int C++: static int Intersection3D(double p1[3], double p2[3], double x1[3], double x2[3], double &u, double &v) Performs intersection of two finite 3D lines. An intersection is found if the projection of the two lines onto the plane perpendicular to the cross product of the two lines intersect, and if the distance between the closest points of approach are within a relative tolerance. The parameters (u,v) are the parametric coordinates of the lines at the position of closest approach. * NOTE: "Unlike Intersection(), which determines whether the projections of * two lines onto a plane intersect, Intersection3D() determines whether the * lines themselves in 3D space intersect, within a tolerance. DistanceToLineV.DistanceToLine((float, float, float), (float, float, float), ( float, float, float), float, [float, ...]) -> float C++: static double DistanceToLine(const double x[3], const double p1[3], const double p2[3], double &t, double *closestPoint=nullptr) V.DistanceToLine((float, float, float), (float, float, float), ( float, float, float)) -> float C++: static double DistanceToLine(const double x[3], const double p1[3], const double p2[3]) Compute the distance of a point x to a finite line (p1,p2). The method computes the parametric coordinate t and the point location on the line. Note that t is unconstrained (i.e., it may lie outside the range [0,1]) but the closest point will lie within the finite line [p1,p2], if it is defined. Also, the method returns the distance squared between x and the line (p1,p2). DistanceBetweenLinesV.DistanceBetweenLines([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], float, float) -> float C++: static double DistanceBetweenLines(double l0[3], double l1[3], double m0[3], double m1[3], double closestPt1[3], double closestPt2[3], double &t1, double &t2) Computes the shortest distance squared between two infinite lines, each defined by a pair of points (l0,l1) and (m0,m1). Upon return, the closest points on the two line segments will be stored in closestPt1 and closestPt2. Their parametric coords (-inf <= t0, t1 <= inf) will be stored in t0 and t1. The return value is the shortest distance squared between the two line-segments. DistanceBetweenLineSegmentsV.DistanceBetweenLineSegments([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], float, float) -> float C++: static double DistanceBetweenLineSegments(double l0[3], double l1[3], double m0[3], double m1[3], double closestPt1[3], double closestPt2[3], double &t1, double &t2) Computes the shortest distance squared between two finite line segments defined by their end points (l0,l1) and (m0,m1). Upon return, the closest points on the two line segments will be stored in closestPt1 and closestPt2. Their parametric coords (0 <= t0, t1 <= 1) will be stored in t0 and t1. The return value is the shortest distance squared between the two line-segments. V.InterpolationFunctions([float, float, float], [float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[2]) @deprecated Replaced by vtkLine::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[2]) @deprecated Replaced by vtkLine::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[2]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[2]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCommonDataModelPython.vtkLocatorvtkLocator - abstract base class for objects that accelerate spatial searches Superclass: vtkObject vtkLocator is an abstract base class for spatial search objects, or locators. The principle behind locators is that they divide 3-space into small regions (or "buckets") that can be quickly found in response to queries about point location, line intersection, or object-object intersection. The purpose of this base class is to provide data members and methods shared by all locators. The GenerateRepresentation() is one such interesting method. This method works in conjunction with vtkLocatorFilter to create polygonal representations for the locator. For example, if the locator is an OBB tree (i.e., vtkOBBTree.h), then the representation is a set of one or more oriented bounding boxes, depending upon the specified level. Locators typically work as follows. One or more "entities", such as points or cells, are inserted into the locator structure. These entities are associated with one or more buckets. Then, when performing geometric operations, the operations are performed first on the buckets, and then if the operation tests positive, then on the entities in the bucket. For example, during collision tests, the locators are collided first to identify intersecting buckets. If an intersection is found, more expensive operations are then carried out on the entities in the bucket. To obtain good performance, locators are often organized in a tree structure. In such a structure, there are frequently multiple "levels" corresponding to different nodes in the tree. So the word level (in the context of the locator) can be used to specify a particular representation in the tree. For example, in an octree (which is a tree with 8 children), level 0 is the bounding box, or root octant, and level 1 consists of its eight children. @warning There is a concept of static and incremental locators. Static locators are constructed one time, and then support appropriate queries. Incremental locators may have data inserted into them over time (e.g., adding new points during the process of isocontouring). @sa vtkPointLocator vtkCellLocator vtkOBBTree vtkMergePoints V.SafeDownCast(vtkObjectBase) -> vtkLocator C++: static vtkLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkLocator C++: vtkLocator *NewInstance() Standard type and print methods. V.SetDataSet(vtkDataSet) C++: virtual void SetDataSet(vtkDataSet *) Build the locator from the points/cells defining this dataset. V.GetDataSet() -> vtkDataSet C++: virtual vtkDataSet *GetDataSet() Build the locator from the points/cells defining this dataset. SetMaxLevelV.SetMaxLevel(int) C++: virtual void SetMaxLevel(int _arg) Set the maximum allowable level for the tree. If the Automatic ivar is off, this will be the target depth of the locator. Initial value is 8. GetMaxLevelMinValueV.GetMaxLevelMinValue() -> int C++: virtual int GetMaxLevelMinValue() Set the maximum allowable level for the tree. If the Automatic ivar is off, this will be the target depth of the locator. Initial value is 8. GetMaxLevelMaxValueV.GetMaxLevelMaxValue() -> int C++: virtual int GetMaxLevelMaxValue() Set the maximum allowable level for the tree. If the Automatic ivar is off, this will be the target depth of the locator. Initial value is 8. GetMaxLevelV.GetMaxLevel() -> int C++: virtual int GetMaxLevel() Set the maximum allowable level for the tree. If the Automatic ivar is off, this will be the target depth of the locator. Initial value is 8. V.GetLevel() -> int C++: virtual int GetLevel() Get the level of the locator (determined automatically if Automatic is true). The value of this ivar may change each time the locator is built. Initial value is 8. SetAutomaticV.SetAutomatic(int) C++: virtual void SetAutomatic(int _arg) Boolean controls whether locator depth/resolution of locator is computed automatically from average number of entities in bucket. If not set, there will be an explicit method to control the construction of the locator (found in the subclass). GetAutomaticV.GetAutomatic() -> int C++: virtual int GetAutomatic() Boolean controls whether locator depth/resolution of locator is computed automatically from average number of entities in bucket. If not set, there will be an explicit method to control the construction of the locator (found in the subclass). AutomaticOnV.AutomaticOn() C++: virtual void AutomaticOn() Boolean controls whether locator depth/resolution of locator is computed automatically from average number of entities in bucket. If not set, there will be an explicit method to control the construction of the locator (found in the subclass). AutomaticOffV.AutomaticOff() C++: virtual void AutomaticOff() Boolean controls whether locator depth/resolution of locator is computed automatically from average number of entities in bucket. If not set, there will be an explicit method to control the construction of the locator (found in the subclass). SetToleranceV.SetTolerance(float) C++: virtual void SetTolerance(double _arg) Specify absolute tolerance (in world coordinates) for performing geometric operations. GetToleranceMinValueV.GetToleranceMinValue() -> float C++: virtual double GetToleranceMinValue() Specify absolute tolerance (in world coordinates) for performing geometric operations. GetToleranceMaxValueV.GetToleranceMaxValue() -> float C++: virtual double GetToleranceMaxValue() Specify absolute tolerance (in world coordinates) for performing geometric operations. GetToleranceV.GetTolerance() -> float C++: virtual double GetTolerance() Specify absolute tolerance (in world coordinates) for performing geometric operations. V.Update() C++: virtual void Update() Cause the locator to rebuild itself if it or its input dataset has changed. V.Initialize() C++: virtual void Initialize() Initialize locator. Frees memory and resets object as appropriate. V.BuildLocator() C++: virtual void BuildLocator() Build the locator from the input dataset. V.FreeSearchStructure() C++: virtual void FreeSearchStructure() Free the memory required for the spatial data structure. V.GenerateRepresentation(int, vtkPolyData) C++: virtual void GenerateRepresentation(int level, vtkPolyData *pd) Method to build a representation at a particular level. Note that the method GetLevel() returns the maximum number of levels available for the tree. You must provide a vtkPolyData object into which to place the data. GetBuildTimeV.GetBuildTime() -> int C++: virtual vtkMTimeType GetBuildTime() Return the time of the last data structure build. vtkMarchingSquaresLineCasesvtkCommonDataModelPython.vtkMarchingSquaresLineCasesvtkMarchingSquaresLineCases - no description provided. vtkMarchingSquaresLineCases() vtkMarchingSquaresLineCases(const &vtkMarchingSquaresLineCases) @W vtkMarchingSquaresLineCasesvtkMarchingCubesTriangleCasesvtkCommonDataModelPython.vtkMarchingCubesTriangleCasesvtkMarchingCubesTriangleCases - no description provided. vtkMarchingCubesTriangleCases() vtkMarchingCubesTriangleCases(const &vtkMarchingCubesTriangleCases) @W vtkMarchingCubesTriangleCasesvtkMeanValueCoordinatesInterpolatorvtkCommonDataModelPython.vtkMeanValueCoordinatesInterpolatorvtkMeanValueCoordinatesInterpolator - compute interpolation computes for closed triangular mesh Superclass: vtkObject vtkMeanValueCoordinatesInterpolator computes interpolation weights for a closed, manifold polyhedron mesh. Once computed, the interpolation weights can be used to interpolate data anywhere interior or exterior to the mesh. This work implements two MVC algorithms. The first one is for triangular meshes which is documented in the Siggraph 2005 paper by Tao Ju, Scot Schaefer and Joe Warren from Rice University "Mean Value Coordinates for Closed Triangular Meshes". The second one is for general polyhedron mesh which is documented in the Eurographics Symposium on Geometry Processing 2006 paper by Torsten Langer, Alexander Belyaev and Hans-Peter Seidel from MPI Informatik "Spherical Barycentric Coordinates". The filter will automatically choose which algorithm to use based on whether the input mesh is triangulated or not. In VTK this class was initially created to interpolate data across polyhedral cells. In addition, the class can be used to interpolate data values from a polyhedron mesh, and to smoothly deform a mesh from an associated control mesh. @sa vtkPolyhedralCell V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard instantiable class methods. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard instantiable class methods. V.SafeDownCast(vtkObjectBase) -> vtkMeanValueCoordinatesInterpolator C++: static vtkMeanValueCoordinatesInterpolator *SafeDownCast( vtkObjectBase *o) Standard instantiable class methods. V.NewInstance() -> vtkMeanValueCoordinatesInterpolator C++: vtkMeanValueCoordinatesInterpolator *NewInstance() Standard instantiable class methods. ComputeInterpolationWeightsV.ComputeInterpolationWeights([float, float, float], vtkPoints, vtkIdList, [float, ...]) C++: static void ComputeInterpolationWeights(double x[3], vtkPoints *pts, vtkIdList *tris, double *weights) V.ComputeInterpolationWeights([float, float, float], vtkPoints, vtkCellArray, [float, ...]) C++: static void ComputeInterpolationWeights(double x[3], vtkPoints *pts, vtkCellArray *tris, double *weights) Method to generate interpolation weights for a point x[3] from a list of triangles. In this version of the method, the triangles are defined by a vtkPoints array plus a vtkIdList, where the vtkIdList is organized such that three ids in order define a triangle. Note that number of weights must equal the number of points. PVVP *d *vtkPoints *vtkIdList *dPVVP *d *vtkPoints *vtkCellArray *dvtkMergePointsvtkCommonDataModelPython.vtkMergePointsvtkMergePoints - merge exactly coincident points Superclass: vtkPointLocator vtkMergePoints is a locator object to quickly locate points in 3D. The primary difference between vtkMergePoints and its superclass vtkPointLocator is that vtkMergePoints merges precisely coincident points and is therefore much faster. @sa vtkCleanPolyData V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard methods for type management and printing. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard methods for type management and printing. V.SafeDownCast(vtkObjectBase) -> vtkMergePoints C++: static vtkMergePoints *SafeDownCast(vtkObjectBase *o) Standard methods for type management and printing. V.NewInstance() -> vtkMergePoints C++: vtkMergePoints *NewInstance() Standard methods for type management and printing. V.IsInsertedPoint((float, float, float)) -> int C++: vtkIdType IsInsertedPoint(const double x[3]) override; V.IsInsertedPoint(float, float, float) -> int C++: vtkIdType IsInsertedPoint(double x, double y, double z) override; Determine whether point given by x[3] has been inserted into points list. Return id of previously inserted point if this is true, otherwise return -1. V.InsertUniquePoint((float, float, float), int) -> int C++: int InsertUniquePoint(const double x[3], vtkIdType &ptId) override; Determine whether point given by x[3] has been inserted into points list. Return 0 if point was already in the list, otherwise return 1. If the point was not in the list, it will be ADDED. In either case, the id of the point (newly inserted or not) is returned in the ptId argument. Note this combines the functionality of IsInsertedPoint() followed by a call to InsertNextPoint(). vtkPointLocatorvtkMultiBlockDataSetvtkCommonDataModelPython.vtkMultiBlockDataSetvtkMultiBlockDataSet - Composite dataset that organizes datasets into blocks. Superclass: vtkDataObjectTree vtkMultiBlockDataSet is a vtkCompositeDataSet that stores a hierarchy of datasets. The dataset collection consists of multiple blocks. Each block can itself be a vtkMultiBlockDataSet, thus providing for a full tree structure. Sub-blocks are usually used to distribute blocks across processors. For example, a 1 block dataset can be distributed as following: proc 0: Block 0: * ds 0 * (null) proc 1: Block 0: * (null) * ds 1 V.SafeDownCast(vtkObjectBase) -> vtkMultiBlockDataSet C++: static vtkMultiBlockDataSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkMultiBlockDataSet C++: vtkMultiBlockDataSet *NewInstance() SetNumberOfBlocksV.SetNumberOfBlocks(int) C++: void SetNumberOfBlocks(unsigned int numBlocks) Set the number of blocks. This will cause allocation if the new number of blocks is greater than the current size. All new blocks are initialized to null. GetNumberOfBlocksV.GetNumberOfBlocks() -> int C++: unsigned int GetNumberOfBlocks() Returns the number of blocks. GetBlockV.GetBlock(int) -> vtkDataObject C++: vtkDataObject *GetBlock(unsigned int blockno) Returns the block at the given index. It is recommended that one uses the iterators to iterate over composite datasets rather than using this API. SetBlockV.SetBlock(int, vtkDataObject) C++: void SetBlock(unsigned int blockno, vtkDataObject *block) Sets the data object as the given block. The total number of blocks will be resized to fit the requested block no. RemoveBlockV.RemoveBlock(int) C++: void RemoveBlock(unsigned int blockno) Remove the given block from the dataset. V.HasMetaData(int) -> int C++: int HasMetaData(unsigned int blockno) V.HasMetaData(vtkCompositeDataIterator) -> int C++: int HasMetaData(vtkCompositeDataIterator *iter) override; Returns true if meta-data is available for a given block. V.GetMetaData(int) -> vtkInformation C++: vtkInformation *GetMetaData(unsigned int blockno) V.GetMetaData(vtkCompositeDataIterator) -> vtkInformation C++: vtkInformation *GetMetaData(vtkCompositeDataIterator *iter) override; Returns the meta-data for the block. If none is already present, a new vtkInformation object will be allocated. Use HasMetaData to avoid allocating vtkInformation objects. V.GetData(vtkInformation) -> vtkMultiBlockDataSet C++: static vtkMultiBlockDataSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkMultiBlockDataSet C++: static vtkMultiBlockDataSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. @V *vtkCompositeDataIteratorvtkMultiPieceDataSetvtkCommonDataModelPython.vtkMultiPieceDataSetvtkMultiPieceDataSet - composite dataset to encapsulates pieces of dataset. Superclass: vtkDataObjectTree A vtkMultiPieceDataSet dataset groups multiple data pieces together. For example, say that a simulation broke a volume into 16 piece so that each piece can be processed with 1 process in parallel. We want to load this volume in a visualization cluster of 4 nodes. Each node will get 4 pieces, not necessarily forming a whole rectangular piece. In this case, it is not possible to append the 4 pieces together into a vtkImageData. In this case, these 4 pieces can be collected together using a vtkMultiPieceDataSet. Note that vtkMultiPieceDataSet is intended to be included in other composite datasets eg. vtkMultiBlockDataSet, vtkHierarchicalBoxDataSet. Hence the lack of algorithms producting vtkMultiPieceDataSet. V.SafeDownCast(vtkObjectBase) -> vtkMultiPieceDataSet C++: static vtkMultiPieceDataSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkMultiPieceDataSet C++: vtkMultiPieceDataSet *NewInstance() SetNumberOfPiecesV.SetNumberOfPieces(int) C++: void SetNumberOfPieces(unsigned int numpieces) Set the number of pieces. This will cause allocation if the new number of pieces is greater than the current size. All new pieces are initialized to null. GetNumberOfPiecesV.GetNumberOfPieces() -> int C++: unsigned int GetNumberOfPieces() Returns the number of pieces. GetPieceV.GetPiece(int) -> vtkDataSet C++: vtkDataSet *GetPiece(unsigned int pieceno) Returns the piece at the given index. GetPieceAsDataObjectV.GetPieceAsDataObject(int) -> vtkDataObject C++: vtkDataObject *GetPieceAsDataObject(unsigned int pieceno) Returns the piece at the given index. SetPieceV.SetPiece(int, vtkDataObject) C++: void SetPiece(unsigned int pieceno, vtkDataObject *piece) Sets the data object as the given piece. The total number of pieces will be resized to fit the requested piece no. V.HasMetaData(int) -> int C++: int HasMetaData(unsigned int piece) V.HasMetaData(vtkCompositeDataIterator) -> int C++: int HasMetaData(vtkCompositeDataIterator *iter) override; Returns true if meta-data is available for a given piece. V.GetMetaData(int) -> vtkInformation C++: vtkInformation *GetMetaData(unsigned int pieceno) V.GetMetaData(vtkCompositeDataIterator) -> vtkInformation C++: vtkInformation *GetMetaData(vtkCompositeDataIterator *iter) override; Returns the meta-data for the piece. If none is already present, a new vtkInformation object will be allocated. Use HasMetaData to avoid allocating vtkInformation objects. V.GetData(vtkInformation) -> vtkMultiPieceDataSet C++: static vtkMultiPieceDataSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkMultiPieceDataSet C++: static vtkMultiPieceDataSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkMutableDirectedGraphvtkCommonDataModelPython.vtkMutableDirectedGraphvtkMutableDirectedGraph - An editable directed graph. Superclass: vtkDirectedGraph vtkMutableDirectedGraph is a directed graph which has additional methods for adding edges and vertices. AddChild() is a convenience method for constructing trees. ShallowCopy(), DeepCopy(), CheckedShallowCopy() and CheckedDeepCopy() will succeed for instances of vtkDirectedGraph, vtkMutableDirectedGraph and vtkTree. @sa vtkDirectedGraph vtkGraph vtkTree V.SafeDownCast(vtkObjectBase) -> vtkMutableDirectedGraph C++: static vtkMutableDirectedGraph *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkMutableDirectedGraph C++: vtkMutableDirectedGraph *NewInstance() SetNumberOfVerticesV.SetNumberOfVertices(int) -> int C++: virtual vtkIdType SetNumberOfVertices(vtkIdType numVerts) Allocates space for the specified number of vertices in the graph's internal data structures. * This has no effect on the number of vertex coordinate tuples or * vertex attribute tuples allocated; you are responsible for * guaranteeing these match. * Also, this call is not implemented for distributed-memory graphs since * the semantics are unclear; calling this function on a graph with a * non-nullptr DistributedGraphHelper will generate an error message and * no allocation will be performed. AddVertexV.AddVertex() -> int C++: vtkIdType AddVertex() V.AddVertex(vtkVariantArray) -> int C++: vtkIdType AddVertex(vtkVariantArray *propertyArr) V.AddVertex(vtkVariant) -> int C++: vtkIdType AddVertex(const vtkVariant &pedigreeId) Adds a vertex to the graph and returns the index of the new vertex. * ote In a distributed graph (i.e. a graph whose DistributedHelper * is non-null), this routine cannot be used to add a vertex * if the vertices in the graph have pedigree IDs, because this routine * will always add the vertex locally, which may conflict with the * proper location of the vertex based on the distribution of the * pedigree IDs. AddEdgeV.AddEdge(int, int) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v) V.AddEdge(int, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr) V.AddEdge(vtkVariant, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(int, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(vtkVariant, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds a directed edge from u to v, where u and v are vertex indices, and returns a vtkEdgeType structure describing that edge. * vtkEdgeType contains fields for Source vertex index, * Target vertex index, and edge index Id. LazyAddVertexV.LazyAddVertex() C++: void LazyAddVertex() V.LazyAddVertex(vtkVariantArray) C++: void LazyAddVertex(vtkVariantArray *propertyArr) V.LazyAddVertex(vtkVariant) C++: void LazyAddVertex(const vtkVariant &pedigreeId) Adds a vertex to the graph. * This method is lazily evaluated for distributed graphs (i.e. graphs * whose DistributedHelper is non-null) the next time Synchronize is * called on the helper. LazyAddEdgeV.LazyAddEdge(int, int, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(vtkVariant, int, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(int, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(vtkVariant, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds a directed edge from u to v, where u and v are vertex indices. * The number and order of values in the optional parameter * propertyArr must match up with the arrays in the edge data * retrieved by GetEdgeData(). * This method is lazily evaluated for distributed graphs (i.e. graphs * whose DistributedHelper is non-null) the next time Synchronize is * called on the helper. AddGraphEdgeV.AddGraphEdge(int, int) -> vtkGraphEdge C++: vtkGraphEdge *AddGraphEdge(vtkIdType u, vtkIdType v) Variant of AddEdge() that returns a heavyweight vtkGraphEdge object. The graph owns the reference of the edge and will replace its contents on the next call to AddGraphEdge(). * ote This is a less efficient method for use with wrappers. * In C++ you should use the faster AddEdge(). AddChildV.AddChild(int, vtkVariantArray) -> int C++: vtkIdType AddChild(vtkIdType parent, vtkVariantArray *propertyArr) V.AddChild(int) -> int C++: vtkIdType AddChild(vtkIdType parent) Convenience method for creating trees. Returns the newly created vertex id. Shortcut forvtkIdType v = g->AddVertex(); g->AddEdge(parent, v); If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData(). RemoveVertexV.RemoveVertex(int) C++: void RemoveVertex(vtkIdType v) Removes the vertex from the graph along with any connected edges. Note: This invalidates the last vertex index, which is reassigned to v. V.RemoveEdge(int) C++: void RemoveEdge(vtkIdType e) Removes the edge from the graph. Note: This invalidates the last edge index, which is reassigned to e. RemoveVerticesV.RemoveVertices(vtkIdTypeArray) C++: void RemoveVertices(vtkIdTypeArray *arr) Removes a collection of vertices from the graph along with any connected edges. RemoveEdgesV.RemoveEdges(vtkIdTypeArray) C++: void RemoveEdges(vtkIdTypeArray *arr) Removes a collection of edges from the graph. @V *vtkVariantArray@W vtkVariantvtkVariantArray@kk@kkV *vtkVariantArray@Wk|V vtkVariant *vtkVariantArray@kW|V vtkVariant *vtkVariantArray@WW|V vtkVariant vtkVariant *vtkVariantArray@kk|V *vtkVariantArrayvtkMutableUndirectedGraphvtkCommonDataModelPython.vtkMutableUndirectedGraphvtkMutableUndirectedGraph - An editable undirected graph. Superclass: vtkUndirectedGraph vtkMutableUndirectedGraph is an undirected graph with additional functions for adding vertices and edges. ShallowCopy(), DeepCopy(), CheckedShallowCopy(), and CheckedDeepCopy() will succeed when the argument is a vtkUndirectedGraph or vtkMutableUndirectedGraph. @sa vtkUndirectedGraph vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkMutableUndirectedGraph C++: static vtkMutableUndirectedGraph *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkMutableUndirectedGraph C++: vtkMutableUndirectedGraph *NewInstance() V.SetNumberOfVertices(int) -> int C++: virtual vtkIdType SetNumberOfVertices(vtkIdType numVerts) Allocates space for the specified number of vertices in the graph's internal data structures. The previous number of vertices is returned on success and -1 is returned on failure. * This has no effect on the number of vertex coordinate tuples or * vertex attribute tuples allocated; you are responsible for * guaranteeing these match. * Also, this call is not implemented for distributed-memory graphs since * the semantics are unclear; calling this function on a graph with a * non-nullptr DistributedGraphHelper will generate an error message, * no allocation will be performed, and a value of -1 will be returned. V.AddEdge(int, int) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v) V.AddEdge(int, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr) V.AddEdge(vtkVariant, int, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(int, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.AddEdge(vtkVariant, vtkVariant, vtkVariantArray) -> vtkEdgeType C++: vtkEdgeType AddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds an undirected edge from u to v, where u and v are vertex indices, and returns a vtkEdgeType structure describing that edge. * vtkEdgeType contains fields for Source vertex index, * Target vertex index, and edge index Id. V.LazyAddEdge(int, int) C++: void LazyAddEdge(vtkIdType u, vtkIdType v) V.LazyAddEdge(int, int, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr) V.LazyAddEdge(vtkVariant, int, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, vtkIdType v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(int, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(vtkIdType u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) V.LazyAddEdge(vtkVariant, vtkVariant, vtkVariantArray) C++: void LazyAddEdge(const vtkVariant &u, const vtkVariant &v, vtkVariantArray *propertyArr=nullptr) Adds an undirected edge from u to v, where u and v are vertex indices. * This method is lazily evaluated for distributed graphs (i.e. graphs * whose DistributedHelper is non-null) the next time Synchronize is * called on the helper. vtkCommonDataModelPython.vtkNonLinearCellvtkNonLinearCell - abstract superclass for non-linear cells Superclass: vtkCell vtkNonLinearCell is an abstract superclass for non-linear cell types. Cells that are a direct subclass of vtkCell or vtkCell3D are linear; cells that are a subclass of vtkNonLinearCell have non-linear interpolation functions. Non-linear cells require special treatment when tessellating or converting to graphics primitives. Note that the linearity of the cell is a function of whether the cell needs tessellation, which does not strictly correlate with interpolation order (e.g., vtkHexahedron has non-linear interpolation functions (a product of three linear functions in r-s-t) even thought vtkHexahedron is considered linear.) V.SafeDownCast(vtkObjectBase) -> vtkNonLinearCell C++: static vtkNonLinearCell *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkNonLinearCell C++: vtkNonLinearCell *NewInstance() V.IsLinear() -> int C++: int IsLinear() override; Non-linear cells require special treatment (tessellation) when converting to graphics primitives (during mapping). The vtkCell API IsLinear() is modified to indicate this requirement. vtkNonMergingPointLocatorvtkCommonDataModelPython.vtkNonMergingPointLocatorvtkNonMergingPointLocator - direct / check-free point insertion. Superclass: vtkPointLocator As a special sub-class of vtkPointLocator, vtkNonMergingPointLocator is intended for direct / check-free insertion of points into a vtkPoints object. In other words, any given point is always directly inserted. The name emphasizes the difference between this class and its sibling class vtkMergePoints in that the latter class performs check-based zero tolerance point insertion (or to 'merge' exactly duplicate / coincident points) by exploiting the uniform bin mechanism employed by the parent class vtkPointLocator. vtkPointLocator allows for generic (zero and non- zero) tolerance point insertion as well as point location. @sa vtkIncrementalPointLocator vtkPointLocator vtkMergePoints V.SafeDownCast(vtkObjectBase) -> vtkNonMergingPointLocator C++: static vtkNonMergingPointLocator *SafeDownCast( vtkObjectBase *o) Standard methods for type management and printing. V.NewInstance() -> vtkNonMergingPointLocator C++: vtkNonMergingPointLocator *NewInstance() Standard methods for type management and printing. V.IsInsertedPoint((float, float, float)) -> int C++: vtkIdType IsInsertedPoint(const double[3]) override; V.IsInsertedPoint(float, float, float) -> int C++: vtkIdType IsInsertedPoint(double, double, double) override; Determine whether a given point x has been inserted into the points list. Return the id of the already inserted point if it is true, or -1 else. Note this function always returns -1 since any point is always inserted. V.InsertUniquePoint((float, float, float), int) -> int C++: int InsertUniquePoint(const double x[3], vtkIdType &ptId) override; Determine whether a given point x has been inserted into the points list. Return 0 if a duplicate has been inserted in the list, or 1 else. Note this function always returns 1 since any point is always inserted. The index of the point is returned via ptId. vtkOctreePointLocatorvtkCommonDataModelPython.vtkOctreePointLocatorvtkOctreePointLocator - an octree spatial decomposition of a set of points Superclass: vtkAbstractPointLocator Given a vtkDataSet, create an octree that is locally refined such that all leaf octants contain less than a certain amount of points. Note that there is no size constraint that a leaf octant in relation to any of its neighbors. This class can also generate a PolyData representation of the boundaries of the spatial regions in the decomposition. @sa vtkLocator vtkPointLocator vtkOctreePointLocatorNode V.SafeDownCast(vtkObjectBase) -> vtkOctreePointLocator C++: static vtkOctreePointLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkOctreePointLocator C++: vtkOctreePointLocator *NewInstance() Standard type and print methods. SetMaximumPointsPerRegionV.SetMaximumPointsPerRegion(int) C++: virtual void SetMaximumPointsPerRegion(int _arg) Maximum number of points per spatial region. Default is 100. GetMaximumPointsPerRegionV.GetMaximumPointsPerRegion() -> int C++: virtual int GetMaximumPointsPerRegion() Maximum number of points per spatial region. Default is 100. SetCreateCubicOctantsV.SetCreateCubicOctants(int) C++: virtual void SetCreateCubicOctants(int _arg) Get/Set macro for CreateCubicOctants. GetCreateCubicOctantsV.GetCreateCubicOctants() -> int C++: virtual int GetCreateCubicOctants() Get/Set macro for CreateCubicOctants. V.GetFudgeFactor() -> float C++: virtual double GetFudgeFactor() Some algorithms on octrees require a value that is a very small distance relative to the diameter of the entire space divided by the octree. This factor is the maximum axis-aligned width of the space multiplied by 10e-6. V.SetFudgeFactor(float) C++: virtual void SetFudgeFactor(double _arg) Some algorithms on octrees require a value that is a very small distance relative to the diameter of the entire space divided by the octree. This factor is the maximum axis-aligned width of the space multiplied by 10e-6. V.GetBounds() -> (float, ...) C++: double *GetBounds() override; V.GetBounds([float, ...]) C++: void GetBounds(double *bounds) override; Get the spatial bounds of the entire octree space. Sets bounds array to xmin, xmax, ymin, ymax, zmin, zmax. GetNumberOfLeafNodesV.GetNumberOfLeafNodes() -> int C++: virtual int GetNumberOfLeafNodes() The number of leaf nodes of the tree, the spatial regions V.GetRegionBounds(int, [float, float, float, float, float, float]) C++: void GetRegionBounds(int regionID, double bounds[6]) Get the spatial bounds of octree region V.GetRegionDataBounds(int, [float, float, float, float, float, float]) C++: void GetRegionDataBounds(int leafNodeID, double bounds[6]) Get the bounds of the data within the leaf node V.GetRegionContainingPoint(float, float, float) -> int C++: int GetRegionContainingPoint(double x, double y, double z) Get the id of the leaf region containing the specified location. V.BuildLocator() C++: void BuildLocator() override; Create the octree decomposition of the cells of the data set or data sets. Cells are assigned to octree spatial regions based on the location of their centroids. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z, double &dist2) Return the Id of the point that is closest to the given point. Set the square of the distance between the two points. V.FindClosestPointInRegion(int, [float, ...], float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double *x, double &dist2) V.FindClosestPointInRegion(int, float, float, float, float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, double &dist2) Find the Id of the point in the given leaf region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double radius, const double x[3], vtkIdList *result) override; Find all points within a specified radius of position x. The result is not sorted in any specific manner. V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but not necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.GetPointsInRegion(int) -> vtkIdTypeArray C++: vtkIdTypeArray *GetPointsInRegion(int leafNodeId) Get a list of the original IDs of all points in a leaf node. V.FreeSearchStructure() C++: void FreeSearchStructure() override; Delete the octree data structure. V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; Create a polydata representation of the boundaries of the octree regions. vtkOctreePointLocatorNodevtkCommonDataModelPython.vtkOctreePointLocatorNodevtkOctreePointLocatorNode - Octree node that has 8 children each of equal size Superclass: vtkObject This class represents a single spatial region in a 3D axis octant partitioning. It is intended to work efficiently with the vtkOctreePointLocator and is not meant for general use. It is assumed the region bounds some set of points. The ordering of the children is (-x,-y,-z),(+x,-y,-z),(-x,+y,-z),(+x,+y,-z),(-x,-y,+z),(+x,-y,+z), (-x,+y,+z),(+x,+y,+z). The portion of the domain assigned to an octant is Min < x <= Max. @sa vtkOctreePointLocator V.SafeDownCast(vtkObjectBase) -> vtkOctreePointLocatorNode C++: static vtkOctreePointLocatorNode *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkOctreePointLocatorNode C++: vtkOctreePointLocatorNode *NewInstance() V.SetNumberOfPoints(int) C++: void SetNumberOfPoints(int numberOfPoints) Set/Get the number of points contained in this region. V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax) V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double b[6]) Set/Get the bounds of the spatial region represented by this node. Caller allocates storage for 6-vector in GetBounds. V.SetDataBounds(float, float, float, float, float, float) C++: void SetDataBounds(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax) Set/Get the bounds of the points contained in this spatial region. This may be smaller than the bounds of the region itself. Caller allocates storage for 6-vector in GetDataBounds. V.GetMinBounds() -> (float, ...) C++: virtual double *GetMinBounds() Get a pointer to the 3 bound minima (xmin, ymin and zmin) or the 3 bound maxima (xmax, ymax, zmax). Don't free this pointer. V.GetMaxBounds() -> (float, ...) C++: virtual double *GetMaxBounds() Get a pointer to the 3 bound minima (xmin, ymin and zmin) or the 3 bound maxima (xmax, ymax, zmax). Don't free this pointer. V.SetMinBounds([float, float, float]) C++: void SetMinBounds(double minBounds[3]) Set the xmin, ymin and zmin value of the bounds of this region V.SetMaxBounds([float, float, float]) C++: void SetMaxBounds(double maxBounds[3]) Set the xmax, ymax and zmax value of the bounds of this region V.GetMinDataBounds() -> (float, ...) C++: virtual double *GetMinDataBounds() Get a pointer to the 3 data bound minima (xmin, ymin and zmin) or the 3 data bound maxima (xmax, ymax, zmax). Don't free this pointer. V.GetMaxDataBounds() -> (float, ...) C++: virtual double *GetMaxDataBounds() Get a pointer to the 3 data bound minima (xmin, ymin and zmin) or the 3 data bound maxima (xmax, ymax, zmax). Don't free this pointer. V.SetMinDataBounds([float, float, float]) C++: void SetMinDataBounds(double minDataBounds[3]) Set the xmin, ymin and zmin value of the bounds of this data within this region. V.SetMaxDataBounds([float, float, float]) C++: void SetMaxDataBounds(double maxDataBounds[3]) Set the xmax, ymax and zmax value of the bounds of this data within this region. V.GetID() -> int C++: virtual int GetID() Get the ID associated with the region described by this node. If this is not a leaf node, this value should be -1. V.GetMinID() -> int C++: virtual int GetMinID() If this node is not a leaf node, there are leaf nodes below it whose regions represent a partitioning of this region. The IDs of these leaf nodes form a contigous set. Get the first of the first point's ID that is contained in this node. CreateChildNodesV.CreateChildNodes() C++: void CreateChildNodes() Add the 8 children. V.DeleteChildNodes() C++: void DeleteChildNodes() Delete the 8 children. V.GetChild(int) -> vtkOctreePointLocatorNode C++: vtkOctreePointLocatorNode *GetChild(int i) Get a pointer to the ith child of this node. V.GetDistance2ToBoundary(float, float, float, vtkOctreePointLocatorNode, int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, vtkOctreePointLocatorNode *top, int useDataBounds) V.GetDistance2ToBoundary(float, float, float, [float, ...], vtkOctreePointLocatorNode, int) -> float C++: double GetDistance2ToBoundary(double x, double y, double z, double *boundaryPt, vtkOctreePointLocatorNode *top, int useDataBounds) Calculate the distance squared from any point to the boundary of this region. Use the boundary of the points within the region if useDataBounds is non-zero. V.GetDistance2ToInnerBoundary(float, float, float, vtkOctreePointLocatorNode) -> float C++: double GetDistance2ToInnerBoundary(double x, double y, double z, vtkOctreePointLocatorNode *top) Calculate the distance from the specified point (which is required to be inside this spatial region) to an interior boundary. An interior boundary is one that is not also an boundary of the entire space partitioned by the tree of vtkOctreePointLocatorNode's. GetSubOctantIndexV.GetSubOctantIndex([float, ...], int) -> int C++: int GetSubOctantIndex(double *point, int CheckContainment) Return the id of the suboctant that a given point is in. If CheckContainment is non-zero then it checks whether the point is in the actual bounding box of the suboctant, otherwise it only checks which octant the point is in that is created from the axis-aligned partitioning of the domain at this octant's center. ComputeOctreeNodeInformationV.ComputeOctreeNodeInformation(vtkOctreePointLocatorNode, int, int, [float, ...]) C++: void ComputeOctreeNodeInformation( vtkOctreePointLocatorNode *Parent, int &NextLeafId, int &NextMinId, float *coordinates) Recursive function to compute ID, MinVal, MaxVal, and MinID. Parent is used for MinVal and MaxVal in the case that no points are in the leaf node. vtkOrderedTriangulatorvtkCommonDataModelPython.vtkOrderedTriangulatorvtkOrderedTriangulator - helper class to generate triangulations Superclass: vtkObject This class is used to generate unique triangulations of points. The uniqueness of the triangulation is controlled by the id of the inserted points in combination with a Delaunay criterion. The class is designed to be as fast as possible (since the algorithm can be slow) and uses block memory allocations to support rapid triangulation generation. Also, the assumption behind the class is that a maximum of hundreds of points are to be triangulated. If you desire more robust triangulation methods use vtkPolygon::Triangulate(), vtkDelaunay2D, or vtkDelaunay3D. @par Background: This work is documented in the technical paper: W.J. Schroeder, B. Geveci, M. Malaterre. Compatible Triangulations of Spatial Decompositions. In Proceedings of Visualization 2004, IEEE Press October 2004. @par Background: Delaunay triangulations are unique assuming a random distribution of input points. The 3D Delaunay criterion is as follows: the circumsphere of each tetrahedron contains no other points of the triangulation except for the four points defining the tetrahedron. In application this property is hard to satisfy because objects like cubes are defined by eight points all sharing the same circumsphere (center and radius); hence the Delaunay triangulation is not unique. These so-called degenerate situations are typically resolved by arbitrary selecting a triangulation. This code does something different: it resolves degenerate triangulations by modifying the "InCircumsphere" method to use a slightly smaller radius. Hence, degenerate points are always considered "out" of the circumsphere. This, in combination with an ordering (based on id) of the input points, guarantees a unique triangulation. @par Background: There is another related characteristic of Delaunay triangulations. Given a N-dimensional Delaunay triangulation, points laying on a (N-1) dimensional plane also form a (N-1) Delaunay triangulation. This means for example, that if a 3D cell is defined by a set of (2D) planar faces, then the face triangulations are Delaunay. Combining this with the method to generate unique triangulations described previously, the triangulations on the face are guaranteed unique. This fact can be used to triangulate 3D objects in such a way to guarantee compatible face triangulations. This is a very useful fact for parallel processing, or performing operations like clipping that require compatible triangulations across 3D cell faces. (See vtkClipVolume for an example.) @par Background: A special feature of this class is that it can generate triangulation templates on the fly. If template triangulation is enabled, then the ordered triangulator will first triangulate the cell using the slower ordered Delaunay approach, and then store the result as a template. Later, if the same cell type and cell configuration is encountered, then the template is reused which greatly speeds the triangulation. @warning Duplicate vertices will be ignored, i.e., if two points have the same coordinates the second one is discarded. The implications are that the user of this class must prevent duplicate points. Because the precision of this algorithm is double, it's also a good idea to merge points that are within some epsilon of one another. @warning The triangulation is performed using the parametric coordinates of the inserted points. Therefore the bounds (see InitTriangulation()) should represent the range of the parametric coordinates of the inserted points. @sa vtkDelaunay2D vtkDelaunay3D vtkPolygon V.SafeDownCast(vtkObjectBase) -> vtkOrderedTriangulator C++: static vtkOrderedTriangulator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkOrderedTriangulator C++: vtkOrderedTriangulator *NewInstance() InitTriangulationV.InitTriangulation(float, float, float, float, float, float, int) C++: void InitTriangulation(double xmin, double xmax, double ymin, double ymax, double zmin, double zmax, int numPts) V.InitTriangulation([float, float, float, float, float, float], int) C++: void InitTriangulation(double bounds[6], int numPts) Initialize the triangulation process. Provide a bounding box and the maximum number of points to be inserted. Note that since the triangulation is performed using parametric coordinates (see InsertPoint()) the bounds should be represent the range of the parametric coordinates inserted. \post no_point_inserted: GetNumberOfPoints()==0 V.InsertPoint(int, [float, float, float], [float, float, float], int) -> int C++: vtkIdType InsertPoint(vtkIdType id, double x[3], double p[3], int type) V.InsertPoint(int, int, [float, float, float], [float, float, float], int) -> int C++: vtkIdType InsertPoint(vtkIdType id, vtkIdType sortid, double x[3], double p[3], int type) V.InsertPoint(int, int, int, [float, float, float], [float, float, float], int) -> int C++: vtkIdType InsertPoint(vtkIdType id, vtkIdType sortid, vtkIdType sortid2, double x[3], double p[3], int type) For each point to be inserted, provide an id, a position x, parametric coordinate p, and whether the point is inside (type=0), outside (type=1), or on the boundary (type=2). You must call InitTriangulation() prior to invoking this method. Make sure that the number of points inserted does not exceed the numPts specified in InitTriangulation(). Also note that the "id" can be any integer and can be greater than numPts. It is used to create tetras (in AddTetras()) with the appropriate connectivity ids. The method returns an internal id that can be used prior to the Triangulate() method to update the type of the point with UpdatePointType(). (Note: the algorithm triangulated with the parametric coordinate p[3] and creates tetras with the global coordinate x[3]. The parametric coordinates and global coordinates may be the same.) V.Triangulate() C++: void Triangulate() Perform the triangulation. (Complete all calls to InsertPoint() prior to invoking this method.) A special version is available when templates should be used. TemplateTriangulateV.TemplateTriangulate(int, int, int) C++: void TemplateTriangulate(int cellType, int numPts, int numEdges) Perform the triangulation. (Complete all calls to InsertPoint() prior to invoking this method.) A special version is available when templates should be used. UpdatePointTypeV.UpdatePointType(int, int) C++: void UpdatePointType(vtkIdType internalId, int type) Update the point type. This is useful when the merging of nearly coincident points is performed. The id is the internal id returned from InsertPoint(). The method should be invoked prior to the Triangulate method. The type is specified as inside (type=0), outside (type=1), or on the boundary (type=2). \pre valid_range: internalId>=0 && internalIdGetNumberOfPoints() GetPointPositionV.GetPointPosition(int) -> (float, ...) C++: double *GetPointPosition(vtkIdType internalId) Return the parametric coordinates of point `internalId'. It assumes that the point has already been inserted. The method should be invoked prior to the Triangulate method. \pre valid_range: internalId>=0 && internalIdGetNumberOfPoints() GetPointLocationV.GetPointLocation(int) -> (float, ...) C++: double *GetPointLocation(vtkIdType internalId) Return the global coordinates of point `internalId'. It assumes that the point has already been inserted. The method should be invoked prior to the Triangulate method. \pre valid_range: internalId>=0 && internalIdGetNumberOfPoints() V.GetPointId(int) -> int C++: vtkIdType GetPointId(vtkIdType internalId) Return the Id of point `internalId'. This id is the one passed in argument of InsertPoint. It assumes that the point has already been inserted. The method should be invoked prior to the Triangulate method. \pre valid_range: internalId>=0 && internalIdGetNumberOfPoints() V.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Return the number of inserted points. SetUseTemplatesV.SetUseTemplates(int) C++: virtual void SetUseTemplates(int _arg) If this flag is set, then the ordered triangulator will create and use templates for the triangulation. To use templates, the TemplateTriangulate() method should be called when appropriate. (Note: the TemplateTriangulate() method works for complete (interior) cells without extra points due to intersection, etc.) GetUseTemplatesV.GetUseTemplates() -> int C++: virtual int GetUseTemplates() If this flag is set, then the ordered triangulator will create and use templates for the triangulation. To use templates, the TemplateTriangulate() method should be called when appropriate. (Note: the TemplateTriangulate() method works for complete (interior) cells without extra points due to intersection, etc.) UseTemplatesOnV.UseTemplatesOn() C++: virtual void UseTemplatesOn() If this flag is set, then the ordered triangulator will create and use templates for the triangulation. To use templates, the TemplateTriangulate() method should be called when appropriate. (Note: the TemplateTriangulate() method works for complete (interior) cells without extra points due to intersection, etc.) UseTemplatesOffV.UseTemplatesOff() C++: virtual void UseTemplatesOff() If this flag is set, then the ordered triangulator will create and use templates for the triangulation. To use templates, the TemplateTriangulate() method should be called when appropriate. (Note: the TemplateTriangulate() method works for complete (interior) cells without extra points due to intersection, etc.) SetPreSortedV.SetPreSorted(int) C++: virtual void SetPreSorted(int _arg) Boolean indicates whether the points have been pre-sorted. If pre-sorted is enabled, the points are not sorted on point id. By default, presorted is off. (The point id is defined in InsertPoint().) GetPreSortedV.GetPreSorted() -> int C++: virtual int GetPreSorted() Boolean indicates whether the points have been pre-sorted. If pre-sorted is enabled, the points are not sorted on point id. By default, presorted is off. (The point id is defined in InsertPoint().) PreSortedOnV.PreSortedOn() C++: virtual void PreSortedOn() Boolean indicates whether the points have been pre-sorted. If pre-sorted is enabled, the points are not sorted on point id. By default, presorted is off. (The point id is defined in InsertPoint().) PreSortedOffV.PreSortedOff() C++: virtual void PreSortedOff() Boolean indicates whether the points have been pre-sorted. If pre-sorted is enabled, the points are not sorted on point id. By default, presorted is off. (The point id is defined in InsertPoint().) SetUseTwoSortIdsV.SetUseTwoSortIds(int) C++: virtual void SetUseTwoSortIds(int _arg) Tells the triangulator that a second sort id is provided for each point and should also be considered when sorting. GetUseTwoSortIdsV.GetUseTwoSortIds() -> int C++: virtual int GetUseTwoSortIds() Tells the triangulator that a second sort id is provided for each point and should also be considered when sorting. UseTwoSortIdsOnV.UseTwoSortIdsOn() C++: virtual void UseTwoSortIdsOn() Tells the triangulator that a second sort id is provided for each point and should also be considered when sorting. UseTwoSortIdsOffV.UseTwoSortIdsOff() C++: virtual void UseTwoSortIdsOff() Tells the triangulator that a second sort id is provided for each point and should also be considered when sorting. GetTetrasV.GetTetras(int, vtkUnstructuredGrid) -> int C++: vtkIdType GetTetras(int classification, vtkUnstructuredGrid *ugrid) Initialize and add the tetras and points from the triangulation to the unstructured grid provided. New points are created and the mesh is allocated. (This method differs from AddTetras() in that it inserts points and cells; AddTetras only adds the tetra cells.) The tetrahdera added are of the type specified (0=inside,1=outside,2=all). Inside tetrahedron are those whose points are classified "inside" or on the "boundary." Outside tetrahedron have at least one point classified "outside." The method returns the number of tetrahedrahedron of the type requested. AddTetrasV.AddTetras(int, vtkUnstructuredGrid) -> int C++: vtkIdType AddTetras(int classification, vtkUnstructuredGrid *ugrid) V.AddTetras(int, vtkCellArray) -> int C++: vtkIdType AddTetras(int classification, vtkCellArray *connectivity) V.AddTetras(int, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) -> int C++: vtkIdType AddTetras(int classification, vtkIncrementalPointLocator *locator, vtkCellArray *outConnectivity, vtkPointData *inPD, vtkPointData *outPD, vtkCellData *inCD, vtkIdType cellId, vtkCellData *outCD) V.AddTetras(int, vtkIdList, vtkPoints) -> int C++: vtkIdType AddTetras(int classification, vtkIdList *ptIds, vtkPoints *pts) Add the tetras to the unstructured grid provided. The unstructured grid is assumed to have been initialized (with Allocate()) and points set (with SetPoints()). The tetrahdera added are of the type specified (0=inside,1=outside,2=all). Inside tetrahedron are those whose points are classified "inside" or on the "boundary." Outside tetrahedron have at least one point classified "outside." The method returns the number of tetrahedrahedron of the type requested. AddTrianglesV.AddTriangles(vtkCellArray) -> int C++: vtkIdType AddTriangles(vtkCellArray *connectivity) V.AddTriangles(int, vtkCellArray) -> int C++: vtkIdType AddTriangles(vtkIdType id, vtkCellArray *connectivity) Add the triangle faces classified (2=boundary) to the connectivity list provided. The method returns the number of triangles. InitTetraTraversalV.InitTetraTraversal() C++: void InitTetraTraversal() Methods to get one tetra at a time. Start with InitTetraTraversal() and then invoke GetNextTetra() until the method returns 0. GetNextTetraV.GetNextTetra(int, vtkTetra, vtkDataArray, vtkDoubleArray) -> int C++: int GetNextTetra(int classification, vtkTetra *tet, vtkDataArray *cellScalars, vtkDoubleArray *tetScalars) Methods to get one tetra at a time. Start with InitTetraTraversal() and then invoke GetNextTetra() until the method returns 0. cellScalars are point-centered scalars on the original cell. tetScalars are point-centered scalars on the tetra: the values will be copied from cellScalars. \pre tet_exists: tet!=0 \pre cellScalars_exists: cellScalars!=0 \pre tetScalars_exists: tetScalars!=0 \pre tetScalars_valid_size: tetScalars->GetNumberOfTuples()==4 vtkUnstructuredGrid@iV *vtkUnstructuredGrid@iV *vtkCellArrayvtkTetravtkCommonDataModelPython.vtkOutEdgeIteratorvtkOutEdgeIterator - Iterates through all outgoing edges from a vertex. Superclass: vtkObject vtkOutEdgeIterator iterates through all edges whose source is a particular vertex. Instantiate this class directly and call Initialize() to traverse the vertex of a graph. Alternately, use GetInEdges() on the graph to initialize the iterator. it->Next() returns a vtkOutEdgeType structure, which contains Id, the edge's id, and Target, the edge's target vertex. @sa vtkGraph vtkInEdgeIterator V.SafeDownCast(vtkObjectBase) -> vtkOutEdgeIterator C++: static vtkOutEdgeIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkOutEdgeIterator C++: vtkOutEdgeIterator *NewInstance() V.Next() -> vtkOutEdgeType C++: vtkOutEdgeType Next() Returns the next edge in the graph. vtkPathControlPointTypeMOVE_TOLINE_TOCONIC_CURVECUBIC_CURVEvtkCommonDataModelPython.vtkPath.ControlPointTypevtkCommonDataModelPython.vtkPathvtkPath - concrete dataset representing a path defined by Bezier curves. Superclass: vtkPointSet vtkPath provides a container for paths composed of line segments, 2nd-order (quadratic) and 3rd-order (cubic) Bezier curves. V.SafeDownCast(vtkObjectBase) -> vtkPath C++: static vtkPath *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPath C++: vtkPath *NewInstance() V.InsertNextPoint([float, float, float], int) C++: void InsertNextPoint(double pts[3], int code) V.InsertNextPoint(float, float, float, int) C++: void InsertNextPoint(double x, double y, double z, int code) Insert the next control point in the path. SetCodesV.SetCodes(vtkIntArray) C++: void SetCodes(vtkIntArray *) Set/Get the array of control point codes: GetCodesV.GetCodes() -> vtkIntArray C++: vtkIntArray *GetCodes() Set/Get the array of control point codes: V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; vtkPath doesn't use cells. These methods return trivial values. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType, vtkGenericCell *) override; V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) Get cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS NOT THREAD SAFE. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType) override; Get type of cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType, vtkIdList *ptIds) override; vtkPath doesn't use cells, this method just clears ptIds. V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; vtkPath doesn't use cells, this method just clears cellIds. V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Return the maximum cell size in this poly data. V.Allocate(int, int) C++: void Allocate(vtkIdType size=1000, int extSize=1000) Method allocates initial storage for points. Use this method before the method vtkPath::InsertNextPoint(). V.Reset() C++: void Reset() Begin inserting data all over again. Memory is not freed but otherwise objects are returned to their initial state. V.GetData(vtkInformation) -> vtkPath C++: static vtkPath *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkPath C++: static vtkPath *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkPentagonalPrismvtkCommonDataModelPython.vtkPentagonalPrismvtkPentagonalPrism - a 3D cell that represents a convex prism with pentagonal base Superclass: vtkCell3D vtkPentagonalPrism is a concrete implementation of vtkCell to represent a linear convex 3D prism with pentagonal base. Such prism is defined by the ten points (0-9), where (0,1,2,3,4) is the base of the prism which, using the right hand rule, forms a pentagon whose normal points is in the direction of the opposite face (5,6,7,8,9). @par Thanks: Thanks to Philippe Guerville who developed this class. Thanks to Charles Pignerol (CEA-DAM, France) who ported this class under VTK 4. Thanks to Jean Favre (CSCS, Switzerland) who contributed to integrate this class in VTK. Please address all comments to Jean Favre (jfavre at cscs.ch). @par Thanks: The Interpolation functions and derivatives were changed in June 2015 by Bill Lorensen. These changes follow the formulation in: http://dilbert.engr.ucdavis.edu/~suku/nem/papers/polyelas.pdf NOTE: An additional copy of this paper is located at: http://www.vtk.org/Wiki/File:ApplicationOfPolygonalFiniteElementsInLin earElasticity.pdf V.SafeDownCast(vtkObjectBase) -> vtkPentagonalPrism C++: static vtkPentagonalPrism *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPentagonalPrism C++: vtkPentagonalPrism *NewInstance() V.GetCellType() -> int C++: int GetCellType() override; See the vtkCell3D API for descriptions of these methods. V.GetCellDimension() -> int C++: int GetCellDimension() override; See the vtkCell3D API for descriptions of these methods. V.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; See the vtkCell3D API for descriptions of these methods. V.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; See the vtkCell3D API for descriptions of these methods. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; See the vtkCell3D API for descriptions of these methods. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; See the vtkCell3D API for descriptions of these methods. V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; See the vtkCell3D API for descriptions of these methods. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[10]) @deprecated Replaced by vtkPentagonalPrism::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[30]) @deprecated Replaced by vtkPentagonalPrism::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[10]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[30]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkPerlinNoisevtkCommonDataModelPython.vtkPerlinNoisevtkPerlinNoise - an implicit function that implements Perlin noise Superclass: vtkImplicitFunction vtkPerlinNoise computes a Perlin noise field as an implicit function. vtkPerlinNoise is a concrete implementation of vtkImplicitFunction. Perlin noise, originally described by Ken Perlin, is a non-periodic and continuous noise function useful for modeling real-world objects. The amplitude and frequency of the noise pattern are adjustable. This implementation of Perlin noise is derived closely from Greg Ward's version in Graphics Gems II. @sa vtkImplicitFunction V.SafeDownCast(vtkObjectBase) -> vtkPerlinNoise C++: static vtkPerlinNoise *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPerlinNoise C++: vtkPerlinNoise *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate PerlinNoise function. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate PerlinNoise gradient. Currently, the method returns a 0 gradient. SetFrequencyV.SetFrequency(float, float, float) C++: void SetFrequency(double, double, double) V.SetFrequency((float, float, float)) C++: void SetFrequency(double a[3]) GetFrequencyV.GetFrequency() -> (float, float, float) C++: double *GetFrequency() Set/get the frequency, or physical scale, of the noise function (higher is finer scale). The frequency can be adjusted per axis, or the same for all axes. SetPhaseV.SetPhase(float, float, float) C++: void SetPhase(double, double, double) V.SetPhase((float, float, float)) C++: void SetPhase(double a[3]) GetPhaseV.GetPhase() -> (float, float, float) C++: double *GetPhase() Set/get the phase of the noise function. This parameter can be used to shift the noise function within space (perhaps to avoid a beat with a noise pattern at another scale). Phase tends to repeat about every unit, so a phase of 0.5 is a half-cycle shift. SetAmplitudeV.SetAmplitude(float) C++: virtual void SetAmplitude(double _arg) Set/get the amplitude of the noise function. Amplitude can be negative. The noise function varies randomly between -|Amplitude| and |Amplitude|. Therefore the range of values is 2*|Amplitude| large. The initial amplitude is 1. GetAmplitudeV.GetAmplitude() -> float C++: virtual double GetAmplitude() Set/get the amplitude of the noise function. Amplitude can be negative. The noise function varies randomly between -|Amplitude| and |Amplitude|. Therefore the range of values is 2*|Amplitude| large. The initial amplitude is 1. vtkPiecewiseFunctionvtkCommonDataModelPython.vtkPiecewiseFunctionvtkPiecewiseFunction - Defines a 1D piecewise function. Superclass: vtkDataObject Defines a piecewise function mapping. This mapping allows the addition of control points, and allows the user to control the function between the control points. A piecewise hermite curve is used between control points, based on the sharpness and midpoint parameters. A sharpness of 0 yields a piecewise linear function and a sharpness of 1 yields a piecewise constant function. The midpoint is the normalized distance between control points at which the curve reaches the median Y value. The midpoint and sharpness values specified when adding a node are used to control the transition to the next node (the last node's values are ignored) Outside the range of nodes, the values are 0 if Clamping is off, or the nearest node point if Clamping is on. Using the legacy methods for adding points (which do not have Sharpness and Midpoint parameters) will default to Midpoint = 0.5 (halfway between the control points) and Sharpness = 0.0 (linear). V.SafeDownCast(vtkObjectBase) -> vtkPiecewiseFunction C++: static vtkPiecewiseFunction *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPiecewiseFunction C++: vtkPiecewiseFunction *NewInstance() V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *f) override; Shallow and Deep copy. These copy the data, but not any of the pipeline connections. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *f) override; Shallow and Deep copy. These copy the data, but not any of the pipeline connections. V.GetSize() -> int C++: int GetSize() Get the number of points used to specify the function AddPointV.AddPoint(float, float) -> int C++: int AddPoint(double x, double y) V.AddPoint(float, float, float, float) -> int C++: int AddPoint(double x, double y, double midpoint, double sharpness) Add/Remove points to/from the function. If a duplicate point is added then the function value is changed at that location. Return the index of the point (0 based), or -1 on error. V.RemovePoint(float) -> int C++: int RemovePoint(double x) Add/Remove points to/from the function. If a duplicate point is added then the function value is changed at that location. Return the index of the point (0 based), or -1 on error. RemoveAllPointsV.RemoveAllPoints() C++: void RemoveAllPoints() Removes all points from the function. AddSegmentV.AddSegment(float, float, float, float) C++: void AddSegment(double x1, double y1, double x2, double y2) Add a line segment to the function. All points defined between the two points specified are removed from the function. This is a legacy method that does not allow the specification of the sharpness and midpoint values for the two nodes. GetValueV.GetValue(float) -> float C++: double GetValue(double x) Returns the value of the function at the specified location using the specified interpolation. GetNodeValueV.GetNodeValue(int, [float, float, float, float]) -> int C++: int GetNodeValue(int index, double val[4]) For the node specified by index, set/get the location (X), value (Y), midpoint, and sharpness values at the node. Returns -1 if the index is out of range, returns 1 otherwise. SetNodeValueV.SetNodeValue(int, [float, float, float, float]) -> int C++: int SetNodeValue(int index, double val[4]) For the node specified by index, set/get the location (X), value (Y), midpoint, and sharpness values at the node. Returns -1 if the index is out of range, returns 1 otherwise. GetDataPointerV.GetDataPointer() -> (float, ...) C++: double *GetDataPointer() Returns a pointer to the data stored in the table. Fills from a pointer to data stored in a similar table. These are legacy methods which will be maintained for compatibility - however, note that the vtkPiecewiseFunction no longer stores the nodes in a double array internally. FillFromDataPointerV.FillFromDataPointer(int, [float, ...]) C++: void FillFromDataPointer(int, double *) Returns a pointer to the data stored in the table. Fills from a pointer to data stored in a similar table. These are legacy methods which will be maintained for compatibility - however, note that the vtkPiecewiseFunction no longer stores the nodes in a double array internally. V.GetRange() -> (float, float) C++: double *GetRange() AdjustRangeV.AdjustRange([float, float]) -> int C++: int AdjustRange(double range[2]) Remove all points out of the new range, and make sure there is a point at each end of that range. Return 1 on success, 0 otherwise. GetTableV.GetTable(float, float, int, [float, ...], int) C++: void GetTable(double x1, double x2, int size, double *table, int stride=1) Fills in an array of function values evaluated at regular intervals. Parameter "stride" is used to step through the output "table". BuildFunctionFromTableV.BuildFunctionFromTable(float, float, int, [float, ...], int) C++: void BuildFunctionFromTable(double x1, double x2, int size, double *table, int stride=1) Constructs a piecewise function from a table. Function range is is set to [x1, x2], function size is set to size, and function points are regularly spaced between x1 and x2. Parameter "stride" is is step through the input table. SetClampingV.SetClamping(int) C++: virtual void SetClamping(int _arg) When zero range clamping is Off, GetValue() returns 0.0 when a value is requested outside of the points specified. When zero range clamping is On, GetValue() returns the value at the value at the lowest point for a request below all points specified and returns the value at the highest point for a request above all points specified. On is the default. GetClampingV.GetClamping() -> int C++: virtual int GetClamping() When zero range clamping is Off, GetValue() returns 0.0 when a value is requested outside of the points specified. When zero range clamping is On, GetValue() returns the value at the value at the lowest point for a request below all points specified and returns the value at the highest point for a request above all points specified. On is the default. ClampingOnV.ClampingOn() C++: virtual void ClampingOn() When zero range clamping is Off, GetValue() returns 0.0 when a value is requested outside of the points specified. When zero range clamping is On, GetValue() returns the value at the value at the lowest point for a request below all points specified and returns the value at the highest point for a request above all points specified. On is the default. ClampingOffV.ClampingOff() C++: virtual void ClampingOff() When zero range clamping is Off, GetValue() returns 0.0 when a value is requested outside of the points specified. When zero range clamping is On, GetValue() returns the value at the value at the lowest point for a request below all points specified and returns the value at the highest point for a request above all points specified. On is the default. SetUseLogScaleV.SetUseLogScale(bool) C++: virtual void SetUseLogScale(bool _arg) GetUseLogScaleV.GetUseLogScale() -> bool C++: virtual bool GetUseLogScale() UseLogScaleOnV.UseLogScaleOn() C++: virtual void UseLogScaleOn() UseLogScaleOffV.UseLogScaleOff() C++: virtual void UseLogScaleOff() V.GetType() -> string C++: const char *GetType() Return the type of function: Function Types: 0 : Constant (No change in slope between end points) 1 : NonDecreasing (Always increasing or zero slope) 2 : NonIncreasing (Always decreasing or zero slope) 3 : Varied (Contains both decreasing and increasing slopes) GetFirstNonZeroValueV.GetFirstNonZeroValue() -> float C++: double GetFirstNonZeroValue() Returns the first point location which precedes a non-zero segment of the function. Note that the value at this point may be zero. V.Initialize() C++: void Initialize() override; Clears out the current function. A newly created vtkPiecewiseFunction is alreay initialized, so there is no need to call this method which in turn simply calls RemoveAllPoints() V.GetData(vtkInformation) -> vtkPiecewiseFunction C++: static vtkPiecewiseFunction *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkPiecewiseFunction C++: static vtkPiecewiseFunction *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. SetAllowDuplicateScalarsV.SetAllowDuplicateScalars(int) C++: virtual void SetAllowDuplicateScalars(int _arg) Toggle whether to allow duplicate scalar values in the piecewise function (off by default). GetAllowDuplicateScalarsV.GetAllowDuplicateScalars() -> int C++: virtual int GetAllowDuplicateScalars() Toggle whether to allow duplicate scalar values in the piecewise function (off by default). AllowDuplicateScalarsOnV.AllowDuplicateScalarsOn() C++: virtual void AllowDuplicateScalarsOn() Toggle whether to allow duplicate scalar values in the piecewise function (off by default). AllowDuplicateScalarsOffV.AllowDuplicateScalarsOff() C++: virtual void AllowDuplicateScalarsOff() Toggle whether to allow duplicate scalar values in the piecewise function (off by default). EstimateMinNumberOfSamplesV.EstimateMinNumberOfSamples(float, float) -> int C++: int EstimateMinNumberOfSamples(double const &x1, double const &x2) Estimates the minimum size of a table such that it would correctly sample this function. The returned value should be passed as parameter 'n' when calling GetTable(). vtkPixelvtkCommonDataModelPython.vtkPixelvtkPixel - a cell that represents an orthogonal quadrilateral Superclass: vtkCell vtkPixel is a concrete implementation of vtkCell to represent a 2D orthogonal quadrilateral. Unlike vtkQuad, the corners are at right angles, and aligned along x-y-z coordinate axes leading to large increases in computational efficiency. V.SafeDownCast(vtkObjectBase) -> vtkPixel C++: static vtkPixel *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPixel C++: vtkPixel *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. V.InterpolationFunctions([float, float, float], [float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[4]) @deprecated Replaced by vtkPixel::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[8]) @deprecated Replaced by vtkPixel::InterpolateDerivs as of VTK 5.2 V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[8]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkPixelExtentvtkCommonDataModelPython.vtkPixelExtentvtkPixelExtent - Representation of a cartesian pixel plane and common operations on it. The implementation is intended to be fast and light so that it may be used in place of int[4] with little or no performance penalty. NOTE in most cases operation on an empty object produces incorrect results. If it an issue query Empty() first. vtkPixelExtent() vtkPixelExtent(const vtkPixelExtent &other) SetDataV.SetData(vtkPixelExtent) C++: void SetData(const vtkPixelExtent &ext) Set the extent. V.Clear() C++: void Clear() V.GetData() -> (int, ...) C++: int *GetData() Direct access to internal data. GetDataUV.GetDataU() -> (int, ...) C++: unsigned int *GetDataU() GetStartIndexV.GetStartIndex([int, int]) C++: void GetStartIndex(int first[2]) V.GetStartIndex([int, int], (int, int)) C++: void GetStartIndex(int first[2], const int origin[2]) Get the start/end index. GetEndIndexV.GetEndIndex([int, int]) C++: void GetEndIndex(int last[2]) Get the start/end index. V.Empty() -> int C++: int Empty() Return true if empty. V.Contains(vtkPixelExtent) -> int C++: int Contains(const vtkPixelExtent &other) V.Contains(int, int) -> int C++: int Contains(int i, int j) Return non-zero if this extent conatins the other. DisjointV.Disjoint(vtkPixelExtent) -> int C++: int Disjoint(vtkPixelExtent other) Return non-zero if the extent is disjoint from the other V.Size() -> int C++: size_t Size() V.Size(vtkPixelExtent) -> int C++: static size_t Size(const vtkPixelExtent &ext) Get the total number. V.Grow(int) C++: void Grow(int n) V.Grow(int, int) C++: void Grow(int q, int n) V.Grow(vtkPixelExtent, int) -> vtkPixelExtent C++: static vtkPixelExtent Grow(const vtkPixelExtent &inputExt, int n) V.Grow(vtkPixelExtent, vtkPixelExtent, int) -> vtkPixelExtent C++: static vtkPixelExtent Grow(const vtkPixelExtent &inputExt, const vtkPixelExtent &problemDomain, int n) Expand the extents by n. GrowLowV.GrowLow(int, int) C++: void GrowLow(int q, int n) V.GrowLow(vtkPixelExtent, int, int) -> vtkPixelExtent C++: static vtkPixelExtent GrowLow(const vtkPixelExtent &ext, int q, int n) Expand the extents by n. GrowHighV.GrowHigh(int, int) C++: void GrowHigh(int q, int n) V.GrowHigh(vtkPixelExtent, int, int) -> vtkPixelExtent C++: static vtkPixelExtent GrowHigh(const vtkPixelExtent &ext, int q, int n) Expand the extents by n. V.Shrink(int) C++: void Shrink(int n) V.Shrink(int, int) C++: void Shrink(int q, int n) V.Shrink(vtkPixelExtent, vtkPixelExtent, int) -> vtkPixelExtent C++: static vtkPixelExtent Shrink(const vtkPixelExtent &inputExt, const vtkPixelExtent &problemDomain, int n) V.Shrink(vtkPixelExtent, int) -> vtkPixelExtent C++: static vtkPixelExtent Shrink(const vtkPixelExtent &inputExt, int n) Shrink the extent by n. V.Shift() C++: void Shift() V.Shift(vtkPixelExtent) C++: void Shift(const vtkPixelExtent &ext) V.Shift([int, ...]) C++: void Shift(int *n) V.Shift(int, int) C++: void Shift(int q, int n) V.Shift([int, ...], int) C++: static void Shift(int *ij, int n) V.Shift([int, ...], [int, ...]) C++: static void Shift(int *ij, int *n) Shifts by low corner of this, moving to the origin. SplitV.Split(int) -> vtkPixelExtent C++: vtkPixelExtent Split(int dir) Divide the extent in half in the given direction. The operation is done in-place the other half of the split extent is returned. The retunr will be empty if the split could not be made. CellToNodeV.CellToNode() C++: void CellToNode() V.CellToNode(vtkPixelExtent) -> vtkPixelExtent C++: static vtkPixelExtent CellToNode( const vtkPixelExtent &inputExt) In-place conversion from cell based to node based extent, and vise-versa. NodeToCellV.NodeToCell() C++: void NodeToCell() V.NodeToCell(vtkPixelExtent) -> vtkPixelExtent C++: static vtkPixelExtent NodeToCell( const vtkPixelExtent &inputExt) In-place conversion from cell based to node based extent, and vise-versa. Wi vtkPixelExtent@W vtkPixelExtentPi *iPP *i *ivtkPixelTransfervtkCommonDataModelPython.vtkPixelTransfervtkPixelTransfer - pixel extents Class to handle non-contiguous data transfers of data described by pixel extents within a process. For transferring data between processes see vtkPPixelTransfer. @sa vtkPixelExtent vtkPPixelTransfer vtkPixelTransfer() vtkPixelTransfer(const &vtkPixelTransfer) BlitV.Blit(vtkPixelExtent, int, int, void, int, void) -> int C++: static int Blit(const vtkPixelExtent &ext, int nComps, int srcType, void *srcData, int destType, void *destData) V.Blit(vtkPixelExtent, vtkPixelExtent, vtkPixelExtent, vtkPixelExtent, int, int, void, int, int, void) -> int C++: static int Blit(const vtkPixelExtent &srcWhole, const vtkPixelExtent &srcSubset, const vtkPixelExtent &destWhole, const vtkPixelExtent &destSubset, int nSrcComps, int srcType, void *srcData, int nDestComps, int destType, void *destData) for memory to memory transfers. Conveinience api for working with vtk type enum rather than c-data types and simple extents. @W vtkPixelTransfervtkPlaneCollectionvtkCommonDataModelPython.vtkPlaneCollectionvtkPlaneCollection - maintain a list of planes Superclass: vtkCollection vtkPlaneCollection is an object that creates and manipulates lists of objects of type vtkPlane. @sa vtkCollection V.SafeDownCast(vtkObjectBase) -> vtkPlaneCollection C++: static vtkPlaneCollection *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPlaneCollection C++: vtkPlaneCollection *NewInstance() V.AddItem(vtkPlane) C++: void AddItem(vtkPlane *) Add a plane to the list. V.GetNextItem() -> vtkPlane C++: vtkPlane *GetNextItem() Get the next plane in the list. V.GetItem(int) -> vtkPlane C++: vtkPlane *GetItem(int i) Get the ith plane in the list. vtkPlanevtkCommonDataModelPython.vtkPlanevtkPlane - perform various plane computations Superclass: vtkImplicitFunction vtkPlane provides methods for various plane computations. These include projecting points onto a plane, evaluating the plane equation, and returning plane normal. vtkPlane is a concrete implementation of the abstract class vtkImplicitFunction. V.SafeDownCast(vtkObjectBase) -> vtkPlane C++: static vtkPlane *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPlane C++: vtkPlane *NewInstance() V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) override; V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate plane equation for point x[3]. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate function gradient at point x[3]. V.GetNormal() -> (float, float, float) C++: double *GetNormal() Set/get plane normal. Plane is defined by point and normal. V.GetOrigin() -> (float, float, float) C++: double *GetOrigin() Set/get point through which plane passes. Plane is defined by point and normal. PushV.Push(float) C++: void Push(double distance) Translate the plane in the direction of the normal by the distance specified. Negative values move the plane in the opposite direction. ProjectPointV.ProjectPoint([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void ProjectPoint(double x[3], double origin[3], double normal[3], double xproj[3]) V.ProjectPoint([float, float, float], [float, float, float]) C++: void ProjectPoint(double x[3], double xproj[3]) Project a point x onto plane defined by origin and normal. The projected point is returned in xproj. NOTE : normal assumed to have magnitude 1. ProjectVectorV.ProjectVector([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void ProjectVector(double v[3], double origin[3], double normal[3], double vproj[3]) V.ProjectVector([float, float, float], [float, float, float]) C++: void ProjectVector(double v[3], double vproj[3]) Project a vector v onto plane defined by origin and normal. The projected vector is returned in vproj. GeneralizedProjectPointV.GeneralizedProjectPoint([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void GeneralizedProjectPoint(double x[3], double origin[3], double normal[3], double xproj[3]) V.GeneralizedProjectPoint([float, float, float], [float, float, float]) C++: void GeneralizedProjectPoint(double x[3], double xproj[3]) Project a point x onto plane defined by origin and normal. The projected point is returned in xproj. NOTE : normal does NOT have to have magnitude 1. EvaluateV.Evaluate([float, float, float], [float, float, float], [float, float, float]) -> float C++: static double Evaluate(double normal[3], double origin[3], double x[3]) Quick evaluation of plane equation n(x-origin)=0. DistanceToPlaneV.DistanceToPlane([float, float, float], [float, float, float], [float, float, float]) -> float C++: static double DistanceToPlane(double x[3], double n[3], double p0[3]) V.DistanceToPlane([float, float, float]) -> float C++: double DistanceToPlane(double x[3]) Return the distance of a point x to a plane defined by n(x-p0) = 0. The normal n[3] must be magnitude=1. V.IntersectWithLine([float, float, float], [float, float, float], [float, float, float], [float, float, float], float, [float, float, float]) -> int C++: static int IntersectWithLine(double p1[3], double p2[3], double n[3], double p0[3], double &t, double x[3]) V.IntersectWithLine([float, float, float], [float, float, float], float, [float, float, float]) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double &t, double x[3]) Given a line defined by the two points p1,p2; and a plane defined by the normal n and point p0, compute an intersection. The parametric coordinate along the line is returned in t, and the coordinates of intersection are returned in x. A zero is returned if the plane and line do not intersect between (0<=t<=1). If the plane and line are parallel, zero is returned and t is set to VTK_LARGE_DOUBLE. vtkPlanesvtkCommonDataModelPython.vtkPlanesvtkPlanes - implicit function for convex set of planes Superclass: vtkImplicitFunction vtkPlanes computes the implicit function and function gradient for a set of planes. The planes must define a convex space. The function value is the closest first order distance of a point to the convex region defined by the planes. The function gradient is the plane normal at the function value. Note that the normals must point outside of the convex region. Thus, a negative function value means that a point is inside the convex region. There are several methods to define the set of planes. The most general is to supply an instance of vtkPoints and an instance of vtkDataArray. (The points define a point on the plane, and the normals corresponding plane normals.) Two other specialized ways are to 1) supply six planes defining the view frustrum of a camera, and 2) provide a bounding box. @sa vtkCamera V.SafeDownCast(vtkObjectBase) -> vtkPlanes C++: static vtkPlanes *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPlanes C++: vtkPlanes *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate plane equations. Return smallest absolute value. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate planes gradient. V.SetPoints(vtkPoints) C++: virtual void SetPoints(vtkPoints *) Specify a list of points defining points through which the planes pass. V.GetPoints() -> vtkPoints C++: virtual vtkPoints *GetPoints() Specify a list of points defining points through which the planes pass. V.SetNormals(vtkDataArray) C++: void SetNormals(vtkDataArray *normals) Specify a list of normal vectors for the planes. There is a one-to-one correspondence between plane points and plane normals. V.GetNormals() -> vtkDataArray C++: virtual vtkDataArray *GetNormals() Specify a list of normal vectors for the planes. There is a one-to-one correspondence between plane points and plane normals. SetFrustumPlanesV.SetFrustumPlanes([float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void SetFrustumPlanes(double planes[24]) An alternative method to specify six planes defined by the camera view frustrum. See vtkCamera::GetFrustumPlanes() documentation. V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double bounds[6]) V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double xmin, double xmax, double ymin, double ymax, double zmin, double zmax) An alternative method to specify six planes defined by a bounding box. The bounding box is a six-vector defined as (xmin,xmax,ymin,ymax,zmin,zmax). It defines six planes orthogonal to the x-y-z coordinate axes. GetNumberOfPlanesV.GetNumberOfPlanes() -> int C++: int GetNumberOfPlanes() Return the number of planes in the set of planes. GetPlaneV.GetPlane(int) -> vtkPlane C++: vtkPlane *GetPlane(int i) V.GetPlane(int, vtkPlane) C++: void GetPlane(int i, vtkPlane *plane) Create and return a pointer to a vtkPlane object at the ith position. Asking for a plane outside the allowable range returns nullptr. This method always returns the same object. Use GetPlane(int i, vtkPlane *plane) instead. vtkCommonDataModelPython.vtkPlanesIntersectionvtkPlanesIntersection - A vtkPlanesIntersection object is a vtkPlanes object that can compute whether the arbitrary convex region bounded by it's planes intersects an axis-aligned box. Superclass: vtkPlanes A subclass of vtkPlanes, this class determines whether it intersects an axis aligned box. This is motivated by the need to intersect the axis aligned region of a spacial decomposition of volume data with various other regions. It uses the algorithm from Graphics Gems IV, page 81. @par Caveat: An instance of vtkPlanes can be redefined by changing the planes, but this subclass then will not know if the region vertices are up to date. (Region vertices can be specified in SetRegionVertices or computed by the subclass.) So Delete and recreate if you want to change the set of planes. V.SafeDownCast(vtkObjectBase) -> vtkPlanesIntersection C++: static vtkPlanesIntersection *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPlanesIntersection C++: vtkPlanesIntersection *NewInstance() SetRegionVerticesV.SetRegionVertices(vtkPoints) C++: void SetRegionVertices(vtkPoints *pts) V.SetRegionVertices([float, ...], int) C++: void SetRegionVertices(double *v, int nvertices) It helps if you know the vertices of the convex region. If you don't, we will calculate them. Region vertices are 3-tuples. GetNumberOfRegionVerticesV.GetNumberOfRegionVertices() -> int C++: int GetNumberOfRegionVertices() GetNumRegionVerticesV.GetNumRegionVertices() -> int C++: int GetNumRegionVertices() GetRegionVerticesV.GetRegionVertices([float, ...], int) -> int C++: int GetRegionVertices(double *v, int nvertices) V.IntersectsRegion(vtkPoints) -> int C++: int IntersectsRegion(vtkPoints *R) Return 1 if the axis aligned box defined by R intersects the region defined by the planes, or 0 otherwise. PolygonIntersectsBBoxV.PolygonIntersectsBBox([float, float, float, float, float, float], vtkPoints) -> int C++: static int PolygonIntersectsBBox(double bounds[6], vtkPoints *pts) A convenience function provided by this class, returns 1 if the polygon defined in pts intersects the bounding box defined in bounds, 0 otherwise. * The points must define a planar polygon. Convert3DCellV.Convert3DCell(vtkCell) -> vtkPlanesIntersection C++: static vtkPlanesIntersection *Convert3DCell(vtkCell *cell) Another convenience function provided by this class, returns the vtkPlanesIntersection object representing a 3D cell. The point IDs for each face must be given in counter-clockwise order from the outside of the cell. vtkCommonDataModelPython.vtkPointDatavtkPointData - represent and manipulate point attribute data Superclass: vtkDataSetAttributes vtkPointData is a class that is used to represent and manipulate point attribute data (e.g., scalars, vectors, normals, texture coordinates, etc.) Most of the functionality is handled by vtkDataSetAttributes V.SafeDownCast(vtkObjectBase) -> vtkPointData C++: static vtkPointData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPointData C++: vtkPointData *NewInstance() NullPointV.NullPoint(int) C++: void NullPoint(vtkIdType ptId) vtkCommonDataModelPython.vtkPointLocatorvtkPointLocator - quickly locate points in 3-space Superclass: vtkIncrementalPointLocator vtkPointLocator is a spatial search object to quickly locate points in 3D. vtkPointLocator works by dividing a specified region of space into a regular array of "rectangular" buckets, and then keeping a list of points that lie in each bucket. Typical operation involves giving a position in 3D and finding the closest point. vtkPointLocator has two distinct methods of interaction. In the first method, you supply it with a dataset, and it operates on the points in the dataset. In the second method, you supply it with an array of points, and the object operates on the array. @warning Many other types of spatial locators have been developed such as octrees and kd-trees. These are often more efficient for the operations described here. @sa vtkCellPicker vtkPointPicker vtkStaticPointLocator V.SafeDownCast(vtkObjectBase) -> vtkPointLocator C++: static vtkPointLocator *SafeDownCast(vtkObjectBase *o) Standard methods for type management and printing. V.NewInstance() -> vtkPointLocator C++: vtkPointLocator *NewInstance() Standard methods for type management and printing. SetDivisionsV.SetDivisions(int, int, int) C++: void SetDivisions(int, int, int) V.SetDivisions((int, int, int)) C++: void SetDivisions(int a[3]) GetDivisionsV.GetDivisions() -> (int, int, int) C++: int *GetDivisions() Set the number of divisions in x-y-z directions. SetNumberOfPointsPerBucketV.SetNumberOfPointsPerBucket(int) C++: virtual void SetNumberOfPointsPerBucket(int _arg) Specify the average number of points in each bucket. GetNumberOfPointsPerBucketMinValueV.GetNumberOfPointsPerBucketMinValue() -> int C++: virtual int GetNumberOfPointsPerBucketMinValue() Specify the average number of points in each bucket. GetNumberOfPointsPerBucketMaxValueV.GetNumberOfPointsPerBucketMaxValue() -> int C++: virtual int GetNumberOfPointsPerBucketMaxValue() Specify the average number of points in each bucket. GetNumberOfPointsPerBucketV.GetNumberOfPointsPerBucket() -> int C++: virtual int GetNumberOfPointsPerBucket() Specify the average number of points in each bucket. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z) Given a position x, return the id of the point closest to it. Alternative method requires separate x-y-z values. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; V.FindClosestPointWithinRadius(float, (float, float, float), float, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double inputDataLength, double &dist2) Given a position x and a radius r, return the id of the point closest to the point in that radius. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. dist2 returns the squared distance to the point. V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float)) -> int C++: int InitPointInsertion(vtkPoints *newPts, const double bounds[6]) override; V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float), int) -> int C++: int InitPointInsertion(vtkPoints *newPts, const double bounds[6], vtkIdType estSize) override; Initialize the point insertion process. The newPts is an object representing point coordinates into which incremental insertion methods place their data. Bounds are the box that the points lie in. Not thread safe. V.InsertPoint(int, (float, float, float)) C++: void InsertPoint(vtkIdType ptId, const double x[3]) override; Incrementally insert a point into search structure with a particular index value. You should use the method IsInsertedPoint() to see whether this point has already been inserted (that is, if you desire to prevent duplicate points). Before using this method you must make sure that newPts have been supplied, the bounds has been set properly, and that divs are properly set. (See InitPointInsertion().) Not thread safe. V.InsertNextPoint((float, float, float)) -> int C++: vtkIdType InsertNextPoint(const double x[3]) override; Incrementally insert a point into search structure. The method returns the insertion location (i.e., point id). You should use the method IsInsertedPoint() to see whether this point has already been inserted (that is, if you desire to prevent duplicate points). Before using this method you must make sure that newPts have been supplied, the bounds has been set properly, and that divs are properly set. (See InitPointInsertion().) Not thread safe. V.IsInsertedPoint(float, float, float) -> int C++: vtkIdType IsInsertedPoint(double x, double y, double z) override; V.IsInsertedPoint((float, float, float)) -> int C++: vtkIdType IsInsertedPoint(const double x[3]) override; Determine whether point given by x[3] has been inserted into points list. Return id of previously inserted point if this is true, otherwise return -1. This method is thread safe. V.InsertUniquePoint((float, float, float), int) -> int C++: int InsertUniquePoint(const double x[3], vtkIdType &ptId) override; Determine whether point given by x[3] has been inserted into points list. Return 0 if point was already in the list, otherwise return 1. If the point was not in the list, it will be ADDED. In either case, the id of the point (newly inserted or not) is returned in the ptId argument. Note this combines the functionality of IsInsertedPoint() followed by a call to InsertNextPoint(). This method is not thread safe. V.FindClosestInsertedPoint((float, float, float)) -> int C++: vtkIdType FindClosestInsertedPoint(const double x[3]) override; Given a position x, return the id of the point closest to it. This method is used when performing incremental point insertion. Note that -1 indicates that no point was found. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. FindDistributedPointsV.FindDistributedPoints(int, (float, float, float), vtkIdList, int) C++: virtual void FindDistributedPoints(int N, const double x[3], vtkIdList *result, int M) V.FindDistributedPoints(int, float, float, float, vtkIdList, int) C++: virtual void FindDistributedPoints(int N, double x, double y, double z, vtkIdList *result, int M) Find the closest points to a position such that each octant of space around the position contains at least N points. Loosely limit the search to a maximum number of points evaluated, M. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. GetPointsInBucketV.GetPointsInBucket((float, float, float), [int, int, int]) -> vtkIdList C++: virtual vtkIdList *GetPointsInBucket(const double x[3], int ijk[3]) Given a position x, return the list of points in the bucket that contains the point. It is possible that nullptr is returned. The user provides an ijk array that is the indices into the locator. This method is thread safe. V.GetPoints() -> vtkPoints C++: virtual vtkPoints *GetPoints() Provide an accessor to the points. V.Initialize() C++: void Initialize() override; See vtkLocator interface documentation. These methods are not thread safe. vtkCommonDataModelPython.vtkPointSetvtkPointSet - abstract class for specifying dataset behavior Superclass: vtkDataSet vtkPointSet is an abstract class that specifies the interface for datasets that explicitly use "point" arrays to represent geometry. For example, vtkPolyData and vtkUnstructuredGrid require point arrays to specify point position, while vtkStructuredGrid generates point positions implicitly. @sa vtkPolyData vtkStructuredGrid vtkUnstructuredGrid V.SafeDownCast(vtkObjectBase) -> vtkPointSet C++: static vtkPointSet *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPointSet C++: vtkPointSet *NewInstance() V.Initialize() C++: void Initialize() override; Reset to an empty state and free any memory. V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *pd) override; Copy the geometric structure of an input point set object. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; See vtkDataSet for additional information. V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType ptId, double x[3]) override; V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; See vtkDataSet for additional information. V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; V.FindPoint(float, float, float) -> int C++: vtkIdType FindPoint(double x, double y, double z) See vtkDataSet for additional information. V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; See vtkDataSet for additional information. V.NewCellIterator() -> vtkCellIterator C++: vtkCellIterator *NewCellIterator() override; Return an iterator that traverses the cells in this data set. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Get MTime which also considers its vtkPoints MTime. V.ComputeBounds() C++: void ComputeBounds() override; Compute the (X, Y, Z) bounds of the data. V.Squeeze() C++: void Squeeze() override; Reclaim any unused memory. V.SetPoints(vtkPoints) C++: virtual void SetPoints(vtkPoints *) Specify point array to define point coordinates. V.GetPoints() -> vtkPoints C++: virtual vtkPoints *GetPoints() Specify point array to define point coordinates. V.GetData(vtkInformation) -> vtkPointSet C++: static vtkPointSet *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkPointSet C++: static vtkPointSet *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkPointSetCellIteratorvtkCommonDataModelPython.vtkPointSetCellIteratorvtkPointSetCellIterator - Implementation of vtkCellIterator using vtkPointSet API. Superclass: vtkCellIterator V.SafeDownCast(vtkObjectBase) -> vtkPointSetCellIterator C++: static vtkPointSetCellIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkPointSetCellIterator C++: vtkPointSetCellIterator *NewInstance() vtkPointsProjectedHullvtkCommonDataModelPython.vtkPointsProjectedHullvtkPointsProjectedHull - the convex hull of the orthogonal projection of the vtkPoints in the 3 coordinate directions Superclass: vtkPoints a subclass of vtkPoints, it maintains the counter clockwise convex hull of the points (projected orthogonally in the three coordinate directions) and has a method to test for intersection of that hull with an axis aligned rectangle. This is used for intersection tests of 3D volumes. V.SafeDownCast(vtkObjectBase) -> vtkPointsProjectedHull C++: static vtkPointsProjectedHull *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPointsProjectedHull C++: vtkPointsProjectedHull *NewInstance() RectangleIntersectionXV.RectangleIntersectionX(vtkPoints) -> int C++: int RectangleIntersectionX(vtkPoints *R) V.RectangleIntersectionX(float, float, float, float) -> int C++: int RectangleIntersectionX(double ymin, double ymax, double zmin, double zmax) determine whether the resulting rectangle intersects the convex hull of the projection of the points along that axis. RectangleIntersectionYV.RectangleIntersectionY(vtkPoints) -> int C++: int RectangleIntersectionY(vtkPoints *R) V.RectangleIntersectionY(float, float, float, float) -> int C++: int RectangleIntersectionY(double zmin, double zmax, double xmin, double xmax) of the parallel projection along the Y axis of the points RectangleIntersectionZV.RectangleIntersectionZ(vtkPoints) -> int C++: int RectangleIntersectionZ(vtkPoints *R) V.RectangleIntersectionZ(float, float, float, float) -> int C++: int RectangleIntersectionZ(double xmin, double xmax, double ymin, double ymax) of the parallel projection along the Z axis of the points GetCCWHullXV.GetCCWHullX([float, ...], int) -> int C++: int GetCCWHullX(double *pts, int len) GetCCWHullYV.GetCCWHullY([float, ...], int) -> int C++: int GetCCWHullY(double *pts, int len) GetCCWHullZV.GetCCWHullZ([float, ...], int) -> int C++: int GetCCWHullZ(double *pts, int len) GetSizeCCWHullXV.GetSizeCCWHullX() -> int C++: int GetSizeCCWHullX() Returns the number of points in the convex hull of the projection of the points down the positive x-axis GetSizeCCWHullYV.GetSizeCCWHullY() -> int C++: int GetSizeCCWHullY() Returns the number of points in the convex hull of the projection of the points down the positive y-axis GetSizeCCWHullZV.GetSizeCCWHullZ() -> int C++: int GetSizeCCWHullZ() Returns the number of points in the convex hull of the projection of the points down the positive z-axis V.Initialize() C++: void Initialize() override; Return object to instantiated state. V.Reset() C++: void Reset() override; Make object look empty but do not delete memory. V.Update() C++: void Update() Forces recalculation of convex hulls, use this if you delete/add points vtkPolyDataCollectionvtkCommonDataModelPython.vtkPolyDataCollectionvtkPolyDataCollection - maintain a list of polygonal data objects Superclass: vtkCollection vtkPolyDataCollection is an object that creates and manipulates ordered lists of datasets of type vtkPolyData. @sa vtkDataSetCollection vtkCollection V.SafeDownCast(vtkObjectBase) -> vtkPolyDataCollection C++: static vtkPolyDataCollection *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolyDataCollection C++: vtkPolyDataCollection *NewInstance() V.AddItem(vtkPolyData) C++: void AddItem(vtkPolyData *pd) Add a poly data to the bottom of the list. V.GetNextItem() -> vtkPolyData C++: vtkPolyData *GetNextItem() Get the next poly data in the list. ERR_NO_SUCH_FIELDERR_INCORRECT_FIELDERR_NON_MANIFOLD_STARREGULAR_POINTMINIMUMSADDLEMAXIMUMvtkCommonDataModelPython.vtkPolyDatavtkPolyData - concrete dataset represents vertices, lines, polygons, and triangle strips Superclass: vtkPointSet vtkPolyData is a data object that is a concrete implementation of vtkDataSet. vtkPolyData represents a geometric structure consisting of vertices, lines, polygons, and/or triangle strips. Point and cell attribute values (e.g., scalars, vectors, etc.) also are represented. The actual cell types (vtkCellType.h) supported by vtkPolyData are: vtkVertex, vtkPolyVertex, vtkLine, vtkPolyLine, vtkTriangle, vtkQuad, vtkPolygon, and vtkTriangleStrip. One important feature of vtkPolyData objects is that special traversal and data manipulation methods are available to process data. These methods are generally more efficient than vtkDataSet methods and should be used whenever possible. For example, traversing the cells in a dataset we would use GetCell(). To traverse cells with vtkPolyData we would retrieve the cell array object representing polygons (for example using GetPolys()) and then use vtkCellArray's InitTraversal() and GetNextCell() methods. @warning Because vtkPolyData is implemented with four separate instances of vtkCellArray to represent 0D vertices, 1D lines, 2D polygons, and 2D triangle strips, it is possible to create vtkPolyData instances that consist of a mixture of cell types. Because of the design of the class, there are certain limitations on how mixed cell types are inserted into the vtkPolyData, and in turn the order in which they are processed and rendered. To preserve the consistency of cell ids, and to insure that cells with cell data are rendered properly, users must insert mixed cells in the order of vertices (vtkVertex and vtkPolyVertex), lines (vtkLine and vtkPolyLine), polygons (vtkTriangle, vtkQuad, vtkPolygon), and triangle strips (vtkTriangleStrip). @warning Some filters when processing vtkPolyData with mixed cell types may process the cells in differing ways. Some will convert one type into another (e.g., vtkTriangleStrip into vtkTriangles) or expect a certain type (vtkDecimatePro expects triangles or triangle strips; vtkTubeFilter expects lines). Read the documentation for each filter carefully to understand how each part of vtkPolyData is processed. V.SafeDownCast(vtkObjectBase) -> vtkPolyData C++: static vtkPolyData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolyData C++: vtkPolyData *NewInstance() V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Copy the geometric and topological structure of an input poly data object. V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Standard vtkDataSet interface. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; V.GetCell(int, [int, ...]) -> int C++: unsigned char GetCell(vtkIdType cellId, vtkIdType *&pts) V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) Standard vtkDataSet interface. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType cellId) override; Standard vtkDataSet interface. V.GetCellBounds(int, [float, float, float, float, float, float]) C++: void GetCellBounds(vtkIdType cellId, double bounds[6]) override; Standard vtkDataSet interface. V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; Standard vtkDataSet interface. CopyCellsV.CopyCells(vtkPolyData, vtkIdList, vtkPointLocator) C++: void CopyCells(vtkPolyData *pd, vtkIdList *idList, vtkPointLocator *locator=nullptr) Copy cells listed in idList from pd, including points, point data, and cell data. This method assumes that point and cell data have been allocated. If you pass in a point locator, then the points won't be duplicated in the output. V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) override; V.GetCellPoints(int, int, [int, ...]) -> int C++: unsigned char GetCellPoints(vtkIdType cellId, vtkIdType &npts, vtkIdType *&pts) Copy a cells point ids into list provided. (Less efficient.) V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; V.GetPointCells(int, int, [int, ...]) C++: void GetPointCells(vtkIdType ptId, unsigned short &ncells, vtkIdType *&cells) Efficient method to obtain cells using a particular point. Make sure that routine BuildLinks() has been called. V.Squeeze() C++: void Squeeze() override; Recover extra allocated memory when creating data whose initial size is unknown. Examples include using the InsertNextCell() method, or when using the CellArray::EstimateSize() method to create vertices, lines, polygons, or triangle strips. SetVertsV.SetVerts(vtkCellArray) C++: void SetVerts(vtkCellArray *v) Set the cell array defining vertices. GetVertsV.GetVerts() -> vtkCellArray C++: vtkCellArray *GetVerts() Get the cell array defining vertices. If there are no vertices, an empty array will be returned (convenience to simplify traversal). SetLinesV.SetLines(vtkCellArray) C++: void SetLines(vtkCellArray *l) Set the cell array defining lines. GetLinesV.GetLines() -> vtkCellArray C++: vtkCellArray *GetLines() Get the cell array defining lines. If there are no lines, an empty array will be returned (convenience to simplify traversal). SetPolysV.SetPolys(vtkCellArray) C++: void SetPolys(vtkCellArray *p) Set the cell array defining polygons. GetPolysV.GetPolys() -> vtkCellArray C++: vtkCellArray *GetPolys() Get the cell array defining polygons. If there are no polygons, an empty array will be returned (convenience to simplify traversal). SetStripsV.SetStrips(vtkCellArray) C++: void SetStrips(vtkCellArray *s) Set the cell array defining triangle strips. GetStripsV.GetStrips() -> vtkCellArray C++: vtkCellArray *GetStrips() Get the cell array defining triangle strips. If there are no triangle strips, an empty array will be returned (convenience to simplify traversal). GetNumberOfVertsV.GetNumberOfVerts() -> int C++: vtkIdType GetNumberOfVerts() Return the number of primitives of a particular type held. GetNumberOfLinesV.GetNumberOfLines() -> int C++: vtkIdType GetNumberOfLines() Return the number of primitives of a particular type held. GetNumberOfPolysV.GetNumberOfPolys() -> int C++: vtkIdType GetNumberOfPolys() Return the number of primitives of a particular type held. GetNumberOfStripsV.GetNumberOfStrips() -> int C++: vtkIdType GetNumberOfStrips() Return the number of primitives of a particular type held. V.Allocate(int, int) C++: void Allocate(vtkIdType numCells=1000, int extSize=1000) V.Allocate(vtkPolyData, int, int) C++: void Allocate(vtkPolyData *inPolyData, vtkIdType numCells=1000, int extSize=1000) Method allocates initial storage for vertex, line, polygon, and triangle strip arrays. Use this method before the method PolyData::InsertNextCell(). (Or, provide vertex, line, polygon, and triangle strip cell arrays.) The array capacity is doubled when the inserting a cell exceeds the current capacity. extSize is no longer used. V.InsertNextCell(int, int, [int, ...]) -> int C++: vtkIdType InsertNextCell(int type, int npts, vtkIdType *pts) V.InsertNextCell(int, vtkIdList) -> int C++: vtkIdType InsertNextCell(int type, vtkIdList *pts) Insert a cell of type VTK_VERTEX, VTK_POLY_VERTEX, VTK_LINE, VTK_POLY_LINE, VTK_TRIANGLE, VTK_QUAD, VTK_POLYGON, or VTK_TRIANGLE_STRIP. Make sure that the PolyData::Allocate() function has been called first or that vertex, line, polygon, and triangle strip arrays have been supplied. Note: will also insert VTK_PIXEL, but converts it to VTK_QUAD. BuildCellsV.BuildCells() C++: void BuildCells() Create data structure that allows random access of cells. BuildCells is expensive but necessary to make use of the faster non-virtual implementations of GetCell/GetCellPoints. One may check if cells need to be built via NeedToBuilds before invoking. Cells always need to be built/re-built after low level direct modifications to verts, lines, polys or strips cell arrays. NeedToBuildCellsV.NeedToBuildCells() -> bool C++: bool NeedToBuildCells() Check if BuildCells is needed. V.BuildLinks(int) C++: void BuildLinks(int initialSize=0) Create upward links from points to cells that use each point. Enables topologically complex queries. Normally the links array is allocated based on the number of points in the vtkPolyData. The optional initialSize parameter can be used to allocate a larger size initially. DeleteCellsV.DeleteCells() C++: void DeleteCells() Release data structure that allows random access of the cells. This must be done before a 2nd call to BuildLinks(). DeleteCells implicitly deletes the links as well since they are no longer valid. DeleteLinksV.DeleteLinks() C++: void DeleteLinks() Release the upward links from point to cells that use each point. GetCellEdgeNeighborsV.GetCellEdgeNeighbors(int, int, int, vtkIdList) C++: void GetCellEdgeNeighbors(vtkIdType cellId, vtkIdType p1, vtkIdType p2, vtkIdList *cellIds) Get the neighbors at an edge. More efficient than the general GetCellNeighbors(). Assumes links have been built (with BuildLinks()), and looks specifically for edge neighbors. IsTriangleV.IsTriangle(int, int, int) -> int C++: int IsTriangle(int v1, int v2, int v3) Given three vertices, determine whether it's a triangle. Make sure BuildLinks() has been called first. V.IsEdge(int, int) -> int C++: int IsEdge(vtkIdType p1, vtkIdType p2) Determine whether two points form an edge. If they do, return non-zero. By definition PolyVertex and PolyLine have no edges since 1-dimensional edges are only found on cells 2D and higher. Edges are defined as 1-D boundary entities to cells. Make sure BuildLinks() has been called first. IsPointUsedByCellV.IsPointUsedByCell(int, int) -> int C++: int IsPointUsedByCell(vtkIdType ptId, vtkIdType cellId) Determine whether a point is used by a particular cell. If it is, return non-zero. Make sure BuildCells() has been called first. V.ReplaceCell(int, int, [int, ...]) C++: void ReplaceCell(vtkIdType cellId, int npts, vtkIdType *pts) Replace the points defining cell "cellId" with a new set of points. This operator is (typically) used when links from points to cells have not been built (i.e., BuildLinks() has not been executed). Use the operator ReplaceLinkedCell() to replace a cell when cell structure has been built. ReplaceCellPointV.ReplaceCellPoint(int, int, int) C++: void ReplaceCellPoint(vtkIdType cellId, vtkIdType oldPtId, vtkIdType newPtId) Replace a point in the cell connectivity list with a different point. V.ReverseCell(int) C++: void ReverseCell(vtkIdType cellId) Reverse the order of point ids defining the cell. V.DeletePoint(int) C++: void DeletePoint(vtkIdType ptId) Mark a point/cell as deleted from this vtkPolyData. V.DeleteCell(int) C++: void DeleteCell(vtkIdType cellId) Mark a point/cell as deleted from this vtkPolyData. RemoveDeletedCellsV.RemoveDeletedCells() C++: void RemoveDeletedCells() The cells marked by calls to DeleteCell are stored in the Cell Array VTK_EMPTY_CELL, but they still exist in the cell arrays. Calling RemoveDeletedCells will traverse the cell arrays and remove/compact the cell arrays as well as any cell data thus truly removing the cells from the polydata object. InsertNextLinkedPointV.InsertNextLinkedPoint(int) -> int C++: vtkIdType InsertNextLinkedPoint(int numLinks) V.InsertNextLinkedPoint([float, float, float], int) -> int C++: vtkIdType InsertNextLinkedPoint(double x[3], int numLinks) Add a point to the cell data structure (after cell pointers have been built). This method adds the point and then allocates memory for the links to the cells. (To use this method, make sure points are available and BuildLinks() has been invoked.) Of the two methods below, one inserts a point coordinate and the other just makes room for cell links. InsertNextLinkedCellV.InsertNextLinkedCell(int, int, [int, ...]) -> int C++: vtkIdType InsertNextLinkedCell(int type, int npts, vtkIdType *pts) Add a new cell to the cell data structure (after cell pointers have been built). This method adds the cell and then updates the links from the points to the cells. (Memory is allocated as necessary.) ReplaceLinkedCellV.ReplaceLinkedCell(int, int, [int, ...]) C++: void ReplaceLinkedCell(vtkIdType cellId, int npts, vtkIdType *pts) Replace one cell with another in cell structure. This operator updates the connectivity list and the point's link list. It does not delete references to the old cell in the point's link list. Use the operator RemoveCellReference() to delete all references from points to (old) cell. You may also want to consider using the operator ResizeCellList() if the link list is changing size. V.RemoveCellReference(int) C++: void RemoveCellReference(vtkIdType cellId) Remove all references to cell in cell structure. This means the links from the cell's points to the cell are deleted. Memory is not reclaimed. Use the method ResizeCellList() to resize the link list from a point to its using cells. (This operator assumes BuildLinks() has been called.) V.AddCellReference(int) C++: void AddCellReference(vtkIdType cellId) Add references to cell in cell structure. This means the links from the cell's points to the cell are modified. Memory is not extended. Use the method ResizeCellList() to resize the link list from a point to its using cells. (This operator assumes BuildLinks() has been called.) RemoveReferenceToCellV.RemoveReferenceToCell(int, int) C++: void RemoveReferenceToCell(vtkIdType ptId, vtkIdType cellId) Remove a reference to a cell in a particular point's link list. You may also consider using RemoveCellReference() to remove the references from all the cell's points to the cell. This operator does not reallocate memory; use the operator ResizeCellList() to do this if necessary. AddReferenceToCellV.AddReferenceToCell(int, int) C++: void AddReferenceToCell(vtkIdType ptId, vtkIdType cellId) Add a reference to a cell in a particular point's link list. (You may also consider using AddCellReference() to add the references from all the cell's points to the cell.) This operator does not realloc memory; use the operator ResizeCellList() to do this if necessary. V.ResizeCellList(int, int) C++: void ResizeCellList(vtkIdType ptId, int size) Resize the list of cells using a particular point. (This operator assumes that BuildLinks() has been called.) V.Initialize() C++: void Initialize() override; Restore object to initial state. Release memory back to system. V.GetPiece() -> int C++: virtual int GetPiece() Get the piece and the number of pieces. Similar to extent in 3D. V.GetNumberOfPieces() -> int C++: virtual int GetNumberOfPieces() Get the piece and the number of pieces. Similar to extent in 3D. GetGhostLevelV.GetGhostLevel() -> int C++: virtual int GetGhostLevel() Get the ghost level. RemoveGhostCellsV.RemoveGhostCells() C++: void RemoveGhostCells() This method will remove any cell that is marked as ghost (has the vtkDataSetAttributes::DUPLICATECELL bit set). It does not remove unused points. V.GetData(vtkInformation) -> vtkPolyData C++: static vtkPolyData *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkPolyData C++: static vtkPolyData *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. GetScalarFieldCriticalIndexV.GetScalarFieldCriticalIndex(int, vtkDataArray) -> int C++: int GetScalarFieldCriticalIndex(vtkIdType pointId, vtkDataArray *scalarField) V.GetScalarFieldCriticalIndex(int, int) -> int C++: int GetScalarFieldCriticalIndex(vtkIdType pointId, int fieldId) V.GetScalarFieldCriticalIndex(int, string) -> int C++: int GetScalarFieldCriticalIndex(vtkIdType pointId, const char *fieldName) GetMeshMTimeV.GetMeshMTime() -> int C++: virtual vtkMTimeType GetMeshMTime() Return the mesh (geometry/topology) modification time. This time is different from the usual MTime which also takes into account the modification of data arrays. This function can be used to track the changes on the mesh separately from the data arrays (eg. static mesh over time with transient data). @kV *vtkGenericCell@kP *k@|ki@V|ki *vtkPolyData@kV *vtkDataArray@ki@kzvtkPolygonvtkCommonDataModelPython.vtkPolygonvtkPolygon - a cell that represents an n-sided polygon Superclass: vtkCell vtkPolygon is a concrete implementation of vtkCell to represent a 2D n-sided polygon. The polygons cannot have any internal holes, and cannot self-intersect. Define the polygon with n-points ordered in the counter- clockwise direction; do not repeat the last point. V.SafeDownCast(vtkObjectBase) -> vtkPolygon C++: static vtkPolygon *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolygon C++: vtkPolygon *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tris, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; V.Triangulate(vtkIdList) -> int C++: int Triangulate(vtkIdList *outTris) See the vtkCell API for descriptions of these methods. ComputeAreaV.ComputeArea() -> float C++: double ComputeArea() V.ComputeArea(vtkPoints, int, [int, ...], [float, float, float]) -> float C++: static double ComputeArea(vtkPoints *p, vtkIdType numPts, vtkIdType *pts, double normal[3]) Compute the area of a polygon. This is a convenience function which simply calls static double ComputeArea(vtkPoints *p, vtkIdType numPts, vtkIdType *pts, double normal[3]); with the appropriate parameters from the instantiated vtkPolygon. V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double x[3], double *sf) override; Compute the interpolation functions/derivatives. (aka shape functions/derivatives) Two interpolation algorithms are available: 1/r^2 and Mean Value Coordinate. The former is used by default. To use the second algorithm, set UseMVCInterpolation to be true. The function assumes the input point lies on the polygon plane without checking that. ComputeNormalV.ComputeNormal(vtkPoints, int, [int, ...], [float, float, float]) C++: static void ComputeNormal(vtkPoints *p, int numPts, vtkIdType *pts, double n[3]) V.ComputeNormal(vtkPoints, [float, float, float]) C++: static void ComputeNormal(vtkPoints *p, double n[3]) V.ComputeNormal(vtkIdTypeArray, vtkPoints, [float, float, float]) C++: static void ComputeNormal(vtkIdTypeArray *ids, vtkPoints *pts, double n[3]) V.ComputeNormal(int, [float, ...], [float, float, float]) C++: static void ComputeNormal(int numPts, double *pts, double n[3]) Computes the unit normal to the polygon. If pts=nullptr, point indexing is assummed to be {0, 1, ..., numPts-1}. IsConvexV.IsConvex() -> bool C++: bool IsConvex() V.IsConvex(vtkPoints, int, [int, ...]) -> bool C++: static bool IsConvex(vtkPoints *p, int numPts, vtkIdType *pts) V.IsConvex(vtkIdTypeArray, vtkPoints) -> bool C++: static bool IsConvex(vtkIdTypeArray *ids, vtkPoints *p) V.IsConvex(vtkPoints) -> bool C++: static bool IsConvex(vtkPoints *p) Determine whether or not a polygon is convex. This is a convenience function that simply calls static bool IsConvex(int numPts, vtkIdType *pts, vtkPoints *p) with the appropriate parameters from the instantiated vtkPolygon. ComputeCentroidV.ComputeCentroid(vtkPoints, int, [int, ...], [float, float, float]) -> bool C++: static bool ComputeCentroid(vtkPoints *p, int numPts, vtkIdType *pts, double centroid[3]) V.ComputeCentroid(vtkIdTypeArray, vtkPoints, [float, float, float]) -> bool C++: static bool ComputeCentroid(vtkIdTypeArray *ids, vtkPoints *pts, double centroid[3]) Compute the centroid of a set of points. Returns false if the computation is invalid (this occurs when numPts=0 or when ids is empty). ParameterizePolygonV.ParameterizePolygon([float, float, float], [float, float, float], float, [float, float, float], float, [float, float, float]) -> int C++: int ParameterizePolygon(double p0[3], double p10[3], double &l10, double p20[3], double &l20, double n[3]) Create a local s-t coordinate system for a polygon. The point p0 is the origin of the local system, p10 is s-axis vector, and p20 is the t-axis vector. (These are expressed in the modeling coordinate system and are vectors of dimension [3].) The values l20 and l20 are the lengths of the vectors p10 and p20, and n is the polygon normal. PointInPolygonV.PointInPolygon([float, float, float], int, [float, ...], [float, float, float, float, float, float], [float, float, float]) -> int C++: static int PointInPolygon(double x[3], int numPts, double *pts, double bounds[6], double n[3]) Determine whether point is inside polygon. Function uses ray-casting to determine if point is inside polygon. Works for arbitrary polygon shape (e.g., non-convex). Returns 0 if point is not in polygon; 1 if it is. Can also return -1 to indicate degenerate polygon. NonDegenerateTriangulateV.NonDegenerateTriangulate(vtkIdList) -> int C++: int NonDegenerateTriangulate(vtkIdList *outTris) Same as Triangulate(vtkIdList *outTris) but with a first pass to split the polygon into non-degenerate polygons. BoundedTriangulateV.BoundedTriangulate(vtkIdList, float) -> int C++: int BoundedTriangulate(vtkIdList *outTris, double tol) Triangulate polygon and enforce that the ratio of the smallest triangle area to the polygon area is greater than a user-defined tolerance. The user must provide the vtkIdList outTris. On output, the outTris list contains the ids of the points defining the triangulation. The ids are ordered into groups of three: each three-group defines one triangle. DistanceToPolygonV.DistanceToPolygon([float, float, float], int, [float, ...], [float, float, float, float, float, float], [float, float, float]) -> float C++: static double DistanceToPolygon(double x[3], int numPts, double *pts, double bounds[6], double closest[3]) Compute the distance of a point to a polygon. The closest point on the polygon is also returned. The bounds should be provided to accelerate the computation. IntersectPolygonWithPolygonV.IntersectPolygonWithPolygon(int, [float, ...], [float, float, float, float, float, float], int, [float, ...], [float, float, float], float, [float, float, float]) -> int C++: static int IntersectPolygonWithPolygon(int npts, double *pts, double bounds[6], int npts2, double *pts2, double bounds2[3], double tol, double x[3]) Method intersects two polygons. You must supply the number of points and point coordinates (npts, *pts) and the bounding box (bounds) of the two polygons. Also supply a tolerance squared for controlling error. The method returns 1 if there is an intersection, and 0 if not. A single point of intersection x[3] is also returned if there is an intersection. IntersectConvex2DCellsV.IntersectConvex2DCells(vtkCell, vtkCell, float, [float, float, float], [float, float, float]) -> int C++: static int IntersectConvex2DCells(vtkCell *cell1, vtkCell *cell2, double tol, double p0[3], double p1[3]) Intersect two convex 2D polygons to produce a line segment as output. The return status of the methods indicated no intersection (returns 0); a single point of intersection (returns 1); or a line segment (i.e., two points of intersection, returns 2). The points of intersection are returned in the arrays p0 and p1. If less than two points of intersection are generated then p1 and/or p0 may be indeterminiate. Finally, if the two convex polygons are parallel, then "0" is returned (i.e., no intersection) even if the triangles lie on one another. GetUseMVCInterpolationV.GetUseMVCInterpolation() -> bool C++: virtual bool GetUseMVCInterpolation() Set/Get the flag indicating whether to use Mean Value Coordinate for the interpolation. If true, InterpolateFunctions() uses the Mean Value Coordinate to compute weights. Otherwise, the conventional 1/r^2 method is used. The UseMVCInterpolation parameter is set to false by default. SetUseMVCInterpolationV.SetUseMVCInterpolation(bool) C++: virtual void SetUseMVCInterpolation(bool _arg) Set/Get the flag indicating whether to use Mean Value Coordinate for the interpolation. If true, InterpolateFunctions() uses the Mean Value Coordinate to compute weights. Otherwise, the conventional 1/r^2 method is used. The UseMVCInterpolation parameter is set to false by default. VVP *vtkIdTypeArray *vtkPoints *diPP *d *dvtkPolyhedronvtkCommonDataModelPython.vtkPolyhedronvtkPolyhedron - a 3D cell defined by a set of polygonal faces Superclass: vtkCell3D vtkPolyhedron is a concrete implementation that represents a 3D cell defined by a set of polygonal faces. The polyhedron should be watertight, non-self-intersecting and manifold (each edge is used twice). Interpolation functions and weights are defined / computed using the method of Mean Value Coordinates (MVC). See the VTK class vtkMeanValueCoordinatesInterpolator for more information. The class does not require the polyhedron to be convex. However, the polygonal faces must be planar. Non-planar polygonal faces will definitely cause problems, especially in severely warped situations. @sa vtkCell3D vtkConvecPointSet vtkMeanValueCoordinatesInterpolator V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard new methods. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard new methods. V.SafeDownCast(vtkObjectBase) -> vtkPolyhedron C++: static vtkPolyhedron *SafeDownCast(vtkObjectBase *o) Standard new methods. V.NewInstance() -> vtkPolyhedron C++: vtkPolyhedron *NewInstance() Standard new methods. V.GetNumberOfEdges() -> int C++: int GetNumberOfEdges() override; A polyhedron is represented internally by a set of polygonal faces. These faces can be processed to explicitly determine edges. V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int) override; A polyhedron is represented internally by a set of polygonal faces. These faces can be processed to explicitly determine edges. V.GetNumberOfFaces() -> int C++: int GetNumberOfFaces() override; A polyhedron is represented internally by a set of polygonal faces. These faces can be processed to explicitly determine edges. V.GetFace(int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; A polyhedron is represented internally by a set of polygonal faces. These faces can be processed to explicitly determine edges. V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *scalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; Satisfy the vtkCell API. This method contours the input polyhedron and outputs a polygon. When the result polygon is not planar, it will be triangulated. The current implementation assumes water-tight polyhedron cells. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *scalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Satisfy the vtkCell API. This method clips the input polyhedron and outputs a new polyhedron. The face information of the output polyhedron is encoded in the output vtkCellArray using a special format: CellLength [nCellFaces, nFace0Pts, i, j, k, nFace1Pts, i, j, k, ...]. Use the static method vtkUnstructuredGrid::DecomposePolyhedronCellArray to convert it into a standard format. Note: the algorithm assumes water-tight polyhedron cells. V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; Satisfy the vtkCell API. The subId is ignored and zero is always returned. The parametric coordinates pcoords are normalized values in the bounding box of the polyhedron. The weights are determined by evaluating the MVC coordinates. The dist is always zero if the point x[3] is inside the polyhedron; otherwise it's the distance to the surface. V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; The inverse of EvaluatePosition. Note the weights should be the MVC weights. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Intersect the line (p1,p2) with a given tolerance tol to determine a point of intersection x[3] with parametric coordinate t along the line. The parametric coordinates are returned as well (subId can be ignored). Returns the number of intersection points. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; Use vtkOrderedTriangulator to tetrahedralize the polyhedron mesh. This method works well for a convex polyhedron but may return wrong result in a concave case. Once triangulation has been performed, the results are saved in ptIds and pts. The ptIds is a vtkIdList with 4xn number of ids (n is the number of result tetrahedrons). The first 4 represent the point ids of the first tetrahedron, the second 4 represents the point ids of the second tetrahedron and so on. The point ids represent global dataset ids. The points of result tetrahedons are stored in pts. Note that there are 4xm output points (m is the number of points in the original polyhedron). A point may be stored multiple times when it is shared by more than one tetrahedrons. The points stored in pts are ordered the same as they are listed in ptIds. V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; Computes derivatives at the point specified by the parameter coordinate. Current implementation uses all vertices and subId is not used. To accelerate the speed, the future implementation can triangulate and extract the local tetrahedron from subId and pcoords, then evaluate derivatives on the local tetrahedron. V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; Find the boundary face closest to the point defined by the pcoords[3] and subId of the cell (subId can be ignored). V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the cell in parametric coordinates. In this cell, the center of the bounding box is returned. V.IsPrimaryCell() -> int C++: int IsPrimaryCell() override; A polyhedron is a full-fledged primary cell. V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double x[3], double *sf) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives). Here we use the MVC calculation process to compute the interpolation functions. V.InterpolateDerivs([float, float, float], [float, ...]) C++: void InterpolateDerivs(double x[3], double *derivs) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives). Here we use the MVC calculation process to compute the interpolation functions. V.RequiresExplicitFaceRepresentation() -> int C++: int RequiresExplicitFaceRepresentation() override; Methods supporting the definition of faces. Note that the GetFaces() returns a list of faces in vtkCellArray form; use the method GetNumberOfFaces() to determine the number of faces in the list. The SetFaces() method is also in vtkCellArray form, except that it begins with a leading count indicating the total number of faces in the list. V.SetFaces([int, ...]) C++: void SetFaces(vtkIdType *faces) override; Methods supporting the definition of faces. Note that the GetFaces() returns a list of faces in vtkCellArray form; use the method GetNumberOfFaces() to determine the number of faces in the list. The SetFaces() method is also in vtkCellArray form, except that it begins with a leading count indicating the total number of faces in the list. V.GetFaces() -> (int, ...) C++: vtkIdType *GetFaces() override; Methods supporting the definition of faces. Note that the GetFaces() returns a list of faces in vtkCellArray form; use the method GetNumberOfFaces() to determine the number of faces in the list. The SetFaces() method is also in vtkCellArray form, except that it begins with a leading count indicating the total number of faces in the list. IsInsideV.IsInside([float, float, float], float) -> int C++: int IsInside(double x[3], double tolerance) A method particular to vtkPolyhedron. It determines whether a point x[3] is inside the polyhedron or not (returns 1 is the point is inside, 0 otherwise). The tolerance is expressed in normalized space; i.e., a fraction of the size of the bounding box. V.IsConvex() -> bool C++: bool IsConvex() Determine whether or not a polyhedron is convex. This method is adapted from Devillers et al., "Checking the Convexity of Polytopes and the Planarity of Subdivisions", Computational Geometry, Volume 11, Issues 3 - 4, December 1998, Pages 187 - 208. GetPolyDataV.GetPolyData() -> vtkPolyData C++: vtkPolyData *GetPolyData() Construct polydata if no one exist, then return this->PolyData vtkPolyLinevtkCommonDataModelPython.vtkPolyLinevtkPolyLine - cell represents a set of 1D lines Superclass: vtkCell vtkPolyLine is a concrete implementation of vtkCell to represent a set of 1D lines. V.SafeDownCast(vtkObjectBase) -> vtkPolyLine C++: static vtkPolyLine *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolyLine C++: vtkPolyLine *NewInstance() GenerateSlidingNormalsV.GenerateSlidingNormals(vtkPoints, vtkCellArray, vtkDataArray) -> int C++: static int GenerateSlidingNormals(vtkPoints *, vtkCellArray *, vtkDataArray *) V.GenerateSlidingNormals(vtkPoints, vtkCellArray, vtkDataArray, [float, ...]) -> int C++: static int GenerateSlidingNormals(vtkPoints *, vtkCellArray *, vtkDataArray *, double *firstNormal) Given points and lines, compute normals to lines. These are not true normals, they are "orientation" normals used by classes like vtkTubeFilter that control the rotation around the line. The normals try to stay pointing in the same direction as much as possible (i.e., minimal rotation) w.r.t the firstNormal (computed if nullptr). Always returns 1 (success). V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *lines, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the point cloud in parametric coordinates. vtkPolyPlanevtkCommonDataModelPython.vtkPolyPlanevtkPolyPlane - Implicit function that is generated by extrusion of a polyline along the Z axis Superclass: vtkImplicitFunction vtkPolyPlane is, as the name suggests, an extrusion of a vtkPolyLine. The extrusion direction is assumed to be the Z vector. It can be used in combination with a vtkCutter to cut a dataset with a polyplane. vtkPolyPlane is a concrete implementation of the abstract class vtkImplicitFunction. @todo Generalize to extrusions along arbitrary directions. V.SafeDownCast(vtkObjectBase) -> vtkPolyPlane C++: static vtkPolyPlane *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolyPlane C++: vtkPolyPlane *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate plane equation for point x[3]. SetPolyLineV.SetPolyLine(vtkPolyLine) C++: virtual void SetPolyLine(vtkPolyLine *) Set/get point through which plane passes. Plane is defined by point and normal. GetPolyLineV.GetPolyLine() -> vtkPolyLine C++: virtual vtkPolyLine *GetPolyLine() Set/get point through which plane passes. Plane is defined by point and normal. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Override GetMTime to include the polyline vtkPolyVertexvtkCommonDataModelPython.vtkPolyVertexvtkPolyVertex - cell represents a set of 0D vertices Superclass: vtkCell vtkPolyVertex is a concrete implementation of vtkCell to represent a set of 3D vertices. V.SafeDownCast(vtkObjectBase) -> vtkPolyVertex C++: static vtkPolyVertex *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPolyVertex C++: vtkPolyVertex *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; See the vtkCell API for descriptions of these methods. vtkPyramidvtkCommonDataModelPython.vtkPyramidvtkPyramid - a 3D cell that represents a linear pyramid Superclass: vtkCell3D vtkPyramid is a concrete implementation of vtkCell to represent a 3D pyramid. A pyramid consists of a rectangular base with four triangular faces. vtkPyramid uses the standard isoparametric shape functions for a linear pyramid. The pyramid is defined by the five points (0-4) where (0,1,2,3) is the base of the pyramid which, using the right hand rule, forms a quadrilaterial whose normal points in the direction of the pyramid apex at vertex #4. The parametric location of vertex #4 is [0, 0, 1]. @sa vtkConvexPointSet vtkHexahedron vtkTetra vtkVoxel vtkWedge V.SafeDownCast(vtkObjectBase) -> vtkPyramid C++: static vtkPyramid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkPyramid C++: vtkPyramid *NewInstance() V.InterpolationFunctions([float, float, float], [float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[5]) @deprecated Replaced by vtkPyramid::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[15]) @deprecated Replaced by vtkPyramid::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[5]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[15]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkQuadvtkCommonDataModelPython.vtkQuadvtkQuad - a cell that represents a 2D quadrilateral Superclass: vtkCell vtkQuad is a concrete implementation of vtkCell to represent a 2D quadrilateral. vtkQuad is defined by the four points (0,1,2,3) in counterclockwise order. vtkQuad uses the standard isoparametric interpolation functions for a linear quadrilateral. V.SafeDownCast(vtkObjectBase) -> vtkQuad C++: static vtkQuad *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuad C++: vtkQuad *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quad using scalar value provided. Like contouring, except that it cuts the quad to produce other quads and/or triangles. V.InterpolationFunctions([float, float, float], [float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double sf[4]) @deprecated Replaced by vtkQuad::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[8]) @deprecated Replaced by vtkQuad::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double sf[4]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.GetEdgeArray(int) -> (int, ...) C++: int *GetEdgeArray(int edgeId) Return the ids of the vertices defining edge (`edgeId`). Ids are related to the cell, not to the dataset. vtkQuadraticEdgevtkCommonDataModelPython.vtkQuadraticEdgevtkQuadraticEdge - cell represents a parabolic, isoparametric edge Superclass: vtkNonLinearCell vtkQuadraticEdge is a concrete implementation of vtkNonLinearCell to represent a one-dimensional, 3-nodes, isoparametric parabolic line. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node. The ordering of the three points defining the cell is point ids (0,1,2) where id #2 is the midedge node. @sa vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticWedge vtkQuadraticQuad vtkQuadraticHexahedron vtkQuadraticPyramid V.SafeDownCast(vtkObjectBase) -> vtkQuadraticEdge C++: static vtkQuadraticEdge *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticEdge C++: vtkQuadraticEdge *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *lines, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this edge using scalar value provided. Like contouring, except that it cuts the edge to produce linear line segments. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the quadratic tetra in parametric coordinates. V.InterpolationFunctions([float, float, float], [float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[3]) @deprecated Replaced by vtkQuadraticEdge::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[3]) @deprecated Replaced by vtkQuadraticEdge::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[3]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[3]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkQuadraticHexahedronvtkCommonDataModelPython.vtkQuadraticHexahedronvtkQuadraticHexahedron - cell represents a parabolic, 20-node isoparametric hexahedron Superclass: vtkNonLinearCell vtkQuadraticHexahedron is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 20-node isoparametric parabolic hexahedron. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node. The ordering of the twenty points defining the cell is point ids (0-7,8-19) where point ids 0-7 are the eight corner vertices of the cube; followed by twelve midedge nodes (8-19). Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,3), (3,0), (4,5), (5,6), (6,7), (7,4), (0,4), (1,5), (2,6), (3,7). @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticQuad vtkQuadraticPyramid vtkQuadraticWedge V.SafeDownCast(vtkObjectBase) -> vtkQuadraticHexahedron C++: static vtkQuadraticHexahedron *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticHexahedron C++: vtkQuadraticHexahedron *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic hexahedron using scalar value provided. Like contouring, except that it cuts the hex to produce linear tetrahedron. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[20]) @deprecated Replaced by vtkQuadraticHexahedron::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[60]) @deprecated Replaced by vtkQuadraticHexahedron::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[20]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[60]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkQuadraticLinearQuadvtkCommonDataModelPython.vtkQuadraticLinearQuadvtkQuadraticLinearQuad - cell represents a quadratic-linear, 6-node isoparametric quad Superclass: vtkNonLinearCell vtkQuadraticQuad is a concrete implementation of vtkNonLinearCell to represent a two-dimensional, 6-node isoparametric quadratic-linear quadrilateral element. The interpolation is the standard finite element, quadratic-linear isoparametric shape function. The cell includes a mid-edge node for two of the four edges. The ordering of the six points defining the cell are point ids (0-3,4-5) where ids 0-3 define the four corner vertices of the quad; ids 4-7 define the midedge nodes (0,1) and (2,3) . @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticQuad vtkQuadraticHexahedron vtkQuadraticWedge vtkQuadraticPyramid @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkQuadraticLinearQuad C++: static vtkQuadraticLinearQuad *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticLinearQuad C++: vtkQuadraticLinearQuad *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic linear quad using scalar value provided. Like contouring, except that it cuts the quad to produce linear triangles. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[6]) @deprecated Replaced by vtkQuadraticLinearQuad::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[12]) @deprecated Replaced by vtkQuadraticLinearQuad::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[6]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[12]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.GetEdgeArray(int) -> (int, ...) C++: static int *GetEdgeArray(int edgeId) Return the ids of the vertices defining edge (`edgeId`). Ids are related to the cell, not to the dataset. vtkQuadraticLinearWedgevtkCommonDataModelPython.vtkQuadraticLinearWedgevtkQuadraticLinearWedge - cell represents a, 12-node isoparametric wedge Superclass: vtkNonLinearCell vtkQuadraticLinearWedge is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 12-node isoparametric linear quadratic wedge. The interpolation is the standard finite element, quadratic isoparametric shape function in xy - layer and the linear functions in z - direction. The cell includes mid-edge node in the triangle edges. The ordering of the 12 points defining the cell is point ids (0-5,6-12) where point ids 0-5 are the six corner vertices of the wedge; followed by six midedge nodes (6-12). Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,0), (3,4), (4,5), (5,3). The Edges (0,3), (1,4), (2,5) don't have midedge nodes. @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticPyramid @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkQuadraticLinearWedge C++: static vtkQuadraticLinearWedge *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkQuadraticLinearWedge C++: vtkQuadraticLinearWedge *NewInstance() V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.GetParametricCoords() -> (float, ...) C++: double *GetParametricCoords() override; The quadratic linear wege is splitted into 4 linear wedges, each of them is contoured by a provided scalar value V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic linear wedge using scalar value provided. Like contouring, except that it cuts the hex to produce linear tetrahedron. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the quadratic linear wedge in parametric coordinates. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[15]) @deprecated Replaced by vtkQuadraticLinearWedge::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[45]) @deprecated Replaced by vtkQuadraticLinearWedge::InterpolateDerivs as of VTK 5.2 vtkQuadraticPolygonvtkCommonDataModelPython.vtkQuadraticPolygonvtkQuadraticPolygon - a cell that represents a parabolic n-sided polygon Superclass: vtkNonLinearCell vtkQuadraticPolygon is a concrete implementation of vtkNonLinearCell to represent a 2D n-sided (2*n nodes) parabolic polygon. The polygon cannot have any internal holes, and cannot self-intersect. The cell includes a mid-edge node for each of the n edges of the cell. The ordering of the 2*n points defining the cell are point ids (0..n-1 and n..2*n-1) where ids 0..n-1 define the corner vertices of the polygon; ids n..2*n-1 define the midedge nodes. Define the polygon with points ordered in the counter- clockwise direction; do not repeat the last point. @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticWedge vtkQuadraticPyramid V.SafeDownCast(vtkObjectBase) -> vtkQuadraticPolygon C++: static vtkQuadraticPolygon *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticPolygon C++: vtkQuadraticPolygon *NewInstance() V.IsPrimaryCell() -> int C++: int IsPrimaryCell() override; Return whether this cell type has a fixed topology or whether the topology varies depending on the data (e.g., vtkConvexPointSet). This compares to composite cells that are typically composed of primary cells (e.g., a triangle strip composite cell is made up of triangle primary cells). V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.EvaluatePosition([float, float, float], [float, ...], int, [float, float, float], float, [float, ...]) -> int C++: int EvaluatePosition(double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.EvaluateLocation(int, [float, float, float], [float, float, float], [float, ...]) C++: void EvaluateLocation(int &subId, double pcoords[3], double x[3], double *weights) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.InterpolateFunctions([float, float, float], [float, ...]) C++: void InterpolateFunctions(double x[3], double *weights) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.ComputeCentroid(vtkIdTypeArray, vtkPoints, [float, float, float]) C++: static void ComputeCentroid(vtkIdTypeArray *ids, vtkPoints *pts, double centroid[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.ParameterizePolygon([float, float, float], [float, float, float], float, [float, float, float], float, [float, float, float]) -> int C++: int ParameterizePolygon(double p0[3], double p10[3], double &l10, double p20[3], double &l20, double n[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.PointInPolygon([float, float, float], int, [float, ...], [float, float, float, float, float, float], [float, float, float]) -> int C++: static int PointInPolygon(double x[3], int numPts, double *pts, double bounds[6], double n[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.Triangulate(vtkIdList) -> int C++: int Triangulate(vtkIdList *outTris) V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.NonDegenerateTriangulate(vtkIdList) -> int C++: int NonDegenerateTriangulate(vtkIdList *outTris) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.DistanceToPolygon([float, float, float], int, [float, ...], [float, float, float, float, float, float], [float, float, float]) -> float C++: static double DistanceToPolygon(double x[3], int numPts, double *pts, double bounds[6], double closest[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.IntersectPolygonWithPolygon(int, [float, ...], [float, float, float, float, float, float], int, [float, ...], [float, float, float], float, [float, float, float]) -> int C++: static int IntersectPolygonWithPolygon(int npts, double *pts, double bounds[6], int npts2, double *pts2, double bounds2[3], double tol, double x[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.IntersectConvex2DCells(vtkCell, vtkCell, float, [float, float, float], [float, float, float]) -> int C++: static int IntersectConvex2DCells(vtkCell *cell1, vtkCell *cell2, double tol, double p0[3], double p1[3]) These methods are based on the vtkPolygon ones : the vtkQuadraticPolygon (with n edges and 2*n points) is transform into a vtkPolygon (with 2*n edges and 2*n points) and the vtkPolygon methods are called. V.GetUseMVCInterpolation() -> bool C++: virtual bool GetUseMVCInterpolation() Set/Get the flag indicating whether to use Mean Value Coordinate for the interpolation. If true, InterpolateFunctions() uses the Mean Value Coordinate to compute weights. Otherwise, the conventional 1/r^2 method is used. The UseMVCInterpolation parameter is set to true by default. V.SetUseMVCInterpolation(bool) C++: virtual void SetUseMVCInterpolation(bool _arg) Set/Get the flag indicating whether to use Mean Value Coordinate for the interpolation. If true, InterpolateFunctions() uses the Mean Value Coordinate to compute weights. Otherwise, the conventional 1/r^2 method is used. The UseMVCInterpolation parameter is set to true by default. vtkQuadraticPyramidvtkCommonDataModelPython.vtkQuadraticPyramidvtkQuadraticPyramid - cell represents a parabolic, 13-node isoparametric pyramid Superclass: vtkNonLinearCell vtkQuadraticPyramid is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 13-node isoparametric parabolic pyramid. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node. The ordering of the thirteen points defining the cell is point ids (0-4,5-12) where point ids 0-4 are the five corner vertices of the pyramid; followed by eight midedge nodes (5-12). Note that these midedge nodes lie on the edges defined by (0,1), (1,2), (2,3), (3,0), (0,4), (1,4), (2,4), (3,4), respectively. The parametric location of vertex #4 is [0, 0, 1]. @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticWedge @par Thanks: The shape functions and derivatives could be implemented thanks to the report Pyramid Solid Elements Linear and Quadratic Iso-P Models From Center For Aerospace Structures V.SafeDownCast(vtkObjectBase) -> vtkQuadraticPyramid C++: static vtkQuadraticPyramid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticPyramid C++: vtkQuadraticPyramid *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tets, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic triangle using scalar value provided. Like contouring, except that it cuts the triangle to produce linear triangles. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the quadratic pyramid in parametric coordinates. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[13]) @deprecated Replaced by vtkQuadraticPyramid::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[39]) @deprecated Replaced by vtkQuadraticPyramid::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[13]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[39]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkQuadraticQuadvtkCommonDataModelPython.vtkQuadraticQuadvtkQuadraticQuad - cell represents a parabolic, 8-node isoparametric quad Superclass: vtkNonLinearCell vtkQuadraticQuad is a concrete implementation of vtkNonLinearCell to represent a two-dimensional, 8-node isoparametric parabolic quadrilateral element. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node for each of the four edges of the cell. The ordering of the eight points defining the cell are point ids (0-3,4-7) where ids 0-3 define the four corner vertices of the quad; ids 4-7 define the midedge nodes (0,1), (1,2), (2,3), (3,0). @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticWedge vtkQuadraticPyramid V.SafeDownCast(vtkObjectBase) -> vtkQuadraticQuad C++: static vtkQuadraticQuad *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticQuad C++: vtkQuadraticQuad *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this quadratic quad using scalar value provided. Like contouring, except that it cuts the quad to produce linear triangles. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[8]) @deprecated Replaced by vtkQuadraticQuad::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[16]) @deprecated Replaced by vtkQuadraticQuad::InterpolateDerivs as of VTK 5.2 V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[16]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkQuadraticTetravtkCommonDataModelPython.vtkQuadraticTetravtkQuadraticTetra - cell represents a parabolic, 10-node isoparametric tetrahedron Superclass: vtkNonLinearCell vtkQuadraticTetra is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 10-node, isoparametric parabolic tetrahedron. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node on each of the size edges of the tetrahedron. The ordering of the ten points defining the cell is point ids (0-3,4-9) where ids 0-3 are the four tetra vertices; and point ids 4-9 are the midedge nodes between (0,1), (1,2), (2,0), (0,3), (1,3), and (2,3). Note that this class uses an internal linear tesselation for some internal operations (e.g., clipping and contouring). This means that some artifacts may appear trying to represent a non-linear interpolation function with linear tets. @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticWedge vtkQuadraticQuad vtkQuadraticHexahedron vtkQuadraticPyramid V.SafeDownCast(vtkObjectBase) -> vtkQuadraticTetra C++: static vtkQuadraticTetra *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticTetra C++: vtkQuadraticTetra *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this edge using scalar value provided. Like contouring, except that it cuts the tetra to produce new tetras. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[10]) @deprecated Replaced by vtkQuadraticTetra::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[30]) @deprecated Replaced by vtkQuadraticTetra::InterpolateDerivs as of VTK 5.2 vtkQuadraticTrianglevtkCommonDataModelPython.vtkQuadraticTrianglevtkQuadraticTriangle - cell represents a parabolic, isoparametric triangle Superclass: vtkNonLinearCell vtkQuadraticTriangle is a concrete implementation of vtkNonLinearCell to represent a two-dimensional, 6-node, isoparametric parabolic triangle. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes three mid-edge nodes besides the three triangle vertices. The ordering of the three points defining the cell is point ids (0-2,3-5) where id #3 is the midedge node between points (0,1); id #4 is the midedge node between points (1,2); and id #5 is the midedge node between points (2,0). @sa vtkQuadraticEdge vtkQuadraticTetra vtkQuadraticPyramid vtkQuadraticQuad vtkQuadraticHexahedron vtkQuadraticWedge V.SafeDownCast(vtkObjectBase) -> vtkQuadraticTriangle C++: static vtkQuadraticTriangle *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticTriangle C++: vtkQuadraticTriangle *NewInstance() V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[6]) @deprecated Replaced by vtkQuadraticTriangle::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[12]) @deprecated Replaced by vtkQuadraticTriangle::InterpolateDerivs as of VTK 5.2 vtkQuadraticWedgevtkCommonDataModelPython.vtkQuadraticWedgevtkQuadraticWedge - cell represents a parabolic, 15-node isoparametric wedge Superclass: vtkNonLinearCell vtkQuadraticWedge is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 15-node isoparametric parabolic wedge. The interpolation is the standard finite element, quadratic isoparametric shape function. The cell includes a mid-edge node. The ordering of the fifteen points defining the cell is point ids (0-5,6-14) where point ids 0-5 are the six corner vertices of the wedge, defined analogously to the six points in vtkWedge (points (0,1,2) form the base of the wedge which, using the right hand rule, forms a triangle whose normal points away from the triangular face (3,4,5)); followed by nine midedge nodes (6-14). Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,0), (3,4), (4,5), (5,3), (0,3), (1,4), (2,5). @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticPyramid V.SafeDownCast(vtkObjectBase) -> vtkQuadraticWedge C++: static vtkQuadraticWedge *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadraticWedge C++: vtkQuadraticWedge *NewInstance() V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[15]) @deprecated Replaced by vtkQuadraticWedge::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[45]) @deprecated Replaced by vtkQuadraticWedge::InterpolateDerivs as of VTK 5.2 vtkCommonDataModelPython.vtkQuadratureSchemeDefinitionvtkQuadratureSchemeDefinition - An Elemental data type that holds a definition of a numerical quadrature scheme. Superclass: vtkObject The definition contains the requisite information to interpolate to the so called quadrature points of the specific scheme. namely: 1) A matrix of shape function weights(shape functions evaluated at parametric coordinates of the quadrature points). 2) The number of quadrature points and cell nodes. These parameters size the matrix, and allow for convinent evaluation by users of the definition. V.SafeDownCast(vtkObjectBase) -> vtkQuadratureSchemeDefinition C++: static vtkQuadratureSchemeDefinition *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkQuadratureSchemeDefinition C++: vtkQuadratureSchemeDefinition *NewInstance() DICTIONARYV.DICTIONARY() -> vtkInformationQuadratureSchemeDefinitionVectorKey C++: static vtkInformationQuadratureSchemeDefinitionVectorKey *DICTIONARY( ) QUADRATURE_OFFSET_ARRAY_NAMEV.QUADRATURE_OFFSET_ARRAY_NAME() -> vtkInformationStringKey C++: static vtkInformationStringKey *QUADRATURE_OFFSET_ARRAY_NAME( ) V.DeepCopy(vtkQuadratureSchemeDefinition) -> int C++: int DeepCopy(const vtkQuadratureSchemeDefinition *other) Deep copy. V.SaveState(vtkXMLDataElement) -> int C++: int SaveState(vtkXMLDataElement *e) Put the object into an XML representation. The element passed in is assumed to be empty. V.RestoreState(vtkXMLDataElement) -> int C++: int RestoreState(vtkXMLDataElement *e) Restore the object from an XML representation. V.Clear() C++: void Clear() Release all allocated resources and set the object to an unitialized state. V.Initialize(int, int, int, [float, ...]) C++: void Initialize(int cellType, int numberOfNodes, int numberOfQuadraturePoints, double *shapeFunctionWeights) V.Initialize(int, int, int, [float, ...], [float, ...]) C++: void Initialize(int cellType, int numberOfNodes, int numberOfQuadraturePoints, double *shapeFunctionWeights, double *quadratureWeights) Initialize the object allocating resources as needed. V.GetCellType() -> int C++: int GetCellType() Access the VTK cell type id. GetQuadratureKeyV.GetQuadratureKey() -> int C++: int GetQuadratureKey() Access to an alternative key. V.GetNumberOfNodes() -> int C++: int GetNumberOfNodes() Get the number of nodes associated with the interpolation. GetNumberOfQuadraturePointsV.GetNumberOfQuadraturePoints() -> int C++: int GetNumberOfQuadraturePoints() Get the number of quadrature points associated with the scheme. GetShapeFunctionWeightsV.GetShapeFunctionWeights() -> (float, ...) C++: const double *GetShapeFunctionWeights() V.GetShapeFunctionWeights(int) -> (float, ...) C++: const double *GetShapeFunctionWeights(int quadraturePointId) Get the array of shape function weights. Shape function weights are the shape functions evaluated at the quadrature points. There are "NumberOfNodes" weights for each quadrature point. GetQuadratureWeightsV.GetQuadratureWeights() -> (float, ...) C++: const double *GetQuadratureWeights() Access to the quadrature weights. vtkQuadricvtkCommonDataModelPython.vtkQuadricvtkQuadric - evaluate implicit quadric function Superclass: vtkImplicitFunction vtkQuadric evaluates the quadric function F(x,y,z) = a0*x^2 + a1*y^2 + a2*z^2 + a3*x*y + a4*y*z + a5*x*z + a6*x + a7*y + a8*z + a9. vtkQuadric is a concrete implementation of vtkImplicitFunction. V.SafeDownCast(vtkObjectBase) -> vtkQuadric C++: static vtkQuadric *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkQuadric C++: vtkQuadric *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate quadric equation. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate the gradient to the quadric equation. SetCoefficientsV.SetCoefficients([float, float, float, float, float, float, float, float, float, float]) C++: void SetCoefficients(double a[10]) V.SetCoefficients(float, float, float, float, float, float, float, float, float, float) C++: void SetCoefficients(double a0, double a1, double a2, double a3, double a4, double a5, double a6, double a7, double a8, double a9) Set / get the 10 coefficients of the quadric equation. GetCoefficientsV.GetCoefficients() -> (float, float, float, float, float, float, float, float, float, float) C++: double *GetCoefficients() Set / get the 10 coefficients of the quadric equation. vtkRectilinearGridvtkCommonDataModelPython.vtkRectilinearGridvtkRectilinearGrid - a dataset that is topologically regular with variable spacing in the three coordinate directions Superclass: vtkDataSet vtkRectilinearGrid is a data object that is a concrete implementation of vtkDataSet. vtkRectilinearGrid represents a geometric structure that is topologically regular with variable spacing in the three coordinate directions x-y-z. To define a vtkRectilinearGrid, you must specify the dimensions of the data and provide three arrays of values specifying the coordinates along the x-y-z axes. The coordinate arrays are specified using three vtkDataArray objects (one for x, one for y, one for z). @warning Make sure that the dimensions of the grid match the number of coordinates in the x-y-z directions. If not, unpredictable results (including program failure) may result. Also, you must supply coordinates in all three directions, even if the dataset topology is 2D, 1D, or 0D. V.SafeDownCast(vtkObjectBase) -> vtkRectilinearGrid C++: static vtkRectilinearGrid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkRectilinearGrid C++: vtkRectilinearGrid *NewInstance() V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Copy the geometric and topological structure of an input rectilinear grid object. V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType id, double x[3]) override; V.GetPoint(int, int, int, [float, float, float]) C++: void GetPoint(const int i, const int j, const int k, double p[3]) Standard vtkDataSet API methods. See vtkDataSet for more information. V.FindPoint(float, float, float) -> int C++: vtkIdType FindPoint(double x, double y, double z) V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetPoints(vtkPoints) C++: void GetPoints(vtkPoints *pnts) Given a user-supplied vtkPoints container object, this method fills in all the points of the RectilinearGrid. V.SetDimensions(int, int, int) C++: void SetDimensions(int i, int j, int k) V.SetDimensions([int, int, int]) C++: void SetDimensions(int dim[3]) Set dimensions of rectilinear grid dataset. This also sets the extent. V.GetDimensions() -> (int, int, int) C++: int *GetDimensions() Get dimensions of this rectilinear grid dataset. V.GetDataDimension() -> int C++: int GetDataDimension() Return the dimensionality of the data. V.ComputeStructuredCoordinates([float, float, float], [int, int, int], [float, float, float]) -> int C++: int ComputeStructuredCoordinates(double x[3], int ijk[3], double pcoords[3]) Convenience function computes the structured coordinates for a point x[3]. The cell is specified by the array ijk[3], and the parametric coordinates in the cell are specified with pcoords[3]. The function returns a 0 if the point x is outside of the grid, and a 1 if inside the grid. V.ComputePointId([int, int, int]) -> int C++: vtkIdType ComputePointId(int ijk[3]) Given a location in structured coordinates (i-j-k), return the point id. V.ComputeCellId([int, int, int]) -> int C++: vtkIdType ComputeCellId(int ijk[3]) Given a location in structured coordinates (i-j-k), return the cell id. V.SetXCoordinates(vtkDataArray) C++: virtual void SetXCoordinates(vtkDataArray *) Specify the grid coordinates in the x-direction. V.GetXCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetXCoordinates() Specify the grid coordinates in the x-direction. V.SetYCoordinates(vtkDataArray) C++: virtual void SetYCoordinates(vtkDataArray *) Specify the grid coordinates in the y-direction. V.GetYCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetYCoordinates() Specify the grid coordinates in the y-direction. V.SetZCoordinates(vtkDataArray) C++: virtual void SetZCoordinates(vtkDataArray *) Specify the grid coordinates in the z-direction. V.GetZCoordinates() -> vtkDataArray C++: virtual vtkDataArray *GetZCoordinates() Specify the grid coordinates in the z-direction. V.SetExtent([int, int, int, int, int, int]) C++: void SetExtent(int extent[6]) V.SetExtent(int, int, int, int, int, int) C++: void SetExtent(int x1, int x2, int y1, int y2, int z1, int z2) Different ways to set the extent of the data array. The extent should be set before the "Scalars" are set or allocated. The Extent is stored in the order (X, Y, Z). V.GetExtentType() -> int C++: int GetExtentType() override; Structured extent. The extent type is a 3D extent V.Crop((int, ...)) C++: void Crop(const int *updateExtent) override; Reallocates and copies to set the Extent to the UpdateExtent. This is used internally when the exact extent is requested, and the source generated more than the update extent. V.GetData(vtkInformation) -> vtkRectilinearGrid C++: static vtkRectilinearGrid *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkRectilinearGrid C++: static vtkRectilinearGrid *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkReebGraphERR_NOT_A_SIMPLICIAL_MESHvtkCommonDataModelPython.vtkReebGraphvtkReebGraph - Reeb graph computation for PL scalar fields. Superclass: vtkMutableDirectedGraph vtkReebGraph is a class that computes a Reeb graph given a PL scalar field (vtkDataArray) defined on a simplicial mesh. A Reeb graph is a concise representation of the connectivity evolution of the level sets of a scalar function. It is particularly useful in visualization (optimal seed set computation, fast flexible isosurface extraction, automated transfer function design, feature-driven visualization, etc.) and computer graphics (shape deformation, shape matching, shape compression, etc.). Reference: "Sur les points singuliers d'une forme de Pfaff completement integrable ou d'une fonction numerique", G. Reeb, Comptes-rendus de l'Academie des Sciences, 222:847-849, 1946. vtkReebGraph implements one of the latest and most robust Reeb graph computation algorithms. Reference: "Robust on-line computation of Reeb graphs: simplicity and speed", V. Pascucci, G. Scorzelli, P.-T. Bremer, and A. Mascarenhas, ACM Transactions on Graphics, Proc. of SIGGRAPH 2007. vtkReebGraph provides methods for computing multi-resolution topological hierarchies through topological simplification. Topoligical simplification can be either driven by persistence homology concepts (default behavior) or by application specific metrics (see vtkReebGraphSimplificationMetric). In the latter case, designing customized simplification metric evaluation algorithms enables the user to control the definition of what should be considered as noise or signal in the topological filtering process. References: "Topological persistence and simplification", H. Edelsbrunner, D. Letscher, and A. Zomorodian, Discrete Computational Geometry, 28:511-533, 2002. "Extreme elevation on a 2-manifold", P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, ACM Symposium on Computational Geometry, pp. 357-365, 2004. "Simplifying flexible isosurfaces using local geometric measures", H. Carr, J. Snoeyink, M van de Panne, IEEE Visualization, 497-504, 2004 "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees", J. Tierny, A. Gyulassy, E. Simon, V. Pascucci, IEEE Trans. on Vis. and Comp. Graph. (Proc of IEEE VIS), 15:1177-1184, 2009. Reeb graphs can be computed from 2D data (vtkPolyData, with triangles only) or 3D data (vtkUnstructuredGrid, with tetrahedra only), sequentially (see the "Build" calls) or in streaming (see the "StreamTriangle" and "StreamTetrahedron" calls). vtkReebGraph inherits from vtkMutableDirectedGraph. Each vertex of a vtkReebGraph object represents a critical point of the scalar field where the connectivity of the related level set changes (creation, deletion, split or merge of connected components). A vtkIdTypeArray (called "Vertex Ids") is associated with the VertexData of a vtkReebGraph object, in order to retrieve if necessary the exact Ids of the corresponding vertices in the input mesh. The edges of a vtkReebGraph object represent the regions of the input mesh separated by the critical contours of the field, and where the connectivity of the input field does not change. A vtkVariantArray is associated with the EdgeDta of a vtkReebGraph object and each entry of this array is a vtkAbstractArray containing the Ids of the vertices of those regions, sorted by function value (useful for flexible isosurface extraction or level set signature computation, for instance). See Graphics/Testing/Cxx/TestReebGraph.cxx for examples of traversals and typical usages (customized simplification, skeletonization, contour spectra, etc.) of a vtkReebGraph object. @sa vtkReebGraphSimplificationMetric vtkPolyDataToReebGraphFilter vtkUnstructuredGridToReebGraphFilter vtkReebGraphSimplificationFilter vtkReebGraphSurfaceSkeletonFilter vtkReebGraphVolumeSkeletonFilter vtkAreaContourSpectrumFilter vtkVolumeContourSpectrumFilter @par Tests: Graphics/Testing/Cxx/TestReebGraph.cxx V.SafeDownCast(vtkObjectBase) -> vtkReebGraph C++: static vtkReebGraph *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkReebGraph C++: vtkReebGraph *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return class name of data type. This is one of VTK_STRUCTURED_GRID, VTK_STRUCTURED_POINTS, VTK_UNSTRUCTURED_GRID, VTK_POLY_DATA, or VTK_RECTILINEAR_GRID (see vtkSetGet.h for definitions). THIS METHOD IS THREAD SAFE BuildV.Build(vtkPolyData, vtkDataArray) -> int C++: int Build(vtkPolyData *mesh, vtkDataArray *scalarField) V.Build(vtkUnstructuredGrid, vtkDataArray) -> int C++: int Build(vtkUnstructuredGrid *mesh, vtkDataArray *scalarField) V.Build(vtkPolyData, int) -> int C++: int Build(vtkPolyData *mesh, vtkIdType scalarFieldId) V.Build(vtkUnstructuredGrid, int) -> int C++: int Build(vtkUnstructuredGrid *mesh, vtkIdType scalarFieldId) V.Build(vtkPolyData, string) -> int C++: int Build(vtkPolyData *mesh, const char *scalarFieldName) V.Build(vtkUnstructuredGrid, string) -> int C++: int Build(vtkUnstructuredGrid *mesh, const char *scalarFieldName) Build the Reeb graph of the field 'scalarField' defined on the surface mesh 'mesh'. * Returned values: * vtkReebGraph::ERR_INCORRECT_FIELD: 'scalarField' does not have as many * tuples as 'mesh' has vertices. * vtkReebGraph::ERR_NOT_A_SIMPLICIAL_MESH: the input mesh 'mesh' is not a * simplicial mesh (for example, the surface mesh contains quads instead of * triangles). StreamTriangleV.StreamTriangle(int, float, int, float, int, float) -> int C++: int StreamTriangle(vtkIdType vertex0Id, double scalar0, vtkIdType vertex1Id, double scalar1, vtkIdType vertex2Id, double scalar2) Streaming Reeb graph computation. Add to the streaming computation the triangle of the vtkPolyData surface mesh described by vertex0Id, scalar0 vertex1Id, scalar1 vertex2Id, scalar2 * where vertexId is the Id of the vertex in the vtkPolyData structure * and scalaris the corresponding scalar field value. * IMPORTANT: The stream _must_ be finalized with the "CloseStream" call. StreamTetrahedronV.StreamTetrahedron(int, float, int, float, int, float, int, float) -> int C++: int StreamTetrahedron(vtkIdType vertex0Id, double scalar0, vtkIdType vertex1Id, double scalar1, vtkIdType vertex2Id, double scalar2, vtkIdType vertex3Id, double scalar3) Streaming Reeb graph computation. Add to the streaming computation the tetrahedra of the vtkUnstructuredGrid volume mesh described by vertex0Id, scalar0 vertex1Id, scalar1 vertex2Id, scalar2 vertex3Id, scalar3 * where vertexId is the Id of the vertex in the vtkUnstructuredGrid * structure and scalaris the corresponding scalar field value. * IMPORTANT: The stream _must_ be finalized with the "CloseStream" call. CloseStreamV.CloseStream() C++: void CloseStream() Finalize internal data structures, in the case of streaming computations (with StreamTriangle or StreamTetrahedron). After this call, no more triangle or tetrahedron can be inserted via StreamTriangle or StreamTetrahedron. IMPORTANT: This method _must_ be called when the input stream is finished. If you need to get a snapshot of the Reeb graph during the streaming process (to parse or simplify it), do a DeepCopy followed by a CloseStream on the copy. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Deep copies the data object into this graph. If it is an incompatible graph, reports an error. SimplifyV.Simplify(float, vtkReebGraphSimplificationMetric) -> int C++: int Simplify(double simplificationThreshold, vtkReebGraphSimplificationMetric *simplificationMetric) Simplify the Reeb graph given a threshold 'simplificationThreshold' (between 0 and 1). * This method is the core feature for Reeb graph multi-resolution hierarchy * construction. * Return the number of arcs that have been removed through the simplification * process. * 'simplificationThreshold' represents a "scale", under which each Reeb graph * feature is considered as noise. 'simplificationThreshold' is expressed as a * fraction of the scalar field overall span. It can vary from 0 * (no simplification) to 1 (maximal simplification). * 'simplificationMetric' is an object in charge of evaluating the importance * of a Reeb graph arc at each step of the simplification process. * if 'simplificationMetric' is nullptr, the default strategy (persitence of the * scalar field) is used. * Customized simplification metric evaluation algorithm can be designed (see * vtkReebGraphSimplificationMetric), enabling the user to control the * definition of what should be considered as noise or signal. * References: * "Topological persistence and simplification", * H. Edelsbrunner, D. Letscher, and A. Zomorodian, * Discrete Computational Geometry, 28:511-533, 2002. * "Extreme elevation on a 2-manifold", * P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, * ACM Symposium on Computational Geometry, pp. 357-365, 2004. * "Simplifying flexible isosurfaces using local geometric measures", * H. Carr, J. Snoeyink, M van de Panne, * IEEE Visualization, 497-504, 2004 * "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees", * J. Tierny, A. Gyulassy, E. Simon, V. Pascucci, * IEEE Trans. on Vis. and Comp. Graph. (Proc of IEEE VIS), 15:1177-1184,2009. V.Set(vtkMutableDirectedGraph) C++: void Set(vtkMutableDirectedGraph *g) Use a pre-defined Reeb graph (post-processing). Use with caution! @VV *vtkPolyData *vtkDataArray@VV *vtkUnstructuredGrid *vtkDataArray@Vk *vtkPolyData@Vk *vtkUnstructuredGrid@Vz *vtkPolyData@Vz *vtkUnstructuredGridvtkReebGraphSimplificationMetricvtkCommonDataModelPython.vtkReebGraphSimplificationMetricvtkReebGraphSimplificationMetric - abstract class for custom Reeb graph simplification metric design. Superclass: vtkObject This class makes it possible to design customized simplification metric evaluation algorithms, enabling the user to control the definition of what should be considered as noise or signal in the topological filtering process. References: "Topological persistence and simplification", H. Edelsbrunner, D. Letscher, and A. Zomorodian, Discrete Computational Geometry, 28:511-533, 2002. "Extreme elevation on a 2-manifold", P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, ACM Symposium on Computational Geometry, pp. 357-365, 2004. "Simplifying flexible isosurfaces using local geometric measures", H. Carr, J. Snoeyink, M van de Panne, IEEE Visualization, 497-504, 2004 "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees", J. Tierny, A. Gyulassy, E. Simon, V. Pascucci, IEEE Trans. on Vis. and Comp. Graph. (Proc of IEEE VIS), 15:1177-1184, 2009. See Graphics/Testing/Cxx/TestReebGraph.cxx for an example of concrete implemetnation. V.SafeDownCast(vtkObjectBase) -> vtkReebGraphSimplificationMetric C++: static vtkReebGraphSimplificationMetric *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkReebGraphSimplificationMetric C++: vtkReebGraphSimplificationMetric *NewInstance() SetLowerBoundV.SetLowerBound(float) C++: virtual void SetLowerBound(double _arg) Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. GetLowerBoundV.GetLowerBound() -> float C++: virtual double GetLowerBound() Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. SetUpperBoundV.SetUpperBound(float) C++: virtual void SetUpperBound(double _arg) Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. GetUpperBoundV.GetUpperBound() -> float C++: virtual double GetUpperBound() Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1. ComputeMetricV.ComputeMetric(vtkDataSet, vtkDataArray, int, vtkAbstractArray, int) -> float C++: virtual double ComputeMetric(vtkDataSet *mesh, vtkDataArray *field, vtkIdType startCriticalPoint, vtkAbstractArray *vertexList, vtkIdType endCriticalPoint) Function to implement in your simplification metric algorithm. Given the input mesh and the Ids of the vertices living on the Reeb graph arc to consider for removal, you should return a value between 0 and 1 (the smallest the more likely the arc will be removed, depending on the user-defined simplification threshold). vtkCommonDataModelPython.vtkSelectionvtkSelection - A node in a selection tree. Superclass: vtkDataObject Used to store selection results. vtkSelection is a collection of vtkSelectionNode objects, each of which contains information about a piece of the whole selection. Each selection node may contain different types of selections. @sa vtkSelectionNode V.SafeDownCast(vtkObjectBase) -> vtkSelection C++: static vtkSelection *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkSelection C++: vtkSelection *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Returns VTK_SELECTION enumeration value. V.GetNumberOfNodes() -> int C++: unsigned int GetNumberOfNodes() Returns the number of nodes in this selection. Each node contains information about part of the selection. GetNodeV.GetNode(int) -> vtkSelectionNode C++: virtual vtkSelectionNode *GetNode(unsigned int idx) Returns a node given it's index. Performs bound checking and will return 0 if out-of-bounds. AddNodeV.AddNode(vtkSelectionNode) C++: virtual void AddNode(vtkSelectionNode *) Adds a selection node. RemoveNodeV.RemoveNode(int) C++: virtual void RemoveNode(unsigned int idx) V.RemoveNode(vtkSelectionNode) C++: virtual void RemoveNode(vtkSelectionNode *) Removes a selection node. RemoveAllNodesV.RemoveAllNodes() C++: virtual void RemoveAllNodes() Removes a selection node. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Copy selection nodes of the input. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Copy selection nodes of the input. This is a shallow copy: selection lists and pointers in the properties are passed by reference. V.Union(vtkSelection) C++: virtual void Union(vtkSelection *selection) V.Union(vtkSelectionNode) C++: virtual void Union(vtkSelectionNode *node) Union this selection with the specified selection. Attempts to reuse selection nodes in this selection if properties match exactly. Otherwise, creates new selection nodes. SubtractV.Subtract(vtkSelection) C++: virtual void Subtract(vtkSelection *selection) V.Subtract(vtkSelectionNode) C++: virtual void Subtract(vtkSelectionNode *node) Remove the nodes from the specified selection from this selection. Assumes that selection node internal arrays are vtkIdTypeArrays. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Return the MTime taking into account changes to the properties V.Dump() C++: virtual void Dump() Dumps the contents of the selection, giving basic information only. V.GetData(vtkInformation) -> vtkSelection C++: static vtkSelection *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkSelection C++: static vtkSelection *GetData(vtkInformationVector *v, int i=0) Retrieve a vtkSelection stored inside an invormation object. vtkSelectionNode@V *vtkSelectionNode@V *vtkSelectionSelectionContentSelectionFieldSELECTIONSVALUESINDICESFRUSTUMLOCATIONSTHRESHOLDSBLOCKSQUERYUSERvtkCommonDataModelPython.vtkSelectionNode.SelectionContentvtkCommonDataModelPython.vtkSelectionNode.SelectionFieldvtkCommonDataModelPython.vtkSelectionNodevtkSelectionNode - A node in a selection tree. Superclass: vtkObject Used to store selection results. vtkSelectionNode stores selection parameters for a selection (or part of a selection). It stores a list of properties (in a vtkInformation) and a list of selection values (in a vtkAbstractArray). The properties provide information about what the selection values mean. For example the CONTENT_TYPE property gives information about what is stored by the node. If the CONTENT_TYPE is GLOBALIDS, the SelectionList array should contain a list of cell or point ids, which identify the particular cells or points that have matching values in the GLOBALID vtkDataSetAttribute array. If the CONTENT_TYPE is PEDIGREEIDS, the SelectionList array should contain a list of cell or point ids, which identify the particular cells or points that have matching values in the PEDIGREEID vtkDataSetAttribute array. The FIELD_TYPE property designates whether the selection refers to cells or points. Usually, each node under the root is a selection from one data object. SOURCE or SOURCE_ID properties point to this object. If the selection was performed on a renderer, PROP or PROP_ID point to the prop the selection was made on. Selection nodes corresponding to composite datasets may contain child nodes. Each child node of a composite dataset should have COMPOSITE_INDEX set. This is the flat-index to identify a node with in the composite dataset to which the selection applies. @warning No SelectionList is created by default. It should be assigned. V.SafeDownCast(vtkObjectBase) -> vtkSelectionNode C++: static vtkSelectionNode *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkSelectionNode C++: vtkSelectionNode *NewInstance() SetSelectionListV.SetSelectionList(vtkAbstractArray) C++: virtual void SetSelectionList(vtkAbstractArray *) Sets the selection list. GetSelectionListV.GetSelectionList() -> vtkAbstractArray C++: virtual vtkAbstractArray *GetSelectionList() Sets the selection list. SetSelectionDataV.SetSelectionData(vtkDataSetAttributes) C++: virtual void SetSelectionData(vtkDataSetAttributes *data) Sets the selection table. GetSelectionDataV.GetSelectionData() -> vtkDataSetAttributes C++: virtual vtkDataSetAttributes *GetSelectionData() Sets the selection table. GetPropertiesV.GetProperties() -> vtkInformation C++: virtual vtkInformation *GetProperties() Returns the property map. V.DeepCopy(vtkSelectionNode) C++: virtual void DeepCopy(vtkSelectionNode *src) Copy properties, selection list and children of the input. V.ShallowCopy(vtkSelectionNode) C++: virtual void ShallowCopy(vtkSelectionNode *src) Copy properties, selection list and children of the input. This is a shallow copy: selection lists and pointers in the properties are passed by reference. CONTENT_TYPEV.CONTENT_TYPE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *CONTENT_TYPE() Get the (primary) property that describes the content of a selection node's data. This key takes on values from the SelectionContent enum. GetContentType() returns -1 if the content type is not set. \sa vtkSelectionNode::SelectionContent SetContentTypeV.SetContentType(int) C++: virtual void SetContentType(int type) Get or set the content type of the selection. This is the same as setting the CONTENT_TYPE() key on the property. GetContentTypeV.GetContentType() -> int C++: virtual int GetContentType() Get or set the content type of the selection. This is the same as setting the CONTENT_TYPE() key on the property. FIELD_TYPEV.FIELD_TYPE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *FIELD_TYPE() Controls whether cell, point, or field data determine what is inside and out. The default is CELL. Vertex and edge types are also available for graph classes. GetFieldType() returns -1 if the field type is not set. SetFieldTypeV.SetFieldType(int) C++: virtual void SetFieldType(int type) Get or set the field type of the selection. This is the same as setting the FIELD_TYPE() key on the property. GetFieldTypeV.GetFieldType() -> int C++: virtual int GetFieldType() Get or set the field type of the selection. This is the same as setting the FIELD_TYPE() key on the property. ConvertSelectionFieldToAttributeTypeV.ConvertSelectionFieldToAttributeType(int) -> int C++: static int ConvertSelectionFieldToAttributeType(int val) Methods to convert vtkSelectionNode::SelectionField to vtkDataSetAttribute::AttributeTypes and vice-versa. ConvertAttributeTypeToSelectionFieldV.ConvertAttributeTypeToSelectionField(int) -> int C++: static int ConvertAttributeTypeToSelectionField(int val) Methods to convert vtkSelectionNode::SelectionField to vtkDataSetAttribute::AttributeTypes and vice-versa. SetQueryStringV.SetQueryString(string) C++: virtual void SetQueryString(const char *_arg) Set/Get the query expression string. GetQueryStringV.GetQueryString() -> string C++: virtual char *GetQueryString() Set/Get the query expression string. EPSILONV.EPSILON() -> vtkInformationDoubleKey C++: static vtkInformationDoubleKey *EPSILON() For location selection of points, if distance is greater than this reject. CONTAINING_CELLSV.CONTAINING_CELLS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *CONTAINING_CELLS() This flag tells the extraction filter, when FIELD_TYPE==POINT, that it should also extract the cells that contain any of the extracted points. COMPONENT_NUMBERV.COMPONENT_NUMBER() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *COMPONENT_NUMBER() When ContentType==THRESHOLDS or ContentType==VALUES i.e. threshold and value based selections, it is possible pick the component number using this key. If none is specified, the 0th component is used. If any number less than 0 is specified, then the magnitude is used. INVERSEV.INVERSE() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *INVERSE() This flag tells the extraction filter to exclude the selection. PIXEL_COUNTV.PIXEL_COUNT() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *PIXEL_COUNT() A helper for visible cell selector, this is the number of pixels covered by the actor whose cells are listed in the selection. SOURCEV.SOURCE() -> vtkInformationObjectBaseKey C++: static vtkInformationObjectBaseKey *SOURCE() Pointer to the data or algorithm the selection belongs to. SOURCE_IDV.SOURCE_ID() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *SOURCE_ID() ID of the data or algorithm the selection belongs to. What ID means is application specific. PROPV.PROP() -> vtkInformationObjectBaseKey C++: static vtkInformationObjectBaseKey *PROP() Pointer to the prop the selection belongs to. PROP_IDV.PROP_ID() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *PROP_ID() ID of the prop the selection belongs to. What ID means is application specific. PROCESS_IDV.PROCESS_ID() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *PROCESS_ID() Process id the selection is on. COMPOSITE_INDEXV.COMPOSITE_INDEX() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *COMPOSITE_INDEX() Used to identify a node in composite datasets. HIERARCHICAL_LEVELV.HIERARCHICAL_LEVEL() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *HIERARCHICAL_LEVEL() Used to identify a dataset in a hiererchical box dataset. HIERARCHICAL_INDEXV.HIERARCHICAL_INDEX() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *HIERARCHICAL_INDEX() Used to identify a dataset in a hiererchical box dataset. INDEXED_VERTICESV.INDEXED_VERTICES() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *INDEXED_VERTICES() This key is used when making visible vertex selection. It means that the cell ID selection has data about which vertices for each cell are visible. UnionSelectionListV.UnionSelectionList(vtkSelectionNode) C++: void UnionSelectionList(vtkSelectionNode *other) Merges the selection list between self and the other. Assumes that both has identical properties. SubtractSelectionListV.SubtractSelectionList(vtkSelectionNode) C++: void SubtractSelectionList(vtkSelectionNode *other) Subtracts the items in the selection list, other, from this selection list. Assumes that both selections have identical properties (i.e., test with EqualProperties before using). EqualPropertiesV.EqualProperties(vtkSelectionNode, bool) -> bool C++: bool EqualProperties(vtkSelectionNode *other, bool fullcompare=true) Compares Properties of self and other to ensure that they are exactly same. vtkSimpleCellTessellatorvtkCommonDataModelPython.vtkSimpleCellTessellatorvtkSimpleCellTessellator - helper class to perform cell tessellation Superclass: vtkGenericCellTessellator vtkSimpleCellTessellator is a helper class to perform adaptive tessellation of particular cell topologies. The major purpose for this class is to transform higher-order cell types (e.g., higher-order finite elements) into linear cells that can then be easily visualized by VTK. This class works in conjunction with the vtkGenericDataSet and vtkGenericAdaptorCell classes. This algorithm is based on edge subdivision. An error metric along each edge is evaluated, and if the error is greater than some tolerance, the edge is subdivided (as well as all connected 2D and 3D cells). The process repeats until the error metric is satisfied. Since the algorithm is based on edge subdivision it inherently avoid T-junctions. A significant issue addressed by this algorithm is to insure face compatibility across neigboring cells. That is, diagonals due to face triangulation must match to insure that the mesh is compatible. The algorithm employs a precomputed table to accelerate the tessellation process. The table was generated with the help of vtkOrderedTriangulator the basic idea is that the choice of diagonal is made only by considering the relative value of the point ids. @sa vtkGenericCellTessellator vtkGenericSubdivisionErrorMetric vtkAttributesErrorMetric vtkGeometricErrorMetric vtkViewDependentErrorMetric V.SafeDownCast(vtkObjectBase) -> vtkSimpleCellTessellator C++: static vtkSimpleCellTessellator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkSimpleCellTessellator C++: vtkSimpleCellTessellator *NewInstance() V.GetGenericCell() -> vtkGenericAdaptorCell C++: virtual vtkGenericAdaptorCell *GetGenericCell() Get the higher order cell in order to access the evaluation function. V.TessellateFace(vtkGenericAdaptorCell, vtkGenericAttributeCollection, int, vtkDoubleArray, vtkCellArray, vtkPointData) C++: void TessellateFace(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkIdType index, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) override; Tessellate a face of a 3D `cell'. The face is specified by the index value. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==3 \pre valid_index_range: (index>=0) && (indexGetNumberOfBoundaries(2)) \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 V.Tessellate(vtkGenericAdaptorCell, vtkGenericAttributeCollection, vtkDoubleArray, vtkCellArray, vtkPointData) C++: void Tessellate(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) override; Tessellate a 3D `cell'. The result is a set of smaller linear tetrahedra in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==3 \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 V.Triangulate(vtkGenericAdaptorCell, vtkGenericAttributeCollection, vtkDoubleArray, vtkCellArray, vtkPointData) C++: void Triangulate(vtkGenericAdaptorCell *cell, vtkGenericAttributeCollection *att, vtkDoubleArray *points, vtkCellArray *cellArray, vtkPointData *internalPd) override; Triangulate a 2D `cell'. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'. \pre cell_exists: cell!=0 \pre valid_dimension: cell->GetDimension()==2 \pre att_exists: att!=0 \pre points_exists: points!=0 \pre cellArray_exists: cellArray!=0 \pre internalPd_exists: internalPd!=0 V.Reset() C++: void Reset() Reset the output for repeated use of this class. V.Initialize(vtkGenericDataSet) C++: void Initialize(vtkGenericDataSet *ds) override; Initialize the tessellator with a data set `ds'. GetFixedSubdivisionsV.GetFixedSubdivisions() -> int C++: int GetFixedSubdivisions() Return the number of fixed subdivisions. It is used to prevent from infinite loop in degenerated cases. For order 3 or higher, if the inflection point is exactly on the mid-point, error metric will not detect that a subdivision is required. 0 means no fixed subdivision: there will be only adaptive subdivisions. * The algorithm first performs `GetFixedSubdivisions' non adaptive * subdivisions followed by at most `GetMaxAdaptiveSubdivisions' adaptive * subdivisions. Hence, there are at most `GetMaxSubdivisionLevel' * subdivisions. * \post positive_result: result>=0 && result<=GetMaxSubdivisionLevel() GetMaxSubdivisionLevelV.GetMaxSubdivisionLevel() -> int C++: int GetMaxSubdivisionLevel() Return the maximum level of subdivision. It is used to prevent from infinite loop in degenerated cases. For order 3 or higher, if the inflection point is exactly on the mid-point, error metric will not detect that a subdivision is required. 0 means no subdivision, neither fixed nor adaptive. \post positive_result: result>=GetFixedSubdivisions() GetMaxAdaptiveSubdivisionsV.GetMaxAdaptiveSubdivisions() -> int C++: int GetMaxAdaptiveSubdivisions() Return the maximum number of adaptive subdivisions. \post valid_result: result==GetMaxSubdivisionLevel()-GetFixedSubdivisions() SetFixedSubdivisionsV.SetFixedSubdivisions(int) C++: void SetFixedSubdivisions(int level) Set the number of fixed subdivisions. See GetFixedSubdivisions() for more explanations. \pre positive_level: level>=0 && level<=GetMaxSubdivisionLevel() \post is_set: GetFixedSubdivisions()==level SetMaxSubdivisionLevelV.SetMaxSubdivisionLevel(int) C++: void SetMaxSubdivisionLevel(int level) Set the maximum level of subdivision. See GetMaxSubdivisionLevel() for more explanations. \pre positive_level: level>=GetFixedSubdivisions() \post is_set: level==GetMaxSubdivisionLevel() SetSubdivisionLevelsV.SetSubdivisionLevels(int, int) C++: void SetSubdivisionLevels(int fixed, int maxLevel) Set both the number of fixed subdivisions and the maximum level of subdivisions. See GetFixedSubdivisions(), GetMaxSubdivisionLevel() and GetMaxAdaptiveSubdivisions() for more explanations. \pre positive_fixed: fixed>=0 \pre valid_range: fixed<=maxLevel \post fixed_is_set: fixed==GetFixedSubdivisions() \post maxLevel_is_set: maxLevel==GetMaxSubdivisionLevel() vtkSmoothErrorMetricvtkCommonDataModelPython.vtkSmoothErrorMetricvtkSmoothErrorMetric - Objects that compute geometry-based error during cell tessellation according to some max angle. Superclass: vtkGenericSubdivisionErrorMetric It is a concrete error metric, based on a geometric criterium: a max angle between the chord passing through the midpoint and one of the endpoints and the other chord passing through the midpoint and the other endpoint of the edge. It is related to the flatness of an edge. @sa vtkGenericCellTessellator vtkGenericSubdivisionErrorMetric V.SafeDownCast(vtkObjectBase) -> vtkSmoothErrorMetric C++: static vtkSmoothErrorMetric *SafeDownCast(vtkObjectBase *o) Standard VTK type and error macros. V.NewInstance() -> vtkSmoothErrorMetric C++: vtkSmoothErrorMetric *NewInstance() Standard VTK type and error macros. GetAngleToleranceV.GetAngleTolerance() -> float C++: double GetAngleTolerance() Return the flatness threshold. \post positive_result: result>90 && result<180 SetAngleToleranceV.SetAngleTolerance(float) C++: void SetAngleTolerance(double value) Set the flatness threshold with an angle in degrees. Internally compute the cosine. value is supposed to be in ]90,180[, if not it is clamped in [90.1,179.9]. For instance 178 will give better result than 150. V.RequiresEdgeSubdivision([float, ...], [float, ...], [float, ...], float) -> int C++: int RequiresEdgeSubdivision(double *leftPoint, double *midPoint, double *rightPoint, double alpha) override; Does the edge need to be subdivided according to the cosine between the two chords passing through the mid-point and the endpoints? The edge is defined by its `leftPoint' and its `rightPoint'. `leftPoint', `midPoint' and `rightPoint' have to be initialized before calling RequiresEdgeSubdivision(). Their format is global coordinates, parametric coordinates and point centered attributes: xyx rst abc de... `alpha' is the normalized abscissa of the midpoint along the edge. (close to 0 means close to the left point, close to 1 means close to the right point) \pre leftPoint_exists: leftPoint!=0 \pre midPoint_exists: midPoint!=0 \pre rightPoint_exists: rightPoint!=0 \pre clamped_alpha: alpha>0 && alpha<1 \pre valid_size: sizeof(leftPoint)=sizeof(midPoint)=sizeof(rightPoint) =GetAttributeCollection()->GetNumberOfPointCenteredComponents()+6 vtkSortFieldDatavtkCommonDataModelPython.vtkSortFieldDatavtkSortFieldData - provides a method for sorting field data Superclass: vtkSortDataArray vtkSortFieldData is used to sort data, based on its value, or with an associated key, into either ascending or descending order. This is useful for operations like selection, or analysis, when evaluating and processing data. This class, which extends the base functionality of vtkSortDataArray, is used to sort field data and its various subclasses (vtkFieldData, vtkDataSetAttributes, vtkPointData, vtkCellData, etc.) @warning This class has been threaded with vtkSMPTools. Using TBB or other non-sequential type (set in the CMake variable VTK_SMP_IMPLEMENTATION_TYPE) may improve performance significantly on multi-core machines. @warning The sort methods below are static, hence the sorting methods can be used without instantiating the class. All methods are thread safe. @sa vtkSortDataArray V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard VTK methods for instantiating, managing type, and printing information about this class. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard VTK methods for instantiating, managing type, and printing information about this class. V.SafeDownCast(vtkObjectBase) -> vtkSortFieldData C++: static vtkSortFieldData *SafeDownCast(vtkObjectBase *o) Standard VTK methods for instantiating, managing type, and printing information about this class. V.NewInstance() -> vtkSortFieldData C++: vtkSortFieldData *NewInstance() Standard VTK methods for instantiating, managing type, and printing information about this class. SortV.Sort(vtkFieldData, string, int, int) -> (int, ...) C++: static vtkIdType *Sort(vtkFieldData *fd, const char *arrayName, int k, int returnIndices) V.Sort(vtkFieldData, string, int, int, int) -> (int, ...) C++: static vtkIdType *Sort(vtkFieldData *fd, const char *arrayName, int k, int returnIndices, int dir) Given field data (and derived classes such as point data and cell data), sort all the arrays in the field data given an array and a component number k from that array. In other words, if an array has n components, the kth component is used to sort the array and all of the other arrays in the field data. Also note that the user can indicate whether the function returns the sort indices (returnIndices=1). If the indices are returned, then the user takes ownership of the data and must delete it. Note that the indices are in sorted (ascending) order, and indicate the final sorted position of the sort. So for example indices[0]=10 indicates that the original data in position 10 in the field, was moved to position 0 after the sort. By default, returnIndices=0. (Other notes: if any array is not the same length as the sorting array, then it will be skipped and not sorted.) vtkSortDataArrayvtkSpherevtkCommonDataModelPython.vtkSpherevtkSphere - implicit function for a sphere Superclass: vtkImplicitFunction vtkSphere computes the implicit function and/or gradient for a sphere. vtkSphere is a concrete implementation of vtkImplicitFunction. Additional methods are available for sphere-related computations, such as computing bounding spheres for a set of points, or set of spheres. V.SafeDownCast(vtkObjectBase) -> vtkSphere C++: static vtkSphere *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkSphere C++: vtkSphere *NewInstance() V.EvaluateFunction([float, float, float]) -> float C++: double EvaluateFunction(double x[3]) override; V.EvaluateFunction(vtkDataArray, vtkDataArray) C++: virtual void EvaluateFunction(vtkDataArray *input, vtkDataArray *output) V.EvaluateFunction(float, float, float) -> float C++: virtual double EvaluateFunction(double x, double y, double z) Evaluate sphere equation ((x-x0)^2 + (y-y0)^2 + (z-z0)^2) - R^2. V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double n[3]) override; Evaluate sphere gradient. V.SetRadius(float) C++: virtual void SetRadius(double _arg) Set / get the radius of the sphere. The default is 0.5. V.GetRadius() -> float C++: virtual double GetRadius() Set / get the radius of the sphere. The default is 0.5. V.GetCenter() -> (float, float, float) C++: double *GetCenter() Set / get the center of the sphere. The default is (0,0,0). ComputeBoundingSphereV.ComputeBoundingSphere([float, ...], int, [float, float, float, float], [int, int]) C++: static void ComputeBoundingSphere(double *pts, vtkIdType numPts, double sphere[4], vtkIdType hints[2]) Create a bounding sphere from a set of points. The set of points is defined by an array of doubles, in the order of x-y-z (which repeats for each point). An optional hints array provides a guess for the initial bounding sphere; the two values in the hints array are the two points expected to be the furthest apart. The output sphere consists of a center (x-y-z) and a radius. vtkSplinevtkCommonDataModelPython.vtkSplinevtkSpline - spline abstract class for interpolating splines Superclass: vtkObject vtkSpline interpolates a set of data points (i.e., interpolation means that the spline passes through the points). vtkSpline is an abstract class: its subclasses vtkCardinalSpline and vtkKochanekSpline do the interpolation. Note that this spline maps the 1D parametric coordinate t into a single value x. Thus if you want to use the spline to interpolate points (i.e. x[3]), you have to create three splines for each of the x-y-z coordinates. Fortunately, the vtkParametricSpline class does this for you. Typically a spline is used by adding a sequence of parametric coordinate / data (t,x) values followed by use of an evaluation function (e.g., vtkCardinalSpline::Evaluate()). Since these splines are 1D, a point in this context is an independent / dependent variable pair. Splines can also be set up to be closed or open. Closed splines continue from the last point to the first point with continuous function and derivative values. (You don't need to duplicate the first point to close the spline, just set ClosedOn.) This implementation of splines does not use a normalized parametric coordinate. If the spline is open, then the parameter space is (tMin <= t <= tMax) where tMin and tMax are the minimum and maximum parametric values seen when performing AddPoint(). If the spline is closed, then the parameter space is (tMin <= t <= (tMax+1)) where tMin and tMax are the minimum and maximum parametric values seen when performing AddPoint(). Note, however, that this behavior can be changed by explicitly setting the ParametricRange(tMin,tMax). If set, the parameter space remains (tMin <= t <= tMax), except that additions of data with parametric values outside this range are clamped within this range. @sa vtkCardinalSpline vtkKochanekSpline vtkParametricSpline vtkParametricFunctionSource V.SafeDownCast(vtkObjectBase) -> vtkSpline C++: static vtkSpline *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkSpline C++: vtkSpline *NewInstance() SetParametricRangeV.SetParametricRange(float, float) C++: void SetParametricRange(double tMin, double tMax) V.SetParametricRange([float, float]) C++: void SetParametricRange(double tRange[2]) Set/Get the parametric range. If not set, the range is determined implicitly by keeping track of the (min,max) parameter values for t. If set, the AddPoint() method will clamp the t value to lie within the specified range. GetParametricRangeV.GetParametricRange([float, float]) C++: void GetParametricRange(double tRange[2]) Set/Get the parametric range. If not set, the range is determined implicitly by keeping track of the (min,max) parameter values for t. If set, the AddPoint() method will clamp the t value to lie within the specified range. SetClampValueV.SetClampValue(int) C++: virtual void SetClampValue(int _arg) Set/Get ClampValue. If On, results of the interpolation will be clamped to the min/max of the input data. GetClampValueV.GetClampValue() -> int C++: virtual int GetClampValue() Set/Get ClampValue. If On, results of the interpolation will be clamped to the min/max of the input data. ClampValueOnV.ClampValueOn() C++: virtual void ClampValueOn() Set/Get ClampValue. If On, results of the interpolation will be clamped to the min/max of the input data. ClampValueOffV.ClampValueOff() C++: virtual void ClampValueOff() Set/Get ClampValue. If On, results of the interpolation will be clamped to the min/max of the input data. ComputeV.Compute() C++: virtual void Compute() Compute the coefficients for the spline. V.Evaluate(float) -> float C++: virtual double Evaluate(double t) Interpolate the value of the spline at parametric location of t. V.GetNumberOfPoints() -> int C++: int GetNumberOfPoints() Return the number of points inserted thus far. V.AddPoint(float, float) C++: void AddPoint(double t, double x) Add a pair of points to be fit with the spline. V.RemovePoint(float) C++: void RemovePoint(double t) Remove a point from the data to be fit with the spline. V.RemoveAllPoints() C++: void RemoveAllPoints() Remove all points from the data. SetClosedV.SetClosed(int) C++: virtual void SetClosed(int _arg) Control whether the spline is open or closed. A closed spline forms a continuous loop: the first and last points are the same, and derivatives are continuous. GetClosedV.GetClosed() -> int C++: virtual int GetClosed() Control whether the spline is open or closed. A closed spline forms a continuous loop: the first and last points are the same, and derivatives are continuous. ClosedOnV.ClosedOn() C++: virtual void ClosedOn() Control whether the spline is open or closed. A closed spline forms a continuous loop: the first and last points are the same, and derivatives are continuous. ClosedOffV.ClosedOff() C++: virtual void ClosedOff() Control whether the spline is open or closed. A closed spline forms a continuous loop: the first and last points are the same, and derivatives are continuous. SetLeftConstraintV.SetLeftConstraint(int) C++: virtual void SetLeftConstraint(int _arg) Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetLeftConstraintMinValueV.GetLeftConstraintMinValue() -> int C++: virtual int GetLeftConstraintMinValue() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetLeftConstraintMaxValueV.GetLeftConstraintMaxValue() -> int C++: virtual int GetLeftConstraintMaxValue() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetLeftConstraintV.GetLeftConstraint() -> int C++: virtual int GetLeftConstraint() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. SetRightConstraintV.SetRightConstraint(int) C++: virtual void SetRightConstraint(int _arg) Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetRightConstraintMinValueV.GetRightConstraintMinValue() -> int C++: virtual int GetRightConstraintMinValue() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetRightConstraintMaxValueV.GetRightConstraintMaxValue() -> int C++: virtual int GetRightConstraintMaxValue() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. GetRightConstraintV.GetRightConstraint() -> int C++: virtual int GetRightConstraint() Set the type of constraint of the left(right) end points. Four constraints are available: * 0: the first derivative at left(right) most point is determined * from the line defined from the first(last) two points. * 1: the first derivative at left(right) most point is set to * Left(Right)Value. * 2: the second derivative at left(right) most point is set to * Left(Right)Value. * 3: the second derivative at left(right)most points is Left(Right)Value * times second derivative at first interior point. SetLeftValueV.SetLeftValue(float) C++: virtual void SetLeftValue(double _arg) The values of the derivative on the left and right sides. The value is used only if the left(right) constraint is type 1-3. GetLeftValueV.GetLeftValue() -> float C++: virtual double GetLeftValue() The values of the derivative on the left and right sides. The value is used only if the left(right) constraint is type 1-3. SetRightValueV.SetRightValue(float) C++: virtual void SetRightValue(double _arg) The values of the derivative on the left and right sides. The value is used only if the left(right) constraint is type 1-3. GetRightValueV.GetRightValue() -> float C++: virtual double GetRightValue() The values of the derivative on the left and right sides. The value is used only if the left(right) constraint is type 1-3. V.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Return the MTime also considering the Piecewise function. V.DeepCopy(vtkSpline) C++: virtual void DeepCopy(vtkSpline *s) Deep copy of spline data. vtkStaticCellLinksvtkCommonDataModelPython.vtkStaticCellLinksvtkStaticCellLinks - object represents upward pointers from points to list of cells using each point Superclass: vtkAbstractCellLinks vtkStaticCellLinks is a supplemental object to vtkCellArray and vtkCellTypes, enabling access from points to the cells using the points. vtkStaticCellLinks is an array of links, each link represents a list of cell ids using a particular point. The information provided by this object can be used to determine neighbors and construct other local topological information. This class is a faster implementation of vtkCellLinks. However, it cannot be incrementally constructed; it is meant to be constructed once (statically) and must be rebuilt if the cells change. @warning This is a drop-in replacement for vtkCellLinks using static link construction. It uses the templated vtkStaticCellLinksTemplate class, instantiating vtkStaticCellLinksTemplate with a vtkIdType template parameter. Note that for best performance, the vtkStaticCellLinksTemplate class may be used directly, instantiating it with the appropriate id type. This class is also wrappable and can be used from an interpreted language such as Python. @sa vtkCellLinks vtkStaticCellLinksTemplate V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard methods for instantiation, type manipulation and printing. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard methods for instantiation, type manipulation and printing. V.SafeDownCast(vtkObjectBase) -> vtkStaticCellLinks C++: static vtkStaticCellLinks *SafeDownCast(vtkObjectBase *o) Standard methods for instantiation, type manipulation and printing. V.NewInstance() -> vtkStaticCellLinks C++: vtkStaticCellLinks *NewInstance() Standard methods for instantiation, type manipulation and printing. V.BuildLinks(vtkDataSet) C++: void BuildLinks(vtkDataSet *ds) override; Build the link list array. Satisfy the superclass API. V.GetNumberOfCells(int) -> int C++: vtkIdType GetNumberOfCells(vtkIdType ptId) Get the number of cells using the point specified by ptId. V.GetNcells(int) -> int C++: unsigned short GetNcells(vtkIdType ptId) Get the number of cells using the point specified by ptId. This is an alias for GetNumberOfCells(); consistent with the vtkCellLinks API. V.GetCells(int) -> (int, ...) C++: const vtkIdType *GetCells(vtkIdType ptId) Return a list of cell ids using the specified point. V.Initialize() C++: void Initialize() Make sure any previously created links are cleaned up. vtkStaticCellLocatorvtkCommonDataModelPython.vtkStaticCellLocatorvtkStaticCellLocator - perform fast cell location operations Superclass: vtkAbstractCellLocator vtkStaticCellLocator is a type of vtkAbstractCellLocator that accelerates certain operations when performing spatial operations on cells. These operations include finding a point that contains a cell, and intersecting cells with a line. vtkStaticCellLocator is an accelerated version of vtkCellLocator. It is threaded (via vtkSMPTools), and supports one-time static construction (i.e., incremental cell insertion is not supported). @warning This class is templated. It may run slower than serial execution if the code is not optimized during compilation. Build in Release or ReleaseWithDebugInfo. @warning This class *always* caches cell bounds. @sa vtkLocator vakAbstractCellLocator vtkCellLocator vtkCellTreeLocator vtkModifiedBSPTree V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard methods to instantiate, print and obtain type-related information. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard methods to instantiate, print and obtain type-related information. V.SafeDownCast(vtkObjectBase) -> vtkStaticCellLocator C++: static vtkStaticCellLocator *SafeDownCast(vtkObjectBase *o) Standard methods to instantiate, print and obtain type-related information. V.NewInstance() -> vtkStaticCellLocator C++: vtkStaticCellLocator *NewInstance() Standard methods to instantiate, print and obtain type-related information. V.GetDivisions() -> (int, int, int) C++: int *GetDivisions() Set the number of divisions in x-y-z directions. If the Automatic data member is enabled, the Divisions are set according to the NumberOfCellsPerNode and MaxNumberOfBuckets data members. The number of divisions must be >= 1 in each direction. V.FindCell([float, float, float], float, vtkGenericCell, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double pos[3], double, vtkGenericCell *cell, double pcoords[3], double *weights) override; V.FindCell([float, float, float]) -> int C++: vtkIdType FindCell(double x[3]) override; Test a point to find if it is inside a cell. Returns the cellId if inside or -1 if not. V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int, vtkGenericCell) -> int C++: int IntersectWithLine(double a0[3], double a1[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) override; V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) override; V.IntersectWithLine((float, float, float), (float, float, float), vtkPoints, vtkIdList) -> int C++: int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) override; Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell. SetMaxNumberOfBucketsV.SetMaxNumberOfBuckets(int) C++: virtual void SetMaxNumberOfBuckets(vtkIdType _arg) Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsMinValueV.GetMaxNumberOfBucketsMinValue() -> int C++: virtual vtkIdType GetMaxNumberOfBucketsMinValue() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsMaxValueV.GetMaxNumberOfBucketsMaxValue() -> int C++: virtual vtkIdType GetMaxNumberOfBucketsMaxValue() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsV.GetMaxNumberOfBuckets() -> int C++: virtual vtkIdType GetMaxNumberOfBuckets() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetLargeIdsV.GetLargeIds() -> bool C++: bool GetLargeIds() Inform the user as to whether large ids are being used. This flag only has meaning after the locator has been built. Large ids are used when the number of binned points, or the number of bins, is >= the maximum number of buckets (specified by the user). Note that LargeIds are only available on 64-bit architectures. vtkStaticPointLocatorvtkCommonDataModelPython.vtkStaticPointLocatorvtkStaticPointLocator - quickly locate points in 3-space Superclass: vtkAbstractPointLocator vtkStaticPointLocator is a spatial search object to quickly locate points in 3D. vtkStaticPointLocator works by dividing a specified region of space into a regular array of cuboid buckets, and then keeping a list of points that lie in each bucket. Typical operation involves giving a position in 3D and finding the closest point; or finding the N closest points. vtkStaticPointLocator is an accelerated version of vtkPointLocator. It is threaded (via vtkSMPTools), and supports one-time static construction (i.e., incremental point insertion is not supported). If you need to incrementally insert points, use the vtkPointLocator or its kin to do so. @warning This class is templated. It may run slower than serial execution if the code is not optimized during compilation. Build in Release or ReleaseWithDebugInfo. @warning Make sure that you review the documentation for the superclasses vtkAbstactPointLocator and vtkLocator. In particular the Automatic data member can be used to automatically determine divisions based on the average number of points per bucket. @warning Other types of spatial locators have been developed such as octrees and kd-trees. These are often more efficient for the operations described here. @sa vtkPointLocator vtkCellLocator vtkLocator vtkAbstractPointLocator V.SafeDownCast(vtkObjectBase) -> vtkStaticPointLocator C++: static vtkStaticPointLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkStaticPointLocator C++: vtkStaticPointLocator *NewInstance() Standard type and print methods. V.SetNumberOfPointsPerBucket(int) C++: virtual void SetNumberOfPointsPerBucket(int _arg) Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. V.GetNumberOfPointsPerBucketMinValue() -> int C++: virtual int GetNumberOfPointsPerBucketMinValue() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. V.GetNumberOfPointsPerBucketMaxValue() -> int C++: virtual int GetNumberOfPointsPerBucketMaxValue() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. V.GetNumberOfPointsPerBucket() -> int C++: virtual int GetNumberOfPointsPerBucket() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. V.GetDivisions() -> (int, int, int) C++: int *GetDivisions() Set the number of divisions in x-y-z directions. If the Automatic data member is enabled, the Divisions are set according to the NumberOfPointsPerBucket and MaxNumberOfBuckets data members. The number of divisions must be >= 1 in each direction. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z) Given a position x, return the id of the point closest to it. An alternative method (defined in the superclass) requires separate x-y-z values. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; V.FindClosestPointWithinRadius(float, (float, float, float), float, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double inputDataLength, double &dist2) Given a position x and a radius r, return the id of the point closest to the point in that radius. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. dist2 returns the squared distance to the point. Note that if multiple points are located the same distance away, the actual point returned is a function in which order the points are processed (i.e., indeterminate). V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; V.FindClosestNPoints(int, float, float, float, vtkIdList) C++: void FindClosestNPoints(int N, double x, double y, double z, vtkIdList *result) Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) override; V.FindPointsWithinRadius(float, float, float, float, vtkIdList) C++: void FindPointsWithinRadius(double R, double x, double y, double z, vtkIdList *result) Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.Initialize() C++: void Initialize() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. V.FreeSearchStructure() C++: void FreeSearchStructure() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. V.BuildLocator() C++: void BuildLocator() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; Populate a polydata with the faces of the bins that potentially contain cells. Note that the level parameter has no effect on this method as there is no hierarchy built (i.e., uniform binning). Typically this is used for debugging. GetNumberOfPointsInBucketV.GetNumberOfPointsInBucket(int) -> int C++: vtkIdType GetNumberOfPointsInBucket(vtkIdType bNum) Given a bucket number bNum between 0 <= bNum < this->GetNumberOfBuckets(), return the number of points found in the bucket. GetBucketIdsV.GetBucketIds(int, vtkIdList) C++: void GetBucketIds(vtkIdType bNum, vtkIdList *bList) Given a bucket number bNum between 0 <= bNum < this->GetNumberOfBuckets(), return a list of point ids contained within the bucket. The user must provide an instance of vtkIdList to contain the result. vtkStructuredDataVTK_UNCHANGEDVTK_SINGLE_POINTVTK_X_LINEVTK_Y_LINEVTK_Z_LINEVTK_XY_PLANEVTK_YZ_PLANEVTK_XZ_PLANEVTK_XYZ_GRIDVTK_EMPTYvtkCommonDataModelPython.vtkStructuredDatavtkStructuredData - Singleton class for topologically regular data Superclass: vtkObject vtkStructuredData is a singleton class that provides an interface for topologically regular data. Regular data is data that can be accessed in rectangular fashion using an i-j-k index. A finite difference grid, a volume, or a pixmap are all considered regular. @sa vtkStructuredGrid vtkUniformGrid vtkRectilinearGrid vtkRectilinearGrid V.SafeDownCast(vtkObjectBase) -> vtkStructuredData C++: static vtkStructuredData *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkStructuredData C++: vtkStructuredData *NewInstance() V.SetDimensions([int, int, int], [int, int, int]) -> int C++: static int SetDimensions(int inDim[3], int dim[3]) Specify the dimensions of a regular, rectangular dataset. The input is the new dimensions (inDim) and the current dimensions (dim). The function returns the dimension of the dataset (0-3D). If the dimensions are improperly specified a -1 is returned. If the dimensions are unchanged, a value of 100 is returned. V.SetExtent([int, int, int, int, int, int], [int, int, int, int, int, int]) -> int C++: static int SetExtent(int inExt[6], int ext[6]) Specify the dimensions of a regular, rectangular dataset. The input is the new dimensions (inDim) and the current dimensions (dim). The function returns the dimension of the dataset (0-3D). If the dimensions are improperly specified a -1 is returned. If the dimensions are unchanged, a value of 100 is returned. GetDataDescriptionV.GetDataDescription([int, int, int]) -> int C++: static int GetDataDescription(int dims[3]) Returns the data description given the dimensions (eg. VTK_SINGLE_POINT, VTK_X_LINE, VTK_XY_PLANE etc.) GetDataDescriptionFromExtentV.GetDataDescriptionFromExtent([int, int, int, int, int, int]) -> int C++: static int GetDataDescriptionFromExtent(int ext[6]) Returns the data description given the dimensions (eg. VTK_SINGLE_POINT, VTK_X_LINE, VTK_XY_PLANE etc.) V.GetDataDimension(int) -> int C++: static int GetDataDimension(int dataDescription) V.GetDataDimension([int, int, int, int, int, int]) -> int C++: static int GetDataDimension(int ext[6]) Return the topological dimension of the data (e.g., 0, 1, 2, or 3D). V.GetNumberOfPoints([int, int, int, int, int, int], int) -> int C++: static vtkIdType GetNumberOfPoints(int ext[6], int dataDescription=VTK_EMPTY) Given the grid extent, this method returns the total number of points within the extent. The dataDescription field is not used. V.GetNumberOfCells([int, int, int, int, int, int], int) -> int C++: static vtkIdType GetNumberOfCells(int ext[6], int dataDescription=VTK_EMPTY) Given the grid extent, this method returns the total number of cells within the extent. The dataDescription field is not used. GetCellExtentFromPointExtentV.GetCellExtentFromPointExtent([int, int, int, int, int, int], [int, int, int, int, int, int], int) C++: static void GetCellExtentFromPointExtent(int pntExtent[6], int cellExtent[6], int dataDescription=VTK_EMPTY) Given the point extent of a grid, this method computes the corresponding cell extent for the grid. The dataDescription field is not used. GetDimensionsFromExtentV.GetDimensionsFromExtent([int, int, int, int, int, int], [int, int, int], int) C++: static void GetDimensionsFromExtent(int ext[6], int dims[3], int dataDescription=VTK_EMPTY) Computes the structured grid dimensions based on the given extent. The dataDescription field is not used. GetCellDimensionsFromExtentV.GetCellDimensionsFromExtent([int, int, int, int, int, int], [int, int, int], int) C++: static void GetCellDimensionsFromExtent(int ext[6], int celldims[3], int dataDescription=VTK_EMPTY) Returns the cell dimensions, i.e., the number of cells along the i,j,k for the grid with the given grid extent. Note, the grid extent is the number of points. The dataDescription field is not used. GetCellDimensionsFromPointDimensionsV.GetCellDimensionsFromPointDimensions([int, int, int], [int, int, int]) C++: static void GetCellDimensionsFromPointDimensions( int pntdims[3], int cellDims[3]) Given the dimensions of the grid, in pntdims, this method returns the corresponding cell dimensions for the given grid. The dataDescription field is not used. GetLocalStructuredCoordinatesV.GetLocalStructuredCoordinates([int, int, int], [int, int, int, int, int, int], [int, int, int], int) C++: static void GetLocalStructuredCoordinates(int ijk[3], int ext[6], int lijk[3], int dataDescription=VTK_EMPTY) Given the global structured coordinates for a point or cell, ijk, w.r.t. as well as, the global sub-grid cell or point extent, this method computes the corresponding local structured coordinates, lijk, starting from 0. The dataDescription argument is not used. GetGlobalStructuredCoordinatesV.GetGlobalStructuredCoordinates([int, int, int], [int, int, int, int, int, int], [int, int, int], int) C++: static void GetGlobalStructuredCoordinates(int lijk[3], int ext[6], int ijk[3], int dataDescription=VTK_EMPTY) Given local structured coordinates, and the corresponding global sub-grid extent, this method computes the global ijk coordinates. The dataDescription parameter is not used. V.GetCellPoints(int, vtkIdList, int, [int, int, int]) C++: static void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds, int dataDescription, int dim[3]) Get the points defining a cell. (See vtkDataSet for more info.) V.GetPointCells(int, vtkIdList, [int, int, int]) C++: static void GetPointCells(vtkIdType ptId, vtkIdList *cellIds, int dim[3]) Get the cells using a point. (See vtkDataSet for more info.) V.GetCellNeighbors(int, vtkIdList, vtkIdList, [int, int, int]) C++: static void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds, int dim[3]) V.GetCellNeighbors(int, vtkIdList, vtkIdList, [int, int, int], [int, int, int]) C++: static void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds, int dim[3], int seedLoc[3]) Get the cells using the points ptIds, exclusive of the cell cellId. (See vtkDataSet for more info.) ComputePointIdForExtentV.ComputePointIdForExtent([int, int, int, int, int, int], [int, int, int], int) -> int C++: static vtkIdType ComputePointIdForExtent(int extent[6], int ijk[3], int dataDescription=VTK_EMPTY) Given a location in structured coordinates (i-j-k), and the extent of the structured dataset, return the point id. The dataDescription argument is not used. ComputeCellIdForExtentV.ComputeCellIdForExtent([int, int, int, int, int, int], [int, int, int], int) -> int C++: static vtkIdType ComputeCellIdForExtent(int extent[6], int ijk[3], int dataDescription=VTK_EMPTY) Given a location in structured coordinates (i-j-k), and the extent of the structured dataset, return the point id. The dataDescription argument is not used. V.ComputePointId([int, int, int], [int, int, int], int) -> int C++: static vtkIdType ComputePointId(int dim[3], int ijk[3], int dataDescription=VTK_EMPTY) Given a location in structured coordinates (i-j-k), and the dimensions of the structured dataset, return the point id. This method does not adjust for the beginning of the extent. The dataDescription argument is not used. V.ComputeCellId([int, int, int], [int, int, int], int) -> int C++: static vtkIdType ComputeCellId(int dim[3], int ijk[3], int dataDescription=VTK_EMPTY) Given a location in structured coordinates (i-j-k), and the dimensions of the structured dataset, return the cell id. This method does not adjust for the beginning of the extent. The dataDescription argument is not used. ComputeCellStructuredCoordsForExtentV.ComputeCellStructuredCoordsForExtent(int, [int, int, int, int, int, int], [int, int, int], int) C++: static void ComputeCellStructuredCoordsForExtent( const vtkIdType cellIdx, int ext[6], int ijk[3], int dataDescription=VTK_EMPTY) Given the global grid extent and the linear index of a cell within the grid extent, this method computes the corresponding structured coordinates of the given cell. This method adjusts for the beginning of the extent. The dataDescription argument is not used. ComputeCellStructuredCoordsV.ComputeCellStructuredCoords(int, [int, int, int], [int, int, int], int) C++: static void ComputeCellStructuredCoords( const vtkIdType cellId, int dim[3], int ijk[3], int dataDescription=VTK_EMPTY) Given a cellId and grid dimensions 'dim', get the structured coordinates (i-j-k). This method does not adjust for the beginning of the extent. The dataDescription argument is not used. ComputePointStructuredCoordsForExtentV.ComputePointStructuredCoordsForExtent(int, [int, int, int, int, int, int], [int, int, int], int) C++: static void ComputePointStructuredCoordsForExtent( const vtkIdType ptId, int ext[6], int ijk[3], int dataDescription=VTK_EMPTY) Given a pointId and the grid extent ext, get the structured coordinates (i-j-k). This method adjusts for the beginning of the extent. The dataDescription argument is not used. ComputePointStructuredCoordsV.ComputePointStructuredCoords(int, [int, int, int], [int, int, int], int) C++: static void ComputePointStructuredCoords( const vtkIdType ptId, int dim[3], int ijk[3], int dataDescription=VTK_EMPTY) Given a pointId and grid dimensions 'dim', get the structured coordinates (i-j-k). This method does not adjust for the beginning of the extent. The dataDescription argument is not used. vtkStructuredExtentvtkCommonDataModelPython.vtkStructuredExtentvtkStructuredExtent - helper class to aid working with structured extents. Superclass: vtkObject vtkStructuredExtent is an helper class that helps in arithmetic with structured extents. It defines a bunch of static methods (most of which are inlined) to aid in dealing with extents. V.SafeDownCast(vtkObjectBase) -> vtkStructuredExtent C++: static vtkStructuredExtent *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkStructuredExtent C++: vtkStructuredExtent *NewInstance() ClampV.Clamp([int, int, int, int, int, int], (int, ...)) C++: static void Clamp(int ext[6], const int wholeExt[]) Clamps ext to fit in wholeExt. StrictlySmallerV.StrictlySmaller((int, int, int, int, int, int), (int, int, int, int, int, int)) -> bool C++: static bool StrictlySmaller(const int ext[6], const int wholeExt[6]) Returns true if ext is fits within wholeExt with atleast 1 dimension smaller than the wholeExt. SmallerV.Smaller((int, int, int, int, int, int), (int, int, int, int, int, int)) -> bool C++: static bool Smaller(const int ext[6], const int wholeExt[6]) Returns if ext fits within wholeExt. Unline StrictlySmaller, this method returns true even if ext == wholeExt. V.Grow([int, int, int, int, int, int], int) C++: static void Grow(int ext[6], int count) V.Grow([int, int, int, int, int, int], int, [int, int, int, int, int, int]) C++: static void Grow(int ext[6], int count, int wholeExt[6]) Grows the ext on each side by the given count. TransformV.Transform([int, int, int, int, int, int], [int, int, int, int, int, int]) C++: static void Transform(int ext[6], int wholeExt[6]) Makes ext relative to wholeExt. V.GetDimensions((int, int, int, int, int, int), [int, int, int]) C++: static void GetDimensions(const int ext[6], int dims[3]) Given the extents, computes the dimensions. vtkStructuredGridvtkCommonDataModelPython.vtkStructuredGridvtkStructuredGrid - topologically regular array of data Superclass: vtkPointSet vtkStructuredGrid is a data object that is a concrete implementation of vtkDataSet. vtkStructuredGrid represents a geometric structure that is a topologically regular array of points. The topology is that of a cube that has been subdivided into a regular array of smaller cubes. Each point/cell can be addressed with i-j-k indices. Examples include finite difference grids. The order and number of points must match that specified by the dimensions of the grid. The point order increases in i fastest (from 0<=i vtkStructuredGrid C++: static vtkStructuredGrid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkStructuredGrid C++: vtkStructuredGrid *NewInstance() V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType ptId, double p[3]) override; V.GetPoint(int, int, int, [float, float, float], bool) C++: void GetPoint(int i, int j, int k, double p[3], bool adjustForExtent=true) Standard vtkDataSet API methods. See vtkDataSet for more information. V.Initialize() C++: void Initialize() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; V.GetCellNeighbors(int, vtkIdList, vtkIdList, [int, ...]) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds, int *seedLoc) Standard vtkDataSet API methods. See vtkDataSet for more information. V.SetDimensions(int, int, int) C++: void SetDimensions(int i, int j, int k) V.SetDimensions([int, int, int]) C++: void SetDimensions(int dim[3]) following methods are specific to structured grid V.GetDimensions() -> (int, int, int) C++: virtual int *GetDimensions() V.GetDimensions([int, int, int]) C++: virtual void GetDimensions(int dim[3]) Get dimensions of this structured points dataset. BlankPointV.BlankPoint(int) C++: void BlankPoint(vtkIdType ptId) Methods for supporting blanking of cells. Blanking turns on or off points in the structured grid, and hence the cells connected to them. These methods should be called only after the dimensions of the grid are set. UnBlankPointV.UnBlankPoint(int) C++: void UnBlankPoint(vtkIdType ptId) Methods for supporting blanking of cells. Blanking turns on or off points in the structured grid, and hence the cells connected to them. These methods should be called only after the dimensions of the grid are set. BlankCellV.BlankCell(int) C++: void BlankCell(vtkIdType ptId) Methods for supporting blanking of cells. Blanking turns on or off cells in the structured grid, and hence the points connected to them. These methods should be called only after the dimensions of the grid are set. UnBlankCellV.UnBlankCell(int) C++: void UnBlankCell(vtkIdType ptId) Methods for supporting blanking of cells. Blanking turns on or off cells in the structured grid, and hence the points connected to them. These methods should be called only after the dimensions of the grid are set. IsPointVisibleV.IsPointVisible(int) -> int C++: unsigned char IsPointVisible(vtkIdType ptId) Return non-zero value if specified point is visible. These methods should be called only after the dimensions of the grid are set. IsCellVisibleV.IsCellVisible(int) -> int C++: unsigned char IsCellVisible(vtkIdType cellId) Return non-zero value if specified point is visible. These methods should be called only after the dimensions of the grid are set. V.HasAnyBlankPoints() -> bool C++: bool HasAnyBlankPoints() override; Returns 1 if there is any visibility constraint on the points, 0 otherwise. V.HasAnyBlankCells() -> bool C++: bool HasAnyBlankCells() override; Returns 1 if there is any visibility constraint on the cells, 0 otherwise. GetCellDimsV.GetCellDims([int, int, int]) C++: void GetCellDims(int cellDims[3]) Given the node dimensions of this grid instance, this method computes the node dimensions. The value in each dimension can will have a lowest value of "1" such that computing the total number of cells can be achieved by simply by cellDims[0]*cellDims[1]*cellDims[2]. V.GetData(vtkInformation) -> vtkStructuredGrid C++: static vtkStructuredGrid *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkStructuredGrid C++: static vtkStructuredGrid *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkStructuredPointsCollectionvtkCommonDataModelPython.vtkStructuredPointsCollectionvtkStructuredPointsCollection - maintain a list of structured points data objects Superclass: vtkCollection vtkStructuredPointsCollection is an object that creates and manipulates ordered lists of structured points datasets. See also vtkCollection and subclasses. V.SafeDownCast(vtkObjectBase) -> vtkStructuredPointsCollection C++: static vtkStructuredPointsCollection *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkStructuredPointsCollection C++: vtkStructuredPointsCollection *NewInstance() V.AddItem(vtkStructuredPoints) C++: void AddItem(vtkStructuredPoints *ds) Add a pointer to a vtkStructuredPoints to the bottom of the list. V.GetNextItem() -> vtkStructuredPoints C++: vtkStructuredPoints *GetNextItem() Get the next item in the collection. nullptr is returned if the collection is exhausted. vtkStructuredPointsvtkCommonDataModelPython.vtkStructuredPointsvtkStructuredPoints - A subclass of ImageData. Superclass: vtkImageData StructuredPoints is a subclass of ImageData that requires the data extent to exactly match the update extent. Normall image data allows that the data extent may be larger than the update extent. StructuredPoints also defines the origin differently that vtkImageData. For structured points the origin is the location of first point. Whereas images define the origin as the location of point 0, 0, 0. Image Origin is stored in ivar, and structured points have special methods for setting/getting the origin/extents. V.SafeDownCast(vtkObjectBase) -> vtkStructuredPoints C++: static vtkStructuredPoints *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkStructuredPoints C++: vtkStructuredPoints *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; To simplify filter superclasses, vtkSuperquadricVTK_MIN_SUPERQUADRIC_THICKNESSvtkCommonDataModelPython.vtkSuperquadricvtkSuperquadric - implicit function for a Superquadric Superclass: vtkImplicitFunction vtkSuperquadric computes the implicit function and function gradient for a superquadric. vtkSuperquadric is a concrete implementation of vtkImplicitFunction. The superquadric is centered at Center and axes of rotation is along the y-axis. (Use the superclass' vtkImplicitFunction transformation matrix if necessary to reposition.) Roundness parameters (PhiRoundness and ThetaRoundness) control the shape of the superquadric. The Toroidal boolean controls whether a toroidal superquadric is produced. If so, the Thickness parameter controls the thickness of the toroid: 0 is the thinnest allowable toroid, and 1 has a minimum sized hole. The Scale parameters allow the superquadric to be scaled in x, y, and z (normal vectors are correctly generated in any case). The Size parameter controls size of the superquadric. This code is based on "Rigid physically based superquadrics", A. H. Barr, in "Graphics Gems III", David Kirk, ed., Academic Press, 1992. @warning The Size and Thickness parameters control coefficients of superquadric generation, and may do not exactly describe the size of the superquadric. V.SafeDownCast(vtkObjectBase) -> vtkSuperquadric C++: static vtkSuperquadric *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkSuperquadric C++: vtkSuperquadric *NewInstance() V.EvaluateGradient([float, float, float], [float, float, float]) C++: void EvaluateGradient(double x[3], double g[3]) override; Evaluate function gradient at position x-y-z and pass back vector. You should generally not call this method directly, you should use FunctionGradient() instead. This method must be implemented by any derived class. V.GetCenter() -> (float, float, float) C++: double *GetCenter() Set the center of the superquadric. Default is 0,0,0. V.SetScale(float, float, float) C++: void SetScale(double, double, double) V.SetScale((float, float, float)) C++: void SetScale(double a[3]) V.GetScale() -> (float, float, float) C++: double *GetScale() Set the scale factors of the superquadric. Default is 1,1,1. GetThicknessV.GetThickness() -> float C++: virtual double GetThickness() Set/Get Superquadric ring thickness (toroids only). Changing thickness maintains the outside diameter of the toroid. SetThicknessV.SetThickness(float) C++: virtual void SetThickness(double _arg) Set/Get Superquadric ring thickness (toroids only). Changing thickness maintains the outside diameter of the toroid. GetThicknessMinValueV.GetThicknessMinValue() -> float C++: virtual double GetThicknessMinValue() Set/Get Superquadric ring thickness (toroids only). Changing thickness maintains the outside diameter of the toroid. GetThicknessMaxValueV.GetThicknessMaxValue() -> float C++: virtual double GetThicknessMaxValue() Set/Get Superquadric ring thickness (toroids only). Changing thickness maintains the outside diameter of the toroid. GetPhiRoundnessV.GetPhiRoundness() -> float C++: virtual double GetPhiRoundness() Set/Get Superquadric north/south roundness. Values range from 0 (rectangular) to 1 (circular) to higher orders. SetPhiRoundnessV.SetPhiRoundness(float) C++: void SetPhiRoundness(double e) Set/Get Superquadric north/south roundness. Values range from 0 (rectangular) to 1 (circular) to higher orders. GetThetaRoundnessV.GetThetaRoundness() -> float C++: virtual double GetThetaRoundness() Set/Get Superquadric east/west roundness. Values range from 0 (rectangular) to 1 (circular) to higher orders. SetThetaRoundnessV.SetThetaRoundness(float) C++: void SetThetaRoundness(double e) Set/Get Superquadric east/west roundness. Values range from 0 (rectangular) to 1 (circular) to higher orders. SetSizeV.SetSize(float) C++: virtual void SetSize(double _arg) Set/Get Superquadric isotropic size. V.GetSize() -> float C++: virtual double GetSize() Set/Get Superquadric isotropic size. ToroidalOnV.ToroidalOn() C++: virtual void ToroidalOn() Set/Get whether or not the superquadric is toroidal (1) or ellipsoidal (0). ToroidalOffV.ToroidalOff() C++: virtual void ToroidalOff() Set/Get whether or not the superquadric is toroidal (1) or ellipsoidal (0). GetToroidalV.GetToroidal() -> int C++: virtual int GetToroidal() Set/Get whether or not the superquadric is toroidal (1) or ellipsoidal (0). SetToroidalV.SetToroidal(int) C++: virtual void SetToroidal(int _arg) Set/Get whether or not the superquadric is toroidal (1) or ellipsoidal (0). vtkTablevtkCommonDataModelPython.vtkTablevtkTable - A table, which contains similar-typed columns of data Superclass: vtkDataObject vtkTable is a basic data structure for storing columns of data. Internally, columns are stored in a vtkDataSetAttributes structure called RowData. However, using the vtkTable API additionally ensures that every column has the same number of entries, and provides row access (using vtkVariantArray) and single entry access (using vtkVariant). The field data inherited from vtkDataObject may be used to store metadata related to the table. @warning You should use the vtkTable API to change the table data. Performing operations on the object returned by GetRowData() may yield unexpected results. vtkTable does allow the user to set the field data using SetRowData(); the number of rows in the table is determined by the number of tuples in the first array (it is assumed that all arrays are the same length). @warning Each column added with AddColumn musthave its name set to a unique, non-empty string in order for GetValue() to function properly. @par Thanks: Thanks to Patricia Crossno, Ken Moreland, Andrew Wilson and Brian Wylie from Sandia National Laboratories for their help in developing this class API. V.SafeDownCast(vtkObjectBase) -> vtkTable C++: static vtkTable *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTable C++: vtkTable *NewInstance() V.Dump(int, int) C++: void Dump(unsigned int colWidth=16, int rowLimit=-1) Dump table contents. If rowLimit is -1 then the full table is printed out (Default). If rowLimit is 0 then only the header row will be displayed. Otherwise, if rowLimit > 0 then Dump will print the first rowLimit rows of data. V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() override; Return the actual size of the data in kibibytes (1024 bytes). This number is valid only after the pipeline has updated. The memory size returned is guaranteed to be greater than or equal to the memory required to represent the data (e.g., extra space in arrays, etc. are not included in the return value). GetRowDataV.GetRowData() -> vtkDataSetAttributes C++: virtual vtkDataSetAttributes *GetRowData() Get/Set the main data (columns) of the table. SetRowDataV.SetRowData(vtkDataSetAttributes) C++: virtual void SetRowData(vtkDataSetAttributes *data) Get/Set the main data (columns) of the table. GetNumberOfRowsV.GetNumberOfRows() -> int C++: vtkIdType GetNumberOfRows() Get the number of rows in the table. SetNumberOfRowsV.SetNumberOfRows(int) C++: void SetNumberOfRows(const vtkIdType) Set the number of rows in the table. Note that memory allocation might be performed as a result of this, but no memory will be released. GetRowV.GetRow(int) -> vtkVariantArray C++: vtkVariantArray *GetRow(vtkIdType row) V.GetRow(int, vtkVariantArray) C++: void GetRow(vtkIdType row, vtkVariantArray *values) Get a row of the table as a vtkVariantArray which has one entry for each column. NOTE: This version of the method is NOT thread safe. SetRowV.SetRow(int, vtkVariantArray) C++: void SetRow(vtkIdType row, vtkVariantArray *values) Set a row of the table with a vtkVariantArray which has one entry for each column. InsertNextBlankRowV.InsertNextBlankRow(float) -> int C++: vtkIdType InsertNextBlankRow(double default_num_val=0.0) Insert a blank row at the end of the table. InsertNextRowV.InsertNextRow(vtkVariantArray) -> int C++: vtkIdType InsertNextRow(vtkVariantArray *arr) Insert a row specified by a vtkVariantArray. The number of entries in the array should match the number of columns in the table. RemoveRowV.RemoveRow(int) C++: void RemoveRow(vtkIdType row) Delete a row from the table. Rows below the deleted row are shifted up. GetNumberOfColumnsV.GetNumberOfColumns() -> int C++: vtkIdType GetNumberOfColumns() Get the number of columns in the table. GetColumnNameV.GetColumnName(int) -> string C++: const char *GetColumnName(vtkIdType col) GetColumnByNameV.GetColumnByName(string) -> vtkAbstractArray C++: vtkAbstractArray *GetColumnByName(const char *name) Get a column of the table by its name. GetColumnV.GetColumn(int) -> vtkAbstractArray C++: vtkAbstractArray *GetColumn(vtkIdType col) Get a column of the table by its column index. AddColumnV.AddColumn(vtkAbstractArray) C++: void AddColumn(vtkAbstractArray *arr) Add a column to the table. RemoveColumnByNameV.RemoveColumnByName(string) C++: void RemoveColumnByName(const char *name) Remove a column from the table by its name. RemoveColumnV.RemoveColumn(int) C++: void RemoveColumn(vtkIdType col) Remove a column from the table by its column index. V.GetValue(int, int) -> vtkVariant C++: vtkVariant GetValue(vtkIdType row, vtkIdType col) Retrieve a value in the table by row and column index as a variant. Note that this calls GetValueByName internally so that each column array must have its name set (and that name should be unique within the table). GetValueByNameV.GetValueByName(int, string) -> vtkVariant C++: vtkVariant GetValueByName(vtkIdType row, const char *col) Retrieve a value in the table by row index and column name as a variant. SetValueV.SetValue(int, int, vtkVariant) C++: void SetValue(vtkIdType row, vtkIdType col, vtkVariant value) Set a value in the table by row and column index as a variant. SetValueByNameV.SetValueByName(int, string, vtkVariant) C++: void SetValueByName(vtkIdType row, const char *col, vtkVariant value) Set a value in the table by row index and column name as a variant. V.Initialize() C++: void Initialize() override; Initialize to an empty table. V.GetData(vtkInformation) -> vtkTable C++: static vtkTable *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkTable C++: static vtkTable *GetData(vtkInformationVector *v, int i=0) Retrieve the table from vtkInformation. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Shallow/deep copy the data from src into this object. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Shallow/deep copy the data from src into this object. V.GetNumberOfElements(int) -> int C++: vtkIdType GetNumberOfElements(int type) override; Get the number of elements for a specific attribute type (ROW, etc.). vtkCommonDataModelPython.vtkTetravtkTetra - a 3D cell that represents a tetrahedron Superclass: vtkCell3D vtkTetra is a concrete implementation of vtkCell to represent a 3D tetrahedron. vtkTetra uses the standard isoparametric shape functions for a linear tetrahedron. The tetrahedron is defined by the four points (0-3); where (0,1,2) is the base of the tetrahedron which, using the right hand rule, forms a triangle whose normal points in the direction of the fourth point. @sa vtkConvexPointSet vtkHexahedron vtkPyramid vtkVoxel vtkWedge V.SafeDownCast(vtkObjectBase) -> vtkTetra C++: static vtkTetra *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTetra C++: vtkTetra *NewInstance() V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; Returns the set of points that are on the boundary of the tetrahedron that are closest parametrically to the point specified. This may include faces, edges, or vertices. V.GetParametricCenter([float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the tetrahedron in parametric coordinates. TetraCenterV.TetraCenter([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void TetraCenter(double p1[3], double p2[3], double p3[3], double p4[3], double center[3]) Compute the center of the tetrahedron, CircumsphereV.Circumsphere([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float]) -> float C++: static double Circumsphere(double p1[3], double p2[3], double p3[3], double p4[3], double center[3]) Compute the circumcenter (center[3]) and radius squared (method return value) of a tetrahedron defined by the four points x1, x2, x3, and x4. InsphereV.Insphere([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float]) -> float C++: static double Insphere(double p1[3], double p2[3], double p3[3], double p4[3], double center[3]) Compute the center (center[3]) and radius (method return value) of a sphere that just fits inside the faces of a tetrahedron defined by the four points x1, x2, x3, and x4. BarycentricCoordsV.BarycentricCoords([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float, float]) -> int C++: static int BarycentricCoords(double x[3], double x1[3], double x2[3], double x3[3], double x4[3], double bcoords[4]) Given a 3D point x[3], determine the barycentric coordinates of the point. Barycentric coordinates are a natural coordinate system for simplices that express a position as a linear combination of the vertices. For a tetrahedron, there are four barycentric coordinates (because there are four vertices), and the sum of the coordinates must equal 1. If a point x is inside a simplex, then all four coordinates will be strictly positive. If three coordinates are zero (so the fourth =1), then the point x is on a vertex. If two coordinates are zero, the point x is on an edge (and so on). In this method, you must specify the vertex coordinates x1->x4. Returns 0 if tetrahedron is degenerate. ComputeVolumeV.ComputeVolume([float, float, float], [float, float, float], [float, float, float], [float, float, float]) -> float C++: static double ComputeVolume(double p1[3], double p2[3], double p3[3], double p4[3]) Compute the volume of a tetrahedron defined by the four points p1, p2, p3, and p4. V.InterpolationFunctions([float, float, float], [float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[4]) @deprecated Replaced by vtkTetra::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[12]) @deprecated Replaced by vtkTetra::InterpolateDerivs as of VTK 5.2 V.GetFaceArray(int) -> (int, int, int) C++: static int *GetFaceArray(int faceId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. vtkTreeBFSIteratorvtkCommonDataModelPython.vtkTreeBFSIteratorvtkTreeBFSIterator - breadth first search iterator through a vtkTree Superclass: vtkTreeIterator vtkTreeBFSIterator performs a breadth first search traversal of a tree. After setting up the iterator, the normal mode of operation is to set up a while(iter->HasNext())loop, with the statement vtkIdType vertex = iter->Next()inside the loop. @par Thanks: Thanks to David Doria for submitting this class. V.SafeDownCast(vtkObjectBase) -> vtkTreeBFSIterator C++: static vtkTreeBFSIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTreeBFSIterator C++: vtkTreeBFSIterator *NewInstance() vtkTreeIteratorvtkTreevtkCommonDataModelPython.vtkTreevtkTree - A rooted tree data structure. Superclass: vtkDirectedAcyclicGraph vtkTree is a connected directed graph with no cycles. A tree is a type of directed graph, so works with all graph algorithms. vtkTree is a read-only data structure. To construct a tree, create an instance of vtkMutableDirectedGraph. Add vertices and edges with AddVertex() and AddEdge(). You may alternately start by adding a single vertex as the root then call graph->AddChild(parent) which adds a new vertex and connects the parent to the child. The tree MUST have all edges in the proper direction, from parent to child. After building the tree, call tree->CheckedShallowCopy(graph) to copy the structure into a vtkTree. This method will return false if the graph is an invalid tree. vtkTree provides some convenience methods for obtaining the parent and children of a vertex, for finding the root, and determining if a vertex is a leaf (a vertex with no children). @sa vtkDirectedGraph vtkMutableDirectedGraph vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkTree C++: static vtkTree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTree C++: vtkTree *NewInstance() GetRootV.GetRoot() -> int C++: virtual vtkIdType GetRoot() Get the root vertex of the tree. V.GetNumberOfChildren(int) -> int C++: vtkIdType GetNumberOfChildren(vtkIdType v) Get the number of children of a vertex. V.GetChild(int, int) -> int C++: vtkIdType GetChild(vtkIdType v, vtkIdType i) Get the i-th child of a parent vertex. GetChildrenV.GetChildren(int, vtkAdjacentVertexIterator) C++: void GetChildren(vtkIdType v, vtkAdjacentVertexIterator *it) Get the child vertices of a vertex. This is a convenience method that functions exactly like GetAdjacentVertices. GetParentV.GetParent(int) -> int C++: vtkIdType GetParent(vtkIdType v) Get the parent of a vertex. GetParentEdgeV.GetParentEdge(int) -> vtkEdgeType C++: vtkEdgeType GetParentEdge(vtkIdType v) Get the edge connecting the vertex to its parent. V.GetLevel(int) -> int C++: vtkIdType GetLevel(vtkIdType v) Get the level of the vertex in the tree. The root vertex has level 0. Returns -1 if the vertex id is < 0 or greater than the number of vertices in the tree. V.IsLeaf(int) -> bool C++: bool IsLeaf(vtkIdType vertex) Return whether the vertex is a leaf (i.e. it has no children). V.GetData(vtkInformation) -> vtkTree C++: static vtkTree *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkTree C++: static vtkTree *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. ReorderChildrenV.ReorderChildren(int, vtkIdTypeArray) C++: virtual void ReorderChildren(vtkIdType parent, vtkIdTypeArray *children) Reorder the children of a parent vertex. The children array must contain all the children of parent, just in a different order. This does not change the topology of the tree. vtkTreeDFSIteratorModeTypeDISCOVERFINISHvtkCommonDataModelPython.vtkTreeDFSIterator.ModeTypevtkCommonDataModelPython.vtkTreeDFSIteratorvtkTreeDFSIterator - depth first iterator through a vtkGraph Superclass: vtkTreeIterator vtkTreeDFSIterator performs a depth first search traversal of a tree. First, you must set the tree on which you are going to iterate, and then optionally set the starting vertex and mode. The mode is either DISCOVER (default), in which case vertices are visited as they are first reached, or FINISH, in which case vertices are visited when they are done, i.e. all adjacent vertices have been discovered already. After setting up the iterator, the normal mode of operation is to set up a while(iter->HasNext())loop, with the statement vtkIdType vertex = iter->Next()inside the loop. V.SafeDownCast(vtkObjectBase) -> vtkTreeDFSIterator C++: static vtkTreeDFSIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTreeDFSIterator C++: vtkTreeDFSIterator *NewInstance() SetModeV.SetMode(int) C++: void SetMode(int mode) Set the visit mode of the iterator. Mode can be DISCOVER (0): Order by discovery time FINISH (1): Order by finish time Default is DISCOVER. Use DISCOVER for top-down algorithms where parents need to be processed before children. Use FINISH for bottom-up algorithms where children need to be processed before parents. GetModeV.GetMode() -> int C++: virtual int GetMode() Set the visit mode of the iterator. Mode can be DISCOVER (0): Order by discovery time FINISH (1): Order by finish time Default is DISCOVER. Use DISCOVER for top-down algorithms where parents need to be processed before children. Use FINISH for bottom-up algorithms where children need to be processed before parents. vtkTrianglevtkCommonDataModelPython.vtkTrianglevtkTriangle - a cell that represents a triangle Superclass: vtkCell vtkTriangle is a concrete implementation of vtkCell to represent a triangle located in 3-space. V.SafeDownCast(vtkObjectBase) -> vtkTriangle C++: static vtkTriangle *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTriangle C++: vtkTriangle *NewInstance() V.GetEdge(int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; Get the edge specified by edgeId (range 0 to 2) and return that edge's coordinates. V.ComputeArea() -> float C++: double ComputeArea() A convenience function to compute the area of a vtkTriangle. V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this triangle using scalar value provided. Like contouring, except that it cuts the triangle to produce other triangles. V.InterpolationFunctions([float, float, float], [float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double sf[3]) @deprecated Replaced by vtkTriangle::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[6]) @deprecated Replaced by vtkTriangle::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double sf[3]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[6]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Plane intersection plus in/out test on triangle. The in/out test is performed using tol as the tolerance. TriangleCenterV.TriangleCenter([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void TriangleCenter(double p1[3], double p2[3], double p3[3], double center[3]) Compute the center of the triangle. TriangleAreaV.TriangleArea([float, float, float], [float, float, float], [float, float, float]) -> float C++: static double TriangleArea(double p1[3], double p2[3], double p3[3]) Compute the area of a triangle in 3D. See also vtkTriangle::ComputeArea() CircumcircleV.Circumcircle([float, float], [float, float], [float, float], [float, float]) -> float C++: static double Circumcircle(double p1[2], double p2[2], double p3[2], double center[2]) Compute the circumcenter (center[3]) and radius squared (method return value) of a triangle defined by the three points x1, x2, and x3. (Note that the coordinates are 2D. 3D points can be used but the z-component will be ignored.) V.BarycentricCoords([float, float], [float, float], [float, float], [float, float], [float, float, float]) -> int C++: static int BarycentricCoords(double x[2], double x1[2], double x2[2], double x3[2], double bcoords[3]) Given a 2D point x[2], determine the barycentric coordinates of the point. Barycentric coordinates are a natural coordinate system for simplices that express a position as a linear combination of the vertices. For a triangle, there are three barycentric coordinates (because there are three vertices), and the sum of the coordinates must equal 1. If a point x is inside a simplex, then all three coordinates will be strictly positive. If two coordinates are zero (so the third =1), then the point x is on a vertex. If one coordinates are zero, the point x is on an edge. In this method, you must specify the vertex coordinates x1->x3. Returns 0 if triangle is degenerate. ProjectTo2DV.ProjectTo2D([float, float, float], [float, float, float], [float, float, float], [float, float], [float, float], [float, float]) -> int C++: static int ProjectTo2D(double x1[3], double x2[3], double x3[3], double v1[2], double v2[2], double v3[2]) Project triangle defined in 3D to 2D coordinates. Returns 0 if degenerate triangle; non-zero value otherwise. Input points are x1->x3; output 2D points are v1->v3. V.ComputeNormal(vtkPoints, int, [int, ...], [float, float, float]) C++: static void ComputeNormal(vtkPoints *p, int numPts, vtkIdType *pts, double n[3]) V.ComputeNormal([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void ComputeNormal(double v1[3], double v2[3], double v3[3], double n[3]) Compute the triangle normal from a points list, and a list of point ids that index into the points list. ComputeNormalDirectionV.ComputeNormalDirection([float, float, float], [float, float, float], [float, float, float], [float, float, float]) C++: static void ComputeNormalDirection(double v1[3], double v2[3], double v3[3], double n[3]) Compute the (unnormalized) triangle normal direction from three points. TrianglesIntersectV.TrianglesIntersect([float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float], [float, float, float]) -> int C++: static int TrianglesIntersect(double p1[3], double q1[3], double r1[3], double p2[3], double q2[3], double r2[3]) Determine whether or not triangle (p1,q1,r1) intersects triangle (p2,q2,r2). This method is adapted from Olivier Devillers, Philippe Guigue. Faster Triangle-Triangle Intersection Tests. RR-4488, IN-RIA. 2002. . PointInTriangleV.PointInTriangle([float, float, float], [float, float, float], [float, float, float], [float, float, float], float) -> int C++: static int PointInTriangle(double x[3], double x1[3], double x2[3], double x3[3], double tol2) Given a point x, determine whether it is inside (within the tolerance squared, tol2) the triangle defined by the three coordinate values p1, p2, p3. Method is via comparing dot products. (Note: in current implementation the tolerance only works in the neighborhood of the three vertices of the triangle. ComputeQuadricV.ComputeQuadric([float, float, float], [float, float, float], [float, float, float], [[float, float, float, float], [float, float, float, float], [float, float, float, float], [float, float, float, float]]) C++: static void ComputeQuadric(double x1[3], double x2[3], double x3[3], double quadric[4][4]) V.ComputeQuadric([float, float, float], [float, float, float], [float, float, float], vtkQuadric) C++: static void ComputeQuadric(double x1[3], double x2[3], double x3[3], vtkQuadric *quadric) Calculate the error quadric for this triangle. Return the quadric as a 4x4 matrix or a vtkQuadric. (from Peter Lindstrom's Siggraph 2000 paper, "Out-of-Core Simplification of Large Polygonal Models") ViPP *vtkPoints *k *dPPPP *d *d *d *dPPPA *d *d *d *d[4]PPPV *d *d *d *vtkQuadricvtkTriangleStripvtkCommonDataModelPython.vtkTriangleStripvtkTriangleStrip - a cell that represents a triangle strip Superclass: vtkCell vtkTriangleStrip is a concrete implementation of vtkCell to represent a 2D triangle strip. A triangle strip is a compact representation of triangles connected edge to edge in strip fashion. The connectivity of a triangle strip is three points defining an initial triangle, then for each additional triangle, a single point that, combined with the previous two points, defines the next triangle. V.SafeDownCast(vtkObjectBase) -> vtkTriangleStrip C++: static vtkTriangleStrip *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTriangleStrip C++: vtkTriangleStrip *NewInstance() DecomposeStripV.DecomposeStrip(int, [int, ...], vtkCellArray) C++: static void DecomposeStrip(int npts, vtkIdType *pts, vtkCellArray *tris) Given a triangle strip, decompose it into a list of (triangle) polygons. The polygons are appended to the end of the list of triangles. vtkTriQuadraticHexahedronvtkCommonDataModelPython.vtkTriQuadraticHexahedronvtkTriQuadraticHexahedron - cell represents a parabolic, 27-node isoparametric hexahedron Superclass: vtkNonLinearCell vtkTriQuadraticHexahedron is a concrete implementation of vtkNonLinearCell to represent a three-dimensional, 27-node isoparametric triquadratic hexahedron. The interpolation is the standard finite element, triquadratic isoparametric shape function. The cell includes 8 edge nodes, 12 mid-edge nodes, 6 mid-face nodes and one mid-volume node. The ordering of the 27 points defining the cell is point ids (0-7,8-19, 20-25, 26) where point ids 0-7 are the eight corner vertices of the cube; followed by twelve midedge nodes (8-19); followed by 6 mid-face nodes (20-25) and the last node (26) is the mid-volume node. Note that these midedge nodes correspond lie on the edges defined by (0,1), (1,2), (2,3), (3,0), (4,5), (5,6), (6,7), (7,4), (0,4), (1,5), (2,6), (3,7). The mid-surface nodes lies on the faces defined by (first edge nodes id's, than mid-edge nodes id's): (0,1,5,4;8,17,12,16), (1,2,6,5;9,18,13,17), (2,3,7,6,10,19,14,18), (3,0,4,7;11,16,15,19), (0,1,2,3;8,9,10,11), (4,5,6,7;12,13,14,15). The last point lies in the center of the cell (0,1,2,3,4,5,6,7). top 7--14--6 | | 15 25 13 | | 4--12--5 middle 19--23--18 | | 20 26 21 | | 16--22--17 bottom 3--10--2 | | 11 24 9 | | 0-- 8--1 @sa vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra vtkQuadraticQuad vtkQuadraticPyramid vtkQuadraticWedge vtkBiQuadraticQuad @par Thanks: Thanks to Soeren Gebbert who developed this class and integrated it into VTK 5.0. V.SafeDownCast(vtkObjectBase) -> vtkTriQuadraticHexahedron C++: static vtkTriQuadraticHexahedron *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkTriQuadraticHexahedron C++: vtkTriQuadraticHexahedron *NewInstance() V.Clip(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData, int) C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tetras, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this triquadratic hexahedron using scalar value provided. Like contouring, except that it cuts the hex to produce linear tetrahedron. V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[27]) @deprecated Replaced by vtkTriQuadraticHexahedron::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[81]) @deprecated Replaced by vtkTriQuadraticHexahedron::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateFunctions(double pcoords[3], double weights[27]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[81]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCommonDataModelPython.vtkUndirectedGraphvtkUndirectedGraph - An undirected graph. Superclass: vtkGraph vtkUndirectedGraph is a collection of vertices along with a collection of undirected edges (they connect two vertices in no particular order). ShallowCopy(), DeepCopy(), CheckedShallowCopy(), CheckedDeepCopy() accept instances of vtkUndirectedGraph and vtkMutableUndirectedGraph. GetOutEdges(v, it) and GetInEdges(v, it) return the same list of edges, which is the list of all edges which have a v as an endpoint. GetInDegree(v), GetOutDegree(v) and GetDegree(v) all return the full degree of vertex v. vtkUndirectedGraph is read-only. To create an undirected graph, use an instance of vtkMutableUndirectedGraph, then you may set the structure to a vtkUndirectedGraph using ShallowCopy(). @sa vtkGraph vtkMutableUndirectedGraph V.SafeDownCast(vtkObjectBase) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkUndirectedGraph C++: vtkUndirectedGraph *NewInstance() V.GetInDegree(int) -> int C++: vtkIdType GetInDegree(vtkIdType v) override; Returns the full degree of the vertex. V.GetInEdge(int, int) -> vtkInEdgeType C++: vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i) override; V.GetInEdge(int, int, vtkGraphEdge) C++: void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge *e) override; Random-access method for retrieving the in edges of a vertex. For an undirected graph, this is the same as the out edges. V.GetData(vtkInformation) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUndirectedGraph C++: static vtkUndirectedGraph *GetData(vtkInformationVector *v, int i=0) Retrieve a graph from an information vector. V.GetInEdges(int, vtkInEdgeIterator) C++: void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) override; Initialize the iterator to get the incoming edges to a vertex. For an undirected graph, this is all incident edges. V.IsStructureValid(vtkGraph) -> bool C++: bool IsStructureValid(vtkGraph *g) override; Check the structure, and accept it if it is a valid undirected graph. This is public to allow the ToDirected/UndirectedGraph to work. vtkUniformGridvtkCommonDataModelPython.vtkUniformGridvtkUniformGrid - image data with blanking Superclass: vtkImageData vtkUniformGrid is a subclass of vtkImageData. In addition to all the image data functionality, it supports blanking. V.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Construct an empty uniform grid. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Construct an empty uniform grid. V.SafeDownCast(vtkObjectBase) -> vtkUniformGrid C++: static vtkUniformGrid *SafeDownCast(vtkObjectBase *o) Construct an empty uniform grid. V.NewInstance() -> vtkUniformGrid C++: vtkUniformGrid *NewInstance() Construct an empty uniform grid. V.GetCell(int, int, int) -> vtkCell C++: vtkCell *GetCell(int i, int j, int k) override; V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; Standard vtkDataSet API methods. See vtkDataSet for more information. GetGridDescriptionV.GetGridDescription() -> int C++: int GetGridDescription() Returns the data description of this uniform grid instance. V.BlankPoint(int) C++: virtual void BlankPoint(vtkIdType ptId) V.BlankPoint(int, int, int) C++: virtual void BlankPoint(const int i, const int j, const int k) Methods for supporting blanking of cells. Blanking turns on or off points in the structured grid, and hence the cells connected to them. These methods should be called only after the dimensions of the grid are set. V.UnBlankPoint(int) C++: virtual void UnBlankPoint(vtkIdType ptId) V.UnBlankPoint(int, int, int) C++: virtual void UnBlankPoint(const int i, const int j, const int k) Methods for supporting blanking of cells. Blanking turns on or off points in the structured grid, and hence the cells connected to them. These methods should be called only after the dimensions of the grid are set. V.BlankCell(int) C++: virtual void BlankCell(vtkIdType ptId) V.BlankCell(int, int, int) C++: virtual void BlankCell(const int i, const int j, const int k) Methods for supporting blanking of cells. Blanking turns on or off cells in the structured grid. These methods should be called only after the dimensions of the grid are set. V.UnBlankCell(int) C++: virtual void UnBlankCell(vtkIdType ptId) V.UnBlankCell(int, int, int) C++: virtual void UnBlankCell(const int i, const int j, const int k) Methods for supporting blanking of cells. Blanking turns on or off cells in the structured grid. These methods should be called only after the dimensions of the grid are set. V.IsPointVisible(int) -> int C++: virtual unsigned char IsPointVisible(vtkIdType ptId) Return non-zero value if specified point is visible. These methods should be called only after the dimensions of the grid are set. V.IsCellVisible(int) -> int C++: virtual unsigned char IsCellVisible(vtkIdType cellId) Return non-zero value if specified cell is visible. These methods should be called only after the dimensions of the grid are set. NewImageDataCopyV.NewImageDataCopy() -> vtkImageData C++: virtual vtkImageData *NewImageDataCopy() V.GetData(vtkInformation) -> vtkUniformGrid C++: static vtkUniformGrid *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUniformGrid C++: static vtkUniformGrid *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkCommonDataModelPython.vtkUnstructuredGridvtkUnstructuredGrid - dataset represents arbitrary combinations of all possible cell types Superclass: vtkUnstructuredGridBase vtkUnstructuredGrid is a data object that is a concrete implementation of vtkDataSet. vtkUnstructuredGrid represents any combinations of any cell types. This includes 0D (e.g., points), 1D (e.g., lines, polylines), 2D (e.g., triangles, polygons), and 3D (e.g., hexahedron, tetrahedron, polyhedron, etc.). V.SafeDownCast(vtkObjectBase) -> vtkUnstructuredGrid C++: static vtkUnstructuredGrid *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkUnstructuredGrid C++: vtkUnstructuredGrid *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Standard vtkDataSet API methods. See vtkDataSet for more information. V.Allocate(int, int) C++: void Allocate(vtkIdType numCells=1000, int extSize=1000) override; Method allocates initial storage for the cell connectivity. Use this method before the method InsertNextCell(). The array capacity is doubled when the inserting a cell exceeds the current capacity. extSize is no longer used. V.InsertNextCell(int, int, [int, ...]) -> int C++: vtkIdType InsertNextCell(int type, vtkIdType npts, vtkIdType *ptIds) override; V.InsertNextCell(int, vtkIdList) -> int C++: vtkIdType InsertNextCell(int type, vtkIdList *ptIds) override; V.InsertNextCell(int, int, [int, ...], int, [int, ...]) -> int C++: vtkIdType InsertNextCell(int type, vtkIdType npts, vtkIdType *ptIds, vtkIdType nfaces, vtkIdType *faces) override; Insert/create cell in object by type and list of point ids defining cell topology. Most cells require just a type which implicitly defines a set of points and their ordering. For non-polyhedron cell type, npts is the number of unique points in the cell. pts are the list of global point Ids. For polyhedron cell, a special input format is required. npts is the number of faces in the cell. ptIds is the list of face stream: (numFace0Pts, id1, id2, id3, numFace1Pts,id1, id2, id3, ...) Make sure you have called Allocate() before calling this method V.Reset() C++: void Reset() Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetCellBounds(int, [float, float, float, float, float, float]) C++: void GetCellBounds(vtkIdType cellId, double bounds[6]) override; Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) override; V.GetCellPoints(int, int, [int, ...]) C++: virtual void GetCellPoints(vtkIdType cellId, vtkIdType &npts, vtkIdType *&pts) Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.NewCellIterator() -> vtkCellIterator C++: vtkCellIterator *NewCellIterator() override; Standard vtkDataSet methods; see vtkDataSet.h for documentation. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType cellId) override; Get type of cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED GetCellTypesArrayV.GetCellTypesArray() -> vtkUnsignedCharArray C++: vtkUnsignedCharArray *GetCellTypesArray() GetCellLocationsArrayV.GetCellLocationsArray() -> vtkIdTypeArray C++: vtkIdTypeArray *GetCellLocationsArray() V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Convenience method returns largest cell size in dataset. This is generally used to allocate memory for supporting data structures. THIS METHOD IS THREAD SAFE V.BuildLinks() C++: void BuildLinks() GetCellLinksV.GetCellLinks() -> vtkCellLinks C++: vtkCellLinks *GetCellLinks() GetFaceStreamV.GetFaceStream(int, vtkIdList) C++: void GetFaceStream(vtkIdType cellId, vtkIdList *ptIds) V.GetFaceStream(int, int, [int, ...]) C++: void GetFaceStream(vtkIdType cellId, vtkIdType &nfaces, vtkIdType *&ptIds) Get the face stream of a polyhedron cell in the following format: (numCellFaces, numFace0Pts, id1, id2, id3, numFace1Pts,id1, id2, id3, ...). If the requested cell is not a polyhedron, then the standard GetCellPoints is called to return a list of unique point ids (id1, id2, id3, ...). V.SetCells(int, vtkCellArray) C++: void SetCells(int type, vtkCellArray *cells) V.SetCells([int, ...], vtkCellArray) C++: void SetCells(int *types, vtkCellArray *cells) V.SetCells(vtkUnsignedCharArray, vtkIdTypeArray, vtkCellArray) C++: void SetCells(vtkUnsignedCharArray *cellTypes, vtkIdTypeArray *cellLocations, vtkCellArray *cells) V.SetCells(vtkUnsignedCharArray, vtkIdTypeArray, vtkCellArray, vtkIdTypeArray, vtkIdTypeArray) C++: void SetCells(vtkUnsignedCharArray *cellTypes, vtkIdTypeArray *cellLocations, vtkCellArray *cells, vtkIdTypeArray *faceLocations, vtkIdTypeArray *faces) Special methods specific to vtkUnstructuredGrid for defining the cells composing the dataset. Most cells require just arrays of cellTypes, cellLocations and cellConnectivities which implicitly define the set of points in each cell and their ordering. In those cases the cellConnectivities are of the format (numFace0Pts, id1, id2, id3, numFace1Pts, id1, id2, id3...). However, some cells like vtkPolyhedron require points plus a list of faces. To handle vtkPolyhedron, SetCells() support a special input cellConnectivities format (numCellFaces, numFace0Pts, id1, id2, id3, numFace1Pts,id1, id2, id3, ...) The functions use vtkPolyhedron::DecomposeAPolyhedronCell() to convert polyhedron cells into standard format. V.GetCells() -> vtkCellArray C++: vtkCellArray *GetCells() V.ReplaceCell(int, int, [int, ...]) C++: void ReplaceCell(vtkIdType cellId, int npts, vtkIdType *pts) override; Replace the points defining cell "cellId" with a new set of points. This operator is (typically) used when links from points to cells have not been built (i.e., BuildLinks() has not been executed). Use the operator ReplaceLinkedCell() to replace a cell when cell structure has been built. V.InsertNextLinkedCell(int, int, [int, ...]) -> int C++: vtkIdType InsertNextLinkedCell(int type, int npts, vtkIdType *pts) V.RemoveReferenceToCell(int, int) C++: void RemoveReferenceToCell(vtkIdType ptId, vtkIdType cellId) V.AddReferenceToCell(int, int) C++: void AddReferenceToCell(vtkIdType ptId, vtkIdType cellId) V.ResizeCellList(int, int) C++: void ResizeCellList(vtkIdType ptId, int size) V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; Topological inquiry to get all cells using list of points exclusive of cell specified (e.g., cellId). THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetPiece() -> int C++: virtual int GetPiece() Set / Get the piece and the number of pieces. Similar to extent in 3D. V.GetNumberOfPieces() -> int C++: virtual int GetNumberOfPieces() Set / Get the piece and the number of pieces. Similar to extent in 3D. GetIdsOfCellsOfTypeV.GetIdsOfCellsOfType(int, vtkIdTypeArray) C++: void GetIdsOfCellsOfType(int type, vtkIdTypeArray *array) override; Fill vtkIdTypeArray container with list of cell Ids. This method traverses all cells and, for a particular cell type, inserts the cell Id into the container. IsHomogeneousV.IsHomogeneous() -> int C++: int IsHomogeneous() override; Traverse cells and determine if cells are all of the same type. V.RemoveGhostCells() C++: void RemoveGhostCells() This method will remove any cell that is marked as ghost (has the vtkDataSetAttributes::DUPLICATECELL bit set). V.GetData(vtkInformation) -> vtkUnstructuredGrid C++: static vtkUnstructuredGrid *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUnstructuredGrid C++: static vtkUnstructuredGrid *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. V.GetFaces(int) -> (int, ...) C++: vtkIdType *GetFaces(vtkIdType cellId) V.GetFaces() -> vtkIdTypeArray C++: vtkIdTypeArray *GetFaces() Special support for polyhedron. Return nullptr for all other cell types. GetFaceLocationsV.GetFaceLocations() -> vtkIdTypeArray C++: vtkIdTypeArray *GetFaceLocations() Get pointer to faces and facelocations. Support for polyhedron cells. InitializeFacesRepresentationV.InitializeFacesRepresentation(int) -> int C++: int InitializeFacesRepresentation(vtkIdType numPrevCells) Special function used by vtkUnstructuredGridReader. By default vtkUnstructuredGrid does not contain face information, which is only used by polyhedron cells. If so far no polyhedron cells have been added, Faces and FaceLocations pointers will be nullptr. In this case, need to initialize the arrays and assign values to the previous non-polyhedron cells. DecomposeAPolyhedronCellV.DecomposeAPolyhedronCell(vtkCellArray, int, int, vtkCellArray, vtkIdTypeArray) C++: static void DecomposeAPolyhedronCell( vtkCellArray *polyhedronCellArray, vtkIdType &nCellpts, vtkIdType &nCellfaces, vtkCellArray *cellArray, vtkIdTypeArray *faces) V.DecomposeAPolyhedronCell([int, ...], int, int, vtkCellArray, vtkIdTypeArray) C++: static void DecomposeAPolyhedronCell( vtkIdType *polyhedronCellStream, vtkIdType &nCellpts, vtkIdType &nCellfaces, vtkCellArray *cellArray, vtkIdTypeArray *faces) V.DecomposeAPolyhedronCell(int, [int, ...], int, vtkCellArray, vtkIdTypeArray) C++: static void DecomposeAPolyhedronCell(vtkIdType nCellFaces, vtkIdType *inFaceStream, vtkIdType &nCellpts, vtkCellArray *cellArray, vtkIdTypeArray *faces) A static method for converting a polyhedron vtkCellArray of format [nCellFaces, nFace0Pts, i, j, k, nFace1Pts, i, j, k, ...] into three components: (1) an integer indicating the number of faces (2) a standard vtkCellArray storing point ids [nCell0Pts, i, j, k] and (3) an vtkIdTypeArray storing face connectivity in format [nFace0Pts, i, j, k, nFace1Pts, i, j, k, ...] Note: input is assumed to contain only one polyhedron cell. Outputs (2) and (3) will be stacked at the end of the input cellArray and faces. The original data in the input will not be touched. ConvertFaceStreamPointIdsV.ConvertFaceStreamPointIds(vtkIdList, [int, ...]) C++: static void ConvertFaceStreamPointIds(vtkIdList *faceStream, vtkIdType *idMap) V.ConvertFaceStreamPointIds(int, [int, ...], [int, ...]) C++: static void ConvertFaceStreamPointIds(vtkIdType nfaces, vtkIdType *faceStream, vtkIdType *idMap) Convert pid in a face stream into idMap[pid]. The face stream is of format [nCellFaces, nFace0Pts, i, j, k, nFace1Pts, i, j, k, ...]. The user is responsible to make sure all the Ids in faceStream do not exceed the range of idMap. vtkUnstructuredGridBase@PV *i *vtkCellArrayVkkVV *vtkCellArray *vtkCellArray *vtkIdTypeArrayPkkVV *k *vtkCellArray *vtkIdTypeArraykPkVV *k *vtkCellArray *vtkIdTypeArrayvtkCommonDataModelPython.vtkUnstructuredGridBasevtkUnstructuredGridBase - dataset represents arbitrary combinations of all possible cell types. Superclass: vtkPointSet May be mapped onto a non-standard memory layout. vtkUnstructuredGridBase defines the core vtkUnstructuredGrid API, omitting functions that are implementation dependent. @sa vtkMappedDataArray vtkUnstructuredGrid V.SafeDownCast(vtkObjectBase) -> vtkUnstructuredGridBase C++: static vtkUnstructuredGridBase *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkUnstructuredGridBase C++: vtkUnstructuredGridBase *NewInstance() V.Allocate(int, int) C++: virtual void Allocate(vtkIdType numCells=1000, int extSize=1000) Allocate memory for the number of cells indicated. extSize is not used. V.InsertNextCell(int, int, [int, ...]) -> int C++: virtual vtkIdType InsertNextCell(int type, vtkIdType npts, vtkIdType *ptIds) V.InsertNextCell(int, vtkIdList) -> int C++: virtual vtkIdType InsertNextCell(int type, vtkIdList *ptIds) V.InsertNextCell(int, int, [int, ...], int, [int, ...]) -> int C++: virtual vtkIdType InsertNextCell(int type, vtkIdType npts, vtkIdType *ptIds, vtkIdType nfaces, vtkIdType *faces) Insert/create cell in object by type and list of point ids defining cell topology. Most cells require just a type which implicitly defines a set of points and their ordering. For non-polyhedron cell type, npts is the number of unique points in the cell. pts are the list of global point Ids. For polyhedron cell, a special input format is required. npts is the number of faces in the cell. ptIds is the list of face stream: (numFace0Pts, id1, id2, id3, numFace1Pts,id1, id2, id3, ...) V.ReplaceCell(int, int, [int, ...]) C++: virtual void ReplaceCell(vtkIdType cellId, int npts, vtkIdType *pts) Replace the points defining cell "cellId" with a new set of points. This operator is (typically) used when links from points to cells have not been built (i.e., BuildLinks() has not been executed). Use the operator ReplaceLinkedCell() to replace a cell when cell structure has been built. V.GetIdsOfCellsOfType(int, vtkIdTypeArray) C++: virtual void GetIdsOfCellsOfType(int type, vtkIdTypeArray *array) Fill vtkIdTypeArray container with list of cell Ids. This method traverses all cells and, for a particular cell type, inserts the cell Id into the container. V.IsHomogeneous() -> int C++: virtual int IsHomogeneous() Traverse cells and determine if cells are all of the same type. V.GetData(vtkInformation) -> vtkUnstructuredGridBase C++: static vtkUnstructuredGridBase *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUnstructuredGridBase C++: static vtkUnstructuredGridBase *GetData( vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkUnstructuredGridCellIteratorvtkCommonDataModelPython.vtkUnstructuredGridCellIteratorvtkUnstructuredGridCellIterator - Implementation of vtkCellIterator specialized for vtkUnstructuredGrid. Superclass: vtkCellIterator V.SafeDownCast(vtkObjectBase) -> vtkUnstructuredGridCellIterator C++: static vtkUnstructuredGridCellIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkUnstructuredGridCellIterator C++: vtkUnstructuredGridCellIterator *NewInstance() vtkVertexvtkCommonDataModelPython.vtkVertexvtkVertex - a cell that represents a 3D point Superclass: vtkCell vtkVertex is a concrete implementation of vtkCell to represent a 3D point. V.SafeDownCast(vtkObjectBase) -> vtkVertex C++: static vtkVertex *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkVertex C++: vtkVertex *NewInstance() V.CellBoundary(int, [float, float, float], vtkIdList) -> int C++: int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) override; Given parametric coordinates of a point, return the closest cell boundary, and whether the point is inside or outside of the cell. The cell boundary is defined by a list of points (pts) that specify a vertex (1D cell). If the return value of the method is != 0, then the point is inside the cell. V.Contour(float, vtkDataArray, vtkIncrementalPointLocator, vtkCellArray, vtkCellArray, vtkCellArray, vtkPointData, vtkPointData, vtkCellData, int, vtkCellData) C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts1, vtkCellArray *lines, vtkCellArray *verts2, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; Generate contouring primitives. The scalar list cellScalars are scalar values at each cell point. The point locator is essentially a points list that merges points as they are inserted (i.e., prevents duplicates). V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Intersect with a ray. Return parametric coordinates (both line and cell) and global intersection coordinates, given ray definition and tolerance. The method returns non-zero value if intersection occurs. V.Triangulate(int, vtkIdList, vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; Triangulate the vertex. This method fills pts and ptIds with information from the only point in the vertex. V.Derivatives(int, [float, float, float], [float, ...], int, [float, ...]) C++: void Derivatives(int subId, double pcoords[3], double *values, int dim, double *derivs) override; Get the derivative of the vertex. Returns (0.0, 0.0, 0.0) for all dimensions. V.InterpolationFunctions([float, float, float], [float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[1]) @deprecated Replaced by vtkVertex::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[3]) @deprecated Replaced by vtkVertex::InterpolateDerivs as of VTK 5.2 V.InterpolateFunctions([float, float, float], [float]) C++: void InterpolateFunctions(double pcoords[3], double weights[1]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCommonDataModelPython.vtkVertexListIteratorvtkVertexListIterator - Iterates all vertices in a graph. Superclass: vtkObject vtkVertexListIterator iterates through all vertices in a graph. Create an instance of this and call graph->GetVertices(it) to initialize this iterator. You may alternately call SetGraph() to initialize the iterator. @sa vtkGraph V.SafeDownCast(vtkObjectBase) -> vtkVertexListIterator C++: static vtkVertexListIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkVertexListIterator C++: vtkVertexListIterator *NewInstance() V.SetGraph(vtkGraph) C++: virtual void SetGraph(vtkGraph *graph) Setup the iterator with a graph. V.GetGraph() -> vtkGraph C++: virtual vtkGraph *GetGraph() Get the graph associated with this iterator. vtkVoxelvtkCommonDataModelPython.vtkVoxelvtkVoxel - a cell that represents a 3D orthogonal parallelepiped Superclass: vtkCell3D vtkVoxel is a concrete implementation of vtkCell to represent a 3D orthogonal parallelepiped. Unlike vtkHexahedron, vtkVoxel has interior angles of 90 degrees, and sides are parallel to coordinate axes. This results in large increases in computational performance. @sa vtkConvexPointSet vtkHexahedron vtkPyramid vtkTetra vtkWedge V.SafeDownCast(vtkObjectBase) -> vtkVoxel C++: static vtkVoxel *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkVoxel C++: vtkVoxel *NewInstance() V.GetParametricCoords() -> (float, ...) C++: double *GetParametricCoords() override; See vtkCell3D API for description of these methods. V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[24]) @deprecated Replaced by vtkVoxel::InterpolateDerivs as of VTK 5.2 V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[8]) Compute the interpolation functions. This static method is for convenience. Use the member function if you already have an instance of a voxel. vtkWedgevtkCommonDataModelPython.vtkWedgevtkWedge - a 3D cell that represents a linear wedge Superclass: vtkCell3D vtkWedge is a concrete implementation of vtkCell to represent a linear 3D wedge. A wedge consists of two triangular and three quadrilateral faces and is defined by the six points (0-5). vtkWedge uses the standard isoparametric shape functions for a linear wedge. The wedge is defined by the six points (0-5) where (0,1,2) is the base of the wedge which, using the right hand rule, forms a triangle whose normal points outward (away from the triangular face (3,4,5)). @sa vtkConvexPointSet vtkHexahedron vtkPyramid vtkTetra vtkVoxel V.SafeDownCast(vtkObjectBase) -> vtkWedge C++: static vtkWedge *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkWedge C++: vtkWedge *NewInstance() V.InterpolationFunctions([float, float, float], [float, float, float, float, float, float]) C++: static void InterpolationFunctions(double pcoords[3], double weights[6]) @deprecated Replaced by vtkWedge::InterpolateFunctions as of VTK 5.2 V.InterpolationDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: static void InterpolationDerivs(double pcoords[3], double derivs[18]) @deprecated Replaced by vtkWedge::InterpolateDerivs as of VTK 5.2 V.InterpolateDerivs([float, float, float], [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) C++: void InterpolateDerivs(double pcoords[3], double derivs[18]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) vtkCommonDataModelPython.vtkXMLDataElementvtkXMLDataElement - Represents an XML element and those nested inside. Superclass: vtkObject vtkXMLDataElement is used by vtkXMLDataParser to represent an XML element. It provides methods to access the element's attributes and nested elements in a convenient manner. This allows easy traversal of an input XML file by vtkXMLReader and its subclasses. @sa vtkXMLDataParser V.SafeDownCast(vtkObjectBase) -> vtkXMLDataElement C++: static vtkXMLDataElement *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkXMLDataElement C++: vtkXMLDataElement *NewInstance() V.GetName() -> string C++: virtual char *GetName() Set/Get the name of the element. This is its XML tag. SetNameV.SetName(string) C++: virtual void SetName(const char *_arg) Set/Get the name of the element. This is its XML tag. V.GetId() -> string C++: virtual char *GetId() Set/Get the value of the id attribute of the element, if any. V.SetId(string) C++: virtual void SetId(const char *_arg) Set/Get the value of the id attribute of the element, if any. V.GetAttribute(string) -> string C++: const char *GetAttribute(const char *name) Get the attribute with the given name. If it doesn't exist, returns 0. V.SetAttribute(string, string) C++: void SetAttribute(const char *name, const char *value) Set the attribute with the given name and value. If it doesn't exist, adds it. SetCharacterDataV.SetCharacterData(string, int) C++: void SetCharacterData(const char *c, int length) Set/Get the character data between XML start/end tags. AddCharacterDataV.AddCharacterData(string, int) C++: void AddCharacterData(const char *c, size_t length) Set/Get the character data between XML start/end tags. GetCharacterDataV.GetCharacterData() -> string C++: virtual char *GetCharacterData() Set/Get the character data between XML start/end tags. GetScalarAttributeV.GetScalarAttribute(string, int) -> int C++: int GetScalarAttribute(const char *name, int &value) V.GetScalarAttribute(string, float) -> int C++: int GetScalarAttribute(const char *name, double &value) V.GetScalarAttribute(string, int) -> int C++: int GetScalarAttribute(const char *name, long &value) V.GetScalarAttribute(string, int) -> int C++: int GetScalarAttribute(const char *name, long long &value) Get the attribute with the given name and converted to a scalar value. Returns whether value was extracted. SetIntAttributeV.SetIntAttribute(string, int) C++: void SetIntAttribute(const char *name, int value) Set the attribute with the given name. We can not use the same GetScalarAttribute() construct since the compiler will not be able to resolve between SetAttribute(..., int) and SetAttribute(..., unsigned long). SetFloatAttributeV.SetFloatAttribute(string, float) C++: void SetFloatAttribute(const char *name, float value) Set the attribute with the given name. We can not use the same GetScalarAttribute() construct since the compiler will not be able to resolve between SetAttribute(..., int) and SetAttribute(..., unsigned long). SetDoubleAttributeV.SetDoubleAttribute(string, float) C++: void SetDoubleAttribute(const char *name, double value) Set the attribute with the given name. We can not use the same GetScalarAttribute() construct since the compiler will not be able to resolve between SetAttribute(..., int) and SetAttribute(..., unsigned long). SetUnsignedLongAttributeV.SetUnsignedLongAttribute(string, int) C++: void SetUnsignedLongAttribute(const char *name, unsigned long value) Set the attribute with the given name. We can not use the same GetScalarAttribute() construct since the compiler will not be able to resolve between SetAttribute(..., int) and SetAttribute(..., unsigned long). GetVectorAttributeV.GetVectorAttribute(string, int, [int, ...]) -> int C++: int GetVectorAttribute(const char *name, int length, int *value) V.GetVectorAttribute(string, int, [float, ...]) -> int C++: int GetVectorAttribute(const char *name, int length, double *value) V.GetVectorAttribute(string, int, [int, ...]) -> int C++: int GetVectorAttribute(const char *name, int length, long *value) V.GetVectorAttribute(string, int, [int, ...]) -> int C++: int GetVectorAttribute(const char *name, int length, long long *value) Get the attribute with the given name and converted to a scalar value. Returns length of vector read. SetVectorAttributeV.SetVectorAttribute(string, int, (int, ...)) C++: void SetVectorAttribute(const char *name, int length, const int *value) V.SetVectorAttribute(string, int, (float, ...)) C++: void SetVectorAttribute(const char *name, int length, const double *value) V.SetVectorAttribute(string, int, (int, ...)) C++: void SetVectorAttribute(const char *name, int length, const unsigned long *value) V.SetVectorAttribute(string, int, (int, ...)) C++: void SetVectorAttribute(const char *name, int length, long long const *value) Set the attribute with the given name. GetWordTypeAttributeV.GetWordTypeAttribute(string, int) -> int C++: int GetWordTypeAttribute(const char *name, int &value) Get the attribute with the given name and converted to a word type such as VTK_FLOAT or VTK_UNSIGNED_LONG. V.GetNumberOfAttributes() -> int C++: virtual int GetNumberOfAttributes() Get the number of attributes. GetAttributeNameV.GetAttributeName(int) -> string C++: const char *GetAttributeName(int idx) Get the n-th attribute name. Returns 0 if there is no such attribute. GetAttributeValueV.GetAttributeValue(int) -> string C++: const char *GetAttributeValue(int idx) Get the n-th attribute value. Returns 0 if there is no such attribute. V.RemoveAttribute(string) C++: virtual void RemoveAttribute(const char *name) Remove one or all attributes. RemoveAllAttributesV.RemoveAllAttributes() C++: virtual void RemoveAllAttributes() Remove one or all attributes. V.GetParent() -> vtkXMLDataElement C++: vtkXMLDataElement *GetParent() Set/Get the parent of this element. SetParentV.SetParent(vtkXMLDataElement) C++: void SetParent(vtkXMLDataElement *parent) Set/Get the parent of this element. V.GetRoot() -> vtkXMLDataElement C++: virtual vtkXMLDataElement *GetRoot() Get root of the XML tree this element is part of. GetNumberOfNestedElementsV.GetNumberOfNestedElements() -> int C++: int GetNumberOfNestedElements() Get the number of elements nested in this one. GetNestedElementV.GetNestedElement(int) -> vtkXMLDataElement C++: vtkXMLDataElement *GetNestedElement(int index) Get the element nested in this one at the given index. AddNestedElementV.AddNestedElement(vtkXMLDataElement) C++: void AddNestedElement(vtkXMLDataElement *element) Add nested element RemoveNestedElementV.RemoveNestedElement(vtkXMLDataElement) C++: virtual void RemoveNestedElement(vtkXMLDataElement *) Remove nested element. RemoveAllNestedElementsV.RemoveAllNestedElements() C++: virtual void RemoveAllNestedElements() Remove all nested elements. FindNestedElementV.FindNestedElement(string) -> vtkXMLDataElement C++: vtkXMLDataElement *FindNestedElement(const char *id) Find the first nested element with the given id, given name, or given name and id. WARNING: the search is only performed on the children, not the grand-children. FindNestedElementWithNameV.FindNestedElementWithName(string) -> vtkXMLDataElement C++: vtkXMLDataElement *FindNestedElementWithName( const char *name) Find the first nested element with the given id, given name, or given name and id. WARNING: the search is only performed on the children, not the grand-children. FindNestedElementWithNameAndIdV.FindNestedElementWithNameAndId(string, string) -> vtkXMLDataElement C++: vtkXMLDataElement *FindNestedElementWithNameAndId( const char *name, const char *id) Find the first nested element with the given id, given name, or given name and id. WARNING: the search is only performed on the children, not the grand-children. FindNestedElementWithNameAndAttributeV.FindNestedElementWithNameAndAttribute(string, string, string) -> vtkXMLDataElement C++: vtkXMLDataElement *FindNestedElementWithNameAndAttribute( const char *name, const char *att_name, const char *att_value) Find the first nested element with the given id, given name, or given name and id. WARNING: the search is only performed on the children, not the grand-children. LookupElementWithNameV.LookupElementWithName(string) -> vtkXMLDataElement C++: vtkXMLDataElement *LookupElementWithName(const char *name) Find the first nested element with given name. WARNING: the search is performed on the whole XML tree. LookupElementV.LookupElement(string) -> vtkXMLDataElement C++: vtkXMLDataElement *LookupElement(const char *id) Lookup the element with the given id, starting at this scope. GetXMLByteIndexV.GetXMLByteIndex() -> int C++: virtual vtkTypeInt64 GetXMLByteIndex() Set/Get the offset from the beginning of the XML document to this element. SetXMLByteIndexV.SetXMLByteIndex(int) C++: virtual void SetXMLByteIndex(vtkTypeInt64 _arg) Set/Get the offset from the beginning of the XML document to this element. IsEqualToV.IsEqualTo(vtkXMLDataElement) -> int C++: virtual int IsEqualTo(vtkXMLDataElement *elem) Check if the instance has the same name, attributes, character data and nested elements contents than the given element (this method is applied recursively on the nested elements, and they must be stored in the same order). Warning: Id, Parent, XMLByteIndex are ignored. V.DeepCopy(vtkXMLDataElement) C++: virtual void DeepCopy(vtkXMLDataElement *elem) Copy this element from another of the same type (elem), recursively. Old attributes and nested elements are removed, new ones are created given the contents of 'elem'. Warning: Parent is ignored. SetAttributeEncodingV.SetAttributeEncoding(int) C++: virtual void SetAttributeEncoding(int _arg) Get/Set the internal character encoding of the attributes. Default type is VTK_ENCODING_UTF_8. Note that a vtkXMLDataParser has its own AttributesEncoding ivar. If this ivar is set to something other than VTK_ENCODING_NONE, it will be used to set the attribute encoding of each vtkXMLDataElement created by this vtkXMLDataParser. GetAttributeEncodingMinValueV.GetAttributeEncodingMinValue() -> int C++: virtual int GetAttributeEncodingMinValue() Get/Set the internal character encoding of the attributes. Default type is VTK_ENCODING_UTF_8. Note that a vtkXMLDataParser has its own AttributesEncoding ivar. If this ivar is set to something other than VTK_ENCODING_NONE, it will be used to set the attribute encoding of each vtkXMLDataElement created by this vtkXMLDataParser. GetAttributeEncodingMaxValueV.GetAttributeEncodingMaxValue() -> int C++: virtual int GetAttributeEncodingMaxValue() Get/Set the internal character encoding of the attributes. Default type is VTK_ENCODING_UTF_8. Note that a vtkXMLDataParser has its own AttributesEncoding ivar. If this ivar is set to something other than VTK_ENCODING_NONE, it will be used to set the attribute encoding of each vtkXMLDataElement created by this vtkXMLDataParser. GetAttributeEncodingV.GetAttributeEncoding() -> int C++: virtual int GetAttributeEncoding() Get/Set the internal character encoding of the attributes. Default type is VTK_ENCODING_UTF_8. Note that a vtkXMLDataParser has its own AttributesEncoding ivar. If this ivar is set to something other than VTK_ENCODING_NONE, it will be used to set the attribute encoding of each vtkXMLDataElement created by this vtkXMLDataParser. PrintXMLV.PrintXML(string) C++: void PrintXML(const char *fname) Prints element tree as XML. GetCharacterDataWidthV.GetCharacterDataWidth() -> int C++: virtual int GetCharacterDataWidth() Get/Set the width (in number of fields) that character data (that between open and closing tags ie. ... ) is printed. If the width is less than one the tag's character data is printed all on one line. If it is greater than one the character data is streamed insterting line feeds every width number of fields. See PrintXML. SetCharacterDataWidthV.SetCharacterDataWidth(int) C++: virtual void SetCharacterDataWidth(int _arg) Get/Set the width (in number of fields) that character data (that between open and closing tags ie. ... ) is printed. If the width is less than one the tag's character data is printed all on one line. If it is greater than one the character data is streamed insterting line feeds every width number of fields. See PrintXML. @zd@zl@zk@ziP *i@ziP *d@ziP *l@ziP *k@ziP *LvtkCommonDataModelPython.vtkTreeIteratorvtkTreeIterator - Abstract class for iterator over a vtkTree. Superclass: vtkObject The base class for tree iterators vtkTreeBFSIterator and vtkTreeDFSIterator. After setting up the iterator, the normal mode of operation is to set up a while(iter->HasNext())loop, with the statement vtkIdType vertex = iter->Next()inside the loop. @sa vtkTreeBFSIterator vtkTreeDFSIterator V.SafeDownCast(vtkObjectBase) -> vtkTreeIterator C++: static vtkTreeIterator *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTreeIterator C++: vtkTreeIterator *NewInstance() V.SetTree(vtkTree) C++: void SetTree(vtkTree *graph) Set/get the graph to iterate over. V.GetTree() -> vtkTree C++: virtual vtkTree *GetTree() Set/get the graph to iterate over. SetStartVertexV.SetStartVertex(int) C++: void SetStartVertex(vtkIdType vertex) The start vertex of the traversal. The tree iterator will only iterate over the subtree rooted at vertex. If not set (or set to a negative value), starts at the root of the tree. GetStartVertexV.GetStartVertex() -> int C++: virtual vtkIdType GetStartVertex() The start vertex of the traversal. The tree iterator will only iterate over the subtree rooted at vertex. If not set (or set to a negative value), starts at the root of the tree. V.Next() -> int C++: vtkIdType Next() The next vertex visited in the graph. V.HasNext() -> bool C++: bool HasNext() Return true when all vertices have been visited. RestartV.Restart() C++: void Restart() Reset the iterator to its start vertex. vtkBoundingBoxvtkCommonDataModelPython.vtkBoundingBoxvtkBoundingBox - Fast Simple Class for dealing with 3D bounds vtkBoundingBox maintains a 3D axis aligned bounding box. It is very lite weight and many of the member functions are in-lined so its very fast It is not derived from vtkObject so it can be allocated on the stack @sa vtkBox vtkBoundingBox() vtkBoundingBox(const double bounds[6]) vtkBoundingBox(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax) vtkBoundingBox(const vtkBoundingBox &bbox) V.SetBounds((float, float, float, float, float, float)) C++: void SetBounds(const double bounds[6]) V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double xMin, double xMax, double yMin, double yMax, double zMin, double zMax) Set the bounds explicitly of the box (vtk Style) Returns 1 if the box was changed else 0. SetMinPointV.SetMinPoint(float, float, float) C++: void SetMinPoint(double x, double y, double z) V.SetMinPoint([float, float, float]) C++: void SetMinPoint(double p[3]) Set the minimum point of the bounding box - if the min point is greater than the max point then the max point will also be changed. SetMaxPointV.SetMaxPoint(float, float, float) C++: void SetMaxPoint(double x, double y, double z) V.SetMaxPoint([float, float, float]) C++: void SetMaxPoint(double p[3]) Set the maximum point of the bounding box - if the max point is less than the min point then the min point will also be changed. V.IsValid() -> int C++: int IsValid() V.IsValid((float, float, float, float, float, float)) -> int C++: static int IsValid(const double bounds[6]) Returns 1 if the bounds have been set and 0 if the box is in its initialized state which is an inverted state. V.AddPoint([float, float, float]) C++: void AddPoint(double p[3]) V.AddPoint(float, float, float) C++: void AddPoint(double px, double py, double pz) Change bounding box so it includes the point p Note that the bounding box may have 0 volume if its bounds were just initialized. AddBoxV.AddBox(vtkBoundingBox) C++: void AddBox(const vtkBoundingBox &bbox) Change the bounding box to be the union of itself and bbox. V.AddBounds((float, ...)) C++: void AddBounds(const double bounds[]) Adjust the bounding box so it contains the specified bounds (defined by the vtk standard (xmin,xmax, ymin,ymax, zmin,zmax). V.IntersectBox(vtkBoundingBox) -> int C++: int IntersectBox(const vtkBoundingBox &bbox) Intersect this box with bbox. The method returns 1 if both boxes are valid and they do have overlap else it will return 0. If 0 is returned the box has not been modified. IntersectsV.Intersects(vtkBoundingBox) -> int C++: int Intersects(const vtkBoundingBox &bbox) Returns 1 if the boxes intersect else returns 0. IntersectPlaneV.IntersectPlane([float, float, float], [float, float, float]) -> bool C++: bool IntersectPlane(double origin[3], double normal[3]) Intersect this box with the half space defined by plane. Returns true if there is intersection---which implies that the box has been modified Returns false otherwise. V.Contains(vtkBoundingBox) -> int C++: int Contains(const vtkBoundingBox &bbox) Returns 1 if the min and max points of bbox are contained within the bounds of this box, else returns 0. V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) V.GetBounds(float, float, float, float, float, float) C++: void GetBounds(double &xMin, double &xMax, double &yMin, double &yMax, double &zMin, double &zMax) Get the bounds of the box (defined by vtk style). GetBoundV.GetBound(int) -> float C++: double GetBound(int i) Return the ith bounds of the box (defined by vtk style). GetMinPointV.GetMinPoint() -> (float, float, float) C++: const double *GetMinPoint() V.GetMinPoint(float, float, float) C++: void GetMinPoint(double &x, double &y, double &z) Get the minimum point of the bounding box. GetMaxPointV.GetMaxPoint() -> (float, float, float) C++: const double *GetMaxPoint() V.GetMaxPoint(float, float, float) C++: void GetMaxPoint(double &x, double &y, double &z) Get the maximum point of the bounding box. V.ContainsPoint([float, float, float]) -> int C++: int ContainsPoint(double p[3]) V.ContainsPoint(float, float, float) -> int C++: int ContainsPoint(double px, double py, double pz) Returns 1 if the point is contained in the box else 0. V.GetCenter([float, float, float]) C++: void GetCenter(double center[3]) Get the center of the bounding box. GetLengthsV.GetLengths([float, float, float]) C++: void GetLengths(double lengths[3]) Get the lengths of the box. V.GetLength(int) -> float C++: double GetLength(int i) Return the length in the ith direction. GetMaxLengthV.GetMaxLength() -> float C++: double GetMaxLength() Return the Max Length of the box. GetDiagonalLengthV.GetDiagonalLength() -> float C++: double GetDiagonalLength() Return the length of the diagonal. \pre not_empty: this->IsValid() InflateV.Inflate(float) C++: void Inflate(double delta) V.Inflate() C++: void Inflate() Expand the Box by delta on each side, the box will grow by 2*delta in x,y and z. Alternatively, inflate the bounds so that it has non-zero volume. Edges that are inflated are adjusted 1% of the longest edge. Or if all edges are zero length, the bounding box is inflated by 1 unit in each of the x-y-z directions. ScaleV.Scale([float, float, float]) C++: void Scale(double s[3]) V.Scale(float, float, float) C++: void Scale(double sx, double sy, double sz) Scale each dimension of the box by some given factor. If the box is not valid, it stays unchanged. If the scalar factor is negative, bounds are flipped: for example, if (xMin,xMax)=(-2,4) and sx=-3, (xMin,xMax) becomes (-12,6). ComputeDivisionsV.ComputeDivisions(int, [float, float, float, float, float, float], [int, int, int]) -> int C++: vtkIdType ComputeDivisions(vtkIdType totalBins, double bounds[6], int divs[3]) Compute the number of divisions in the z-y-z directions given a target number of total bins (i.e., product of divisions in the x-y-z directions). The computation is done in such a way as to create near cuboid bins. Also note that the returned bounds may be different than the bounds defined in this class, as the bounds in the z-y-z directions can never be <= 0. Note that the total number of divisions (divs[0]*divs[1]*divs[2]) is guaranteed to be smaller than the target number of bins. V.Reset() C++: void Reset() Returns the box to its initialized state. @W vtkBoundingBoxvtkAtomvtkCommonDataModelPython.vtkAtomvtkAtom - convenience proxy for vtkMolecule vtkAtom(const &vtkAtom) V.GetId() -> int C++: vtkIdType GetId() Return the Id used to identify this atom in the parent molecule. GetMoleculeV.GetMolecule() -> vtkMolecule C++: vtkMolecule *GetMolecule() Return the parent molecule of this atom. GetAtomicNumberV.GetAtomicNumber() -> int C++: unsigned short GetAtomicNumber() Get/Set the atomic number of this atom SetAtomicNumberV.SetAtomicNumber(int) C++: void SetAtomicNumber(unsigned short atomicNum) Get/Set the atomic number of this atom V.GetPosition([float, float, float]) C++: void GetPosition(double pos[3]) V.GetPosition() -> vtkVector3f C++: vtkVector3f GetPosition() Get/Set the position of this atom SetPositionV.SetPosition((float, float, float)) C++: void SetPosition(const float pos[3]) V.SetPosition(float, float, float) C++: void SetPosition(float x, float y, float z) V.SetPosition(vtkVector3f) C++: void SetPosition(const vtkVector3f &pos) Get/Set the position of this atom vtkVector3f@P *f@W vtkVector3f@W vtkAtomvtkBondvtkCommonDataModelPython.vtkBondvtkBond - convenience proxy for vtkMolecule vtkBond(const &vtkBond) V.GetId() -> int C++: vtkIdType GetId() Return the Id used to identify this bond in the parent molecule. V.GetMolecule() -> vtkMolecule C++: vtkMolecule *GetMolecule() Return the parent molecule of this bond. GetBeginAtomIdV.GetBeginAtomId() -> int C++: vtkIdType GetBeginAtomId() Get the starting / ending atom ids for this bond. GetEndAtomIdV.GetEndAtomId() -> int C++: vtkIdType GetEndAtomId() Get the starting / ending atom ids for this bond. GetBeginAtomV.GetBeginAtom() -> vtkAtom C++: vtkAtom GetBeginAtom() Get a vtkAtom object that refers to the starting / ending atom for this bond. GetEndAtomV.GetEndAtom() -> vtkAtom C++: vtkAtom GetEndAtom() Get a vtkAtom object that refers to the starting / ending atom for this bond. V.GetOrder() -> int C++: unsigned short GetOrder() Get the bond order for this bond. V.GetLength() -> float C++: double GetLength() Get the distance between the bonded atoms. * ote This function is faster than vtkMolecule::GetBondLength and * should be used when possible. @W vtkBondvtkMoleculevtkCommonDataModelPython.vtkMoleculevtkMolecule - class describing a molecule Superclass: vtkUndirectedGraph vtkMolecule and the convenience classes vtkAtom and vtkBond describe the geometry and connectivity of a molecule. The molecule can be constructed using the AppendAtom() and AppendBond() methods in one of two ways; either by fully specifying the atom/bond in a single call, or by incrementally setting the various attributes using the convience vtkAtom and vtkBond classes: Single call:vtkMolecule *mol = vtkMolecule::New(); vtkAtom h1 = mol->AppendAtom(1, 0.0, 0.0, -0.5); vtkAtom h2 = mol->AppendAtom(1, 0.0, 0.0, 0.5); vtkBond b = mol->AppendBond(h1, h2, 1); Incremental:vtkMolecule *mol = vtkMolecule::New(); vtkAtom h1 = mol->AppendAtom(); h1.SetAtomicNumber(1); h1.SetPosition(0.0, 0.0, -0.5); vtkAtom h2 = mol->AppendAtom(); h2.SetAtomicNumber(1); vtkVector3d displacement (0.0, 0.0, 1.0); h2.SetPosition(h1.GetPositionAsVector3d() + displacement); vtkBond b = mol->AppendBond(h1, h2, 1); Both of the above methods will produce the same molecule, two hydrogens connected with a 1.0 Angstrom single bond, aligned to the z-axis. The second example also demostrates the use of VTK's vtkVector class, which is fully supported by the Chemistry kit. The vtkMolecule object is intended to be used with the vtkMoleculeMapper class for visualizing molecular structure using common rendering techniques. \warning While direct use of the underlying vtkUndirectedGraph structure is possible due to vtkMolecule's public inheritance, this should not be relied upon and may change in the future. @sa vtkAtom vtkBond vtkMoleculeMapper vtkPeriodicTable V.SafeDownCast(vtkObjectBase) -> vtkMolecule C++: static vtkMolecule *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkMolecule C++: vtkMolecule *NewInstance() AppendAtomV.AppendAtom() -> vtkAtom C++: vtkAtom AppendAtom() V.AppendAtom(int, vtkVector3f) -> vtkAtom C++: vtkAtom AppendAtom(unsigned short atomicNumber, const vtkVector3f &pos) V.AppendAtom(int, float, float, float) -> vtkAtom C++: vtkAtom AppendAtom(unsigned short atomicNumber, double x, double y, double z) Add new atom with atomic number 0 (dummy atom) at origin. Return a vtkAtom that refers to the new atom. GetAtomV.GetAtom(int) -> vtkAtom C++: vtkAtom GetAtom(vtkIdType atomId) Return a vtkAtom that refers to the atom with the specified id. GetNumberOfAtomsV.GetNumberOfAtoms() -> int C++: vtkIdType GetNumberOfAtoms() Return the number of atoms in the molecule. AppendBondV.AppendBond(int, int, int) -> vtkBond C++: vtkBond AppendBond(vtkIdType atom1, vtkIdType atom2, unsigned short order=1) V.AppendBond(vtkAtom, vtkAtom, int) -> vtkBond C++: vtkBond AppendBond(const vtkAtom &atom1, const vtkAtom &atom2, unsigned short order=1) Add a bond between the specified atoms, optionally setting the bond order (default: 1). Return a vtkBond object referring to the new bond. GetBondV.GetBond(int) -> vtkBond C++: vtkBond GetBond(vtkIdType bondId) Return a vtkAtom that refers to the bond with the specified id. GetNumberOfBondsV.GetNumberOfBonds() -> int C++: vtkIdType GetNumberOfBonds() Return the number of bonds in the molecule. GetAtomAtomicNumberV.GetAtomAtomicNumber(int) -> int C++: unsigned short GetAtomAtomicNumber(vtkIdType atomId) Return the atomic number of the atom with the specified id. SetAtomAtomicNumberV.SetAtomAtomicNumber(int, int) C++: void SetAtomAtomicNumber(vtkIdType atomId, unsigned short atomicNum) Set the atomic number of the atom with the specified id. SetAtomPositionV.SetAtomPosition(int, vtkVector3f) C++: void SetAtomPosition(vtkIdType atomId, const vtkVector3f &pos) V.SetAtomPosition(int, float, float, float) C++: void SetAtomPosition(vtkIdType atomId, double x, double y, double z) Set the position of the atom with the specified id. GetAtomPositionV.GetAtomPosition(int) -> vtkVector3f C++: vtkVector3f GetAtomPosition(vtkIdType atomId) V.GetAtomPosition(int, [float, float, float]) C++: void GetAtomPosition(vtkIdType atomId, float pos[3]) Get the position of the atom with the specified id. SetBondOrderV.SetBondOrder(int, int) C++: void SetBondOrder(vtkIdType bondId, unsigned short order) Get/Set the bond order of the bond with the specified id GetBondOrderV.GetBondOrder(int) -> int C++: unsigned short GetBondOrder(vtkIdType bondId) Get/Set the bond order of the bond with the specified id GetBondLengthV.GetBondLength(int) -> float C++: double GetBondLength(vtkIdType bondId) Get the bond length of the bond with the specified id * ote If the associated vtkBond object is already available, * vtkBond::GetBondLength is potentially much faster than this * function, as a list of all bonds may need to be constructed to * locate the appropriate bond. * \sa UpdateBondList() GetAtomicPositionArrayV.GetAtomicPositionArray() -> vtkPoints C++: vtkPoints *GetAtomicPositionArray() Access the raw arrays used in this vtkMolecule instance GetAtomicNumberArrayV.GetAtomicNumberArray() -> vtkUnsignedShortArray C++: vtkUnsignedShortArray *GetAtomicNumberArray() Access the raw arrays used in this vtkMolecule instance GetElectronicDataV.GetElectronicData() -> vtkAbstractElectronicData C++: virtual vtkAbstractElectronicData *GetElectronicData() Set/Get the AbstractElectronicData-subclassed object for this molecule. SetElectronicDataV.SetElectronicData(vtkAbstractElectronicData) C++: virtual void SetElectronicData(vtkAbstractElectronicData *) Set/Get the AbstractElectronicData-subclassed object for this molecule. V.CheckedShallowCopy(vtkGraph) -> bool C++: bool CheckedShallowCopy(vtkGraph *g) override; Performs the same operation as ShallowCopy(), but instead of reporting an error for an incompatible graph, returns false. V.CheckedDeepCopy(vtkGraph) -> bool C++: bool CheckedDeepCopy(vtkGraph *g) override; Performs the same operation as DeepCopy(), but instead of reporting an error for an incompatible graph, returns false. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *obj) override; Shallow copies the data object into this molecule. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *obj) override; Deep copies the data object into this molecule. ShallowCopyStructureV.ShallowCopyStructure(vtkMolecule) C++: virtual void ShallowCopyStructure(vtkMolecule *m) Shallow copies the atoms and bonds from m into this. DeepCopyStructureV.DeepCopyStructure(vtkMolecule) C++: virtual void DeepCopyStructure(vtkMolecule *m) Deep copies the atoms and bonds from m into this. ShallowCopyAttributesV.ShallowCopyAttributes(vtkMolecule) C++: virtual void ShallowCopyAttributes(vtkMolecule *m) Shallow copies attributes (i.e. everything besides atoms and bonds) fromm into this. DeepCopyAttributesV.DeepCopyAttributes(vtkMolecule) C++: virtual void DeepCopyAttributes(vtkMolecule *m) Deep copies attributes (i.e. everything besides atoms and bonds) fromm into this. GetPlaneFromBondV.GetPlaneFromBond(vtkBond, vtkVector3f, vtkPlane) -> bool C++: static bool GetPlaneFromBond(const vtkBond &bond, const vtkVector3f &normal, vtkPlane *plane) V.GetPlaneFromBond(vtkAtom, vtkAtom, vtkVector3f, vtkPlane) -> bool C++: static bool GetPlaneFromBond(const vtkAtom &atom1, const vtkAtom &atom2, const vtkVector3f &normal, vtkPlane *plane) Obtain the plane that passes through the indicated bond with the given normal. If the plane is set successfully, the function returns true. * If the normal is not orthogonal to the bond, a new normal will be * constructed in such a way that the plane will be orthogonal to * the plane spanned by the bond vector and the input normal vector. * This ensures that the plane passes through the bond, and the * normal is more of a "hint" indicating the orientation of the plane. * The new normal (n) is defined as the input normal vector (n_i) minus * the projection of itself (proj[n_i]_v) onto the bond vector (v): * * v ^ * | n = (n_i - proj[n_j]_v) * proj[n_i]_v ^ |----x * | | / * | | / n_i * | | / * | |/ * * If n_i is parallel to v, a warning will be printed and no plane will be * added. Obviously, n_i must not be parallel to v. HasLatticeV.HasLattice() -> bool C++: bool HasLattice() Return true if a unit cell lattice is defined. ClearLatticeV.ClearLattice() C++: void ClearLattice() Remove any unit cell lattice information from the molecule. SetLatticeV.SetLattice(vtkMatrix3x3) C++: void SetLattice(vtkMatrix3x3 *matrix) V.SetLattice(vtkVector3d, vtkVector3d, vtkVector3d) C++: void SetLattice(const vtkVector3d &a, const vtkVector3d &b, const vtkVector3d &c) The unit cell vectors. The matrix is stored using a row-major layout, with the vectors encoded as columns. GetLatticeV.GetLattice() -> vtkMatrix3x3 C++: vtkMatrix3x3 *GetLattice() V.GetLattice(vtkVector3d, vtkVector3d, vtkVector3d) C++: void GetLattice(vtkVector3d &a, vtkVector3d &b, vtkVector3d &c) V.GetLattice(vtkVector3d, vtkVector3d, vtkVector3d, vtkVector3d) C++: void GetLattice(vtkVector3d &a, vtkVector3d &b, vtkVector3d &c, vtkVector3d &origin) Get the unit cell lattice vectors. The matrix is stored using a row-major layout, with the vectors encoded as columns. Will return nullptr if no unit cell information is available. @sa GetLatticeOrigin GetLatticeOriginV.GetLatticeOrigin() -> vtkVector3d C++: virtual vtkVector3d GetLatticeOrigin() Get the unit cell origin (for rendering purposes). SetLatticeOriginV.SetLatticeOrigin(vtkVector3d) C++: virtual void SetLatticeOrigin(vtkVector3d _arg) Get the unit cell origin (for rendering purposes). @kk|H@WW|H vtkAtom vtkAtomvtkAbstractElectronicDatavtkMatrix3x3vtkCommonDataModelPython.vtkAbstractElectronicDatavtkAbstractElectronicData - Provides access to and storage of chemical electronic data Superclass: vtkDataObject V.SafeDownCast(vtkObjectBase) -> vtkAbstractElectronicData C++: static vtkAbstractElectronicData *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkAbstractElectronicData C++: vtkAbstractElectronicData *NewInstance() GetNumberOfMOsV.GetNumberOfMOs() -> int C++: virtual vtkIdType GetNumberOfMOs() Returns the number of molecular orbitals available. GetNumberOfElectronsV.GetNumberOfElectrons() -> int C++: virtual vtkIdType GetNumberOfElectrons() Returns the number of electrons in the molecule. GetMOV.GetMO(int) -> vtkImageData C++: virtual vtkImageData *GetMO(vtkIdType orbitalNumber) Returns the vtkImageData for the requested molecular orbital. GetElectronDensityV.GetElectronDensity() -> vtkImageData C++: virtual vtkImageData *GetElectronDensity() Returns vtkImageData for the molecule's electron density. The data will be calculated when first requested, and cached for later requests. GetHOMOV.GetHOMO() -> vtkImageData C++: vtkImageData *GetHOMO() Returns vtkImageData for the Highest Occupied Molecular Orbital. GetLUMOV.GetLUMO() -> vtkImageData C++: vtkImageData *GetLUMO() Returns vtkImageData for the Lowest Unoccupied Molecular Orbital. GetHOMOOrbitalNumberV.GetHOMOOrbitalNumber() -> int C++: vtkIdType GetHOMOOrbitalNumber() GetLUMOOrbitalNumberV.GetLUMOOrbitalNumber() -> int C++: vtkIdType GetLUMOOrbitalNumber() IsHOMOV.IsHOMO(int) -> bool C++: bool IsHOMO(vtkIdType orbitalNumber) Returns true if the given orbital number is the Highest Occupied Molecular Orbital, false otherwise. IsLUMOV.IsLUMO(int) -> bool C++: bool IsLUMO(vtkIdType orbitalNumber) Returns true if the given orbital number is the Lowest Unoccupied Molecular Orbital, false otherwise. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *obj) override; Deep copies the data object into this. GetPaddingV.GetPadding() -> float C++: virtual double GetPadding() Get the padding between the molecule and the cube boundaries. This is used to determine the dataset's bounds. VTK_EMPTY_CELLVTK_VERTEXVTK_POLY_VERTEXVTK_LINEVTK_POLY_LINEVTK_TRIANGLEVTK_TRIANGLE_STRIPVTK_POLYGONVTK_PIXELVTK_QUADVTK_TETRAVTK_VOXELVTK_HEXAHEDRONVTK_WEDGEVTK_PYRAMIDVTK_PENTAGONAL_PRISMVTK_HEXAGONAL_PRISMVTK_QUADRATIC_EDGEVTK_QUADRATIC_TRIANGLEVTK_QUADRATIC_QUADVTK_QUADRATIC_POLYGONVTK_QUADRATIC_TETRAVTK_QUADRATIC_HEXAHEDRONVTK_QUADRATIC_WEDGEVTK_QUADRATIC_PYRAMIDVTK_BIQUADRATIC_QUADVTK_TRIQUADRATIC_HEXAHEDRONVTK_QUADRATIC_LINEAR_QUADVTK_QUADRATIC_LINEAR_WEDGEVTK_BIQUADRATIC_QUADRATIC_WEDGEVTK_BIQUADRATIC_QUADRATIC_HEXAHEDRONVTK_BIQUADRATIC_TRIANGLEVTK_CUBIC_LINEVTK_CONVEX_POINT_SETVTK_POLYHEDRONVTK_PARAMETRIC_CURVEVTK_PARAMETRIC_SURFACEVTK_PARAMETRIC_TRI_SURFACEVTK_PARAMETRIC_QUAD_SURFACEVTK_PARAMETRIC_TETRA_REGIONVTK_PARAMETRIC_HEX_REGIONVTK_HIGHER_ORDER_EDGEVTK_HIGHER_ORDER_TRIANGLEVTK_HIGHER_ORDER_QUADVTK_HIGHER_ORDER_POLYGONVTK_HIGHER_ORDER_TETRAHEDRONVTK_HIGHER_ORDER_WEDGEVTK_HIGHER_ORDER_PYRAMIDVTK_HIGHER_ORDER_HEXAHEDRONVTK_LAGRANGE_CURVEVTK_LAGRANGE_TRIANGLEVTK_LAGRANGE_QUADRILATERALVTK_LAGRANGE_TETRAHEDRONVTK_LAGRANGE_HEXAHEDRONVTK_LAGRANGE_WEDGEVTK_LAGRANGE_PYRAMIDVTK_NUMBER_OF_CELL_TYPESvtkCommonDataModelPython.vtkVectorvtkCommonDataModelPython.vtkVector2vtkCommonDataModelPython.vtkVector3valuesvtkVectorvtkVector2vtkVector3vtkVector2fvtkVector2dvtkCommonDataModelPython.vtkVector_IdLi4EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float64,4] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const double &scalar) explicit vtkVector(const double *init) vtkVector(const &vtkVector) vtkVector_IdLi4EESquaredNormV.SquaredNorm() -> float C++: double SquaredNorm() Get the squared norm of the vector. NormV.Norm() -> float C++: double Norm() Get the norm of the vector, i.e. its length. NormalizeV.Normalize() -> float C++: double Normalize() Normalize the vector in place. \return The length of the vector. NormalizedV.Normalized() -> vtkVector_IdLi4EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. DotV.Dot(vtkVector_IdLi4EE) -> float C++: double Dot(const vtkVector &other) The dot product of this and the supplied vector. -@d-@P *d@W vtkVector_IdLi4EEvtkCommonDataModelPython.vtkVector_IfLi4EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float32,4] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const float &scalar) explicit vtkVector(const float *init) vtkVector(const &vtkVector) vtkVector_IfLi4EEV.SquaredNorm() -> float C++: float SquaredNorm() Get the squared norm of the vector. V.Normalized() -> vtkVector_IfLi4EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IfLi4EE) -> float C++: float Dot(const vtkVector &other) The dot product of this and the supplied vector. -@f-@P *f@W vtkVector_IfLi4EEvtkCommonDataModelPython.vtkVector_IiLi4EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[int32,4] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const int &scalar) explicit vtkVector(const int *init) vtkVector(const &vtkVector) vtkVector_IiLi4EEV.SquaredNorm() -> int C++: int SquaredNorm() Get the squared norm of the vector. V.Normalized() -> vtkVector_IiLi4EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IiLi4EE) -> int C++: int Dot(const vtkVector &other) The dot product of this and the supplied vector. -@i-@P *i@W vtkVector_IiLi4EEvtkCommonDataModelPython.vtkVector_IdLi2EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float64,2] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const double &scalar) explicit vtkVector(const double *init) vtkVector(const &vtkVector) vtkVector_IdLi2EEV.Normalized() -> vtkVector_IdLi2EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IdLi2EE) -> float C++: double Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IdLi2EEvtkCommonDataModelPython.vtkVector_IfLi2EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float32,2] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const float &scalar) explicit vtkVector(const float *init) vtkVector(const &vtkVector) vtkVector_IfLi2EEV.Normalized() -> vtkVector_IfLi2EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IfLi2EE) -> float C++: float Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IfLi2EEvtkCommonDataModelPython.vtkVector_IiLi2EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[int32,2] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const int &scalar) explicit vtkVector(const int *init) vtkVector(const &vtkVector) vtkVector_IiLi2EEV.Normalized() -> vtkVector_IiLi2EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IiLi2EE) -> int C++: int Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IiLi2EEvtkCommonDataModelPython.vtkVector_IdLi3EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float64,3] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const double &scalar) explicit vtkVector(const double *init) vtkVector(const &vtkVector) vtkVector_IdLi3EEV.Normalized() -> vtkVector_IdLi3EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IdLi3EE) -> float C++: double Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IdLi3EEvtkCommonDataModelPython.vtkVector_IfLi3EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[float32,3] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const float &scalar) explicit vtkVector(const float *init) vtkVector(const &vtkVector) vtkVector_IfLi3EEV.Normalized() -> vtkVector_IfLi3EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IfLi3EE) -> float C++: float Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IfLi3EEvtkCommonDataModelPython.vtkVector_IiLi3EEvtkVector - templated base type for storage of vectors. Superclass: vtkTuple[int32,3] This class is a templated data type for storing and manipulating fixed size vectors, which can be used to represent two and three dimensional points. The memory layout is a contiguous array of the specified type, such that a float[2] can be cast to a vtkVector2f and manipulated. Also a float[6] could be cast and used as a vtkVector2f[3]. vtkVector() explicit vtkVector(const int &scalar) explicit vtkVector(const int *init) vtkVector(const &vtkVector) vtkVector_IiLi3EEV.Normalized() -> vtkVector_IiLi3EE C++: vtkVector Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Dot(vtkVector_IiLi3EE) -> int C++: int Dot(const vtkVector &other) The dot product of this and the supplied vector. @W vtkVector_IiLi3EEvtkVector3 - templated base type for storage of 3D vectors. Superclass: vtkTuple[T,Size] Provided Types: vtkVector[float64,4] => vtkVector vtkVector[float32,4] => vtkVector vtkVector[int32,4] => vtkVector vtkVector[float64,2] => vtkVector vtkVector[float32,2] => vtkVector vtkVector[int32,2] => vtkVector vtkVector[float64,3] => vtkVector vtkVector[float32,3] => vtkVector vtkVector[int32,3] => vtkVector vtkCommonDataModelPython.vtkVector2_IdEvtkVector2 - no description provided. Superclass: vtkVector[float64,2] vtkVector2() explicit vtkVector2(const double &scalar) explicit vtkVector2(const double *init) vtkVector2(const double &x, const double &y) vtkVector2(const &vtkVector2) vtkVector2_IdEV.Set(float, float) C++: void Set(const double &x, const double &y) Set the x and y components of the vector. SetXV.SetX(float) C++: void SetX(const double &x) Set the x component of the vector, i.e. element 0. GetXV.GetX() -> float C++: const double &GetX() Get the x component of the vector, i.e. element 0. SetYV.SetY(float) C++: void SetY(const double &y) Set the y component of the vector, i.e. element 1. GetYV.GetY() -> float C++: const double &GetY() Get the y component of the vector, i.e. element 1. @W vtkVector2_IdEvtkCommonDataModelPython.vtkVector2_IfEvtkVector2 - no description provided. Superclass: vtkVector[float32,2] vtkVector2() explicit vtkVector2(const float &scalar) explicit vtkVector2(const float *init) vtkVector2(const float &x, const float &y) vtkVector2(const &vtkVector2) vtkVector2_IfEV.Set(float, float) C++: void Set(const float &x, const float &y) Set the x and y components of the vector. V.SetX(float) C++: void SetX(const float &x) Set the x component of the vector, i.e. element 0. V.GetX() -> float C++: const float &GetX() Get the x component of the vector, i.e. element 0. V.SetY(float) C++: void SetY(const float &y) Set the y component of the vector, i.e. element 1. V.GetY() -> float C++: const float &GetY() Get the y component of the vector, i.e. element 1. @W vtkVector2_IfEvtkCommonDataModelPython.vtkVector2_IiEvtkVector2 - no description provided. Superclass: vtkVector[int32,2] vtkVector2() explicit vtkVector2(const int &scalar) explicit vtkVector2(const int *init) vtkVector2(const int &x, const int &y) vtkVector2(const &vtkVector2) vtkVector2_IiEV.Set(int, int) C++: void Set(const int &x, const int &y) Set the x and y components of the vector. V.SetX(int) C++: void SetX(const int &x) Set the x component of the vector, i.e. element 0. V.GetX() -> int C++: const int &GetX() Get the x component of the vector, i.e. element 0. V.SetY(int) C++: void SetY(const int &y) Set the y component of the vector, i.e. element 1. V.GetY() -> int C++: const int &GetY() Get the y component of the vector, i.e. element 1. @W vtkVector2_IiEvtkVector2 - no description provided. Superclass: vtkVector[T,2] Provided Types: vtkVector2[float64] => vtkVector2 vtkVector2[float32] => vtkVector2 vtkVector2[int32] => vtkVector2 vtkCommonDataModelPython.vtkVector3_IdEvtkVector3 - no description provided. Superclass: vtkVector[float64,3] vtkVector3() explicit vtkVector3(const double &scalar) explicit vtkVector3(const double *init) vtkVector3(const double &x, const double &y, const double &z) vtkVector3(const &vtkVector3) vtkVector3_IdEV.Set(float, float, float) C++: void Set(const double &x, const double &y, const double &z) Set the x, y and z components of the vector. SetZV.SetZ(float) C++: void SetZ(const double &z) Set the z component of the vector, i.e. element 2. GetZV.GetZ() -> float C++: const double &GetZ() Get the z component of the vector, i.e. element 2. CrossV.Cross(vtkVector3_IdE) -> vtkVector3_IdE C++: vtkVector3 Cross(const vtkVector3 &other) Return the cross product of this X other. @W vtkVector3_IdEvtkCommonDataModelPython.vtkVector3_IfEvtkVector3 - no description provided. Superclass: vtkVector[float32,3] vtkVector3() explicit vtkVector3(const float &scalar) explicit vtkVector3(const float *init) vtkVector3(const float &x, const float &y, const float &z) vtkVector3(const &vtkVector3) vtkVector3_IfEV.Set(float, float, float) C++: void Set(const float &x, const float &y, const float &z) Set the x, y and z components of the vector. V.SetZ(float) C++: void SetZ(const float &z) Set the z component of the vector, i.e. element 2. V.GetZ() -> float C++: const float &GetZ() Get the z component of the vector, i.e. element 2. V.Cross(vtkVector3_IfE) -> vtkVector3_IfE C++: vtkVector3 Cross(const vtkVector3 &other) Return the cross product of this X other. @W vtkVector3_IfEvtkCommonDataModelPython.vtkVector3_IiEvtkVector3 - no description provided. Superclass: vtkVector[int32,3] vtkVector3() explicit vtkVector3(const int &scalar) explicit vtkVector3(const int *init) vtkVector3(const int &x, const int &y, const int &z) vtkVector3(const &vtkVector3) vtkVector3_IiEV.Set(int, int, int) C++: void Set(const int &x, const int &y, const int &z) Set the x, y and z components of the vector. V.SetZ(int) C++: void SetZ(const int &z) Set the z component of the vector, i.e. element 2. V.GetZ() -> int C++: const int &GetZ() Get the z component of the vector, i.e. element 2. V.Cross(vtkVector3_IiE) -> vtkVector3_IiE C++: vtkVector3 Cross(const vtkVector3 &other) Return the cross product of this X other. @W vtkVector3_IiEvtkVector3 - no description provided. Superclass: vtkVector[T,3] Provided Types: vtkVector3[float64] => vtkVector3 vtkVector3[float32] => vtkVector3 vtkVector3[int32] => vtkVector3 vtkCommonDataModelPython.vtkVector2ivtkVector2i - Some derived classes for the different vectors commonly used. Superclass: vtkVector2[int32] vtkVector2i() vtkVector2i(int x, int y) explicit vtkVector2i(int s) explicit vtkVector2i(const int *i) explicit vtkVector2i(const vtkTuple &o) vtkVector2i(const vtkVector &o) vtkVector2i(const &vtkVector2i) V.Normalized() -> vtkVector2i C++: vtkVector2i Normalized() Return the normalized form of this vector. \return The normalized form of this vector. -@W vtkTuple_IiLi2EE@W vtkVector2ivtkTuple_IiLi2EEvtkCommonDataModelPython.vtkVector2fvtkVector2f - no description provided. Superclass: vtkVector2[float32] vtkVector2f() vtkVector2f(float x, float y) explicit vtkVector2f(float s) explicit vtkVector2f(const float *i) explicit vtkVector2f(const vtkTuple &o) vtkVector2f(const vtkVector &o) vtkVector2f(const &vtkVector2f) V.Normalized() -> vtkVector2f C++: vtkVector2f Normalized() Return the normalized form of this vector. \return The normalized form of this vector. -@W vtkTuple_IfLi2EE@W vtkVector2fvtkTuple_IfLi2EEvtkCommonDataModelPython.vtkVector2dvtkVector2d - no description provided. Superclass: vtkVector2[float64] vtkVector2d() vtkVector2d(double x, double y) explicit vtkVector2d(double s) explicit vtkVector2d(const double *i) explicit vtkVector2d(const vtkTuple &o) vtkVector2d(const vtkVector &o) vtkVector2d(const &vtkVector2d) V.Normalized() -> vtkVector2d C++: vtkVector2d Normalized() Return the normalized form of this vector. \return The normalized form of this vector. -@W vtkTuple_IdLi2EE@W vtkVector2dvtkTuple_IdLi2EEvtkCommonDataModelPython.vtkVector3ivtkVector3i - no description provided. Superclass: vtkVector3[int32] vtkVector3i() vtkVector3i(int x, int y, int z) explicit vtkVector3i(int s) explicit vtkVector3i(const int *i) explicit vtkVector3i(const vtkTuple &o) vtkVector3i(const vtkVector &o) vtkVector3i(const &vtkVector3i) V.Normalized() -> vtkVector3i C++: vtkVector3i Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Cross(vtkVector3i) -> vtkVector3i C++: vtkVector3i Cross(const vtkVector3i &other) -@W vtkTuple_IiLi3EE@W vtkVector3ivtkTuple_IiLi3EEvtkCommonDataModelPython.vtkVector3fvtkVector3f - no description provided. Superclass: vtkVector3[float32] vtkVector3f() vtkVector3f(float x, float y, float z) explicit vtkVector3f(float s) explicit vtkVector3f(const float *i) explicit vtkVector3f(const vtkTuple &o) vtkVector3f(const vtkVector &o) vtkVector3f(const &vtkVector3f) V.Normalized() -> vtkVector3f C++: vtkVector3f Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Cross(vtkVector3f) -> vtkVector3f C++: vtkVector3f Cross(const vtkVector3f &other) -@W vtkTuple_IfLi3EEvtkTuple_IfLi3EEvtkCommonDataModelPython.vtkVector3dvtkVector3d - no description provided. Superclass: vtkVector3[float64] vtkVector3d() vtkVector3d(double x, double y, double z) explicit vtkVector3d(double s) explicit vtkVector3d(const double *i) explicit vtkVector3d(const vtkTuple &o) vtkVector3d(const vtkVector &o) vtkVector3d(const &vtkVector3d) V.Normalized() -> vtkVector3d C++: vtkVector3d Normalized() Return the normalized form of this vector. \return The normalized form of this vector. V.Cross(vtkVector3d) -> vtkVector3d C++: vtkVector3d Cross(const vtkVector3d &other) -@W vtkTuple_IdLi3EE@W vtkVector3dvtkTuple_IdLi3EEvtkCommonDataModelPython.vtkColor3vtkCommonDataModelPython.vtkColor4vtkColor3vtkColor4vtkColor3ubvtkColor3fvtkColor3dvtkColor4ubvtkColor4fvtkColor4dvtkCommonDataModelPython.vtkColor3_IdEvtkColor3 - no description provided. Superclass: vtkTuple[float64,3] vtkColor3() explicit vtkColor3(const double &scalar) explicit vtkColor3(const double *init) vtkColor3(const double &red, const double &green, const double &blue) vtkColor3(const &vtkColor3) vtkColor3_IdEV.Set(float, float, float) C++: void Set(const double &red, const double &green, const double &blue) Set the red, green and blue components of the color. SetRedV.SetRed(float) C++: void SetRed(const double &red) Set the red component of the color, i.e. element 0. GetRedV.GetRed() -> float C++: const double &GetRed() Get the red component of the color, i.e. element 0. SetGreenV.SetGreen(float) C++: void SetGreen(const double &green) Set the green component of the color, i.e. element 1. GetGreenV.GetGreen() -> float C++: const double &GetGreen() Get the green component of the color, i.e. element 1. SetBlueV.SetBlue(float) C++: void SetBlue(const double &blue) Set the blue component of the color, i.e. element 2. GetBlueV.GetBlue() -> float C++: const double &GetBlue() Get the blue component of the color, i.e. element 2. @W vtkColor3_IdEvtkCommonDataModelPython.vtkColor3_IfEvtkColor3 - no description provided. Superclass: vtkTuple[float32,3] vtkColor3() explicit vtkColor3(const float &scalar) explicit vtkColor3(const float *init) vtkColor3(const float &red, const float &green, const float &blue) vtkColor3(const &vtkColor3) vtkColor3_IfEV.Set(float, float, float) C++: void Set(const float &red, const float &green, const float &blue) Set the red, green and blue components of the color. V.SetRed(float) C++: void SetRed(const float &red) Set the red component of the color, i.e. element 0. V.GetRed() -> float C++: const float &GetRed() Get the red component of the color, i.e. element 0. V.SetGreen(float) C++: void SetGreen(const float &green) Set the green component of the color, i.e. element 1. V.GetGreen() -> float C++: const float &GetGreen() Get the green component of the color, i.e. element 1. V.SetBlue(float) C++: void SetBlue(const float &blue) Set the blue component of the color, i.e. element 2. V.GetBlue() -> float C++: const float &GetBlue() Get the blue component of the color, i.e. element 2. @W vtkColor3_IfEvtkCommonDataModelPython.vtkColor3_IhEvtkColor3 - no description provided. Superclass: vtkTuple[uint8,3] vtkColor3() explicit vtkColor3(const unsigned char &scalar) explicit vtkColor3(const unsigned char *init) vtkColor3(const unsigned char &red, const unsigned char &green, const unsigned char &blue) vtkColor3(const &vtkColor3) vtkColor3_IhEV.Set(int, int, int) C++: void Set(const unsigned char &red, const unsigned char &green, const unsigned char &blue) Set the red, green and blue components of the color. V.SetRed(int) C++: void SetRed(const unsigned char &red) Set the red component of the color, i.e. element 0. V.GetRed() -> int C++: const unsigned char &GetRed() Get the red component of the color, i.e. element 0. V.SetGreen(int) C++: void SetGreen(const unsigned char &green) Set the green component of the color, i.e. element 1. V.GetGreen() -> int C++: const unsigned char &GetGreen() Get the green component of the color, i.e. element 1. V.SetBlue(int) C++: void SetBlue(const unsigned char &blue) Set the blue component of the color, i.e. element 2. V.GetBlue() -> int C++: const unsigned char &GetBlue() Get the blue component of the color, i.e. element 2. -@B-@P *B@W vtkColor3_IhEvtkColor3 - no description provided. Superclass: vtkTuple[T,3] Provided Types: vtkColor3[float64] => vtkColor3 vtkColor3[float32] => vtkColor3 vtkColor3[uint8] => vtkColor3 vtkCommonDataModelPython.vtkColor4_IdEvtkColor4 - no description provided. Superclass: vtkTuple[float64,4] vtkColor4() explicit vtkColor4(const double &scalar) explicit vtkColor4(const double *init) vtkColor4(const double &red, const double &green, const double &blue, const double &alpha) vtkColor4(const &vtkColor4) vtkColor4_IdEV.Set(float, float, float) C++: void Set(const double &red, const double &green, const double &blue) V.Set(float, float, float, float) C++: void Set(const double &red, const double &green, const double &blue, const double &alpha) Set the red, green and blue components of the color. SetAlphaV.SetAlpha(float) C++: void SetAlpha(const double &alpha) Set the alpha component of the color, i.e. element 3. GetAlphaV.GetAlpha() -> float C++: const double &GetAlpha() Get the alpha component of the color, i.e. element 3. @W vtkColor4_IdEvtkCommonDataModelPython.vtkColor4_IfEvtkColor4 - no description provided. Superclass: vtkTuple[float32,4] vtkColor4() explicit vtkColor4(const float &scalar) explicit vtkColor4(const float *init) vtkColor4(const float &red, const float &green, const float &blue, const float &alpha) vtkColor4(const &vtkColor4) vtkColor4_IfEV.Set(float, float, float) C++: void Set(const float &red, const float &green, const float &blue) V.Set(float, float, float, float) C++: void Set(const float &red, const float &green, const float &blue, const float &alpha) Set the red, green and blue components of the color. V.SetAlpha(float) C++: void SetAlpha(const float &alpha) Set the alpha component of the color, i.e. element 3. V.GetAlpha() -> float C++: const float &GetAlpha() Get the alpha component of the color, i.e. element 3. @W vtkColor4_IfEvtkCommonDataModelPython.vtkColor4_IhEvtkColor4 - no description provided. Superclass: vtkTuple[uint8,4] vtkColor4() explicit vtkColor4(const unsigned char &scalar) explicit vtkColor4(const unsigned char *init) vtkColor4(const unsigned char &red, const unsigned char &green, const unsigned char &blue, const unsigned char &alpha) vtkColor4(const &vtkColor4) vtkColor4_IhEV.Set(int, int, int) C++: void Set(const unsigned char &red, const unsigned char &green, const unsigned char &blue) V.Set(int, int, int, int) C++: void Set(const unsigned char &red, const unsigned char &green, const unsigned char &blue, const unsigned char &alpha) Set the red, green and blue components of the color. V.SetAlpha(int) C++: void SetAlpha(const unsigned char &alpha) Set the alpha component of the color, i.e. element 3. V.GetAlpha() -> int C++: const unsigned char &GetAlpha() Get the alpha component of the color, i.e. element 3. @W vtkColor4_IhEvtkColor4 - no description provided. Superclass: vtkTuple[T,4] Provided Types: vtkColor4[float64] => vtkColor4 vtkColor4[float32] => vtkColor4 vtkColor4[uint8] => vtkColor4 vtkCommonDataModelPython.vtkColor3ubvtkColor3ub - Some derived classes for the different colors commonly used. Superclass: vtkColor3[uint8] vtkColor3ub() explicit vtkColor3ub(unsigned char scalar) explicit vtkColor3ub(const unsigned char *init) explicit vtkColor3ub(int hexSigned) vtkColor3ub(unsigned char r, unsigned char g, unsigned char b) vtkColor3ub(const &vtkColor3ub) @W vtkColor3ubvtkCommonDataModelPython.vtkColor3fvtkColor3f - no description provided. Superclass: vtkColor3[float32] vtkColor3f() explicit vtkColor3f(float scalar) explicit vtkColor3f(const float *init) vtkColor3f(float r, float g, float b) vtkColor3f(const &vtkColor3f) @W vtkColor3fvtkCommonDataModelPython.vtkColor3dvtkColor3d - no description provided. Superclass: vtkColor3[float64] vtkColor3d() explicit vtkColor3d(double scalar) explicit vtkColor3d(const double *init) vtkColor3d(double r, double g, double b) vtkColor3d(const &vtkColor3d) @W vtkColor3dvtkCommonDataModelPython.vtkColor4ubvtkColor4ub - no description provided. Superclass: vtkColor4[uint8] vtkColor4ub() explicit vtkColor4ub(unsigned char scalar) explicit vtkColor4ub(const unsigned char *init) explicit vtkColor4ub(int hexSigned) vtkColor4ub(unsigned char r, unsigned char g, unsigned char b, unsigned char a=255) vtkColor4ub(const vtkColor3ub &c) vtkColor4ub(const &vtkColor4ub) @W vtkColor4ubvtkCommonDataModelPython.vtkColor4fvtkColor4f - no description provided. Superclass: vtkColor4[float32] vtkColor4f() explicit vtkColor4f(float scalar) explicit vtkColor4f(const float *init) vtkColor4f(float r, float g, float b, float a=1.0) vtkColor4f(const &vtkColor4f) @W vtkColor4fvtkCommonDataModelPython.vtkColor4dvtkColor4d - no description provided. Superclass: vtkColor4[float64] vtkColor4d() explicit vtkColor4d(double scalar) explicit vtkColor4d(const double *init) vtkColor4d(double r, double g, double b, double a=1.0) vtkColor4d(const &vtkColor4d) @W vtkColor4dvtkCommonDataModelPython.vtkRectvtkRectvtkRectivtkRectfvtkRectdvtkCommonDataModelPython.vtkRect_IdEvtkRect- templated base type for storage of 2D rectangles. Superclass: vtkVector[float64,4] This class is a templated data type for storing and manipulating rectangles. The memory layout is a contiguous array of the specified type, such that a float[4] can be cast to a vtkRectf and manipulated. Also a float[12] could be cast and used as a vtkRectf[3]. vtkRect() vtkRect(const double &x, const double &y, const double &width, const double &height) explicit vtkRect(const double *init) vtkRect(const &vtkRect) vtkRect_IdEV.Set(float, float, float, float) C++: void Set(const double &x, const double &y, const double &width, const double &height) Set the x, y components of the rectangle, and the width/height. V.SetX(float) C++: void SetX(const double &x) Set the x component of the rectangle bottom corner, i.e. element 0. V.GetX() -> float C++: const double &GetX() Get the x component of the rectangle bottom corner, i.e. element 0. V.SetY(float) C++: void SetY(const double &y) Set the y component of the rectangle bottom corner, i.e. element 1. V.GetY() -> float C++: const double &GetY() Get the y component of the rectangle bottom corner, i.e. element 1. SetWidthV.SetWidth(float) C++: void SetWidth(const double &width) Set the width of the rectanle, i.e. element 2. GetWidthV.GetWidth() -> float C++: const double &GetWidth() Get the width of the rectangle, i.e. element 2. SetHeightV.SetHeight(float) C++: void SetHeight(const double &height) Set the height of the rectangle, i.e. element 3. GetHeightV.GetHeight() -> float C++: const double &GetHeight() Get the height of the rectangle, i.e. element 3. V.GetLeft() -> float C++: const double &GetLeft() Get the left boundary of the rectangle along the X direction. V.GetRight() -> float C++: double GetRight() Get the right boundary of the rectangle along the X direction. GetTopV.GetTop() -> float C++: double GetTop() Get the top boundary of the rectangle along the Y direction. GetBottomV.GetBottom() -> float C++: const double &GetBottom() Get the bottom boundary of the rectangle along the Y direction. GetBottomLeftV.GetBottomLeft() -> vtkVector2_IdE C++: vtkVector2 GetBottomLeft() Get the bottom left corner of the rect as a vtkVector. GetTopLeftV.GetTopLeft() -> vtkVector_IdLi2EE C++: vtkVector GetTopLeft() Get the top left corner of the rect as a vtkVector. GetBottomRightV.GetBottomRight() -> vtkVector_IdLi2EE C++: vtkVector GetBottomRight() Get the bottom right corner of the rect as a vtkVector. GetTopRightV.GetTopRight() -> vtkVector_IdLi2EE C++: vtkVector GetTopRight() Get the bottom left corner of the rect as a vtkVector. V.AddPoint((float, float)) C++: void AddPoint(const double point[2]) V.AddPoint(float, float) C++: void AddPoint(double x, double y) Expand this rect to contain the point passed in. AddRectV.AddRect(vtkRect_IdE) C++: void AddRect(const vtkRect &rect) Expand this rect to contain the rect passed in. IntersectsWithV.IntersectsWith(vtkRect_IdE) -> bool C++: bool IntersectsWith(const vtkRect &rect) Returns true if the rect argument overlaps this rect. If the upper bound of one rect is equal to the lower bound of the other rect, then this will return false (in that case, the rects would be considered to be adjacent but not overlapping). @W vtkRect_IdEvtkCommonDataModelPython.vtkRect_IfEvtkRect- templated base type for storage of 2D rectangles. Superclass: vtkVector[float32,4] This class is a templated data type for storing and manipulating rectangles. The memory layout is a contiguous array of the specified type, such that a float[4] can be cast to a vtkRectf and manipulated. Also a float[12] could be cast and used as a vtkRectf[3]. vtkRect() vtkRect(const float &x, const float &y, const float &width, const float &height) explicit vtkRect(const float *init) vtkRect(const &vtkRect) vtkRect_IfEV.Set(float, float, float, float) C++: void Set(const float &x, const float &y, const float &width, const float &height) Set the x, y components of the rectangle, and the width/height. V.SetX(float) C++: void SetX(const float &x) Set the x component of the rectangle bottom corner, i.e. element 0. V.GetX() -> float C++: const float &GetX() Get the x component of the rectangle bottom corner, i.e. element 0. V.SetY(float) C++: void SetY(const float &y) Set the y component of the rectangle bottom corner, i.e. element 1. V.GetY() -> float C++: const float &GetY() Get the y component of the rectangle bottom corner, i.e. element 1. V.SetWidth(float) C++: void SetWidth(const float &width) Set the width of the rectanle, i.e. element 2. V.GetWidth() -> float C++: const float &GetWidth() Get the width of the rectangle, i.e. element 2. V.SetHeight(float) C++: void SetHeight(const float &height) Set the height of the rectangle, i.e. element 3. V.GetHeight() -> float C++: const float &GetHeight() Get the height of the rectangle, i.e. element 3. V.GetLeft() -> float C++: const float &GetLeft() Get the left boundary of the rectangle along the X direction. V.GetRight() -> float C++: float GetRight() Get the right boundary of the rectangle along the X direction. V.GetTop() -> float C++: float GetTop() Get the top boundary of the rectangle along the Y direction. V.GetBottom() -> float C++: const float &GetBottom() Get the bottom boundary of the rectangle along the Y direction. V.GetBottomLeft() -> vtkVector2_IfE C++: vtkVector2 GetBottomLeft() Get the bottom left corner of the rect as a vtkVector. V.GetTopLeft() -> vtkVector_IfLi2EE C++: vtkVector GetTopLeft() Get the top left corner of the rect as a vtkVector. V.GetBottomRight() -> vtkVector_IfLi2EE C++: vtkVector GetBottomRight() Get the bottom right corner of the rect as a vtkVector. V.GetTopRight() -> vtkVector_IfLi2EE C++: vtkVector GetTopRight() Get the bottom left corner of the rect as a vtkVector. V.AddPoint((float, float)) C++: void AddPoint(const float point[2]) V.AddPoint(float, float) C++: void AddPoint(float x, float y) Expand this rect to contain the point passed in. V.AddRect(vtkRect_IfE) C++: void AddRect(const vtkRect &rect) Expand this rect to contain the rect passed in. V.IntersectsWith(vtkRect_IfE) -> bool C++: bool IntersectsWith(const vtkRect &rect) Returns true if the rect argument overlaps this rect. If the upper bound of one rect is equal to the lower bound of the other rect, then this will return false (in that case, the rects would be considered to be adjacent but not overlapping). @W vtkRect_IfEvtkCommonDataModelPython.vtkRect_IiEvtkRect- templated base type for storage of 2D rectangles. Superclass: vtkVector[int32,4] This class is a templated data type for storing and manipulating rectangles. The memory layout is a contiguous array of the specified type, such that a float[4] can be cast to a vtkRectf and manipulated. Also a float[12] could be cast and used as a vtkRectf[3]. vtkRect() vtkRect(const int &x, const int &y, const int &width, const int &height) explicit vtkRect(const int *init) vtkRect(const &vtkRect) vtkRect_IiEV.Set(int, int, int, int) C++: void Set(const int &x, const int &y, const int &width, const int &height) Set the x, y components of the rectangle, and the width/height. V.SetX(int) C++: void SetX(const int &x) Set the x component of the rectangle bottom corner, i.e. element 0. V.GetX() -> int C++: const int &GetX() Get the x component of the rectangle bottom corner, i.e. element 0. V.SetY(int) C++: void SetY(const int &y) Set the y component of the rectangle bottom corner, i.e. element 1. V.GetY() -> int C++: const int &GetY() Get the y component of the rectangle bottom corner, i.e. element 1. V.SetWidth(int) C++: void SetWidth(const int &width) Set the width of the rectanle, i.e. element 2. V.GetWidth() -> int C++: const int &GetWidth() Get the width of the rectangle, i.e. element 2. V.SetHeight(int) C++: void SetHeight(const int &height) Set the height of the rectangle, i.e. element 3. V.GetHeight() -> int C++: const int &GetHeight() Get the height of the rectangle, i.e. element 3. V.GetLeft() -> int C++: const int &GetLeft() Get the left boundary of the rectangle along the X direction. V.GetRight() -> int C++: int GetRight() Get the right boundary of the rectangle along the X direction. V.GetTop() -> int C++: int GetTop() Get the top boundary of the rectangle along the Y direction. V.GetBottom() -> int C++: const int &GetBottom() Get the bottom boundary of the rectangle along the Y direction. V.GetBottomLeft() -> vtkVector2_IiE C++: vtkVector2 GetBottomLeft() Get the bottom left corner of the rect as a vtkVector. V.GetTopLeft() -> vtkVector_IiLi2EE C++: vtkVector GetTopLeft() Get the top left corner of the rect as a vtkVector. V.GetBottomRight() -> vtkVector_IiLi2EE C++: vtkVector GetBottomRight() Get the bottom right corner of the rect as a vtkVector. V.GetTopRight() -> vtkVector_IiLi2EE C++: vtkVector GetTopRight() Get the bottom left corner of the rect as a vtkVector. V.AddPoint((int, int)) C++: void AddPoint(const int point[2]) V.AddPoint(int, int) C++: void AddPoint(int x, int y) Expand this rect to contain the point passed in. V.AddRect(vtkRect_IiE) C++: void AddRect(const vtkRect &rect) Expand this rect to contain the rect passed in. V.IntersectsWith(vtkRect_IiE) -> bool C++: bool IntersectsWith(const vtkRect &rect) Returns true if the rect argument overlaps this rect. If the upper bound of one rect is equal to the lower bound of the other rect, then this will return false (in that case, the rects would be considered to be adjacent but not overlapping). @W vtkRect_IiEvtkRect - templated base type for storage of 2D rectangles. Superclass: vtkVector[T,4] This class is a templated data type for storing and manipulating rectangles. The memory layout is a contiguous array of the specified type, such that a float[4] can be cast to a vtkRectf and manipulated. Also a float[12] could be cast and used as a vtkRectf[3]. Provided Types: vtkRect[float64] => vtkRect vtkRect[float32] => vtkRect vtkRect[int32] => vtkRect vtkCommonDataModelPython.vtkRectivtkRecti - no description provided. Superclass: vtkRect[int32] vtkRecti() vtkRecti(int x, int y, int width, int height) explicit vtkRecti(const int *init) vtkRecti(const &vtkRecti) @W vtkRectivtkCommonDataModelPython.vtkRectfvtkRectf - no description provided. Superclass: vtkRect[float32] vtkRectf() vtkRectf(float x, float y, float width, float height) explicit vtkRectf(const float *init) vtkRectf(const &vtkRectf) @W vtkRectfvtkCommonDataModelPython.vtkRectdvtkRectd - no description provided. Superclass: vtkRect[float64] vtkRectd() vtkRectd(double x, double y, double width, double height) explicit vtkRectd(const double *init) vtkRectd(const &vtkRectd) @W vtkRectdvtkNonOverlappingAMRvtkCommonDataModelPython.vtkNonOverlappingAMRvtkNonOverlappingAMR - A concrete instance of vtkUniformGridAMR to store uniform grids at different levels of resolution that do not overlap with each other. Superclass: vtkUniformGridAMR @sa vtkUniformGridAMR V.SafeDownCast(vtkObjectBase) -> vtkNonOverlappingAMR C++: static vtkNonOverlappingAMR *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkNonOverlappingAMR C++: vtkNonOverlappingAMR *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Returns object type (see vtkType.h for definitions). V.GetData(vtkInformation) -> vtkNonOverlappingAMR C++: static vtkNonOverlappingAMR *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkNonOverlappingAMR C++: static vtkNonOverlappingAMR *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkCommonDataModelPython.vtkOverlappingAMRvtkOverlappingAMR - hierarchical dataset of vtkUniformGrids Superclass: vtkUniformGridAMR vtkOverlappingAMR extends vtkUniformGridAMR by exposing access to the amr meta data, which stores all structural information represented by an vtkAMRInformation object @sa vtkAMRInformation V.SafeDownCast(vtkObjectBase) -> vtkOverlappingAMR C++: static vtkOverlappingAMR *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkOverlappingAMR C++: vtkOverlappingAMR *NewInstance() V.NewIterator() -> vtkCompositeDataIterator C++: vtkCompositeDataIterator *NewIterator() override; Return a new iterator (the iterator has to be deleted by the user). V.SetOrigin((float, ...)) C++: void SetOrigin(const double *) Get/Set the global origin of the amr data set V.GetOrigin() -> (float, ...) C++: double *GetOrigin() V.GetOrigin(int, int, [float, float, float]) C++: void GetOrigin(unsigned int level, unsigned int id, double origin[3]) Get/Set the global origin of the amr data set V.SetSpacing(int, (float, float, float)) C++: void SetSpacing(unsigned int level, const double spacing[3]) Get/Set the grid spacing at a given level V.GetSpacing(int, [float, float, float]) C++: void GetSpacing(unsigned int level, double spacing[3]) Get/Set the grid spacing at a given level SetAMRBoxV.SetAMRBox(int, int, vtkAMRBox) C++: void SetAMRBox(unsigned int level, unsigned int id, const vtkAMRBox &box) Set/Get the AMRBox for a given block GetAMRBoxV.GetAMRBox(int, int) -> vtkAMRBox C++: const vtkAMRBox &GetAMRBox(unsigned int level, unsigned int id) Set/Get the AMRBox for a given block V.GetBounds(int, int, [float, ...]) C++: void GetBounds(unsigned int level, unsigned int id, double *bb) V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double b[6]) Returns the bounding information of a data set. NUMBER_OF_BLANKED_POINTSV.NUMBER_OF_BLANKED_POINTS() -> vtkInformationIdTypeKey C++: static vtkInformationIdTypeKey *NUMBER_OF_BLANKED_POINTS() V.GetData(vtkInformation) -> vtkOverlappingAMR C++: static vtkOverlappingAMR *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkOverlappingAMR C++: static vtkOverlappingAMR *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. SetRefinementRatioV.SetRefinementRatio(int, int) C++: void SetRefinementRatio(unsigned int level, int refRatio) Sets the refinement of a given level. The spacing at level level+1 is defined as spacing(level+1) = spacing(level)/refRatio(level). Note that currently, this is not enforced by this class however some algorithms might not function properly if the spacing in the blocks (vtkUniformGrid) does not match the one described by the refinement ratio. GetRefinementRatioV.GetRefinementRatio(int) -> int C++: int GetRefinementRatio(unsigned int level) V.GetRefinementRatio(vtkCompositeDataIterator) -> int C++: int GetRefinementRatio(vtkCompositeDataIterator *iter) Returns the refinement of a given level. SetAMRBlockSourceIndexV.SetAMRBlockSourceIndex(int, int, int) C++: void SetAMRBlockSourceIndex(unsigned int level, unsigned int id, int sourceId) Set/Get the source id of a block. The source id is produced by an AMR source, e.g. a file reader might set this to be a file block id GetAMRBlockSourceIndexV.GetAMRBlockSourceIndex(int, int) -> int C++: int GetAMRBlockSourceIndex(unsigned int level, unsigned int id) Set/Get the source id of a block. The source id is produced by an AMR source, e.g. a file reader might set this to be a file block id HasChildrenInformationV.HasChildrenInformation() -> bool C++: bool HasChildrenInformation() Return whether parent child information has been generated GenerateParentChildInformationV.GenerateParentChildInformation() C++: void GenerateParentChildInformation() Generate the parent/child relationships - needed to be called before GetParents or GetChildren can be used! GetParentsV.GetParents(int, int, int) -> (int, ...) C++: unsigned int *GetParents(unsigned int level, unsigned int index, unsigned int &numParents) Return a pointer to Parents of a block. The first entry is the number of parents the block has followed by its parent ids in level-1. If none exits it returns nullptr. V.GetChildren(int, int, int) -> (int, ...) C++: unsigned int *GetChildren(unsigned int level, unsigned int index, unsigned int &numChildren) Return a pointer to Children of a block. The first entry is the number of children the block has followed by its childern ids in level+1. If none exits it returns nullptr. PrintParentChildInfoV.PrintParentChildInfo(int, int) C++: void PrintParentChildInfo(unsigned int level, unsigned int index) Prints the parents and children of a requested block (Debug Routine) FindGridV.FindGrid([float, float, float], int, int) -> bool C++: bool FindGrid(double q[3], unsigned int &level, unsigned int &gridId) Given a point q, find the highest level grid that contains it. GetAMRInfoV.GetAMRInfo() -> vtkAMRInformation C++: vtkAMRInformation *GetAMRInfo() override; Get/Set the internal representation of amr meta meta data SetAMRInfoV.SetAMRInfo(vtkAMRInformation) C++: void SetAMRInfo(vtkAMRInformation *info) override; Get/Set the meta AMR meta data AuditV.Audit() C++: void Audit() Check whether the data set is internally consistent, e.g. whether the meta data and actual data blocks match. Incorrectness will be reported as error messages vtkAMRInformationvtkCommonDataModelPython.vtkAMRInformationvtkAMRInformation - Meta data that describes the structure of an AMR data set Superclass: vtkObject vtkAMRInformation encaspulates the following meta information for an AMR data set - a list of vtkAMRBox objects - Refinement ratio between AMR levels - Grid spacing for each level - The file block index for each block - parent child information, if requested @sa vtkOverlappingAMR, vtkAMRBox V.SafeDownCast(vtkObjectBase) -> vtkAMRInformation C++: static vtkAMRInformation *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAMRInformation C++: vtkAMRInformation *NewInstance() V.Initialize(int, (int, ...)) C++: void Initialize(int numLevels, const int *blocksPerLevel) Initialize the meta information numLevels is the number of levels blocksPerLevel[i] is the number of blocks at level i V.GetGridDescription() -> int C++: virtual int GetGridDescription() returns the value of vtkUniformGrid::GridDescription() of any block SetGridDescriptionV.SetGridDescription(int) C++: void SetGridDescription(int description) returns the value of vtkUniformGrid::GridDescription() of any block V.GetOrigin([float, float, float]) C++: void GetOrigin(double origin[3]) V.GetOrigin() -> (float, ...) C++: double *GetOrigin() V.GetOrigin(int, int, [float, ...]) -> bool C++: bool GetOrigin(unsigned int level, unsigned int id, double *origin) Get the AMR dataset origin The origin is essentially the minimum of all the grids. V.SetOrigin((float, ...)) C++: void SetOrigin(const double *origin) Get the AMR dataset origin The origin is essentially the minimum of all the grids. V.GetNumberOfLevels() -> int C++: unsigned int GetNumberOfLevels() Return the number of levels V.GetNumberOfDataSets(int) -> int C++: unsigned int GetNumberOfDataSets(unsigned int level) Returns the number of datasets at the given levelx GetTotalNumberOfBlocksV.GetTotalNumberOfBlocks() -> int C++: unsigned int GetTotalNumberOfBlocks() Returns total number of datasets GetIndexV.GetIndex(int, int) -> int C++: int GetIndex(unsigned int level, unsigned int id) Returns the single index from a pair of indices ComputeIndexPairV.ComputeIndexPair(int, int, int) C++: void ComputeIndexPair(unsigned int index, unsigned int &level, unsigned int &id) Returns the an index pair given a single index V.GetBounds() -> (float, ...) C++: const double *GetBounds() V.GetBounds(int, int, [float, ...]) C++: void GetBounds(unsigned int level, unsigned int id, double *bb) Returns the bounds of the entire domain V.GetSpacing(int, [float, float, float]) C++: void GetSpacing(unsigned int level, double spacing[3]) Return the spacing at the given fiven HasSpacingV.HasSpacing(int) -> bool C++: bool HasSpacing(unsigned int level) V.SetAMRBox(int, int, vtkAMRBox) C++: void SetAMRBox(unsigned int level, unsigned int id, const vtkAMRBox &box) Methods to set and get the AMR box at a given position V.GetAMRBox(int, int) -> vtkAMRBox C++: const vtkAMRBox &GetAMRBox(unsigned int level, unsigned int id) Methods to set and get the AMR box at a given position GetCoarsenedAMRBoxV.GetCoarsenedAMRBox(int, int, vtkAMRBox) -> bool C++: bool GetCoarsenedAMRBox(unsigned int level, unsigned int id, vtkAMRBox &box) return the amr box coarsened to the previous level V.GetAMRBlockSourceIndex(int) -> int C++: int GetAMRBlockSourceIndex(int index) Get/Set the SourceIndex of a block. Typically, this is a file-type specific index that can be used by a reader to load a particular file block V.SetAMRBlockSourceIndex(int, int) C++: void SetAMRBlockSourceIndex(int index, int sourceId) Get/Set the SourceIndex of a block. Typically, this is a file-type specific index that can be used by a reader to load a particular file block GenerateRefinementRatioV.GenerateRefinementRatio() C++: void GenerateRefinementRatio() This method computes the refinement ratio at each level. At each level, l, the refinement ratio r_l is computed by r_l = D_{l} / D_{l+1}, where D_{l+1} and D_{l} are the grid spacings at the next and current level respectively. * .SECTION Assumptions * 1) Within each level, the refinement ratios are the same for all blocks. * 2) The refinement ratio is uniform along each dimension of the block. HasRefinementRatioV.HasRefinementRatio() -> bool C++: bool HasRefinementRatio() Returns whether refinement ratio has been set (either by calling GenerateRefinementRatio() or by calling SetRefinementRatio() V.SetRefinementRatio(int, int) C++: void SetRefinementRatio(unsigned int level, int ratio) Set the refinement ratio at a level. This method should be called for all levels, if called at all. V.GetRefinementRatio(int) -> int C++: int GetRefinementRatio(unsigned int level) Returns the refinement of a given level. V.SetSpacing(int, (float, ...)) C++: void SetSpacing(unsigned int level, const double *h) Set the spacing at a given level V.Audit() -> bool C++: bool Audit() Checks whether the meta data is internally consistent. V.FindCell([float, float, float], int, int, int) -> bool C++: bool FindCell(double q[3], unsigned int level, unsigned int index, int &cellIdx) Given a point q, find whether q is bounded by the data set at (level,index). If it is, set cellIdx to the cell index and return true; otherwise return false V.FindGrid([float, float, float], int, int) -> bool C++: bool FindGrid(double q[3], int level, unsigned int &gridId) V.FindGrid([float, float, float], int, int) -> bool C++: bool FindGrid(double q[3], unsigned int &level, unsigned int &gridId) find the grid that contains the point q at the specified level V.DeepCopy(vtkAMRInformation) C++: void DeepCopy(vtkAMRInformation *other) @PiI *d@PII *dvtkAMRDataInternalsvtkCommonDataModelPython.vtkAMRDataInternalsvtkAMRDataInternals - container of vtkUniformGrid for an AMR data set Superclass: vtkObject vtkAMRDataInternals stores a list of non-empty blocks of an AMR data set @sa vtkOverlappingAMR, vtkAMRBox V.SafeDownCast(vtkObjectBase) -> vtkAMRDataInternals C++: static vtkAMRDataInternals *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkAMRDataInternals C++: vtkAMRDataInternals *NewInstance() V.Initialize() C++: void Initialize() InsertV.Insert(int, vtkUniformGrid) C++: void Insert(unsigned int index, vtkUniformGrid *grid) V.GetDataSet(int) -> vtkUniformGrid C++: vtkUniformGrid *GetDataSet(unsigned int compositeIndex) V.ShallowCopy(vtkObject) C++: virtual void ShallowCopy(vtkObject *src) V.GetNumberOfBlocks() -> int C++: unsigned int GetNumberOfBlocks() vtkCommonDataModelPython.vtkUniformGridAMRvtkUniformGridAMR - no description provided. Superclass: vtkCompositeDataSet vtkUniformGridAMR is a concrete implementation of vtkCompositeDataSet. The dataset type is restricted to vtkUniformGrid. V.SafeDownCast(vtkObjectBase) -> vtkUniformGridAMR C++: static vtkUniformGridAMR *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkUniformGridAMR C++: vtkUniformGridAMR *NewInstance() V.Initialize() C++: void Initialize() override; V.Initialize(int, (int, ...)) C++: virtual void Initialize(int numLevels, const int *blocksPerLevel) Restore data object to initial V.SetGridDescription(int) C++: void SetGridDescription(int gridDescription) Set/Get the data description of this uniform grid instance, e.g. VTK_XYZ_GRID V.GetGridDescription() -> int C++: int GetGridDescription() Set/Get the data description of this uniform grid instance, e.g. VTK_XYZ_GRID V.GetTotalNumberOfBlocks() -> int C++: virtual unsigned int GetTotalNumberOfBlocks() Return the total number of blocks, including nullptr blocks V.GetNumberOfDataSets(int) -> int C++: unsigned int GetNumberOfDataSets(const unsigned int level) Returns the number of datasets at the given level, including null blocks V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) V.GetBounds() -> (float, ...) C++: const double *GetBounds() Retrieve the bounds of the AMR domain GetMinV.GetMin([float, float, float]) C++: void GetMin(double min[3]) Retrieve the bounds of the AMR domain GetMaxV.GetMax([float, float, float]) C++: void GetMax(double max[3]) Retrieve the bounds of the AMR domain V.SetDataSet(vtkCompositeDataIterator, vtkDataObject) C++: void SetDataSet(vtkCompositeDataIterator *iter, vtkDataObject *dataObj) override; V.SetDataSet(int, int, vtkUniformGrid) C++: virtual void SetDataSet(unsigned int level, unsigned int idx, vtkUniformGrid *grid) Unhiding superclass method. V.GetDataSet(vtkCompositeDataIterator) -> vtkDataObject C++: vtkDataObject *GetDataSet(vtkCompositeDataIterator *iter) override; V.GetDataSet(int, int) -> vtkUniformGrid C++: vtkUniformGrid *GetDataSet(unsigned int level, unsigned int idx) Return the data set pointed to by iter GetCompositeIndexV.GetCompositeIndex(int, int) -> int C++: int GetCompositeIndex(const unsigned int level, const unsigned int index) Retrieves the composite index associated with the data at the given (level,index) pair. GetLevelAndIndexV.GetLevelAndIndex(int, int, int) C++: void GetLevelAndIndex(const unsigned int compositeIdx, unsigned int &level, unsigned int &idx) Givenes the composite Idx (as set by SetCompositeIdx) this method returns the corresponding level and dataset index within the level. V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Override ShallowCopy/DeepCopy and CopyStructure V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Override ShallowCopy/DeepCopy and CopyStructure V.CopyStructure(vtkCompositeDataSet) C++: void CopyStructure(vtkCompositeDataSet *src) override; Override ShallowCopy/DeepCopy and CopyStructure V.GetData(vtkInformation) -> vtkUniformGridAMR C++: static vtkUniformGridAMR *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkUniformGridAMR C++: static vtkUniformGridAMR *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkCommonDataModelPython.vtkUniformGridAMRDataIteratorvtkUniformGridAMRDataIterator - subclass of vtkCompositeDataIterator with API to get current level and dataset index. Superclass: vtkCompositeDataIterator V.SafeDownCast(vtkObjectBase) -> vtkUniformGridAMRDataIterator C++: static vtkUniformGridAMRDataIterator *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkUniformGridAMRDataIterator C++: vtkUniformGridAMRDataIterator *NewInstance() V.GetCurrentMetaData() -> vtkInformation C++: vtkInformation *GetCurrentMetaData() override; Returns the meta-data associated with the current item. Note that this points to a single instance of vtkInformation object allocated by the iterator and will be changed as soon as GoToNextItem is called. GetCurrentLevelV.GetCurrentLevel() -> int C++: virtual unsigned int GetCurrentLevel() Returns the level for the current dataset. GetCurrentIndexV.GetCurrentIndex() -> int C++: virtual unsigned int GetCurrentIndex() Returns the dataset index for the current data object. Valid only if the current data is a leaf node i.e. no a composite dataset. vtkHyperOctreevtkHyperOctreeLightWeightCursorvtkCommonDataModelPython.vtkHyperOctreevtkHyperOctree - A dataset structured as a tree where each node has exactly 2^n children. Superclass: vtkDataSet An hyperoctree is a dataset where each node has either exactly 2^n children or no child at all if the node is a leaf. `n' is the dimension of the dataset (1 (binary tree), 2 (quadtree) or 3 (octree) ). The class name comes from the following paper: @ARTICLE{yau-srihari-1983, author={Mann-May Yau and Sargur N. Srihari}, title={A Hierarchical Data Structure for Multidimensional Digital Images}, journal={Communications of the ACM}, month={July}, year={1983}, volume={26}, number={7}, pages={504--515} } Each node is a cell. Attributes are associated with cells, not with points. The geometry is implicitly given by the size of the root node on each axis and position of the center and the orientation. (TODO: review center position and orientation). The geometry is then not limited to an hybercube but can have a rectangular shape. Attributes are associated with leaves. For LOD (Level-Of-Detail) purpose, attributes can be computed on none-leaf nodes by computing the average values from its children (which can be leaves or not). By construction, an hyperoctree is efficient in memory usage when the geometry is sparse. The LOD feature allows to cull quickly part of the dataset. A couple of filters can be applied on this dataset: contour, outline, geometry. * 3D case (octree) for each node, each child index (from 0 to 7) is encoded in the following orientation. It is easy to access each child as a cell of a grid. Note also that the binary representation is relevant, each bit code a side: bit 0 encodes -x side (0) or +x side (1) bit 1 encodes -y side (0) or +y side (1) bit 2 encodes -z side (0) or +z side (2) - the -z side first - 0: -y -x sides - 1: -y +x sides - 2: +y -x sides - 3: +y +x sides +y +-+-+ ^ |2|3| | +-+-+ O +z +-> +x |0|1| +-+-+ - then the +z side, in counter-clockwise - 4: -y -x sides - 5: -y +x sides - 6: +y -x sides - 7: +y +x sides +y +-+-+ ^ |6|7| | +-+-+ O +z +-> +x |4|5| +-+-+ The cases with fewer dimensions are consistent with the octree case: * Quadtree: in counter-clockwise - 0: -y -x edges - 1: -y +x edges - 2: +y -x edges - 3: +y +x edges +y +-+-+ ^ |2|3| | +-+-+ O+-> +x |0|1| +-+-+ * Binary tree: +0+1+ O+-> +x @warning It is not a spatial search object! If you looking for this kind of octree see vtkCellLocator instead. @sa vtkHyperOctreeAlgorithm V.SafeDownCast(vtkObjectBase) -> vtkHyperOctree C++: static vtkHyperOctree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperOctree C++: vtkHyperOctree *NewInstance() V.GetDimension() -> int C++: int GetDimension() Return the dimension of the tree (1D:binary tree(2 children), 2D:quadtree(4 children), 3D:octree (8 children)) \post valid_result: result>=1 && result<=3 V.SetDimension(int) C++: void SetDimension(int dim) Set the dimension of the tree with `dim'. See GetDimension() for details. \pre valid_dim: dim>=1 && dim<=3 \post dimension_is_set: GetDimension()==dim V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Return the number of cells in the dual grid. \post positive_result: result>=0 V.GetNumberOfLeaves() -> int C++: vtkIdType GetNumberOfLeaves() Get the number of leaves in the tree. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Return the number of points in the dual grid. \post positive_result: result>=0 GetMaxNumberOfPointsV.GetMaxNumberOfPoints(int) -> int C++: vtkIdType GetMaxNumberOfPoints(int level) Return the number of points corresponding to an hyperoctree starting at level `level' where all the leaves at at the last level. In this case, the hyperoctree is like a uniform grid. So this number is the number of points of the uniform grid. \pre positive_level: level>=0 && levelGetNumberOfLevels() \post definition: result==(2^(GetNumberOfLevels()-level-1)+1)^GetDimension() GetMaxNumberOfPointsOnBoundaryV.GetMaxNumberOfPointsOnBoundary(int) -> int C++: vtkIdType GetMaxNumberOfPointsOnBoundary(int level) Return the number of points corresponding to the boundary of an hyperoctree starting at level `level' where all the leaves at at the last level. In this case, the hyperoctree is like a uniform grid. So this number is the number of points of on the boundary of the uniform grid. For an octree, the boundary are the faces. For a quadtree, the boundary are the edges. \pre 2d_or_3d: this->GetDimension()==2 || this->GetDimension()==3 \pre positive_level: level>=0 && levelGetNumberOfLevels() \post min_result: result>=GetMaxNumberOfPoints(this->GetNumberOfLevels()-1) \post max_result: result<=GetMaxNumberOfPoints(level) GetMaxNumberOfCellsOnBoundaryV.GetMaxNumberOfCellsOnBoundary(int) -> int C++: vtkIdType GetMaxNumberOfCellsOnBoundary(int level) Return the number of cells corresponding to the boundary of a cell of level `level' where all the leaves at at the last level. \pre positive_level: level>=0 && levelGetNumberOfLevels() \post positive_result: result>=0 V.GetNumberOfLevels() -> int C++: vtkIdType GetNumberOfLevels() Return the number of levels. \post result_greater_or_equal_to_one: result>=1 V.SetSize(float, float, float) C++: void SetSize(double, double, double) V.SetSize((float, float, float)) C++: void SetSize(double a[3]) V.GetSize() -> (float, float, float) C++: double *GetSize() NewCellCursorV.NewCellCursor() -> vtkHyperOctreeCursor C++: vtkHyperOctreeCursor *NewCellCursor() Create a new cursor: an object that can traverse the cell of an hyperoctree. \post result_exists: result!=0 V.SubdivideLeaf(vtkHyperOctreeCursor) C++: void SubdivideLeaf(vtkHyperOctreeCursor *leaf) Subdivide node pointed by cursor, only if its a leaf. At the end, cursor points on the node that used to be leaf. \pre leaf_exists: leaf!=0 \pre is_a_leaf: leaf->CurrentIsLeaf() CollapseTerminalNodeV.CollapseTerminalNode(vtkHyperOctreeCursor) C++: void CollapseTerminalNode(vtkHyperOctreeCursor *node) Collapse a node for which all children are leaves. At the end, cursor points on the leaf that used to be a node. \pre node_exists: node!=0 \pre node_is_node: !node->CurrentIsLeaf() \pre children_are_leaves: node->CurrentIsTerminalNode() V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType id, double x[3]) override; Get point coordinates with ptId such that: 0 <= ptId < NumberOfPoints. THIS METHOD IS NOT THREAD SAFE. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) Get cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS NOT THREAD SAFE. V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) override; V.GetCellPoints(int, int, [int, ...]) C++: virtual void GetCellPoints(vtkIdType cellId, vtkIdType &npts, vtkIdType *&pts) Topological inquiry to get points defining cell. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; Topological inquiry to get cells using point. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; Topological inquiry to get all cells using list of points exclusive of cell specified (e.g., cellId). Note that the list consists of only cells that use ALL the points provided. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; Locate the closest point to the global coordinate x. Return the point id. If point id < 0; then no point found. (This may arise when point is outside of dataset.) THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; Locate cell based on global coordinate x and tolerance squared. If cell and cellId is non-nullptr, then search starts from this cell and looks at immediate neighbors. Returns cellId >= 0 if inside, < 0 otherwise. The parametric coordinates are provided in pcoords[3]. The interpolation weights are returned in weights[]. (The number of weights is equal to the number of points in the found cell). Tolerance is used to control how close the point is to be considered "in" the cell. THIS METHOD IS NOT THREAD SAFE. V.Initialize() C++: void Initialize() override; Restore data object to initial state, THIS METHOD IS NOT THREAD SAFE. V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Convenience method returns largest cell size in dataset. This is generally used to allocate memory for supporting data structures. This is the number of points of a cell. THIS METHOD IS THREAD SAFE GetPointsOnFaceV.GetPointsOnFace(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnFace(vtkHyperOctreeCursor *sibling, int face, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its face `face'. \pre sibling_exists: sibling!=0 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre sibling_3d: sibling->GetDimension()==3 \pre valid_face: face>=0 && face<6 \pre valid_level_not_leaf: level>=0 level<(this->GetNumberOfLevels()-1) GetPointsOnParentFacesV.GetPointsOnParentFaces([int, int, int], int, vtkHyperOctreeCursor, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentFaces(int faces[3], int level, vtkHyperOctreeCursor *cursor, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its faces `faces' at level `level' or deeper. \pre cursor_exists: cursor!=0 \pre cursor_3d: cursor->GetDimension()==3 \pre valid_level: level>=0 \pre boolean_faces: (faces[0]==0 || faces[0]==1) && (faces[1]==0 || faces[1]==1) && (faces[2]==0 || faces[2]==1) GetPointsOnEdgeV.GetPointsOnEdge(vtkHyperOctreeCursor, int, int, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnEdge(vtkHyperOctreeCursor *sibling, int level, int axis, int k, int j, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its edge `axis','k','j'. If axis==0, the edge is X-aligned and k gives the z coordinate and j the y-coordinate. If axis==1, the edge is Y-aligned and k gives the x coordinate and j the z coordinate. If axis==2, the edge is Z-aligned and k gives the y coordinate and j the x coordinate. \pre sibling_exists: sibling!=0 \pre sibling_3d: sibling->GetDimension()==3 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre valid_axis: axis>=0 && axis<3 \pre valid_k: k>=0 && k<=1 \pre valid_j: j>=0 && j<=1 \pre valid_level_not_leaf: level>=0 level<(this->Input->GetNumberOfLevels()-1) GetPointsOnParentEdgeV.GetPointsOnParentEdge(vtkHyperOctreeCursor, int, int, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentEdge(vtkHyperOctreeCursor *cursor, int level, int axis, int k, int j, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its edge `axis','k','j' at level `level' or deeper. If axis==0, the edge is X-aligned and k gives the z coordinate and j the y-coordinate. If axis==1, the edge is Y-aligned and k gives the x coordinate and j the z coordinate. If axis==2, the edge is Z-aligned and k gives the y coordinate and j the x coordinate. \pre cursor_exists: cursor!=0 \pre cursor_3d: cursor->GetDimension()==3 \pre valid_level: level>=0 \pre valid_range_axis: axis>=0 && axis<3 \pre valid_range_k: k>=0 && k<=1 \pre valid_range_j: j>=0 && j<=1 GetPointsOnEdge2DV.GetPointsOnEdge2D(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnEdge2D(vtkHyperOctreeCursor *sibling, int edge, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its edge `edge'. \pre sibling_exists: sibling!=0 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre sibling_2d: sibling->GetDimension()==2 \pre valid_edge: edge>=0 && edge<4 \pre valid_level_not_leaf: level>=0 level<(this->Input->GetNumberOfLevels()-1) GetPointsOnParentEdge2DV.GetPointsOnParentEdge2D(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentEdge2D(vtkHyperOctreeCursor *cursor, int edge, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its edge `edge' at level `level' or deeper. (edge=0 for -X, 1 for +X, 2 for -Y, 3 for +Y) \pre cursor_exists: cursor!=0 \pre cursor_2d: cursor->GetDimension()==2 \pre valid_level: level>=0 \pre valid_edge: edge>=0 && edge<4 GetLeafDataV.GetLeafData() -> vtkDataSetAttributes C++: vtkDataSetAttributes *GetLeafData() A generic way to set the leaf data attributes. This can be either point data for dual or cell data for normal grid. SetDualGridFlagV.SetDualGridFlag(int) C++: void SetDualGridFlag(int flag) Switch between returning leaves as cells, or the dual grid. GetDualGridFlagV.GetDualGridFlag() -> int C++: virtual int GetDualGridFlag() Switch between returning leaves as cells, or the dual grid. V.GetData(vtkInformation) -> vtkHyperOctree C++: static vtkHyperOctree *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkHyperOctree C++: static vtkHyperOctree *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. vtkHyperOctreeCursorvtkHyperOctreePointsGrabbervtkCommonDataModelPython.vtkHyperOctreeLightWeightCursorvtkHyperOctreeLightWeightCursor - no description provided. vtkHyperOctreeLightWeightCursor() vtkHyperOctreeLightWeightCursor( const &vtkHyperOctreeLightWeightCursor) V.Initialize(vtkHyperOctree) C++: void Initialize(vtkHyperOctree *tree) V.ToRoot() C++: void ToRoot() V.ToChild(int) C++: void ToChild(int child) GetIsLeafV.GetIsLeaf() -> int C++: unsigned short GetIsLeaf() GetLeafIndexV.GetLeafIndex() -> int C++: int GetLeafIndex() V.GetTree() -> vtkHyperOctree C++: vtkHyperOctree *GetTree() V.GetLevel() -> int C++: unsigned short GetLevel() @W vtkHyperOctreeLightWeightCursorVTK_OCTREE_CHILD_ZMIN_YMIN_XMINVTK_OCTREE_CHILD_ZMIN_YMIN_XMAXVTK_OCTREE_CHILD_ZMIN_YMAX_XMINVTK_OCTREE_CHILD_ZMIN_YMAX_XMAXVTK_OCTREE_CHILD_ZMAX_YMIN_XMINVTK_OCTREE_CHILD_ZMAX_YMIN_XMAXVTK_OCTREE_CHILD_ZMAX_YMAX_XMINVTK_OCTREE_CHILD_ZMAX_YMAX_XMAXVTK_QUADTREE_CHILD_SWVTK_QUADTREE_CHILD_SEVTK_QUADTREE_CHILD_NWVTK_QUADTREE_CHILD_NEVTK_BINARY_TREE_CHILD_LEFTVTK_BINARY_TREE_CHILD_RIGHTvtkCommonDataModelPython.vtkHyperOctreeCursorvtkHyperOctreeCursor - Objects that can traverse hyperoctree nodes. Superclass: vtkObject Objects that can traverse hyperoctree nodes. It is an abstract class. Cursors are created by the hyperoctree. @sa vtkDataObject vtkFieldData vtkHyperOctreeAlgorithm V.SafeDownCast(vtkObjectBase) -> vtkHyperOctreeCursor C++: static vtkHyperOctreeCursor *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperOctreeCursor C++: vtkHyperOctreeCursor *NewInstance() GetLeafIdV.GetLeafId() -> int C++: virtual int GetLeafId() Return the index of the current leaf in the data arrays. \pre is_leaf: CurrentIsLeaf() CurrentIsLeafV.CurrentIsLeaf() -> int C++: virtual int CurrentIsLeaf() Is the node pointed by the cursor a leaf? CurrentIsRootV.CurrentIsRoot() -> int C++: virtual int CurrentIsRoot() Is the node pointed by the cursor the root? V.GetCurrentLevel() -> int C++: virtual int GetCurrentLevel() Return the level of the node pointed by the cursor. \post positive_result: result>=0 V.GetChildIndex() -> int C++: virtual int GetChildIndex() Return the child number of the current node relative to its parent. \pre not_root: !CurrentIsRoot(). \post valid_range: result>=0 && result int C++: virtual int CurrentIsTerminalNode() V.ToRoot() C++: virtual void ToRoot() Move the cursor the root node. \pre can be root \post is_root: CurrentIsRoot() V.ToParent() C++: virtual void ToParent() Move the cursor to the parent of the current node. \pre not_root: !CurrentIsRoot() V.ToChild(int) C++: virtual void ToChild(int child) Move the cursor to child `child' of the current node. \pre not_leaf: !CurrentIsLeaf() \pre valid_child: child>=0 && childGetNumberOfChildren() ToSameNodeV.ToSameNode(vtkHyperOctreeCursor) C++: virtual void ToSameNode(vtkHyperOctreeCursor *other) Move the cursor to the same node pointed by `other'. \pre other_exists: other!=0 \pre same_hyperoctree: this->SameTree(other); \post equal: this->IsEqual(other) V.IsEqual(vtkHyperOctreeCursor) -> int C++: virtual int IsEqual(vtkHyperOctreeCursor *other) Is `this' equal to `other'? \pre other_exists: other!=0 \pre same_hyperoctree: this->SameTree(other); V.Clone() -> vtkHyperOctreeCursor C++: virtual vtkHyperOctreeCursor *Clone() Create a copy of `this'. \post results_exists:result!=0 \post same_tree: result->SameTree(this) V.SameTree(vtkHyperOctreeCursor) -> int C++: virtual int SameTree(vtkHyperOctreeCursor *other) Are `this' and `other' pointing on the same hyperoctree? \pre other_exists: other!=0 V.GetIndex(int) -> int C++: virtual int GetIndex(int d) Return the index in dimension `d', as if the node was a cell of a uniform grid of 1<=0 && d=0 && result<(1< int C++: virtual int GetNumberOfChildren() Return the number of children for each node of the tree. \post positive_number: result>0 MoveToNodeV.MoveToNode([int, ...], int) C++: virtual void MoveToNode(int *indices, int level) Move to the node described by its indices in each dimension and at a given level. If there is actually a node or a leaf at this location, Found() returns true. Otherwise, Found() returns false and the cursor moves to the closest parent of the query. It can be the root in the worst case. \pre indices_exists: indices!=0 \pre valid_size: sizeof(indices)==GetDimension() \pre valid_level: level>=0 FoundV.Found() -> int C++: virtual int Found() Did the last call to MoveToNode succeed? vtkCommonDataModelPython.vtkHyperOctreePointsGrabbervtkHyperOctreePointsGrabber - An object used by filters to store points computed on face or edge of an hyperoctant. Superclass: vtkObject It is an abstract class. vtkClipHyperOctree and vtkHyperOctreeCutter use vtkHyperOctreeClipCutPointsGrabber vtkHyperOctreeContourFilter use an internal one: vtkHyperOctreeContourFilterPointsGrabber. @sa vtkHyperOctree, vtkHyperOctreeClipCutPointsGrabber, vtkClipHyperOctree, vtkHyperOctreeCutter V.SafeDownCast(vtkObjectBase) -> vtkHyperOctreePointsGrabber C++: static vtkHyperOctreePointsGrabber *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkHyperOctreePointsGrabber C++: vtkHyperOctreePointsGrabber *NewInstance() V.GetDimension() -> int C++: int GetDimension() Return the dimension of the hyperoctree. \post valid_result: (result==2 || result==3) V.SetDimension(int) C++: virtual void SetDimension(int dim) Set the dimension of the hyperoctree. \pre valid_dim: (dim==2 || dim==3) \post is_set: GetDimension()==dim V.InitPointInsertion() C++: virtual void InitPointInsertion() Initialize the points insertion scheme. Actually, it is just a trick to initialize the IdSet from the filter. The IdSet class cannot be shared with the filter because it is a Pimpl. It is used by clip,cut and contour filters to build the points that lie on an hyperoctant. \pre only_in_3d: GetDimension()==3 V.InsertPoint(int, [float, float, float], [float, float, float], [int, int, int]) C++: virtual void InsertPoint(vtkIdType ptId, double pt[3], double pcoords[3], int ijk[3]) Insert a point, assuming the point is unique and does not require a locator. Tt does not mean it does not use a locator. It just mean that some implementation may skip the use of a locator. InsertPointWithMergeV.InsertPointWithMerge(int, [float, float, float], [float, float, float], [int, int, int]) C++: virtual void InsertPointWithMerge(vtkIdType ptId, double pt[3], double pcoords[3], int ijk[3]) Insert a point using a locator. InsertPoint2DV.InsertPoint2D([float, float, float], [int, int, int]) C++: virtual void InsertPoint2D(double pt[3], int ijk[3]) Insert a point in the quadtree case. real_initvtkCommonDataModelPythoncan't get dictionary for module vtkCommonDataModelPythonvtkCommonDataModelPythonx*    P(ho  4'"q              /vqm ^^ if ^^ jc1   1   $   t ^   $   t ^   $   t ^   $   t ^   s / // // /. .. .- -- -- "-,a ' '' '' '& && && &% %%8a'  P     oh"x  h Kz8KK(#b?(= &)@    LS(@MSo$   t ^   iY*    PxSS$   t ^   $   t ^   ||cjo  YI  ' T  P''*$   t ^   m  P^m^^v?m) ESSSSo$   t ^   o#A   P^$    h1   1   1   1   "Bv   f*YY  4'" ^^ if%NShG?BB$   t ^   BB$   t ^   #~> T> T  PH        .   xM||cj*    yPv(bo@)Q    }u:oooSfSfSfSfD"c  z Koo($GM#D#$   K#9   K(@JMvMM$   t ^   >$   t ^   >>WWAKvvSrr   } [[ r il [[ r il!ii  rw!ii  rw!ii  rw!ii  rw*     ii  ii  *     *     $   t ^   >SS0K$   t ^   v || H8vvSPPwK$   t ^   mmMv || H8vvSPPwK$   t ^   >>WWAKPPbK$   t ^   *   P^^(ko#9   Kvoo#  y K>MBB$   t ^   vYY$   t ^   "Bv  nmmMll   q$S>> T>>>(9jE#w"9kKYsEYhE$   t ^   )bPn  ^(E  ^ K#b   P  P  P$   w^SS$   t ^   o"skK$   t ^   $   t ^   BB$   t ^   $   t ^   $   t ^   $   t ^   $   t ^   $   t ^   $   t ^  P  P$   w   $   t ^   $   t ^   $   t ^   $   t ^   $   t ^   GZ  f~ Q> T  P||cj1   1   ^*    Px(honnm(gNM||cj,$8$_FgJBB$   t ^   $   t ^   ^$   t ^   ppM$   t ^   > T  PMB  m  qs&SZQS#YYsEG6  @[muuYxxYX    (Bm   asY$   t ^   BB$   t ^   BB$   t ^   u?yKoKoK|S|S|S|S=SfcSfH  RgS(9   r PSf(9PSgS&;bB&SZQS> T MMUIM???UUUUUU?UUUUUU?UUUUUU??-C6?h㈵>@V@NSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEENSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEE?9~???؉؉?؉؉?؉؉???@@@F]kSU?F]kSU?F]kSU?9~9~999~9 DHa!XQXaQ !Q Q, 0o "02l @ 00,@H,px,,,, ,` ,@x , ,Pc ,l , , 8 ,`P ,t ,P , , , ,0 ,.< ,7d ,@=| , , , ,0 , ,P, ,`H ,` ,x , , , , ,0+D,`6\,>,0M,P[,_,t,0,4,L,@d,P|,, %,@0,4, F,pN8,TP,t,,4,=,i,s,,0H,P\,, ,@;,`?,pP,@_ ,g$,`k<,T,@p,,,`,,p,@,@,X,|,,,D,K,PV,u,,}d,P,, ,@4,pL,d,|,,, , ,,$,P'<,G`,`Ix,R,0[,e,,,0 X,0; ,I ,W ,[ (,| @,@ T,H ,@P ,_ ,Pg , (, @,P d, |, , , , ,0 , , (,` @,2 l,7 ,= ,E ,N ,T (,@W @,x X, , ,P , , , ,@ 0,P H, l, ,` , , ,` , ,p (,  L, p, , , , ,@ @, `,$ ,* ,`F ,N ,] ,j D,Pn \,t t,`y , ,` ,p ,@  , , , D ,@ \ , , , ,p , , !,p ,!, D!,0 \!,p t!, !, !, !, !, ' ",p3 0",7 H",0? `",B |",@G ",H ",V ",_ #,@e #,z <#,Я l#, #,(#,06#,@#,pK$,P $,a8$,g`$,k|$,$, $,$,P$,%,` (%,@%,X%,P6p%,>%,J%,\%,~%,&,(&,H&,l&, &,>&,B&, F',d ',hL',ul',',',P', ',p',$(,<(,`(,@(,(,(,(, ),<),X),),@),),)), 2),<*,G,*,LD*,Q\*,p\t*,k*,s*,p~*,+,Ы(+,P@+,Pd+,|+,+,`+,+,+,P ,,8,,;\,,C,,0J,,po,,w,,~-,`$-,L-,d-,-,-, -,"-,*.,04,.,=D.,PE`.,J|.,pU.,k.,t.,Pz/,,/,PT/,l/, /,p/,/, /, )0,`/40,XX0, a0,`g0,0,1,L1,h1,T|1,P]1,0{1,P2,е42,L2,"x2,A2,V2,p2,p2, 3,,3, L3,d3,|3,3,`3,3,4,P! 4,VD4,ps\4,{4,@4,4,4,P4,5,@85,p|5,5,5,!6, '86,*P6, <l6,E6,K6, O6,PY6,`cT7,{l7,`7,P7,7, 7,08,(8,@8,@d8,|8,8,P8,8,@M8,P9,PT09,WL9,P[h9,\|9,^9,p_9,m9,Pz9, 9,]9,e:,~,:,@:,0l:,p:,:,:,:,;,@\;,'p;, hPP  `  ````+5@9;@BC DDEF`HO TT0UUpVW0YZ\\@]]^_0ee`kpr0tpx{P`PP0p@PpP0 ЦPPЭ`P PдP`P Pp``pPP@00Pp0 @0@  `#P$$%'(/p19>@0GH0JpN@TP[\\]`^_Pagj`rwxЂpp` p Pp pp`0`  , -@..0/0@2203346`78; <?NR0SSTUV@ZZ [[ ]^``af`hjkk@lPmop@q rs@vw0z p0P  ЕИ@pФЮв 0` 00p0@@` `0p0P  p  P (() 03069::;0<@=>ABC D 0@@@   `p` PP0`#@$' (()*/2055 67@8: <=p>?PA BBC0HPU[0bpe f`jnooppq`st@vy|Pp0PPЫб@00@00P`p` p @pP@P0`pP0p  P @P ))`)0*`+p.000P23 5`6709:<=>`@A0CpDDGJJPLPpQ@STVWY0[]p^@`acdjln@qs@wpxy}`` p@`@PЩ0о0Pp`PP0` pP`p 0p`@@@0 0&& ''(* ..58;0??p@AC@FFGGJ RTVW_@``abPhj lmmn@o qPt@uz|}PP0p P`@@P0@`P P0 @0P@P@@0P p    `::p;;P<=>APCDPDDEFPHLMPNOPpQTUUpVWZZ[^@_`hill0nn oopr0yyzppP0P0``@Л`@p 0p0P@@0@ @p   @`   `  p `P!P&&0)**p+ ,0-./p0P122330445556p789:@<<0=>P?ABD`JRW0]`d0ef`inwy`yyz|}@`0@в@Pо `p@` pp@ `0`@P0`@0P@P +, ..P123 4p88:`::;<P? AABH L OpR STPUUVXYP[ _aceqvwxypz0{{}`pЍ@pp`@@ @ p@pp@p @p`0`` 0  @"#%&''p(@)p*`/203406@899 ::;<ACF@H`JJPK LPMS VVWXZP[[@\]@^0cPfghPijk`llPmnorx@y}` pЉЋ0Х0@ @@0pP`@ @`P0PPp``P0  @@"&).P00@12@3`6@7780:;;<`=P>??CpEEHIL@PPpTU@VZZ]0`aab`cgghlqrwzp{Ёp0 p@Ж`У P` ` '(+ -`1556p:0<< =>@?@PFGHQ0VZ `Pg hkplptw0x{p 0p0 `@p`д0P``p0pp p00 `p@ 0 P  ` P` 0!P&*@0p7@8;P?CDH`I `LpMMOPpRpU VWpX0YZ@c`hlPryPz p}@@ `Е О @@P@00` @@  `@ @!! ""#%p& '(()*+-.345566p66779`9p::<p<==>p@@DI`IJK`M0OP QQRS0UV@WpY0ZZ]0__`a@cdPeg@hhk@mmnoPq0rsPs tpt@uvpyz0Ё`Џ@pP PP` 0pP@@P`@ `p` P  pP  "#$$@%P&((p,../002255 79@<<>>>@AABCpEFpHN W@\ahi kmrPz{{|P}~p@` `p0` @`P`@0 ppp@` `0  P     PPp!!`"0#`$&&'0(( )) + 0`2p405@7HJV`VVWX]aapb cfhPijkkplm`o`st@xy{p{|| ~p`p0Кp`@ ` л@@PP0P`P Pp`  0PP0 p @ `0@p #p&( *`+.0011p23369P=> AC0DDEFpHIPKN@S[`dfmpnsPw|`PP P p P@ ``@p  ``@ p @p p@p` #$P%%&')P*`,/P4<A GPNO`PPPQ0RpS UV X^`0iPnsz{0}0p@p `pЖ @а P p Pp00@ @ @")* ++,-/1p2508@EFMNPVP[@aa@bbcdfm`ow|}  0`Ф@PP@p`   @p p 0  P Pp# -`..P/00p1 3`56p9; D@I`JQ`RTPZ_pff`g@hi0kqs@|`00 @0@0`0`0 0@0`0 `  @ p  @  0   ! " $ P% . 1 p2  3 3 4 4 6 ; @= @ pA A `B @C D 0F G `J  P R PT _ 0e h h `k 0m m n q s t pu Pv w w x { @| ~  P     p 0 p  `  P  p` p@ p  0 @ P !"p$P%&&@(**0+,, --./p39<p<==?`AFFpGPIKKpL@MpNPpQ Zb@ccde`iiPj kPl@qpt0u@wx p||P}~p`0ЈPЎ@P `0@p`` @pP p0@Pp`  P"#`&)*+- /3@69`:P;`<==0BFI@JP@RSTUVPWWXY[P\]`]p^`_aa`bb`dejlnoqr@s`tvPwxy|p}}`~0`P0ІЈ@@P@0 @pЧ`й0`00@ 0PP00@00  0  P%&(,P9BH@LSSW0aabcpefPhk@px}@P P@ `pМ @``й0p`@0P`P@`@@0pp`0P0!P##`'*P. 135P5P7888AApBEG`HK`OOPQ`S V0`c`dePefgg`hilmm`no@qrtuw0P @ PPp 0pp@Pp0PP@ `p @   @@P&'( ), - ..1235P78@==A@BCCD0EJpM QT XYZ@\]]^0_@`ab`cdffggik`rs v w`x}p0@0 0@0@``Щ `P0@0Ppp PP` P P P `0`p 0 0 0  0Pp!@"p#P$`$%( )P*0+@++/ 1`2P3`347@9:p;; <=p?@ABBD0EHIJJKL@PpQPR`RSTW YZZP[\bdde@fpgmnooq0r@xypzz{p|} 0 PPЏ@PЕКЛ `@@@ `P`p  `00 0p`P@P@Ppp`pP p0  p ``%0'', 001129:;@pCCDD0FFGGHpI`JpJKL`MMNOpQ0RpRSTUU`VVWpZ[^pb`gghh ijl0qqrupvv`wx yz||p}@0@0`PPP`0 жиp@`P@pPPp0P0`` @     p 0p`p!!@#$'((`)* +p-0..P6`= ,,,,p[`` Ф @ SPp(4=pp,@p,@Ьȁ,8,`,,p;,,``@><,5:#;:#H:#kG((vG(}G(G(G(G(G(G( G( * **&*/*=*J*]*i*s* |* * * * *******$1*E*^*r****** *!3*"L*#[*)p***3*4*5*6*7*8*<.*=H*>^*?w*@*A*B*C*D*E *F$*G=*HU*Ih*J}*K&0:DNXblvƄЄڄ\fpz  *4>HR6@&0:DNXblvƅЅڅ  *4>HR\fpzʆԆކ$.8BLV`jt~ć·؇ (2<FPZdnxȈ҈܈JT",6@JT^hr|‰̉։&0:DNXblvƊЊڊ  *4>HR\fpzʋԋދ$.8BLV`jt~ČΌ، (2<FPZdnxȍҍ܍",6@JT^hr|Ž̎֎&0:DNXblvƏЏڏ  *4>HR\fpzʐԐސ$.8BLV`jt~đΑؑ (2<FPZdnxȒҒܒ",6@JT^hr|“̓֓&0:DNXblvƔДڔ  *4>HR\fpzʕԕޕ$.8BLV`jt~ĖΖؖ (2<FPZdnxȗҗܗ",^h6@JT^hr|˜̘֘&0:DNXblvƙЙڙ  *4>HR\fpzʚԚޚr$.8BLV`jt~ěΛ؛ (2<$.8BLV`jt~ (2<FPZdnx"FPZdnxȜҜܜ",6@JT^hr|̝֝&0:DNXblvƞОڞ  *4>HR\fpzʟԟޟ$.8BLV`jt~ĠΠؠ (2<FPZdnxȡҡܡ",6@JT^hr|¢̢֢&0:DNXblvƣУڣ  *4>HR\fpzʤԤޤ$.8BLV`jt~ĥΥإ (2<FPZdnxȦҦܦ",6@JT^hr|§̧֧&0:DNXblvƨШڨ  *4>HR\fpzʩԩީ$.8BLV`jt~ĪΪت (2<FPZdnxȫҫܫ",6@JT^hr|¬̬֬&0:DNXblvƭЭڭ  *4>HR\fpzʮԮޮ$.8BLV`jt~įίد| (2<FPZdnx,ȰҰܰ",6@JT^hr|±ֱ̱&0:DNXblvƲвڲ  *4>HR\fpzʳԳ޳$.8BLV`jt~Ĵδش (2<FPZdnxȵҵܵ",6@JT^hr|¶̶ֶ&0:DNXblvƷзڷ  *4>HR\fpzʸԸ޸$.8BLV`jt~Ĺιع (2<FPZdnxȺҺܺ",6@JT^hr|»ֻ̻&0:DNXblvƼмڼ  *4>HR\fpzʽԽ޽$.8BLV`jt~ľξؾ (2<FPZdnxȿҿܿ",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv  *4>HR\fpz$.8BLV`jt~ (2<FPZdnx",6@JT^hr|&0:DNXblv&0:DNXblvHDkpt Q0^xHDk@tQ@q8X`Xk- `@        ` 0Bhz`xq`p!p!&0& (м(*@ *++0-HDa-k@tQ@//00!b233]6@t68p8<9O9':HDZ:kP;<Q=$>>> ???@?@ @U@]@@(P@BCDCpSCC0CEPEFFGG}HHTI`IIPIJJJ@JK$KKKhMtMON0nNPPPdP`lPPPPP2Qp9QQ QR)RS S-T hi`'iLk(Xkl(lm)mn`*no +oHp+Vppp,pq-q/r-4r{rP.rr0/r.s/?ss0spt`1yttHDuk2;3<Q4sv5v#w60ww@7wWx 8_xy`8yy8zz@9zg{9r{{ :{|:|+};0}>p;}~ <$~~=~=`?!>!1HDk@;A<QBCނDpED FX5GI"G9PHņFITIЇ>JF~0K~L]WxL 0MMN!M!1HDk0P;Q<Q0RERWxS TrT~ΐpU]VfّVxW~PX~0YZ!Z!1sHDk\]rQ^ޖp_p`%0aܙƛaܛ]bsFPc^låHDku;v<Qwxaym@z { {p|@} |~fw\ m@``t` 10HDkp;P<Q@a@m !@J|fw\Pmp`t1P?0=HD)k;<Q0`am`  !Q|@fw\m0``t0`1  F@p@ 0 = CHDsk0";#<QP$%a&m&' @(!(Q)J|*P,f.w\7m <@=`pDt@EpG1K0MNPSpVTHDtk[;[<Q]]/f^wbT@d\ f'hpj"l,8n. s  t w `{HDk~;<Q'fqpYclv@Wxб>~> ~ @!!1!HD!k;p<Q:#0#$0 $n$v$8$^%q%%%&p&'0(**,`,r..[0p00 1n11@1P2!2HDD2k;<Q3`3<4`J455y7;T<f<k==>>?p?k ;<QC)DlDuD>DF KEEErFFVHpdH&I2IJJ>Kp]K[LcLdMsMOOO@OuPPFQ[Q"R7RRR:S FST T9U DUU UVV~`XWx mYYY$Zp,ZhZ|Z:\`F\T\|\HD\k`;<Q _^`> `~@%a~ &ba'Yc'c*d`(3dd ) ee)ef*fh0+hVhp._hh@/h i/ip0i  1i[j1gjj`2j03Lk3k|4rCktFx H8} L90M؂80TPVV6PXUYc`ZP[ǎ_ߏHDkd;e<QfnpgՒHHDqkPi;j<Qk2kVHl1pm> nan5o p[jphqVh0r[Lr3 isC PtGHDmk@xyTQ@zzx{lDp})>`~Ϫ*~44D@) 5î+:$ZY+hZ ~,HDkptPQ͸@[ù@ݹ_yź#!0<9B*0& (P-+p л w0k;<QslDdM>PRbPfw_na` $Z ,ZYqhZ@~b(P*d``dHDk;<QHxH@mxhZWx>~~`a i@4`S!!12HDdk;<Q3ppmPVH` pE XRd`I[0HD3k;<Qf#1:,=4HD_k@; <Q`~  > O <4 5@S `ta dP H>  p t @  O  fP>\$K! %"|P,5#.q$U/%@0%4&'HD'k9;:<Q;w*<*a= @>#+?+ ?,`@,0A -|B-CL.f FH0\pN1S{2T43`['4\ ^4P`6a]7f8g9pi:k;<HD<ko;o<Qq?qL@fr@uBB0xB)C y3CCyC&D{0DrD|zDE~E#FHDSFkP; <QPF@GG#HHHDHkP; <QPI7JJJKK|KpKM N NN NHDNkЖ;<QQ@ RQR@`RRSЛS>WTT@TUНU V#VVVWWRX@kXY*YYYx@LZg[u[hZ\]`]^0^_`aagcpcYd0ld[frf+i0Hijjkpk~ l~(mmmoo@pNprrt*tcu`wuv09v5wRwRx`axxдx;y@Lyyy4z Fzzz@{V{{p{o|~||P|}}}~0!~~~;L8M`؀Pлk@z lyRpYÄ'P4Wx00!p!1FHDrk;`<Qp . }7P!!HDFkp;P<Q@F@Vwmam~`hZ@>~~a ipWx ə !`!1HDJk;p<Q+PP ~`E٠p @Rp٫ լ̭ޭpͮ 8 z   ;HDik;P<Q90>0~~pӺPVgмpۼp r@},7@PHY |6C 0 = ~  P Ydy2Egtepr 1=-*p;PP@_ JYd`r   M`!\"?#N#$9P%H@&S 'a'()`*N +_+R,e-"`.5u/0014F4YH6Q 8@9`;0=`A;BKC D `ET\0F G H  HD? kJ;J<QL# L JM KNR  0O |KO) mP 0 b HD kS;T<QU `V `W= L 0X[ iY% FY X pZa ~ ] [L]%  0` a0b  b  c  d   e  f *iz ! s! y2$ $ `z$ e% zr% $Z{& x& 0|& 8| ' &D>( ) ) >) W* pf* T`, hZ- xЅt/ ~~pa/ P/ v1 1 Wx<3 rPP4 cu 5 P6 a6 6 6 V7 0g7 &8 88 8  9 9 0: : : -; `?; &< @< < < 0!p!1> HDD> k;0<Q {B ИB xЙXC WxC !`!1E HD9E k;<QTG pG xpXC Wx0H .I p?I !P!16J HDiJ k;0<Q@RL L 7M FM M M zN PN !O .O O O P P mQ yQ S @S S S U `U W HDW k;p<QY 0YZ ?0Z Z Z @3[ [ `[ U@]@\ HD\ k;@<QP_ _ >7` ` ` c  d f `f "h 05h hi zi j VHKk k k Y0l ]m bm tm HDm k;<Qmn n a P#++ ,`,0 -|-o  q fPw\mr  u HD1v k@;<Qw zx x x >pTy { @{ Jn{ | | 7~ `U~ ̀ 0 - K i |   Չ  0 |  # HDI k ; <Q ϙ P 8 >P { lD  P _ ΐ`  1 ]֠  . 07 ʥ   ! -  u P ~ ~`: $Z@ Y( hZ`       1 P!  !& " #ù $Ϻ P% @&T\'T\' (T\@)  HD k*;+<Q,b `- 2 `.8 / [ /c - p0: 1 y 1 6 p2H < @3U 4 4 i5 @6 07 g 7x ~ 8! `9 p: W @;j  p> f`? \D F  G Ip pLC pP 8T PW X? pY `Zr [ H!]Y!!^(![j@_!!pb!d !y !`e !0 f !g!`k!!HDF!kp!`q!Qpr! s!! t! tV!!`u:!$!v=!hZv!!@w&!ew!!x!!`y !J!z^!!z!!{!YP|!~|b!~} !`~!!^"! q"!S#!f#!Yd$!2&!pU&!'! 7'! (!(!)!@,)!*!p+!-!HD2-!k;0<Q@/!0!p0!x0! 1!2!2![ @X3!4!4!J6!hZP6!7!7!\9!g9!9!`9!=!=!~P?!~ @!>A!XA!pvA!`A!A!A!A!HDB!k`;0<Q`C!dD!D!D!vE!аE!~GF!~pF!aP #+*d9G!d`G!>+H!fH!hp3I!VhI!+ 0,+J!J!|-f@H0\1L.)K!@L!{243LN!`0'4UN!hO!&JP!0VP!Q!Q!R!-R!gR! R!R!R! S!`S!]S!sS!S!S!T!@)T!eT!xT!T!T!T!  U!CU!VU!U!`U!U!U!3V!HV!V!@V!V! W!SW!kW!W! W!X!.X!vX!`X!X!X!py!z!@ z!z!z!k{!z{!{!|! }!HD8}!k! !Q!!p"! ip#!F $Ç!%̈! %!~ & !y!'!!(! `) !* !x& +!8P,!&D.8! ) 0A!@p1Җ!!3!!3!hZ4י!x`5t/ !6!Wx6}!7!7!1Ŝ!HD!k@9!9!Q;K!;!c <[!!?!9!?C!A!@]!$!ABǤ! PC!2!CH!!D!!I!!K!/!0O;!!O!L!PV!K! QV!q!HD!kR;pS<QT!PU!!PV !!p\˲!!P](!!]!=!^U!Y!_d!!`! !`a!W! bb!!b!!c !Z!0dn!S! ea!B!eQ!s!f!!HD¼!k`hhd!id!Q j]!j !f!kf!f!lf!@0m!!m !2 p!!HD!kq@rrQPs!t!Fuf!}L!,!;!!P!S!m!Z!HD!k`0rQ`!q!! !!Ў !!!FPt!!`!l!!(! ]!(! 0+!=!( d!0@!!(0;!@`!!HD!k ;<Q T"н""о"z " "x0XC > "X N "h "D!@ "x& "8""Z"f""""""`"" ":"F":"D"c"w""" ""0"""""""" "~08!"~!"""9#"L#"!$"1$"$Z$"Wx@>%"8&"K&"'"P'"("("*"*"t,"p,"<4-"."."I/"pV/"/"@/"h0"u0"1"p1"3"3"3"p3"4"04"5"5"rP4 cu6"~7"p7"7"7"9"9":"&:"!P!1;"HD6;"k;@<QPZ<"<"="="g="q="="="$>"p.>">" >"2 >"@?"(p?"?" @"HD8@"k;<Q@"`qA"A"HDA"kP;0<Qp D" LE"<4  5 E"a  #++ `, +J!J!|-fw\m!r 0&P'`.tP/)F"0F"3H"8I"<K"0A=BM"HD'M"kD;D<Q0FtO"FO"<4G 5`IE"aJ K+ `L, M+J!MJ!|N-PL.fRw\0[mP`r de`ltm$P"o0Q"sR"vS"0{FU"{ V"V"HD3W"k|;}<QW"=X"X"HDY"k;`<QpY" [Z" Z"xHWxІ]["`!!1\"HD\"kЉ;<Qi"@j">@Ej"j"j""/k"GPk",l">l"l"l"- `.m"m"m" n")n"n" n"do"`so"tp"0p"'q" ;q"!r"+r"r"0r"hZs"t"t"nu"pu"@v"PXv"$w"p*w"@w"HDlw"k ;П<Qy"!z"pz"xz"z"`z"p{"|{"{"{"G|"pN|"|" |"5}"ЦC}"~"#~"~"0~""#""""p"S @"k"t"m"$"- p׃"d"HD"<"C"""""q"`w"kа;<Q׉"H"xXC P"5"0A""!"g"u"c"}"k""n""R"0g"6"нC"- ""0 "" """l"`w""""~",l"P"Fl" i"j"P]"'"p7""0Ę"H"X"ՙ""i"Py""""""#""0""2"ŝ"ڝ"l"`|""P"g"v"ן""J"pb""` ""P"?"@Z""0"!r"`"""'":"""""r""X `"[L"au" " p" `" u"*">2"z""pz"p;"T@"~"~j"m"hZp- m"0J"""""?"@L"C"d"T"p u"b" {"Wx " ! !1"HD"k ; <Q " "S  q">p ""` "$"@ ,"pz" "z" *"p{" ""0 *"{" "G|" "|"@ j"5}" "~" "~"P 1"" "" v"" "k"p c"m"@ )"-  "\" f"Jp "8@ "X  `"" ,""@ "&" 7""HD"k ; <Q " "" z"# "x$ XC Fp% Y" i & "X ' {"[L@) {" + " - "*0 "! 0; "a@ v" A  " B "x& C m"TD ">PE 2"CF q"EG E"[I " "P ""Q "i"S z""T ""0V "I"W ]"8#[ L##] ##@` ##a ##0#b A#N# d \###e 1# #k  #k#o #9#p J##`s #J#t f##u 8##v ##x #C#y S#o| ]#hZ} - P#~ [## #A# K#\" # #` .## #6#Ѕ D##` # #0 )#%#Ї A## #]0  #^ !#k "#~ ~ a##` ##%# *%#J&# ]&#@'#@ V'#m (#WxК -)# M*#p S*#` !P ! ! !1+# +#HD,#k0 ; <Q0 /# 40#f 0# ,2#` 2#V3# b3#3# 3#4# 4#75#0 H5#5# 5#H6#в a6#6# 6#T7#@ l7#7# 7#k8# 8#8# 9#9# 9#x:#HD:#k ;` <Q H>#@ >#@  ?#f ?#@ 5A# A#m` cB#B# B#~C# C#D# D#D# D#=E#HDtE#k ;P <Q sF#0 G#J0 hG#K G#UH#HDH#k ;0 <Q@ N# 9O# O#1P# ?P#Q#0 R#S# S#wU# U#f ;V#0 aX#@ Y# $w"Y#HD!Z#k@ ; <Q@ \# \#f F]#0 ^#Bp __#)C` _#C C&D0 0D`#  `#`# `#a#HDHa#k Wg#` g#Q ^h#@ i#f@ i# Bk#{r k#r l#Ym#P vm#zn#0 n#o# o#p# p#q#P q#\r#` fr#  s#s#HDs#k ; <Q Zu# u#f v# w# 2#V3# x#y#  y#z# z#z# z#O|#` d|#}# }#<# Q#À#HD#kp ;@ <Qp Ʉ#  <#  #f ^#   ##` #1#@ ;#B# #~C#! 3#D#" D#D#$ D#ˊ#HD#k`& ;0' <Q`( O#) ׍#f* 4#P- #y#/ ###p0 7#̑# 1 ۑ#l#2 {#N#p3 ^##5 #5 2##HD*#kp7 ; 8 <Q09 1#9 # i: ##; ##@< .#"< #8> l#R#? _##@ ##@A  ##B #{"B ^#5}"`C ##D ##E ##F #!H #J#K f#ѭ#L #Q#O n#f#@P #9#HDs#kT tU QU B#V ##W ##X  #n#`Y ## Z #R#Z f##[  ##`\ #.# ] B##] #>^ #0_ #8_ ]# id ##d #we #f |#Pg C#!o 5#p#Pq #]6r ##s #3u #"h Pv l##0x #hi z m#!p{ #4| ##} ##HDB#k@ t Q` T# ## #"h  ## ##hi #!@ #4` +##HD#kP ; <Q # (#> > ? ??@ ?@ u#[ [ U@@ ]@k ;p <Q #0 #$0 $q$ x$'$ ,$$ $$@ $$ $$ $~ ^$~ $$ $$С $ $HD $k ;@ <Q0  $ K$=" $=" #$g="` $$>" $f$ q$.$ 9$$0 $$ $]$ s$$p $$P $c$ w$$ %$$p $_$p {$$ -$$ $]$ v$$0 $ $з  $f"$ }"$c#$ z#$[$$P k$$$$ %$&$ 9&$N'$ j'$!($ =($($0  )$)$ )$|*$ *$+$P +$,$ ,$,$HD,$kp ; <Q0 .$ r.$.$ .$S/$ Z/$/$p 0$0$0 1$ i 1$"  2$8 q3$#4$ 14$5$P 5$R# 6$#@ #7$ 7$ 8$ -8$#` 8$# 9$9$ 9$:$ :$>;$ D;$;$ ;$<$ <$>$` >$y?$ ?$@$ @$eB$ sB$# B$OC$@ WC$C$ C$:D$ CD$D$` D$.E$ 4E$E$ E$' F$* ~G$H$ H$, J$M$ )M$# N$ѭ#0 O$J# Q$S$ %S$S$ S$"T$HDET$k` t0 Q` -Z$ Z$[$ [$i[$ s[$[$ [$.\$` 8\$\$ \$]$ #]$]$ ]$^$P ^$<_$0 U_$d`$ }`$`$ `$b$ b$n$p _b$$ c$c$ d$d$p d$e$ "e$e$ e$'f$ :f$f$ f$;g$@ Ng$ g$! j$j$ j$k$ k$l$ l$m  l$m$P m$Yn$ in$8 o$o$ o$^%` (q$% q$& Qr$l s$Ss$  ds$s$ s$t$` (t$Vw$0$ tw$x$% x$z$% 2z$i{$& {$|$0' |$*}$' 6}$}$p( }$$ )  $Å$P* ۅ$$ + $L$+ e$, $$- $+$. G$\$/ |$$0 $$1 ȓ$$2 $ 2 g$7 $!; 8$~$= $]6B |$3 C $$0D $D ܣ$wE $$I :$$`J Ƨ$+$K T$ɪ$K $]$L i$ $PM $$N $$N $PR T\ S $T -$@W 5$Z I$[ r$\ $] $^ $@_ ˰$$HD*$k` ta Qc #$c $d 5$!e $30g ӵ$]6h ۷$i W$j $w0k g$;$HDe$km ;m <Q0o $o $ap ]$q  d`r $ s  s t Pu  > v |v fx w\ m ` $ r Ў  ` t $ B$$ $P P$ l$$Ф  $$ $Q$ m$ $  #$HDR$kP ;0 <Qp $ $a ]$  d $`    c$ $> |0 f w\@ m`  $ r 0 P ` tP $ B$$@ $ P$ l$$ W$$0 O$Q$` m$.$ H$ !$ $ G$HDy$k ; <Q $` L$$` $H$ a$ $p !$$  $$ $Y$ q$'$ =$$  $$ $$@ $$ $e$$ s$O$* g$W$`1 s$$1 $$2 $$3 !$$3 $6$4 T$$4 $j$ 5 $$5 $$06 $($6 G$$@7 $G$7 h$$P8 $$8 $8$`9 U$$HD$k: ;; <Q< b$= $a> ]$`?  d @ $@  A PB c$ C $>C |D f`F w\N mS 0V $`X r \ ] `d te $@g B$$h $j P$Pn l$$r W$$t C$Q$t m$px $`y !$R$HD|$k{ ;| <Q} $~ )$a ]$@  d $   @ c$ $> t$ $$ $|P f w\` m  $ r P p ` tp $Ш B$@ P$ l$$ $$` $$ )$$@ $$ $$ $&$HDS$kн ; <Q $  $a ]$`  d $   P c$  > t$ $$ $|` f w\p m  $ r `  ` tZ$ r$ $ B$p P$ l$$ $$ $$0 )$$p $$ $$ $$ $F$ L$$HD$k  ; <Q@ *$ $a ]$  dp $0    c$ $>P | f w\ m0  $! r &  ' `P. t / $0 B$$2 $p3 P$7 l$$; W$$> O$Q$0? m$.$B H$$pF $@G !$H !$$HD$k`J ;0K <Q`L $M $aN  N #+O + @P ,P ,Q  -|R -PT L.fV H0\_ 1 d {2@e 43`pl '4@m 4po 6q ]7;:#@u $p$w $$z $%$ :$)$ E$p A% %P %` %%HD%kP t Q W %  % =%m %F%P R%%@ 1%% %% %|"` %% %% %% %C%` P%w% %% 4%% %% %` 8%> % %p }%w %G% T%%( % %%(p % % P  % !%HDF!%k0 %% s&%Q &% '%;(% W(%Я !=+% !^+%+%HD+%k  -%й -%Q .% .%# "/%hi ` 0%2%HD2%k@ ; <Q $5%` 5%x` H5% 6%6% 6%a7%p j7%S8% \8%/9% ;9%~ 9%a :%Wx '<% *w" h=% *w"0 h=% ! !1=%HD=%kP ; <Q A%p {A%xp HA%0 A%B% B%?C% HC%C%0 C%gD% pD%~ CE%a 0F%Wx0 G% *w" h=% *w"@ h=% ! !1I%HDMI%k` ; <Q  K% K%K% K%VN%` `N%P%0 P%T% T%EV%P QV%Z% *Z%[%p [%]% ]%!p |^%_% (_%_% _%0 N`% b`% `% `% `% `%` `% N`% b`%  a% `% `%@ `%%w ?%$@$`%HD%kD;pE<QF%0GH%0$0H% iH1$"I'%8pKq3$#4$N%5$P5$R#PS%#0T%7$U% 8$V%#W%#X}%9$YT%:$ [%;$\%<$@]V%x%]%#^ѝ%#_%H$_H$#`N$ѭ#a%J#f%ߢ%g%%k%B%HDr%k@p;p<Qr%r %`%sr%!`v%|w%?%}S%b%~r%E%~V%%%jp% i t%%Ё%m%}%%`%x% %%Є %%%%`'%% ,%&%Ї7%%%%`%w% %8%ЊB%%%%0%%%%%0g%%%HD%k;p<Q%0(%>0> ????@`w%[ [ U@]@% F%HDg%k@;<QI%`%x`XC 4 %%@%L%U%F%[LPD%a% % %Tp%lD 5%Y0%Wx%P!!1%HD%kа;<Q%%<4 5 E"a%`G% % A%%p?%|@%fw\Pmpr `t)F"P%%@Z%`|%0= @%HDh%k;<Q%`%f`X%&&&O&\&A&J&&&#&0&W&pd&&HD&k ;<Q  &K &~ &~? &xXC JP &D&M&/!&&@&&(&&&%&2&M& Z&u& &&` &7!_&&&u&~&&&*&@6&& &{&&!&$!&"&@"& #&0#&[#&i#&#&#&[ P#&3%& H%&> &&Wxp!&&7(&!P(&)&")&)&@#)&*&$*&I+&$d+&@&!%!1,&HD,&k';(<Q)-&p*[.&ap+ 0,#+,+ -,`.+J!0/ -|0-1L. 4.&fP6H0\>1C6@Er IJ`QtRV0&PTA1&pV:X?2&Z3&(\\\3&^P`5&a5&$bq5&Wxc5&5&0d5&#6&d16&6&f6&JgU7&S`h7&Q8&pjZ8&'$Pl8&Pmk9&:&o;&;&q;&2Q@s<&Q@u]>&?& v?&@&0w@&A&pxA&aB&y z!B&P{ |!B&|B&~%]@ !B&!B& C&(06C&@_D&dD&Ћ G&2G&HD^G&k;`<QH&@H&J@H&K.I&|KI&I&HDJ&kP; <QPTK&K&fK&PxM&q#q#\r#$N&A#`K#\"pN&4O&09O&O&O&Q&Q&S& S&U&@U&V&V&/X&[&HD[&k ;<Q G_&_&f_&a&D!Pb&h0b&,.c&c&d&Pd&"If&h&0h&h&h& j&HD8j&k;<Qzm&m&Jn&\n&o&o&o&0o&@p&Rp&H$pp&qq&0q&r&r&Jt&HDpt&k0;<QPu& v&Nv&Xv&v&HDv&k -% -%Q4z&z&R{&_{&{&{&c|&~|&}&p1}&}&0}&~&~&0&!@&"h &!ȅ&4ڇ&# &hi &#ȍ&3ӵ$f&`|&]6 ۷$&P  &h &> &@W$$wg$i&HD&kp;P<QA&@&>@&H& iӗ&X J& 1&* &~ P'o&(&x& (y&$Zp)ܝ&D! *#&h+&hZ+- ~p,~P-aWx0.&0/!p.!18&HDi&k0;1<Q2۠&`3_&`4G5#Hϡ&HD&k6;7<Q8&`98&&`:& &;"&K&`=b&&>&&B&M& FY&&I&_&`Jo&&K &>K&YPL&Mq&kN;PO<QP&0Q&J0R&KRL&kpX;X<QY&ZU&x[XC @\&F ]1&[L]&a_%& p`& pb=&&c& du& h&x& Pky&$Zl&Tl%&`m#&& n&S&n\&&o&& p&&p&&q&4&@r>&&r!&&s&(& t9&&t&lD`uC&dMu`&Yy%&pz&6&{G&x{&&p|&&}&b&}w&&~&f &&`&:S&j&p{&R@<&)&Ј&&&&0&H&]&&P&&&z&&&!&+P&>M&?C%@&B%2&&&hZP- ~~a&П'&Wx`&&!&&&0-& A&H&M&@!!1Э`&r&pv&&HD&k;<Q&g&a `#+ + й,+J!P -| -L.@&fpH0\1L! e&43UN!g&s&@K&!&/&&&&&&'h'w'x''g'z'F'X'' ' ' '' 'w'P'@!'! '8'HD_'kpN'P'Q'@'<4@ 5S `@ta  d H>!@"'"' #r'p$6'@%'''f)'\ 2@"'@7M#';n%'<!)'|C+'E,'UG,'Gj-'L.'fPP/'hQj1'VhPT3'4' U4'&V6')7'0W57'7'HD7'kX;Y<QZ8'p[8'*9'p\A9'a` a#+Pb+ c,c+J!dJ!|Pe-gL.pi<'fkH0\s1yL!P}{2p~43UN!P='>'HD>'k;p<Q@'PA'fPFA'xM&B'БB'rC'~C'`D'D'HDD'k;<QYE'E'a #+0+ ,+J!`J!|0-L.P F'fH0\Ы1L!0{2P43UN!0='G'HDG'k;`<Q|J'PJ'<4P 5E"aP #++ ,P+J! J!|-L.fH0\`1L!{243`'4` K'@L'`JM'HN'0FU"0 V"O'HDO'k;p<QP'PWQ'aP #++ ,@+J! -|-L.fH0\P1pL!{243` '4 6P"Q'$S'0&T'P(~U'*?2&0p-pV'2W'HD\W'k0/;0<QP1Y'2Z'a3m3 4 0556 |7@9f;w\CmI0J``Qt0ReZ'`T1Xi\'0Z]'[ ^'p]^'__'`'HDa'kb;c<QeSd'ed'afmpg0h h!ijJ|Pkmfpow\wm|~`0t'e'01p9g'h'@k'l'0=P\o'HDo'k;<Qr'as'amp0 !pJ|@f`w\mд` ts' 1`u'v'w'y'0p/z'z'HD0{'k;<Q )''amP !Q|p0'f<'\'' օ'`P' ˇ'P1߉''0'`0  0='HDK'k ;<Q@]'ԑ'am p 0 U%'|0''P r'f"ș'\*'/''04'&p8k'&9'h'='Cw'x'D'F'PEA''J' 'PS>'pU'\'w'P]U'ذ'HD'k0_;`<QPa'b'acmcd @e!fQf|g`ifkw\tm0yPz`tP'1'@' '޻'0'0P=#'HDM'k;`<Q1'P'aPmУ !@J|fw\Pmp`t'1''R"I''HD'k;p<Q'`*'a`m  !`0J|f w\pm`tw'1 i\'s'`' Z% |%0 =V'HD'kP;0<Qp' 'a m `!QJ|pf w\ )m@.`/`6t`791=P?@L'BQ'`Ew'Gy''HD'k@L; M<Q`N'O'aPmPQ PR!SQS|TpVfXw\ am@f`g`nt`o'e'q1uPwk'pz'p 00=Ћ'HD'k`;<Q !'Џ''А!''@'~`'$p'$0'$ '>v'a'h'y'G 'F'b''@ '''&'HDJ'k@;<Q@b''f'0'0'p@''''HD'k;p<Q'`'x`XC  W'>M&FY" i"X '[L{" P" Pu'*"! "a`v" 0 " @"x& @m"T" v'hM'C'E`'i" E'['"0("!('"("A(H"(ՙ"J(i"0("S(#(##hZ- ~p~Pam0A(o(Wx@(@!!1 (HD- (k0;<Q((xT(q(`w(z(( ( (#(P#(~%(=&(F&($-(P.(0=.(d.(u.(.(.(.(HD/(k;0<Q@W3(3(X4(f4(5(5(6(7(M8([8(9(P 9(;(HD<(k ;p <Q Q=(P=(>Px=(Gl>(?(`"?(?(0?(H@(S@(A(PA(~aA(~A(5:#B(C(C(@E(~7"E(WxE(*w"%G(:G(%G(`:G(@%G(! !1G( G( (H(HDRH(k#;0$<Q@%\N(%N(>&WTO(')O(O((O('P(0)8P(P(*P(LQ(*ZQ(~p+Q(~P,SR(0-E(ES(-RS(T(`.T(iU(0/xU((V(/3V(jW(P0wW($X( 11X(X(1X(Y(P2Z(Z(2Z(a[(5p[([(6[(\(7\(](7](_(7"_(_(`8_(`(8`(Ia(@9Sa(b(9b(b( :b(Mc(:Xc(c(;c(d(p;d(>e(;Qe(e(P< f( g(<g(g(=g(i(@>i(j(HD7j(k0@;A<Q0Bo(BRp(!Cp(xo!DVq( 0Fst(Gv(Y0I`y(>Iy(8z(JMz(|(@K }(~(K~((L((0MҀ(ف(M(ȃ(HD(kOpPrQQ(PR((PS((S(FTш(P]!(HD*(kg(gY(Qi(i֒((j(R(HDu(km;Pn<Qoי(0p:(f0qw(pt(Bv()Cw((C`xC&Dpz((0{-(|(HD(k;0<Q@(e(((D(W(((E(S((p((0(R(Z(U&( i`2(D&(/!Ќ(&~(Ѱ(۰(((((d(`n(;(M(((((f(px(( ˽((-(((((A(0N(( ((((Й(q(~P(k /((Q N(П(xР(F(*p(0y(>(q(HD(k((Q((R{&_{&{&{(*P(&еpC(w+`g(}((/(((((0(@<((HD(ktQe((c|&w(}&(}&P(~&(R{&_{&{&()! )35)]6)> )p ) 2 )w )/ )I )()p5)g(@}((@/(((((0(p<(88)HD)k`;<Q )4)C)#0,)))))i"0) i`)F))p$))))P)t) ) )!)") #) $) p%) C&)$() <())) ))"`+)"0,).)?.):0)0V0)1) 2)3)03)!!$p5)HD5)k;@<QP 6)!67)7)"7)8)$+8)99)%A9)P&J:)b;))l;)E+<)<)HD=)k-;.<Q/>B)/B)x0XC p1& iP2"X 03B)[L7{" p9"ap;v"F@<Y" = " >">?D)T@@" AE)C`EyF)E0G>G)i" IE'#I(#K#hZL- ~pM~PNam0O(#H)OH)!I)P.I)BJ)PQLJ)ZK)RfK)xL)RL)[M)`SiM)&8 T=N)V7 TN)bO)pUnO)oV(WxXP)Y!X!1R)HDJR)k[;[<Q]VS)]S)J^KT)K_T)U)HDU)k a;a<QbX)@cX)x@dX)pY)HDY)kf;g<QhP^)pi^)fpjwm_)CoC&Drc`) n"r`)n"tja)a)ua)b)pvb)nc)wc)Gd)Px\d) e)y0e)e)ye)f)zf)mg)@{g)0h){8h)J|h)h)}h)xi)`~i)j)j)j)j)0k)HDRk)k;`<Qp)@op)~7"@p)xPXC hZq)cs)Їns)s)t)t)`t)t)u)u)u)w)w)w)Ќw)fx)tx)Sy)p]y)y) y)[z)iz)z)z)X{)b{){)0{)X|)k|)|)|)&pb})~)p~)Z)c)))>ր)Wxp&)~)~)rpP4 cu@')О!!1ȃ)HD)kP;0<Qp) L)<4  5E"a  + ,`+J!0J!L.`)K!fH0\1L!@{2`43`'4|`) ‡)r)~)))9)0B)))))))`:y'0FU"%))HD/)k;<QƖ);))HD×)k;P<Q`))xXC I)Q)m")#@$)))))))|"P){"_)Wx٠)ϡ)ߡ)!!15) j)HD)k`;0<Q`;))))t)|))HD)k`;0<Q`Ū) ,) m)a   #+` +  ,  -|-`L.fH0\10 {2P!43`('4g&P) )){) ,)-d)/W)1B)04pV'P5@)96;˳)<ڳ)Ѵ)?޴)ٵ)B))@E))0H )!&Lͼ))0L)ܿ)pO))S)()V7)V! )Z!")^!3)a!G)r)HD)kd;e<Qfz)g)ah `i#+ j+ j,k+J!PlJ!| m-nL.@q.&fpsw\{mr  @Up%' ='6)E)k)HD)kp;P<Q)@{)a@m !@J|fw\Pmp`t)1)0))m)0`=)HD)k;p<Q)``)x`XC :" ):"$)Wxy)").I })!!1k)HD)kO))Q()0)0"xXC [L)*@"! p"a v"  " "> D)T"r))H)0)!I){)BJ)P)ZK)K)V7 pN)&8 =N)xL))[M))Z)pk)Wx )!!1)HD)k0;<Q)@)x)lD`)dMa)Y`=))F-)[L) * * *~ *a`H*:*0L***$Zpܝ&> &T*x *"*!/*t*!*V0$x*& *:S ' *H&*v*z&-*&.^*+/* `0*?C%1e*B%02*&2&hZ3- ~P4~05ai*6}**7*&7"*Wx@8*Vh8**9*}*:*&0;&k*;** <*D%E "*I!H!1@J!!"*K!S"* O!z"*"*HD"*kpS;S<QT$$*U$*xVt/ lDPW%*~pXadMPY%*:S`c8)*i*f***g+*Wx@h`,*@i!h!1-*HD.*kj;k<Ql.*pm"/*pnG o#H/*HD/*kp;q<QrI0*ps0*apt 0u#+u+ v,@w,x -xq f{H0\`1`'4|P0*2*p6B5*0/7*P8*'9*9*:*p_';*HD;*k;P<Q`=*=*Z =* ?P>*@ @U@@]@>*HD>*kЪ;<Q@*@*<4 5 E"`'A*ap 0#++ ,p+J!@J!|-иL.f0H0\1L!{2430A*R"S"`*C*0FU" V"D*HDD*kp;P<Q G*@kG*<4@ 5E"a@ #++ ,@+J!J!|-L.fH0\P1pL!{243`'4)F"PG*@H*pw'I*0FU"P V"@K*HDkK*k;p<QL*0 YM*p0!0!M*N* "N*2 #N*>"$O*e&zO*g'P*P*(P*aQ*)rQ*R* +R*R*,R*T*P,T*U*0-U*+W*.>W*sX*.X*Y*/Y*Z\*0m\*^*P0^*!P1_*_*2 `*`*2`*!3Ja*a*4a*)5,b*b* 6b*I)6c*c*7c*+d*08k*l*?l*~m*p@m*"n* A2n*n*Bn*~B@p*Xq*Cmq*s*D#s*t*pEt*v*0Fv*1x*F:x*x*Gx*7z*`HMz*@I @J{*@K{*@L{*@M{*P{*PT{*W|*P[{*\{*^|*p_|*|*HD?|*ka;`b<Qpc}* d)~*pz" er~*z"e~*(*f7*-*@g<*@g3*U@h*܁*0i*=*(jke*km"nK**0q*؆*`s*{ u*D& w *$*Py+* Pz* {r*w*|* *}*SI*8*8*ЄA****Ї*#k*&DZ*ɓ*0ԓ* ) >**`*****/*5** *YpY* $w"0**(@ܛ*P2 `"*****}* *!О****0՟* ۟**(0`*p2 d** Ϡ*9*H**Pá*-*:*¢*͢*$PQ* ) *h**HD*k;<Q*j*> "xPXC **X*г`***`*0k** **@* * **α*w*`**@**0*J*W***d*p{****̸**`*9#"@Q*!$" (*~*~|*****;*Q**`*ÿ*@Կ**** *********04*P:*w*HD*k;<Q*`**`*** *&****0*8*@****`/*w*~*%*,*~*H*S*@*( Pk*`** *%*y*****0*0*P4*;*P*( {* * * * %*y* ** ** *`H*L*`S*h*( P*`** *%*y***)***J*N*U*j*(*** *`%*y*0*****00*4*0*&*( Q*0 * * *!%*y*`"**P#**0$@*p%H*%L*&**(P''*'*0(* *(%*y*)**`*H**@+*P,J*,N*-i*~*(0.`.*p.* /* *0%*y*0**1**2*P40*44*5%*:*(P66e*6*07* *8%*y*8**:**;T*p<H*<L*=**(p>>*>*P?* *@%*y*@**A\**B*CJ*PDN*E}**(EF*F@G$`H*@*0IE**I*+J+v+0K{+K0*PL4*L++(MM+MN$P#+@*P+*Q++ RS+v+R+pSH*SL*T+'+(PUUO+UV$WN+@*X+*@Y++Yn+v+Z+ [J*[N*P\(++(]0]6+@]^$_Z +@*`E**`a*+b+v+b{+ +Pc +M +dR + +d +e0*pf4*0gN +` +(g h +0hpi$j +@*k+*@l++lS+v+m+ +0n- +M +n + +o +pH*PqL*r++(rs+s0t$`u+@*Pv+*w++wn+v+@x+ +xE+M +y+ +0z+p{J*{N*|+t+(p}}+}*~+J* N*Ѐz+i*P++(0+@*P +0H*L*`+ *++(+Ј*3+Њ0*P4*Ћ+*P++(@"+P*P+ ++J*@N*<+}*Q+q+(@p+*+ +i+H*L*@+*۟*+( +*P+ ++P0*Р4*< +P%*Q +!+( 6!+0$pZ"+"+`#+k#+r#+#+#+S$+`\$+$+$+>%+F%+P0*л4*%+%+(P%+$'+"+'+k#+` (+#+o(+S$+(+$+PK)+>%+)+H* L* *+1*+(X*+$++"+^,+k#+,+#+@8-+S$+-+$+ .+>%+@.+/+`/+ /+/+(0+$PW1+"+P#+k#+r#+#+#+S$+P\$+$+$+>%+F%+|2+@2+2+3+0* 4*l3+}3+(3+$04+"+ '+k#+ (+#+po(+S$+ (+$+K)+>%+p)+|2+5+2+h6+`H*L*`6+6+( P 7+`$~8+"+^,+k#+@,+#+8-+S$+-+$+0 .+>%+.+|2+9+2+0A:+/+P/+:+;+(;+/+J*=+$=+(H=+@H*L**>+8>+(@p\>+0*@4*C?+Q?+(v?+p/+J*=+@@+@+( A+0H* L*B+B+(`8B+00*4*-C+C+( 0 C+@ $ E+@*F+*`F++gG+v+G+MH+PVH+H+H+0I+:I+I+PI+OC$J+:D$J+J+@K+lK+vK+K+K+L+0L+ M+M+M+M+D&@;N+N+N+sO+O+4*P+P+(  Q+ $"S+@* #S+*#LT++p$T+v+ %0U+MH+%U+H+p& V+0I+'pV+I+'V+OC$`(GW+:D$)W+J+)%X+lK+`*X+K++Y+L++Y+ M+P,Z+M+-Z+D&-[+N+0[+sO+1D\+P3L*3]+]+(44]+4$6_+@* 7|`+*7`++`8Xa+v+9a+MH+94b+H+`:b+0I+;b+I+;fc+OC$P<c+:D$<7d+J+=d+lK+ >e+K+>ve+L+`?e+ M+@vf+M+@g+D&pAg+N+C*h+sO+`Eh+FN* Gi+k+(GHk+ H`IN*Il+l+(JJl+J LL*Lm+m+(`MMm+MO4*On+n+HDn+kQ;R<QRo+S=p+xTp+Wx`U q+ W!0V!1Lr+HDwr+xXHkY;Z<Q[s+[t+\Tt+A#]t+\"^ku+P#@aNv+#@bv+vw+cw+x+d%x+8ex+y+jy+WxkCz+w{+@k{+B}+lU}+C~+PlZ~+b+@my+t+n++n-++@o+)pp-+m+q+5+pr>++`t ++u+ +u&+pw!v!10x*w"xh=%+HD +kz;@{<QP|+} +>~m+r)@C+͋++\"n+A#0+j"pU+l$+G+^+Ώ+`׏+\+0m+8p+#+{+ +vw+Б˒+x+x++0+b++C~+`Ε++0Ԗ+++w{+`z+B}+0;+P#+t+ +++)-+m+ ++-+ +4+* +5+Ĝ+~0+J+R+n+HD+k;0<Q@f+ݟ+>.+V+]+mP+~+JJ6%d++HDԡ+k;<Q0++Tt+xгH>^+͋++r)`+j"U+G+@+l$Pӥ+8+C+J++P+!+mpU+v++[+l+~~+~+~+Wx+!!1E+HD|+k;<Q++E+p٠0;+K++@ϲ+ ~Pɳ+HD+<"C""@"q"w"k ;<Q@+[+xXC W'- +6" n+F;+,l"+ i ;++++++0+j"&+0h)+J@+A#`K#\"#~+@+r"O+]+r+X `+[L+aH* S+ + + l+*+>0+Ts+~~pay+P+x+`++++@.+Z+l+e+ }+j+ v+=+P M++ +hZ - Wxp R++(0+@>+~"`+"+(+2+i+@v+z"+|"`++p! !1+HD+k;<Q+Px++P+`+n+++;+`J+5}"+++~"p +~" !+"!++"+"`#+S 0$+k"$`+Ώ+%+m"p&:+- '׃"+'++++#+HDX+k,;@-<QP.,/,- 0,6"0,"h `1-,!2,,4+,,7",,W1!TC[ApSBWKpSBRCSACQ"`G` B`BSApYEppRASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASAp8ppRASASASASASASASASAp8pp@p0pphp`RASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASAp8pppRASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASAp(p8ppRASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASAp RASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASAp8ppRASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASAp RASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASAp8ppRASASASASASAp8ppRASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASAp8pppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASAp(p8ppRASASASASASASAp(p8ppRASASASASASASASASASASASASASAp8ppRASASASASASASASASAp8ppRASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASAp( p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASAp8ppRASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASAp8ppRASASASASASASASASASAp8ppRASASASASASASASASASAp8pp@pp pphpppp@p0pp`pp8pp@p0pphpp8pp@p0pphpp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASAp8pp@p0pphpp8ppRASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASAp8ppRASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(pp(pp(p8pppRASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASAp8ppRASASASASASAp8ppRASASASASASASASASASASAp(p8ppRASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASAp8ppRASASASASASASASASASAp RASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p(p(p8ppRASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(pp8pppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(pp(pp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8pp@p0pphpp8pp@p0pphpp8ppRASASASASAp(p8ppRASASASASASAp8ppRASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASASASASASASASAp(p( p(p(p8ppRASASASASASASASASASASASASASAp(p( p(p( p8ppRASASASASAp8ppRASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASAp8pppRASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASAp8pp@pp pphp`RASASASASASASASASASASASASASASASASASAp(pp(p(p( p8pp@p0pp`RAp(pp8ppRASASASASASASAp8ppRASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASAp8ppRASASASASASASASASASASAp8ppRASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASAp8ppRASASASASASASASASASASASASASASASAp RASASASASASAp RASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASAp8ppRASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASAp( p8ppRASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASAp(p(p(p(p8ppppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASAp8ppRASASASASASASASAp8ppRASASASASAp8ppRASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp RASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASAp8ppRASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASAp8ppRASASASASASASASASASASASASASASAp(p8pppRASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(pHppRASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASASASASAp(p8ppRASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p(p8ppRASASASASASASASASASASAp8pp@p0pphp`RASASASASASASASASASASASASASASASASASASASASASASASASAp(p8pp@p0pp`RASASASASASAp(pp(p8pp@p0pp`RASASASASASASASAp(pp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASASASASAp8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pp`RASASASASAp(p8pp@p0pphp`RASASASASAp(p8pp@p0pphp`RASASASASAp(p8pp@p0pphp`RASASASASAp(p8pp@p0pphp`RASASASASASASASAp(p8pp@p0pphp`RASASASASASASASAp(p8pp@p0pphp`RASASASASASASASAp(p8pp@p0pp`RAp( p8pp@p0pp`RAp( p8pp@p0pp`RAp( p8pp@p0pp`RASAp( p8pp@p0pp`RASAp( p8pp@p0pp`RASAp( p8pp@p0pp`RASASASASASASAp(p8pp@p0pp`RASASASASASASAp(p8pp@p0pp`RASASASASASASAp(p8pp@p0pp`RASASASASASASASASAp(p8pp@p0pp`RASASASASASASASASAp(p8pp@p0pp`RASASASASASASASASAp(p8pp@p0pphp8pp@p0pphp8pp@p0pphp8pp@p0pphp8pp@p0pphp8pp@p0pphp8pp@p0pp`RASASASASASASASASASASASASASASASASASASASAp(p8pp@p0pp`RASASASASASASASASASASASASASASASASASASASAp(p8pp@p0pp`RASASASASASASASASASASASASASASASASASASASAp(p8pp@p0pphp8pp@p0pphp8pp@p0pphp8ppRASASASASASAp(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p(p8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASAp(p8ppRASASASASASASASASASASASASAp8ppRASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASASAp8pp@p0pp`RASASASASASASAp(pp(p8ppRASASASASASASASASASASASASASASASASASASASASASAp8ppRASASASASASASASASASApHpQ>@_PyCFunction_TypeQq@_PyExc_TypeError@_PyLong_Typer/#П@_PyObject_Free/#sSg3 П   I@_PyObject_GC_Delqr                                  @_PyObject_GenericGetAttrq r                                     @_PyObject_GenericSetAttrq(r                                  @_PyType_Typeq0r                                     @__Py_NoneStructqp@__Py_NotImplementedStruct@_PyVTKObject_AsBufferr                                  @_PyVTKObject_Deleteq@r                                  @_PyVTKObject_GetSetqHrص                                  @_PyVTKObject_NewqPr                                  @_PyVTKObject_ReprqXr                                  @_PyVTKObject_Stringq`r                                  @_PyVTKObject_Traverseqhr                                  @_PyVTKSpecialObject_ReprȚ    I@__ZN13vtkPythonArgs5ArrayIdEC1El@__ZN13vtkPythonArgs5ArrayIfEC1El@__ZN13vtkPythonArgs5ArrayIhEC1El@__ZN13vtkPythonArgs5ArrayIiEC1El@__ZN13vtkPythonArgs5ArrayIlEC1El@__ZN13vtkPythonArgs5ArrayImEC1El@__ZN13vtkPythonArgs5ArrayIxEC1El@__ZN20vtkDebugLeaksManagerD1Evq@__ZN23vtkAOSDataArrayTemplateIxE10GetPointerExr}@__ZN23vtkAOSDataArrayTemplateIxE12WritePointerExx@__ZN30vtkCommonInformationKeyManagerD1Evq@__ZN31vtkObjectFactoryRegistryCleanupD1Ev@__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED0Ev@__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED1Ev@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE4syncEv@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE5imbueERKNS_6localeE@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE5uflowEv8@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6setbufEPcl@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6xsgetnEPcl @__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6xsputnEPKcl@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE9showmanycEv@__ZTINSt3__113basic_ostreamIcNS_11char_traitsIcEEEE @__ZTINSt3__115basic_streambufIcNS_11char_traitsIcEEEE@__ZTVN10__cxxabiv120__si_class_type_infoE`@__ZTv0_n24_NSt3__113basic_ostreamIcNS_11char_traitsIcEEED0Ev`@__ZTv0_n24_NSt3__113basic_ostreamIcNS_11char_traitsIcEEED1Ev@__ZdaPvrȲ@__ZdlPv@__Znam@__Znwm@___gxx_personality_v0q@___stack_chk_guard@dyld_stub_binder@__ZN13vtkPythonArgs5ArrayIdEC1ElQr*@__ZN13vtkPythonArgs5ArrayIfEC1El@__ZN13vtkPythonArgs5ArrayIhEC1El@__ZN13vtkPythonArgs5ArrayIiEC1El@__ZN13vtkPythonArgs5ArrayIlEC1El@__ZN13vtkPythonArgs5ArrayImEC1El@__ZN13vtkPythonArgs5ArrayIxEC1El@__ZN23vtkAOSDataArrayTemplateIxE10GetPointerExR@__ZN23vtkAOSDataArrayTemplateIxE12WritePointerExx@__ZTINSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEEq@__ZTINSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE@__ZTSNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEE@__ZTSNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE@__ZdaPvrȲ@__ZdlPv@__Znam@__Znwmr>@_PyBool_FromLongr>@_PyBuffer_Releaser>@_PyBytes_FromStringAndSizer>@_PyDict_SetItemStringr >@_PyDict_Sizer(>@_PyErr_Clearr0>@_PyErr_Occurredr8>@_PyErr_SetStringr@>@_PyFloat_FromDoublerH>@_PyLong_FromLongrP>@_PyLong_FromLongLongrX>@_PyLong_FromUnsignedLongr`>@_PyModule_Create2rh>@_PyModule_GetDictrp>@_PyObject_CallMethodrx>@_PyObject_Freer>@_PyObject_HashNotImplementedr>@_PyType_IsSubtyper>@_PyType_Readyr>@_PyUnicode_FromStringr>@_PyUnicode_FromStringAndSizer@_PyVTKClass_Addr@_PyVTKObject_Checkr@_PyVTKObject_GetObjectr@_PyVTKObject_SetFlagr@_PyVTKSpecialObject_CopyNewr@_PyVTKSpecialObject_Newr@_PyVTKSpecialType_Addr@_PyVTKTemplate_AddItemr@_PyVTKTemplate_Newr>@_Py_BuildValuer@_PyvtkAnimationCue_ClassNewr@_PyvtkCollection_ClassNewr@_PyvtkFunctionSet_ClassNewr@_PyvtkInformationKey_ClassNewr@_PyvtkLinearTransform_ClassNewr@_PyvtkObject_ClassNewr@_PyvtkPoints_ClassNewr@_PyvtkSortDataArray_ClassNewr@_PyvtkTuple_IdLi2EE_TypeNewr@_PyvtkTuple_IdLi3EE_TypeNewr@_PyvtkTuple_IdLi4EE_TypeNewr@_PyvtkTuple_IfLi2EE_TypeNewr@_PyvtkTuple_IfLi3EE_TypeNewr@_PyvtkTuple_IfLi4EE_TypeNewr@_PyvtkTuple_IhLi3EE_TypeNewr@_PyvtkTuple_IhLi4EE_TypeNewr@_PyvtkTuple_IiLi2EE_TypeNewr@_PyvtkTuple_IiLi3EE_TypeNewr@_PyvtkTuple_IiLi4EE_TypeNewr>@__Py_Deallocr>@__Py_FatalErrorFuncr@__Unwind_Resumer@__Z31vtkOutputWindowDisplayErrorTextPKcr@__Z40vtkOutputWindowDisplayGenericWarningTextPKcr@__ZN10vtkBSPCuts10CreateCutsEP9vtkKdNoder@__ZN10vtkBSPCuts10CreateCutsEPdiPiS0_S1_S1_S0_S0_S1_r@__ZN10vtkBSPCuts10InitializeEvr@__ZN10vtkBSPCuts11PrintArraysEvr@__ZN10vtkBSPCuts11ShallowCopyEP13vtkDataObjectr@__ZN10vtkBSPCuts3NewEvr@__ZN10vtkBSPCuts6EqualsEPS_dr@__ZN10vtkBSPCuts7GetDataEP14vtkInformationr@__ZN10vtkBSPCuts7GetDataEP20vtkInformationVectorir@__ZN10vtkBSPCuts8DeepCopyEP13vtkDataObjectr@__ZN10vtkBSPCuts9GetArraysEiPiPdS0_S0_S1_S1_S0_r@__ZN10vtkBSPCuts9PrintTreeEvr@__ZN10vtkDataSet10InitializeEvr@__ZN10vtkDataSet11ShallowCopyEP13vtkDataObjectr@__ZN10vtkDataSet12GetCellTypesEP12vtkCellTypesr@__ZN10vtkDataSet13ComputeBoundsEvr@__ZN10vtkDataSet13GetCellBoundsExPdr@__ZN10vtkDataSet14CopyAttributesEPS_r@__ZN10vtkDataSet14FindAndGetCellEPdP7vtkCellxdRiS0_S0_r@__ZN10vtkDataSet14GetScalarRangeEPdr@__ZN10vtkDataSet14GetScalarRangeEvr@__ZN10vtkDataSet15CheckAttributesEvr@__ZN10vtkDataSet15NewCellIteratorEvr@__ZN10vtkDataSet16GetCellNeighborsExP9vtkIdListS1_r@__ZN10vtkDataSet16HasAnyGhostCellsEvr@__ZN10vtkDataSet17GetCellGhostArrayEvr@__ZN10vtkDataSet17HasAnyGhostPointsEvr@__ZN10vtkDataSet18GenerateGhostArrayEPibr@__ZN10vtkDataSet18GetPointGhostArrayEvr@__ZN10vtkDataSet19GetActualMemorySizeEvr@__ZN10vtkDataSet19GetNumberOfElementsEir@__ZN10vtkDataSet22AllocateCellGhostArrayEvr@__ZN10vtkDataSet23AllocatePointGhostArrayEvr@__ZN10vtkDataSet24GetAttributesAsFieldDataEir@__ZN10vtkDataSet25UpdateCellGhostArrayCacheEvr@__ZN10vtkDataSet26UpdatePointGhostArrayCacheEvr@__ZN10vtkDataSet7GetDataEP14vtkInformationr@__ZN10vtkDataSet7GetDataEP20vtkInformationVectorir@__ZN10vtkDataSet7SqueezeEvr@__ZN10vtkDataSet8DeepCopyEP13vtkDataObjectr@__ZN10vtkDataSet8GetMTimeEvr@__ZN10vtkDataSet9GetBoundsEPdr@__ZN10vtkDataSet9GetBoundsEvr@__ZN10vtkDataSet9GetCenterEPdr@__ZN10vtkDataSet9GetCenterEvr@__ZN10vtkDataSet9GetLengthEvr@__ZN10vtkLocator10InitializeEvr@__ZN10vtkLocator10SetDataSetEP10vtkDataSetr@__ZN10vtkLocator6UpdateEvr@__ZN10vtkPolygon11ComputeAreaEP9vtkPointsxPxPdr@__ZN10vtkPolygon11ComputeAreaEvr@__ZN10vtkPolygon11DerivativesEiPdS0_iS0_r@__ZN10vtkPolygon11TriangulateEP9vtkIdListr@__ZN10vtkPolygon11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN10vtkPolygon12CellBoundaryEiPdP9vtkIdListr@__ZN10vtkPolygon13ComputeNormalEP14vtkIdTypeArrayP9vtkPointsPdr@__ZN10vtkPolygon13ComputeNormalEP9vtkPointsPdr@__ZN10vtkPolygon13ComputeNormalEP9vtkPointsiPxPdr@__ZN10vtkPolygon13ComputeNormalEiPdS0_r@__ZN10vtkPolygon14PointInPolygonEPdiS0_S0_S0_r@__ZN10vtkPolygon15ComputeCentroidEP14vtkIdTypeArrayP9vtkPointsPdr@__ZN10vtkPolygon15ComputeCentroidEP9vtkPointsiPxPdr@__ZN10vtkPolygon16EvaluateLocationERiPdS1_S1_r@__ZN10vtkPolygon16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN10vtkPolygon17DistanceToPolygonEPdiS0_S0_S0_r@__ZN10vtkPolygon17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN10vtkPolygon18BoundedTriangulateEP9vtkIdListdr@__ZN10vtkPolygon19ParameterizePolygonEPdS0_RdS0_S1_S0_r@__ZN10vtkPolygon20InterpolateFunctionsEPdS0_r@__ZN10vtkPolygon22IntersectConvex2DCellsEP7vtkCellS1_dPdS2_r@__ZN10vtkPolygon24NonDegenerateTriangulateEP9vtkIdListr@__ZN10vtkPolygon27IntersectPolygonWithPolygonEiPdS0_iS0_S0_dS0_r@__ZN10vtkPolygon3NewEvr@__ZN10vtkPolygon4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN10vtkPolygon7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN10vtkPolygon7GetEdgeEir@__ZN10vtkPolygon8IsConvexEP14vtkIdTypeArrayP9vtkPointsr@__ZN10vtkPolygon8IsConvexEP9vtkPointsr@__ZN10vtkPolygon8IsConvexEP9vtkPointsiPxr@__ZN10vtkPolygon8IsConvexEvr@__ZN10vtkPyramid11DerivativesEiPdS0_iS0_r@__ZN10vtkPyramid11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN10vtkPyramid12CellBoundaryEiPdP9vtkIdListr@__ZN10vtkPyramid12GetEdgeArrayEir@__ZN10vtkPyramid12GetFaceArrayEir@__ZN10vtkPyramid13GetEdgePointsEiRPir@__ZN10vtkPyramid13GetFacePointsEiRPir@__ZN10vtkPyramid16EvaluateLocationERiPdS1_S1_r@__ZN10vtkPyramid16EvaluatePositionEPdS0_RiS0_RdS0_r @__ZN10vtkPyramid17IntersectWithLineEPdS0_dRdS0_S0_Rir @__ZN10vtkPyramid19GetParametricCoordsEvr @__ZN10vtkPyramid19InterpolationDerivsEPdS0_r @__ZN10vtkPyramid22InterpolationFunctionsEPdS0_r @__ZN10vtkPyramid3NewEvr @__ZN10vtkPyramid7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r @__ZN10vtkPyramid7GetEdgeEir @__ZN10vtkPyramid7GetFaceEir @__ZN10vtkQuadric15SetCoefficientsEPdr @__ZN10vtkQuadric15SetCoefficientsEddddddddddr @__ZN10vtkQuadric16EvaluateFunctionEPdr @__ZN10vtkQuadric16EvaluateGradientEPdS0_r @__ZN10vtkQuadric3NewEvr @__ZN10vtkVariantC1ERKS_r @__ZN10vtkVariantD1Evr @__ZN11vtkCellData3NewEvr @__ZN11vtkCylinder16EvaluateFunctionEPdr @__ZN11vtkCylinder16EvaluateGradientEPdS0_r @__ZN11vtkCylinder3NewEvr @__ZN11vtkCylinder7SetAxisEPdr @__ZN11vtkCylinder7SetAxisEdddr @__ZN11vtkMolecule10AppendAtomEtRK11vtkVector3fr @__ZN11vtkMolecule10AppendBondExxtr @__ZN11vtkMolecule10GetLatticeER11vtkVector3dS1_S1_r @__ZN11vtkMolecule10GetLatticeER11vtkVector3dS1_S1_S1_r @__ZN11vtkMolecule10GetLatticeEvr @__ZN11vtkMolecule10HasLatticeEvr @__ZN11vtkMolecule10InitializeEvr @__ZN11vtkMolecule10SetLatticeEP12vtkMatrix3x3r @__ZN11vtkMolecule10SetLatticeERK11vtkVector3dS2_S2_r @__ZN11vtkMolecule11ShallowCopyEP13vtkDataObjectr @__ZN11vtkMolecule12ClearLatticeEvr @__ZN11vtkMolecule12GetBondOrderExr @__ZN11vtkMolecule12SetBondOrderExtr @__ZN11vtkMolecule13GetBondLengthExr @__ZN11vtkMolecule15CheckedDeepCopyEP8vtkGraphr @__ZN11vtkMolecule15GetAtomPositionExr @__ZN11vtkMolecule15GetAtomPositionExPfr @__ZN11vtkMolecule15SetAtomPositionExRK11vtkVector3fr @__ZN11vtkMolecule15SetAtomPositionExdddr @__ZN11vtkMolecule16GetNumberOfAtomsEvr @__ZN11vtkMolecule16GetNumberOfBondsEvr @__ZN11vtkMolecule16GetPlaneFromBondERK7vtkAtomS2_RK11vtkVector3fP8vtkPlaner @__ZN11vtkMolecule16GetPlaneFromBondERK7vtkBondRK11vtkVector3fP8vtkPlaner @__ZN11vtkMolecule17DeepCopyStructureEPS_r @__ZN11vtkMolecule17SetElectronicDataEP25vtkAbstractElectronicDatar @__ZN11vtkMolecule18CheckedShallowCopyEP8vtkGraphr @__ZN11vtkMolecule18DeepCopyAttributesEPS_r @__ZN11vtkMolecule19GetAtomAtomicNumberExr @__ZN11vtkMolecule19SetAtomAtomicNumberExtr @__ZN11vtkMolecule20GetAtomicNumberArrayEvr @__ZN11vtkMolecule20ShallowCopyStructureEPS_r @__ZN11vtkMolecule21ShallowCopyAttributesEPS_r @__ZN11vtkMolecule22GetAtomicPositionArrayEvr @__ZN11vtkMolecule3NewEvr @__ZN11vtkMolecule7GetAtomExr @__ZN11vtkMolecule7GetBondExr @__ZN11vtkMolecule8DeepCopyEP13vtkDataObjectr @__ZN11vtkPointSet10InitializeEvr @__ZN11vtkPointSet11ShallowCopyEP13vtkDataObjectr @__ZN11vtkPointSet13ComputeBoundsEvr @__ZN11vtkPointSet13CopyStructureEP10vtkDataSetr @__ZN11vtkPointSet15NewCellIteratorEvr @__ZN11vtkPointSet19GetActualMemorySizeEvr @__ZN11vtkPointSet7GetDataEP14vtkInformationr @__ZN11vtkPointSet7GetDataEP20vtkInformationVectorir @__ZN11vtkPointSet7SqueezeEvr @__ZN11vtkPointSet8DeepCopyEP13vtkDataObjectr @__ZN11vtkPointSet8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r @__ZN11vtkPointSet8FindCellEPdP7vtkCellxdRiS0_S0_r @__ZN11vtkPointSet8GetMTimeEvr @__ZN11vtkPointSet9FindPointEPdr @__ZN11vtkPointSet9SetPointsEP9vtkPointsr @__ZN11vtkPolyData10BuildCellsEvr @__ZN11vtkPolyData10BuildLinksEir @__ZN11vtkPolyData10InitializeEvr @__ZN11vtkPolyData11DeleteCellsEvr @__ZN11vtkPolyData11DeleteLinksEvr @__ZN11vtkPolyData11GetCellTypeExr @__ZN11vtkPolyData11ReplaceCellExiPxr@__ZN11vtkPolyData11ReverseCellExr@__ZN11vtkPolyData11ShallowCopyEP13vtkDataObjectr@__ZN11vtkPolyData12GetMeshMTimeEvr@__ZN11vtkPolyData13ComputeBoundsEvr@__ZN11vtkPolyData13CopyStructureEP10vtkDataSetr@__ZN11vtkPolyData13GetCellBoundsExPdr@__ZN11vtkPolyData13GetCellPointsExP9vtkIdListr@__ZN11vtkPolyData13GetGhostLevelEvr@__ZN11vtkPolyData13GetPointCellsExP9vtkIdListr@__ZN11vtkPolyData14GetMaxCellSizeEvr@__ZN11vtkPolyData14InsertNextCellEiP9vtkIdListr@__ZN11vtkPolyData14InsertNextCellEiiPxr@__ZN11vtkPolyData16GetCellNeighborsExP9vtkIdListS1_r@__ZN11vtkPolyData16GetNumberOfCellsEvr@__ZN11vtkPolyData16GetNumberOfLinesEvr@__ZN11vtkPolyData16GetNumberOfPolysEvr@__ZN11vtkPolyData16GetNumberOfVertsEvr@__ZN11vtkPolyData16RemoveGhostCellsEvr@__ZN11vtkPolyData17GetNumberOfPiecesEvr@__ZN11vtkPolyData17GetNumberOfStripsEvr@__ZN11vtkPolyData17ReplaceLinkedCellExiPxr@__ZN11vtkPolyData18AddReferenceToCellExxr@__ZN11vtkPolyData18RemoveDeletedCellsEvr@__ZN11vtkPolyData19GetActualMemorySizeEvr@__ZN11vtkPolyData20GetCellEdgeNeighborsExxxP9vtkIdListr@__ZN11vtkPolyData20InsertNextLinkedCellEiiPxr@__ZN11vtkPolyData21InsertNextLinkedPointEPdir@__ZN11vtkPolyData21InsertNextLinkedPointEir@__ZN11vtkPolyData21RemoveReferenceToCellExxr@__ZN11vtkPolyData27GetScalarFieldCriticalIndexExP12vtkDataArrayr@__ZN11vtkPolyData27GetScalarFieldCriticalIndexExPKcr@__ZN11vtkPolyData27GetScalarFieldCriticalIndexExir@__ZN11vtkPolyData3NewEvr@__ZN11vtkPolyData5ResetEvr@__ZN11vtkPolyData6IsEdgeExxr@__ZN11vtkPolyData7GetCellExr@__ZN11vtkPolyData7GetCellExP14vtkGenericCellr@__ZN11vtkPolyData7GetDataEP14vtkInformationr@__ZN11vtkPolyData7GetDataEP20vtkInformationVectorir@__ZN11vtkPolyData7SqueezeEvr@__ZN11vtkPolyData8AllocateEPS_xir@__ZN11vtkPolyData8AllocateExir@__ZN11vtkPolyData8DeepCopyEP13vtkDataObjectr@__ZN11vtkPolyData8GetLinesEvr@__ZN11vtkPolyData8GetPieceEvr@__ZN11vtkPolyData8GetPolysEvr@__ZN11vtkPolyData8GetVertsEvr@__ZN11vtkPolyData8SetLinesEP12vtkCellArrayr@__ZN11vtkPolyData8SetPolysEP12vtkCellArrayr@__ZN11vtkPolyData8SetVertsEP12vtkCellArrayr@__ZN11vtkPolyData9CopyCellsEPS_P9vtkIdListP15vtkPointLocatorr@__ZN11vtkPolyData9GetStripsEvr@__ZN11vtkPolyData9SetStripsEP12vtkCellArrayr@__ZN11vtkPolyLine11DerivativesEiPdS0_iS0_r@__ZN11vtkPolyLine11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN11vtkPolyLine12CellBoundaryEiPdP9vtkIdListr@__ZN11vtkPolyLine16EvaluateLocationERiPdS1_S1_r@__ZN11vtkPolyLine16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN11vtkPolyLine17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN11vtkPolyLine19GetParametricCenterEPdr@__ZN11vtkPolyLine22GenerateSlidingNormalsEP9vtkPointsP12vtkCellArrayP12vtkDataArrayr@__ZN11vtkPolyLine22GenerateSlidingNormalsEP9vtkPointsP12vtkCellArrayP12vtkDataArrayPdr@__ZN11vtkPolyLine3NewEvr@__ZN11vtkPolyLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN11vtkPolyLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN11vtkTriangle11ComputeAreaEvr@__ZN11vtkTriangle11DerivativesEiPdS0_iS0_r@__ZN11vtkTriangle11ProjectTo2DEPdS0_S0_S0_S0_S0_r@__ZN11vtkTriangle11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN11vtkTriangle12CellBoundaryEiPdP9vtkIdListr@__ZN11vtkTriangle12CircumcircleEPdS0_S0_S0_r@__ZN11vtkTriangle12GetEdgeArrayEir@__ZN11vtkTriangle13ComputeNormalEP9vtkPointsiPxPdr@__ZN11vtkTriangle14ComputeQuadricEPdS0_S0_P10vtkQuadricr@__ZN11vtkTriangle14ComputeQuadricEPdS0_S0_PA4_dr@__ZN11vtkTriangle15PointInTriangleEPdS0_S0_S0_dr@__ZN11vtkTriangle16EvaluateLocationERiPdS1_S1_r@__ZN11vtkTriangle16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN11vtkTriangle17BarycentricCoordsEPdS0_S0_S0_S0_r@__ZN11vtkTriangle17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN11vtkTriangle18TrianglesIntersectEPdS0_S0_S0_S0_S0_r@__ZN11vtkTriangle19GetParametricCoordsEvr@__ZN11vtkTriangle19InterpolationDerivsEPdS0_r@__ZN11vtkTriangle21GetParametricDistanceEPdr@__ZN11vtkTriangle22InterpolationFunctionsEPdS0_r@__ZN11vtkTriangle3NewEvr@__ZN11vtkTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN11vtkTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN11vtkTriangle7GetEdgeEir@__ZN12vtkArrayData11ClearArraysEvr@__ZN12vtkArrayData11ShallowCopyEP13vtkDataObjectr@__ZN12vtkArrayData14GetArrayByNameEPKcr@__ZN12vtkArrayData17GetNumberOfArraysEvr@__ZN12vtkArrayData3NewEvr@__ZN12vtkArrayData7GetDataEP14vtkInformationr@__ZN12vtkArrayData7GetDataEP20vtkInformationVectorir@__ZN12vtkArrayData8AddArrayEP8vtkArrayr@__ZN12vtkArrayData8DeepCopyEP13vtkDataObjectr@__ZN12vtkArrayData8GetArrayExr@__ZN12vtkCellArray10InitializeEvr@__ZN12vtkCellArray11GetNextCellEP9vtkIdListr@__ZN12vtkCellArray14GetMaxCellSizeEvr@__ZN12vtkCellArray19GetActualMemorySizeEvr@__ZN12vtkCellArray3NewEvr@__ZN12vtkCellArray7GetCellExP9vtkIdListr@__ZN12vtkCellArray8DeepCopyEPS_r@__ZN12vtkCellArray8SetCellsExP14vtkIdTypeArrayr@__ZN12vtkCellLinks10BuildLinksEP10vtkDataSetr@__ZN12vtkCellLinks10BuildLinksEP10vtkDataSetP12vtkCellArrayr@__ZN12vtkCellLinks10InitializeEvr@__ZN12vtkCellLinks15InsertNextPointEir@__ZN12vtkCellLinks19GetActualMemorySizeEvr@__ZN12vtkCellLinks3NewEvr@__ZN12vtkCellLinks5ResetEvr@__ZN12vtkCellLinks7SqueezeEvr@__ZN12vtkCellLinks8AllocateExxr@__ZN12vtkCellLinks8DeepCopyEPS_r@__ZN12vtkCellTypes10InsertCellExhxr@__ZN12vtkCellTypes12SetCellTypesExP20vtkUnsignedCharArrayP11vtkIntArrayr@__ZN12vtkCellTypes12SetCellTypesExP20vtkUnsignedCharArrayP14vtkIdTypeArrayr@__ZN12vtkCellTypes14InsertNextCellEhxr@__ZN12vtkCellTypes19GetActualMemorySizeEvr@__ZN12vtkCellTypes22GetClassNameFromTypeIdEir@__ZN12vtkCellTypes22GetTypeIdFromClassNameEPKcr@__ZN12vtkCellTypes3NewEvr@__ZN12vtkCellTypes5ResetEvr@__ZN12vtkCellTypes7SqueezeEvr@__ZN12vtkCellTypes8AllocateEiir@__ZN12vtkCellTypes8DeepCopyEPS_r@__ZN12vtkCubicLine11DerivativesEiPdS0_iS0_r@__ZN12vtkCubicLine11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN12vtkCubicLine12CellBoundaryEiPdP9vtkIdListr@__ZN12vtkCubicLine16EvaluateLocationERiPdS1_S1_r@__ZN12vtkCubicLine16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN12vtkCubicLine17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN12vtkCubicLine19GetParametricCoordsEvr@__ZN12vtkCubicLine19InterpolationDerivsEPdS0_r@__ZN12vtkCubicLine21GetParametricDistanceEPdr@__ZN12vtkCubicLine22InterpolationFunctionsEPdS0_r@__ZN12vtkCubicLine3NewEvr@__ZN12vtkCubicLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN12vtkCubicLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN12vtkEdgeTable10InitializeEvr@__ZN12vtkEdgeTable10InsertEdgeExxr@__ZN12vtkEdgeTable10InsertEdgeExxPvr@__ZN12vtkEdgeTable10InsertEdgeExxxr@__ZN12vtkEdgeTable11GetNextEdgeERxS0_r@__ZN12vtkEdgeTable13InitTraversalEvr@__ZN12vtkEdgeTable17InitEdgeInsertionExir@__ZN12vtkEdgeTable17InsertUniquePointExxPdRxr@__ZN12vtkEdgeTable18InitPointInsertionEP9vtkPointsxr@__ZN12vtkEdgeTable3NewEvr@__ZN12vtkEdgeTable5ResetEvr@__ZN12vtkEdgeTable6IsEdgeExxr@__ZN12vtkEmptyCell11DerivativesEiPdS0_iS0_r@__ZN12vtkEmptyCell11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN12vtkEmptyCell12CellBoundaryEiPdP9vtkIdListr@__ZN12vtkEmptyCell16EvaluateLocationERiPdS1_S1_r@__ZN12vtkEmptyCell16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN12vtkEmptyCell17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN12vtkEmptyCell3NewEvr@__ZN12vtkEmptyCell4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN12vtkEmptyCell7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN12vtkFieldData10CopyAllOffEir@__ZN12vtkFieldData10InitializeEvr@__ZN12vtkFieldData11InsertTupleExxPS_r@__ZN12vtkFieldData11RemoveArrayEPKcr@__ZN12vtkFieldData11RemoveArrayEir@__ZN12vtkFieldData11ShallowCopyEPS_r@__ZN12vtkFieldData13CopyStructureEPS_r@__ZN12vtkFieldData14AllocateArraysEir@__ZN12vtkFieldData14CopyFieldOnOffEPKcir@__ZN12vtkFieldData15InsertNextTupleExPS_r@__ZN12vtkFieldData16GetAbstractArrayEPKcRir@__ZN12vtkFieldData16GetAbstractArrayEir@__ZN12vtkFieldData17GetNumberOfTuplesEvr@__ZN12vtkFieldData17SetNumberOfTuplesExr@__ZN12vtkFieldData19GetActualMemorySizeEvr@__ZN12vtkFieldData21GetNumberOfComponentsEvr@__ZN12vtkFieldData27GetArrayContainingComponentEiRir@__ZN12vtkFieldData3NewEvr@__ZN12vtkFieldData5ResetEvr@__ZN12vtkFieldData7SqueezeEvr@__ZN12vtkFieldData8AddArrayEP16vtkAbstractArrayr@__ZN12vtkFieldData8AllocateExxr@__ZN12vtkFieldData8DeepCopyEPS_r@__ZN12vtkFieldData8GetArrayEPKcRir@__ZN12vtkFieldData8GetArrayEir@__ZN12vtkFieldData8GetFieldEP9vtkIdListPS_r@__ZN12vtkFieldData8GetMTimeEvr@__ZN12vtkFieldData8PassDataEPS_r@__ZN12vtkFieldData8SetTupleExxPS_r@__ZN12vtkFieldData9CopyAllOnEir@__ZN12vtkGraphEdge3NewEvr@__ZN12vtkHyperTree14CreateInstanceEjjr@__ZN12vtkHyperTree15FindParentIndexERxr@__ZN12vtkHyperTree19FindChildParametersEiRxRbr@__ZN12vtkImageData10InitializeEvr@__ZN12vtkImageData11GetCellTypeExr@__ZN12vtkImageData11ShallowCopyEP13vtkDataObjectr@__ZN12vtkImageData13ComputeBoundsEvr@__ZN12vtkImageData13CopyStructureEP10vtkDataSetr@__ZN12vtkImageData13GetCellBoundsExPdr@__ZN12vtkImageData13GetDimensionsEPir@__ZN12vtkImageData13GetDimensionsEvr@__ZN12vtkImageData13GetIncrementsEP12vtkDataArrayr@__ZN12vtkImageData13GetIncrementsEP12vtkDataArrayPxr@__ZN12vtkImageData13GetIncrementsEP12vtkDataArrayRxS2_S2_r@__ZN12vtkImageData13GetIncrementsEPxr@__ZN12vtkImageData13GetIncrementsERxS0_S0_r@__ZN12vtkImageData13GetIncrementsEvr@__ZN12vtkImageData13GetScalarSizeEP14vtkInformationr@__ZN12vtkImageData13GetScalarSizeEvr@__ZN12vtkImageData13GetScalarTypeEP14vtkInformationr@__ZN12vtkImageData13GetScalarTypeEvr@__ZN12vtkImageData13HasScalarTypeEP14vtkInformationr@__ZN12vtkImageData13SetDimensionsEPKir@__ZN12vtkImageData13SetDimensionsEiiir@__ZN12vtkImageData13SetScalarTypeEiP14vtkInformationr@__ZN12vtkImageData14FindAndGetCellEPdP7vtkCellxdRiS0_S0_r@__ZN12vtkImageData15AllocateScalarsEP14vtkInformationr@__ZN12vtkImageData15AllocateScalarsEiir@__ZN12vtkImageData15CopyAndCastFromEPS_Pir@__ZN12vtkImageData15GetArrayPointerEP12vtkDataArrayPir@__ZN12vtkImageData16GetNumberOfCellsEvr@__ZN12vtkImageData16GetPointGradientEiiiP12vtkDataArrayPdr@__ZN12vtkImageData16GetScalarPointerEPir@__ZN12vtkImageData16GetScalarPointerEiiir@__ZN12vtkImageData16GetScalarPointerEvr@__ZN12vtkImageData16GetScalarTypeMaxEP14vtkInformationr@__ZN12vtkImageData16GetScalarTypeMaxEvr@__ZN12vtkImageData16GetScalarTypeMinEP14vtkInformationr@__ZN12vtkImageData16GetScalarTypeMinEvr@__ZN12vtkImageData16GetVoxelGradientEiiiP12vtkDataArrayS1_r@__ZN12vtkImageData17PrepareForNewDataEvr@__ZN12vtkImageData18GetArrayIncrementsEP12vtkDataArrayPxr@__ZN12vtkImageData19GetActualMemorySizeEvr@__ZN12vtkImageData19GetAxisUpdateExtentEiRiS0_PKir@__ZN12vtkImageData19SetAxisUpdateExtentEiiiPKiPir@__ZN12vtkImageData21ComputeInternalExtentEPiS0_S0_r@__ZN12vtkImageData23GetContinuousIncrementsEP12vtkDataArrayPiRxS3_S3_r@__ZN12vtkImageData23GetContinuousIncrementsEPiRxS1_S1_r@__ZN12vtkImageData24GetArrayPointerForExtentEP12vtkDataArrayPir@__ZN12vtkImageData25CopyInformationToPipelineEP14vtkInformationr@__ZN12vtkImageData25GetScalarComponentAsFloatEiiiir@__ZN12vtkImageData25GetScalarPointerForExtentEPir@__ZN12vtkImageData26GetScalarComponentAsDoubleEiiiir@__ZN12vtkImageData27CopyInformationFromPipelineEP14vtkInformationr@__ZN12vtkImageData27GetNumberOfScalarComponentsEP14vtkInformationr@__ZN12vtkImageData27GetNumberOfScalarComponentsEvr@__ZN12vtkImageData27HasNumberOfScalarComponentsEP14vtkInformationr@__ZN12vtkImageData27SetNumberOfScalarComponentsEiP14vtkInformationr@__ZN12vtkImageData27SetScalarComponentFromFloatEiiiifr@__ZN12vtkImageData28ComputeStructuredCoordinatesEPKdPiPdr@__ZN12vtkImageData28ComputeStructuredCoordinatesEPKdPiPdPKiS1_S1_S1_r@__ZN12vtkImageData28SetScalarComponentFromDoubleEiiiidr@__ZN12vtkImageData3NewEvr@__ZN12vtkImageData4CropEPKir@__ZN12vtkImageData7GetCellEiiir@__ZN12vtkImageData7GetCellExr@__ZN12vtkImageData7GetCellExP14vtkGenericCellr@__ZN12vtkImageData7GetDataEP14vtkInformationr@__ZN12vtkImageData7GetDataEP20vtkInformationVectorir@__ZN12vtkImageData8DeepCopyEP13vtkDataObjectr@__ZN12vtkImageData8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r@__ZN12vtkImageData8FindCellEPdP7vtkCellxdRiS0_S0_r@__ZN12vtkImageData8GetPointExPdr@__ZN12vtkImageData9FindPointEPdr@__ZN12vtkImageData9SetExtentEPir@__ZN12vtkImageData9SetExtentEiiiiiir@__ZN12vtkPointData3NewEvr@__ZN12vtkPointData9NullPointExr@__ZN12vtkPolyPlane11SetPolyLineEP11vtkPolyLiner@__ZN12vtkPolyPlane16EvaluateFunctionEPdr@__ZN12vtkPolyPlane16EvaluateGradientEPdS0_r@__ZN12vtkPolyPlane3NewEvr@__ZN12vtkPolyPlane8GetMTimeEvr@__ZN12vtkReebGraph11CloseStreamEvr@__ZN12vtkReebGraph14StreamTriangleExdxdxdr@__ZN12vtkReebGraph17StreamTetrahedronExdxdxdxdr@__ZN12vtkReebGraph3NewEvr@__ZN12vtkReebGraph3SetEP23vtkMutableDirectedGraphr@__ZN12vtkReebGraph5BuildEP11vtkPolyDataP12vtkDataArrayr@__ZN12vtkReebGraph5BuildEP11vtkPolyDataPKcr@__ZN12vtkReebGraph5BuildEP11vtkPolyDataxr@__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridP12vtkDataArrayr@__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridPKcr@__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridxr @__ZN12vtkReebGraph8DeepCopyEP13vtkDataObjectr @__ZN12vtkReebGraph8SimplifyEdP32vtkReebGraphSimplificationMetricr @__ZN12vtkSelection10InitializeEvr @__ZN12vtkSelection10RemoveNodeEP16vtkSelectionNoder @__ZN12vtkSelection10RemoveNodeEjr @__ZN12vtkSelection11ShallowCopyEP13vtkDataObjectr @__ZN12vtkSelection14RemoveAllNodesEvr @__ZN12vtkSelection16GetNumberOfNodesEvr @__ZN12vtkSelection3NewEvr @__ZN12vtkSelection4DumpEvr @__ZN12vtkSelection5UnionEP16vtkSelectionNoder @__ZN12vtkSelection5UnionEPS_r @__ZN12vtkSelection7AddNodeEP16vtkSelectionNoder @__ZN12vtkSelection7GetDataEP14vtkInformationr @__ZN12vtkSelection7GetDataEP20vtkInformationVectorir @__ZN12vtkSelection7GetNodeEjr!@__ZN12vtkSelection8DeepCopyEP13vtkDataObjectr!@__ZN12vtkSelection8GetMTimeEvr!@__ZN12vtkSelection8SubtractEP16vtkSelectionNoder!@__ZN12vtkSelection8SubtractEPS_r!@__ZN13vtkAnnotation10ICON_INDEXEvr!@__ZN13vtkAnnotation10InitializeEvr!@__ZN13vtkAnnotation11ShallowCopyEP13vtkDataObjectr!@__ZN13vtkAnnotation12SetSelectionEP12vtkSelectionr!@__ZN13vtkAnnotation3NewEvr!@__ZN13vtkAnnotation4DATAEvr!@__ZN13vtkAnnotation4HIDEEvr!@__ZN13vtkAnnotation5COLOREvr!@__ZN13vtkAnnotation5LABELEvr!@__ZN13vtkAnnotation6ENABLEEvr!@__ZN13vtkAnnotation7GetDataEP14vtkInformationr!@__ZN13vtkAnnotation7GetDataEP20vtkInformationVectorir"@__ZN13vtkAnnotation7OPACITYEvr"@__ZN13vtkAnnotation8DeepCopyEP13vtkDataObjectr"@__ZN13vtkAnnotation8GetMTimeEvr"@__ZN13vtkCollection15GetItemAsObjectEir"@__ZN13vtkCollection7AddItemEP9vtkObjectr"@__ZN13vtkDataObject10FIELD_NAMEEvr"@__ZN13vtkDataObject10InitializeEvr"@__ZN13vtkDataObject11DATA_EXTENTEvr"@__ZN13vtkDataObject11DATA_OBJECTEvr"@__ZN13vtkDataObject11FIELD_RANGEEvr"@__ZN13vtkDataObject11ReleaseDataEvr"@__ZN13vtkDataObject11ShallowCopyEPS_r"@__ZN13vtkDataObject12BOUNDING_BOXEvr"@__ZN13vtkDataObject12PIECE_EXTENTEvr"@__ZN13vtkDataObject12SetFieldDataEP12vtkFieldDatar"@__ZN13vtkDataObject13GetAttributesEir#@__ZN13vtkDataObject13GetUpdateTimeEvr#@__ZN13vtkDataObject14DATA_TIME_STEPEvr#@__ZN13vtkDataObject14DATA_TYPE_NAMEEvr#@__ZN13vtkDataObject14SetInformationEP14vtkInformationr#@__ZN13vtkDataObject15FIELD_OPERATIONEvr#@__ZN13vtkDataObject16CELL_DATA_VECTOREvr#@__ZN13vtkDataObject16DATA_EXTENT_TYPEEvr#@__ZN13vtkDataObject16EDGE_DATA_VECTOREvr#@__ZN13vtkDataObject16FIELD_ARRAY_TYPEEvr#@__ZN13vtkDataObject17ALL_PIECES_EXTENTEvr#@__ZN13vtkDataObject17DATA_PIECE_NUMBEREvr#@__ZN13vtkDataObject17FIELD_ASSOCIATIONEvr#@__ZN13vtkDataObject17POINT_DATA_VECTOREvr#@__ZN13vtkDataObject18SetActiveAttributeEP14vtkInformationiPKcir#@__ZN13vtkDataObject18VERTEX_DATA_VECTOREvr#@__ZN13vtkDataObject19GetActualMemorySizeEvr$@__ZN13vtkDataObject19GetNumberOfElementsEir$@__ZN13vtkDataObject20DataHasBeenGeneratedEvr$@__ZN13vtkDataObject20FIELD_ATTRIBUTE_TYPEEvr$@__ZN13vtkDataObject21DATA_NUMBER_OF_PIECESEvr$@__ZN13vtkDataObject22FIELD_ACTIVE_ATTRIBUTEEvr$@__ZN13vtkDataObject22FIELD_NUMBER_OF_TUPLESEvr$@__ZN13vtkDataObject22SetActiveAttributeInfoEP14vtkInformationiiPKciiir$@__ZN13vtkDataObject24GetAttributeTypeForArrayEP16vtkAbstractArrayr$@__ZN13vtkDataObject24GetAttributesAsFieldDataEir$@__ZN13vtkDataObject24GetGlobalReleaseDataFlagEvr$@__ZN13vtkDataObject24GetNamedFieldInformationEP14vtkInformationiPKcr$@__ZN13vtkDataObject24SetGlobalReleaseDataFlagEir$@__ZN13vtkDataObject25GetActiveFieldInformationEP14vtkInformationiir$@__ZN13vtkDataObject26FIELD_NUMBER_OF_COMPONENTSEvr$@__ZN13vtkDataObject26GetAssociationTypeAsStringEir$@__ZN13vtkDataObject27DATA_NUMBER_OF_GHOST_LEVELSEvr%@__ZN13vtkDataObject27RemoveNamedFieldInformationEP14vtkInformationiPKcr%@__ZN13vtkDataObject28GetAssociationTypeFromStringEPKcr%@__ZN13vtkDataObject28SetPointDataActiveScalarInfoEP14vtkInformationiir%@__ZN13vtkDataObject3NewEvr%@__ZN13vtkDataObject3SILEvr%@__ZN13vtkDataObject4CropEPKir%@__ZN13vtkDataObject6ORIGINEvr%@__ZN13vtkDataObject7GetDataEP14vtkInformationr%@__ZN13vtkDataObject7GetDataEP20vtkInformationVectorir%@__ZN13vtkDataObject7SPACINGEvr%@__ZN13vtkDataObject8DeepCopyEPS_r%@__ZN13vtkDataObject8GetMTimeEvr%@__ZN13vtkHexahedron11DerivativesEiPdS0_iS0_r%@__ZN13vtkHexahedron11TriangulateEiP9vtkIdListP9vtkPointsr%@__ZN13vtkHexahedron12CellBoundaryEiPdP9vtkIdListr%@__ZN13vtkHexahedron12GetEdgeArrayEir&@__ZN13vtkHexahedron12GetFaceArrayEir&@__ZN13vtkHexahedron13GetEdgePointsEiRPir&@__ZN13vtkHexahedron13GetFacePointsEiRPir&@__ZN13vtkHexahedron16EvaluateLocationERiPdS1_S1_r&@__ZN13vtkHexahedron16EvaluatePositionEPdS0_RiS0_RdS0_r&@__ZN13vtkHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Rir&@__ZN13vtkHexahedron19GetParametricCoordsEvr&@__ZN13vtkHexahedron19InterpolationDerivsEPdS0_r&@__ZN13vtkHexahedron22InterpolationFunctionsEPdS0_r&@__ZN13vtkHexahedron3NewEvr&@__ZN13vtkHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r&@__ZN13vtkHexahedron7GetEdgeEir&@__ZN13vtkHexahedron7GetFaceEir&@__ZN13vtkObjectBase8IsTypeOfEPKcr&@__ZN13vtkPolyVertex11DerivativesEiPdS0_iS0_r&@__ZN13vtkPolyVertex11TriangulateEiP9vtkIdListP9vtkPointsr'@__ZN13vtkPolyVertex12CellBoundaryEiPdP9vtkIdListr'@__ZN13vtkPolyVertex16EvaluateLocationERiPdS1_S1_r'@__ZN13vtkPolyVertex16EvaluatePositionEPdS0_RiS0_RdS0_r'@__ZN13vtkPolyVertex17IntersectWithLineEPdS0_dRdS0_S0_Rir'@__ZN13vtkPolyVertex19GetParametricCenterEPdr'@__ZN13vtkPolyVertex3NewEvr'@__ZN13vtkPolyVertex4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir'@__ZN13vtkPolyVertex7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r'@__ZN13vtkPolyhedron10InitializeEvr'@__ZN13vtkPolyhedron11DerivativesEiPdS0_iS0_r'@__ZN13vtkPolyhedron11GetPolyDataEvr'@__ZN13vtkPolyhedron11TriangulateEiP9vtkIdListP9vtkPointsr'@__ZN13vtkPolyhedron12CellBoundaryEiPdP9vtkIdListr'@__ZN13vtkPolyhedron16EvaluateLocationERiPdS1_S1_r'@__ZN13vtkPolyhedron16EvaluatePositionEPdS0_RiS0_RdS0_r'@__ZN13vtkPolyhedron16GetNumberOfEdgesEvr(@__ZN13vtkPolyhedron16GetNumberOfFacesEvr(@__ZN13vtkPolyhedron17InterpolateDerivsEPdS0_r(@__ZN13vtkPolyhedron17IntersectWithLineEPdS0_dRdS0_S0_Rir(@__ZN13vtkPolyhedron19GetParametricCoordsEvr(@__ZN13vtkPolyhedron20InterpolateFunctionsEPdS0_r(@__ZN13vtkPolyhedron3NewEvr(@__ZN13vtkPolyhedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir(@__ZN13vtkPolyhedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r(@__ZN13vtkPolyhedron7GetEdgeEir(@__ZN13vtkPolyhedron7GetFaceEir(@__ZN13vtkPolyhedron8GetFacesEvr(@__ZN13vtkPolyhedron8IsConvexEvr(@__ZN13vtkPolyhedron8IsInsideEPddr(@__ZN13vtkPolyhedron8SetFacesEPxr(@__ZN13vtkPythonArgs10BuildTupleEPKdir(@__ZN13vtkPythonArgs10BuildTupleEPKiir)@__ZN13vtkPythonArgs10BuildTupleEPKjir)@__ZN13vtkPythonArgs10BuildTupleEPKxir)@__ZN13vtkPythonArgs10GetArgSizeEir)@__ZN13vtkPythonArgs11SetArgValueEiPKdir)@__ZN13vtkPythonArgs11SetArgValueEiPKhir)@__ZN13vtkPythonArgs11SetArgValueEiPKiir)@__ZN13vtkPythonArgs11SetArgValueEiPKxir)@__ZN13vtkPythonArgs11SetArgValueEibr)@__ZN13vtkPythonArgs11SetArgValueEidr)@__ZN13vtkPythonArgs11SetArgValueEiir)@__ZN13vtkPythonArgs11SetArgValueEijr)@__ZN13vtkPythonArgs11SetArgValueEilr)@__ZN13vtkPythonArgs11SetArgValueEitr)@__ZN13vtkPythonArgs11SetArgValueEixr)@__ZN13vtkPythonArgs12PrecondErrorEPKcr)@__ZN13vtkPythonArgs13ArgCountErrorEiPKcr*@__ZN13vtkPythonArgs13ArgCountErrorEiir*@__ZN13vtkPythonArgs13CheckSizeHintEillr*@__ZN13vtkPythonArgs16PureVirtualErrorEvr*@__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbr*@__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1_r*@__ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_objectr*@__ZN13vtkPythonArgs8GetArrayEPdir*@__ZN13vtkPythonArgs8GetArrayEPfir*@__ZN13vtkPythonArgs8GetArrayEPhir+@__ZN13vtkPythonArgs8GetArrayEPiir+@__ZN13vtkPythonArgs8GetArrayEPjir+@__ZN13vtkPythonArgs8GetArrayEPlir+@__ZN13vtkPythonArgs8GetArrayEPmir+@__ZN13vtkPythonArgs8GetArrayEPxir+@__ZN13vtkPythonArgs8GetValueERPcr+@__ZN13vtkPythonArgs8GetValueERbr+@__ZN13vtkPythonArgs8GetValueERdr+@__ZN13vtkPythonArgs8GetValueERfr+@__ZN13vtkPythonArgs8GetValueERhr+@__ZN13vtkPythonArgs8GetValueERir+@__ZN13vtkPythonArgs8GetValueERjr+@__ZN13vtkPythonArgs8GetValueERlr+@__ZN13vtkPythonArgs8GetValueERmr+@__ZN13vtkPythonArgs8GetValueERtr+@__ZN13vtkPythonArgs8GetValueERxr,@__ZN13vtkPythonArgs8SetArrayEiPKdir,@__ZN13vtkPythonArgs8SetArrayEiPKfir,@__ZN13vtkPythonArgs8SetArrayEiPKhir,@__ZN13vtkPythonArgs8SetArrayEiPKiir,@__ZN13vtkPythonArgs8SetArrayEiPKjir,@__ZN13vtkPythonArgs8SetArrayEiPKlir,@__ZN13vtkPythonArgs8SetArrayEiPKxir,@__ZN13vtkPythonArgs9GetBufferERPvP10bufferinfor,@__ZN13vtkPythonArgs9GetNArrayEPdiPKir,@__ZN13vtkPythonArgs9SetNArrayEiPKdiPKir,@__ZN13vtkPythonUtil12AddEnumToMapEP11_typeobjectr,@__ZN13vtkPythonUtil13ManglePointerEPKvPKcr,@__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBaser,@__ZN13vtkPythonUtil27GetPointerFromSpecialObjectEP7_objectPKcPS1_r,@__ZN14vtkBoundingBox11SetMaxPointEdddr,@__ZN14vtkBoundingBox11SetMinPointEdddr-@__ZN14vtkBoundingBox12IntersectBoxERKS_r-@__ZN14vtkBoundingBox14IntersectPlaneEPdS0_r-@__ZN14vtkBoundingBox5ScaleEPdr-@__ZN14vtkBoundingBox5ScaleEdddr-@__ZN14vtkBoundingBox6AddBoxERKS_r-@__ZN14vtkBoundingBox7InflateEdr-@__ZN14vtkBoundingBox7InflateEvr-@__ZN14vtkBoundingBox8AddPointEPdr-@__ZN14vtkBoundingBox8AddPointEdddr-@__ZN14vtkBoundingBox9AddBoundsEPKdr-@__ZN14vtkBoundingBox9SetBoundsEddddddr-@__ZN14vtkCellLocator12BuildLocatorEvr-@__ZN14vtkCellLocator16FindClosestPointEPdS0_P14vtkGenericCellRxRiRdr-@__ZN14vtkCellLocator17ForceBuildLocatorEvr-@__ZN14vtkCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCellr-@__ZN14vtkCellLocator18FindCellsAlongLineEPdS0_dP9vtkIdListr.@__ZN14vtkCellLocator18GetNumberOfBucketsEvr.@__ZN14vtkCellLocator19FreeSearchStructureEvr.@__ZN14vtkCellLocator20BuildLocatorIfNeededEvr.@__ZN14vtkCellLocator20BuildLocatorInternalEvr.@__ZN14vtkCellLocator21FindCellsWithinBoundsEPdP9vtkIdListr.@__ZN14vtkCellLocator22GenerateRepresentationEiP11vtkPolyDatar.@__ZN14vtkCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdS4_r.@__ZN14vtkCellLocator3NewEvr.@__ZN14vtkCellLocator8FindCellEPddP14vtkGenericCellS0_S0_r.@__ZN14vtkCellLocator8GetCellsEir.@__ZN14vtkGenericCell10InitializeEvr.@__ZN14vtkGenericCell11DerivativesEiPdS0_iS0_r.@__ZN14vtkGenericCell11GetCellTypeEvr.@__ZN14vtkGenericCell11SetCellTypeEir.@__ZN14vtkGenericCell11SetPointIdsEP9vtkIdListr.@__ZN14vtkGenericCell11ShallowCopyEP7vtkCellr/@__ZN14vtkGenericCell11TriangulateEiP9vtkIdListP9vtkPointsr/@__ZN14vtkGenericCell12CellBoundaryEiPdP9vtkIdListr/@__ZN14vtkGenericCell13IsPrimaryCellEvr/@__ZN14vtkGenericCell15InstantiateCellEir/@__ZN14vtkGenericCell16EvaluateLocationERiPdS1_S1_r/@__ZN14vtkGenericCell16EvaluatePositionEPdS0_RiS0_RdS0_r/@__ZN14vtkGenericCell16GetCellDimensionEvr/@__ZN14vtkGenericCell16GetNumberOfEdgesEvr/@__ZN14vtkGenericCell16GetNumberOfFacesEvr/@__ZN14vtkGenericCell17InterpolateDerivsEPdS0_r/@__ZN14vtkGenericCell17IntersectWithLineEPdS0_dRdS0_S0_Rir/@__ZN14vtkGenericCell19GetParametricCenterEPdr/@__ZN14vtkGenericCell19GetParametricCoordsEvr/@__ZN14vtkGenericCell20InterpolateFunctionsEPdS0_r/@__ZN14vtkGenericCell22RequiresInitializationEvr/@__ZN14vtkGenericCell34RequiresExplicitFaceRepresentationEvr0@__ZN14vtkGenericCell3NewEvr0@__ZN14vtkGenericCell4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir0@__ZN14vtkGenericCell7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r0@__ZN14vtkGenericCell7GetEdgeEir0@__ZN14vtkGenericCell7GetFaceEir0@__ZN14vtkGenericCell8DeepCopyEP7vtkCellr0@__ZN14vtkGenericCell8GetFacesEvr0@__ZN14vtkGenericCell8IsLinearEvr0@__ZN14vtkGenericCell8SetFacesEPxr0@__ZN14vtkGenericCell9SetPointsEP9vtkPointsr0@__ZN14vtkHyperOctree10InitializeEvr0@__ZN14vtkHyperOctree11GetCellTypeExr0@__ZN14vtkHyperOctree11GetLeafDataEvr0@__ZN14vtkHyperOctree11ShallowCopyEP13vtkDataObjectr0@__ZN14vtkHyperOctree12GetDimensionEvr0@__ZN14vtkHyperOctree12SetDimensionEir1@__ZN14vtkHyperOctree13CopyStructureEP10vtkDataSetr1@__ZN14vtkHyperOctree13GetCellPointsExP9vtkIdListr1@__ZN14vtkHyperOctree13GetCellPointsExRxRPxr1@__ZN14vtkHyperOctree13GetPointCellsExP9vtkIdListr1@__ZN14vtkHyperOctree13NewCellCursorEvr1@__ZN14vtkHyperOctree13SubdivideLeafEP20vtkHyperOctreeCursorr1@__ZN14vtkHyperOctree14GetMaxCellSizeEvr1@__ZN14vtkHyperOctree15GetPointsOnEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabberr1@__ZN14vtkHyperOctree15GetPointsOnFaceEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabberr1@__ZN14vtkHyperOctree15SetDualGridFlagEir1@__ZN14vtkHyperOctree16GetCellNeighborsExP9vtkIdListS1_r1@__ZN14vtkHyperOctree16GetNumberOfCellsEvr1@__ZN14vtkHyperOctree17GetDataObjectTypeEvr1@__ZN14vtkHyperOctree17GetNumberOfLeavesEvr1@__ZN14vtkHyperOctree17GetNumberOfLevelsEvr1@__ZN14vtkHyperOctree17GetNumberOfPointsEvr2@__ZN14vtkHyperOctree17GetPointsOnEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabberr2@__ZN14vtkHyperOctree19GetActualMemorySizeEvr2@__ZN14vtkHyperOctree20CollapseTerminalNodeEP20vtkHyperOctreeCursorr2@__ZN14vtkHyperOctree20GetMaxNumberOfPointsEir2@__ZN14vtkHyperOctree21GetPointsOnParentEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabberr2@__ZN14vtkHyperOctree22GetPointsOnParentFacesEPiiP20vtkHyperOctreeCursorP27vtkHyperOctreePointsGrabberr2@__ZN14vtkHyperOctree23GetPointsOnParentEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabberr2@__ZN14vtkHyperOctree29GetMaxNumberOfCellsOnBoundaryEir2@__ZN14vtkHyperOctree30GetMaxNumberOfPointsOnBoundaryEir2@__ZN14vtkHyperOctree3NewEvr2@__ZN14vtkHyperOctree5SIZESEvr2@__ZN14vtkHyperOctree6LEVELSEvr2@__ZN14vtkHyperOctree7GetCellExr2@__ZN14vtkHyperOctree7GetCellExP14vtkGenericCellr2@__ZN14vtkHyperOctree7GetDataEP14vtkInformationr2@__ZN14vtkHyperOctree7GetDataEP20vtkInformationVectorir3@__ZN14vtkHyperOctree8DeepCopyEP13vtkDataObjectr3@__ZN14vtkHyperOctree8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r3@__ZN14vtkHyperOctree8FindCellEPdP7vtkCellxdRiS0_S0_r3@__ZN14vtkHyperOctree8GetPointExr3@__ZN14vtkHyperOctree8GetPointExPdr3@__ZN14vtkHyperOctree9DIMENSIONEvr3@__ZN14vtkHyperOctree9FindPointEPdr3@__ZN14vtkImplicitSum11AddFunctionEP19vtkImplicitFunctiondr3@__ZN14vtkImplicitSum16EvaluateFunctionEPdr3@__ZN14vtkImplicitSum16EvaluateGradientEPdS0_r3@__ZN14vtkImplicitSum17SetFunctionWeightEP19vtkImplicitFunctiondr3@__ZN14vtkImplicitSum18RemoveAllFunctionsEvr3@__ZN14vtkImplicitSum3NewEvr3@__ZN14vtkImplicitSum8GetMTimeEvr3@__ZN14vtkMergePoints15IsInsertedPointEPKdr3@__ZN14vtkMergePoints17InsertUniquePointEPKdRxr4@__ZN14vtkMergePoints3NewEvr4@__ZN14vtkPerlinNoise16EvaluateFunctionEPdr4@__ZN14vtkPerlinNoise16EvaluateGradientEPdS0_r4@__ZN14vtkPerlinNoise3NewEvr4@__ZN14vtkPixelExtent10CellToNodeERKS_r4@__ZN14vtkPixelExtent10NodeToCellERKS_r4@__ZN14vtkPixelExtent4GrowERKS_S1_ir4@__ZN14vtkPixelExtent4GrowERKS_ir4@__ZN14vtkPixelExtent5ShiftEPiS0_r4@__ZN14vtkPixelExtent5ShiftEPiir4@__ZN14vtkPixelExtent6ShrinkERKS_S1_ir4@__ZN14vtkPixelExtent6ShrinkERKS_ir4@__ZN14vtkPixelExtent7GrowLowERKS_iir4@__ZN14vtkPixelExtent8GrowHighERKS_iir4@__ZN14vtkUniformGrid10BlankPointEiiir4@__ZN14vtkUniformGrid10BlankPointExr5@__ZN14vtkUniformGrid10InitializeEvr5@__ZN14vtkUniformGrid11GetCellTypeExr5@__ZN14vtkUniformGrid11UnBlankCellEiiir5@__ZN14vtkUniformGrid11UnBlankCellExr5@__ZN14vtkUniformGrid12UnBlankPointEiiir5@__ZN14vtkUniformGrid12UnBlankPointExr5@__ZN14vtkUniformGrid13CopyStructureEP10vtkDataSetr5@__ZN14vtkUniformGrid13IsCellVisibleExr5@__ZN14vtkUniformGrid14FindAndGetCellEPdP7vtkCellxdRiS0_S0_r5@__ZN14vtkUniformGrid14IsPointVisibleExr5@__ZN14vtkUniformGrid16HasAnyBlankCellsEvr5@__ZN14vtkUniformGrid16NewImageDataCopyEvr5@__ZN14vtkUniformGrid17HasAnyBlankPointsEvr5@__ZN14vtkUniformGrid18GetGridDescriptionEvr5@__ZN14vtkUniformGrid3NewEvr5@__ZN14vtkUniformGrid7GetCellEiiir6@__ZN14vtkUniformGrid7GetCellExr6@__ZN14vtkUniformGrid7GetCellExP14vtkGenericCellr6@__ZN14vtkUniformGrid7GetDataEP14vtkInformationr6@__ZN14vtkUniformGrid7GetDataEP20vtkInformationVectorir6@__ZN14vtkUniformGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r6@__ZN14vtkUniformGrid8FindCellEPdP7vtkCellxdRiS0_S0_r6@__ZN14vtkUniformGrid9BlankCellEiiir6@__ZN14vtkUniformGrid9BlankCellExr6@__ZN15vtkAMRUtilities10BlankCellsEP17vtkOverlappingAMRr6@__ZN15vtkAMRUtilities16StripGhostLayersEP17vtkOverlappingAMRS1_r6@__ZN15vtkAMRUtilities33HasPartiallyOverlappingGhostCellsEP17vtkOverlappingAMRr6@__ZN15vtkCellIterator16GetCellDimensionEvr6@__ZN15vtkCellIterator7GetCellEP14vtkGenericCellr6@__ZN15vtkImplicitHalo16EvaluateFunctionEPdr6@__ZN15vtkImplicitHalo16EvaluateGradientEPdS0_r6@__ZN15vtkImplicitHalo3NewEvr7@__ZN15vtkPointLocator10InitializeEvr7@__ZN15vtkPointLocator11InsertPointExPKdr7@__ZN15vtkPointLocator12BuildLocatorEvr7@__ZN15vtkPointLocator15InsertNextPointEPKdr7@__ZN15vtkPointLocator15IsInsertedPointEPKdr7@__ZN15vtkPointLocator16FindClosestPointEPKdr7@__ZN15vtkPointLocator17GetPointsInBucketEPKdPir7@__ZN15vtkPointLocator17InsertUniquePointEPKdRxr7@__ZN15vtkPointLocator18FindClosestNPointsEiPKdP9vtkIdListr7@__ZN15vtkPointLocator18InitPointInsertionEP9vtkPointsPKdr7@__ZN15vtkPointLocator18InitPointInsertionEP9vtkPointsPKdxr7@__ZN15vtkPointLocator19FreeSearchStructureEvr7@__ZN15vtkPointLocator21FindDistributedPointsEiPKdP9vtkIdListir7@__ZN15vtkPointLocator21FindDistributedPointsEidddP9vtkIdListir7@__ZN15vtkPointLocator22FindPointsWithinRadiusEdPKdP9vtkIdListr7@__ZN15vtkPointLocator22GenerateRepresentationEiP11vtkPolyDatar8@__ZN15vtkPointLocator24FindClosestInsertedPointEPKdr8@__ZN15vtkPointLocator28FindClosestPointWithinRadiusEdPKdRdr8@__ZN15vtkPointLocator28FindClosestPointWithinRadiusEdPKddRdr8@__ZN15vtkPointLocator3NewEvr8@__ZN15vtkSuperquadric15SetPhiRoundnessEdr8@__ZN15vtkSuperquadric16EvaluateFunctionEPdr8@__ZN15vtkSuperquadric16EvaluateGradientEPdS0_r8@__ZN15vtkSuperquadric17SetThetaRoundnessEdr8@__ZN15vtkSuperquadric3NewEvr8@__ZN15vtkTreeIterator14SetStartVertexExr8@__ZN15vtkTreeIterator4NextEvr8@__ZN15vtkTreeIterator7HasNextEvr8@__ZN15vtkTreeIterator7RestartEvr8@__ZN15vtkTreeIterator7SetTreeEP7vtkTreer8@__ZN16vtkDirectedGraph16IsStructureValidEP8vtkGraphr8@__ZN16vtkDirectedGraph3NewEvr9@__ZN16vtkDirectedGraph7GetDataEP14vtkInformationr9@__ZN16vtkDirectedGraph7GetDataEP20vtkInformationVectorir9@__ZN16vtkHyperTreeGrid10InitializeEvr9@__ZN16vtkHyperTreeGrid11GetCellTypeExr9@__ZN16vtkHyperTreeGrid11ORIENTATIONEvr9@__ZN16vtkHyperTreeGrid11SetGridSizeEPjr9@__ZN16vtkHyperTreeGrid11SetGridSizeEjjjr9@__ZN16vtkHyperTreeGrid11ShallowCopyEP13vtkDataObjectr9@__ZN16vtkHyperTreeGrid12GetChildMaskEjr9@__ZN16vtkHyperTreeGrid12SetDimensionEjr9@__ZN16vtkHyperTreeGrid13CopyStructureEP10vtkDataSetr9@__ZN16vtkHyperTreeGrid13GenerateTreesEvr9@__ZN16vtkHyperTreeGrid13GetCellPointsExP9vtkIdListr9@__ZN16vtkHyperTreeGrid13GetCellPointsExRxRPxr9@__ZN16vtkHyperTreeGrid13GetPointCellsExP9vtkIdListr9@__ZN16vtkHyperTreeGrid13NewGridCursorExbr:@__ZN16vtkHyperTreeGrid13SetGridExtentEPir:@__ZN16vtkHyperTreeGrid13SetGridExtentEiiiiiir:@__ZN16vtkHyperTreeGrid13SubdivideLeafEP18vtkHyperTreeCursorxr:@__ZN16vtkHyperTreeGrid14GetMaxCellSizeEvr:@__ZN16vtkHyperTreeGrid14SetOrientationEjr:@__ZN16vtkHyperTreeGrid15HasMaterialMaskEvr:@__ZN16vtkHyperTreeGrid15SetBranchFactorEjr:@__ZN16vtkHyperTreeGrid15SetMaterialMaskEP11vtkBitArrayr:@__ZN16vtkHyperTreeGrid15SetXCoordinatesEP12vtkDataArrayr:@__ZN16vtkHyperTreeGrid15SetYCoordinatesEP12vtkDataArrayr:@__ZN16vtkHyperTreeGrid15SetZCoordinatesEP12vtkDataArrayr:@__ZN16vtkHyperTreeGrid16GetCellNeighborsExP9vtkIdListS1_r:@__ZN16vtkHyperTreeGrid16GetNumberOfCellsEvr:@__ZN16vtkHyperTreeGrid16GetNumberOfTreesEvr:@__ZN16vtkHyperTreeGrid17GetDataObjectTypeEvr:@__ZN16vtkHyperTreeGrid17GetNumberOfLeavesEvr;@__ZN16vtkHyperTreeGrid17GetNumberOfLevelsEvr;@__ZN16vtkHyperTreeGrid17GetNumberOfLevelsExr;@__ZN16vtkHyperTreeGrid17GetNumberOfPointsEvr;@__ZN16vtkHyperTreeGrid18NewGeometricCursorExbr;@__ZN16vtkHyperTreeGrid19GetActualMemorySizeEvr;@__ZN16vtkHyperTreeGrid19GetNumberOfVerticesEvr;@__ZN16vtkHyperTreeGrid19GetPureMaterialMaskEvr;@__ZN16vtkHyperTreeGrid19NewMooreSuperCursorExbr;@__ZN16vtkHyperTreeGrid20SetMaterialMaskIndexEP14vtkIdTypeArrayr;@__ZN16vtkHyperTreeGrid24GetShiftedLevelZeroIndexExiiir;@__ZN16vtkHyperTreeGrid24NewVonNeumannSuperCursorExbr;@__ZN16vtkHyperTreeGrid32GetIndexFromLevelZeroCoordinatesERxjjjr;@__ZN16vtkHyperTreeGrid32GetLevelZeroCoordinatesFromIndexExRjS0_S0_r;@__ZN16vtkHyperTreeGrid37RecursivelyInitializePureMaterialMaskEP22vtkHyperTreeGridCursorr;@__ZN16vtkHyperTreeGrid3NewEvr;@__ZN16vtkHyperTreeGrid5SIZESEvr<@__ZN16vtkHyperTreeGrid6LEVELSEvr<@__ZN16vtkHyperTreeGrid7GetCellExr<@__ZN16vtkHyperTreeGrid7GetCellExP14vtkGenericCellr<@__ZN16vtkHyperTreeGrid7GetDataEP14vtkInformationr<@__ZN16vtkHyperTreeGrid7GetDataEP20vtkInformationVectorir<@__ZN16vtkHyperTreeGrid7GetTreeExr<@__ZN16vtkHyperTreeGrid7SetTreeExP12vtkHyperTreer<@__ZN16vtkHyperTreeGrid8DeepCopyEP13vtkDataObjectr<@__ZN16vtkHyperTreeGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r<@__ZN16vtkHyperTreeGrid8FindCellEPdP7vtkCellxdRiS0_S0_r<@__ZN16vtkHyperTreeGrid8GetPointExr<@__ZN16vtkHyperTreeGrid8GetPointExPdr<@__ZN16vtkHyperTreeGrid9DIMENSIONEvr<@__ZN16vtkHyperTreeGrid9FindPointEPdr<@__ZN16vtkHyperTreeGrid9NewCursorExbr<@__ZN16vtkLagrangeCurve10InitializeEvr=@__ZN16vtkLagrangeCurve11DerivativesEiPdS0_iS0_r=@__ZN16vtkLagrangeCurve11TriangulateEiP9vtkIdListP9vtkPointsr=@__ZN16vtkLagrangeCurve12CellBoundaryEiPdP9vtkIdListr=@__ZN16vtkLagrangeCurve16EvaluateLocationERiPdS1_S1_r=@__ZN16vtkLagrangeCurve16EvaluatePositionEPdS0_RiS0_RdS0_r=@__ZN16vtkLagrangeCurve17InterpolateDerivsEPdS0_r=@__ZN16vtkLagrangeCurve17IntersectWithLineEPdS0_dRdS0_S0_Rir=@__ZN16vtkLagrangeCurve17PointIndexFromIJKEiiir=@__ZN16vtkLagrangeCurve19GetParametricCoordsEvr=@__ZN16vtkLagrangeCurve20InterpolateFunctionsEPdS0_r=@__ZN16vtkLagrangeCurve21GetParametricDistanceEPdr=@__ZN16vtkLagrangeCurve24SubCellCoordinatesFromIdER11vtkVector3iir=@__ZN16vtkLagrangeCurve24SubCellCoordinatesFromIdERiir=@__ZN16vtkLagrangeCurve27TransformApproxToCellParamsEiPdr=@__ZN16vtkLagrangeCurve3NewEvr=@__ZN16vtkLagrangeCurve4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir>@__ZN16vtkLagrangeCurve7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r>@__ZN16vtkLagrangeCurve8GetOrderEvr>@__ZN16vtkLagrangeTetra10InitializeEvr>@__ZN16vtkLagrangeTetra11DerivativesEiPdS0_iS0_r>@__ZN16vtkLagrangeTetra11TriangulateEiP9vtkIdListP9vtkPointsr>@__ZN16vtkLagrangeTetra12CellBoundaryEiPdP9vtkIdListr>@__ZN16vtkLagrangeTetra12ComputeOrderEvr>@__ZN16vtkLagrangeTetra16BarycentricIndexExPxxr>@__ZN16vtkLagrangeTetra16EvaluateLocationERiPdS1_S1_r>@__ZN16vtkLagrangeTetra16EvaluatePositionEPdS0_RiS0_RdS0_r>@__ZN16vtkLagrangeTetra17InterpolateDerivsEPdS0_r>@__ZN16vtkLagrangeTetra17IntersectWithLineEPdS0_dRdS0_S0_Rir>@__ZN16vtkLagrangeTetra18ToBarycentricIndexExPxr>@__ZN16vtkLagrangeTetra19GetParametricCenterEPdr>@__ZN16vtkLagrangeTetra19GetParametricCoordsEvr>@__ZN16vtkLagrangeTetra20InterpolateFunctionsEPdS0_r?@__ZN16vtkLagrangeTetra21GetParametricDistanceEPdr?@__ZN16vtkLagrangeTetra3NewEvr?@__ZN16vtkLagrangeTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir?@__ZN16vtkLagrangeTetra5IndexEPKxxr?@__ZN16vtkLagrangeTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r?@__ZN16vtkLagrangeTetra7GetEdgeEir?@__ZN16vtkLagrangeTetra7GetFaceEir?@__ZN16vtkLagrangeTetra7ToIndexEPKxr?@__ZN16vtkLagrangeWedge10InitializeEvr?@__ZN16vtkLagrangeWedge11DerivativesEiPdS0_iS0_r?@__ZN16vtkLagrangeWedge11TriangulateEiP9vtkIdListP9vtkPointsr?@__ZN16vtkLagrangeWedge12CellBoundaryEiPdP9vtkIdListr?@__ZN16vtkLagrangeWedge16EvaluateLocationERiPdS1_S1_r?@__ZN16vtkLagrangeWedge16EvaluatePositionEPdS0_RiS0_RdS0_r?@__ZN16vtkLagrangeWedge17InterpolateDerivsEPdS0_r?@__ZN16vtkLagrangeWedge17IntersectWithLineEPdS0_dRdS0_S0_Rir@@__ZN16vtkLagrangeWedge17PointIndexFromIJKEiiir@@__ZN16vtkLagrangeWedge17PointIndexFromIJKEiiiPKir@@__ZN16vtkLagrangeWedge19GetParametricCoordsEvr@@__ZN16vtkLagrangeWedge20InterpolateFunctionsEPdS0_r@@__ZN16vtkLagrangeWedge21GetParametricDistanceEPdr@@__ZN16vtkLagrangeWedge24SubCellCoordinatesFromIdER11vtkVector3iir@@__ZN16vtkLagrangeWedge24SubCellCoordinatesFromIdERiS0_S0_ir@@__ZN16vtkLagrangeWedge25TransformFaceToCellParamsEiPdr@@__ZN16vtkLagrangeWedge27TransformApproxToCellParamsEiPdr@@__ZN16vtkLagrangeWedge30GetNumberOfApproximatingWedgesEPKir@@__ZN16vtkLagrangeWedge3NewEvr@@__ZN16vtkLagrangeWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@@__ZN16vtkLagrangeWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@@__ZN16vtkLagrangeWedge7GetEdgeEir@@__ZN16vtkLagrangeWedge7GetFaceEir@@__ZN16vtkLagrangeWedge8GetOrderEvrA@__ZN16vtkPixelTransfer4BlitERK14vtkPixelExtentS2_S2_S2_iiPviiS3_rA@__ZN16vtkQuadraticEdge11DerivativesEiPdS0_iS0_rA@__ZN16vtkQuadraticEdge11TriangulateEiP9vtkIdListP9vtkPointsrA@__ZN16vtkQuadraticEdge12CellBoundaryEiPdP9vtkIdListrA@__ZN16vtkQuadraticEdge16EvaluateLocationERiPdS1_S1_rA@__ZN16vtkQuadraticEdge16EvaluatePositionEPdS0_RiS0_RdS0_rA@__ZN16vtkQuadraticEdge17IntersectWithLineEPdS0_dRdS0_S0_RirA@__ZN16vtkQuadraticEdge19GetParametricCoordsEvrA@__ZN16vtkQuadraticEdge19InterpolationDerivsEPdS0_rA@__ZN16vtkQuadraticEdge22InterpolationFunctionsEPdS0_rA@__ZN16vtkQuadraticEdge3NewEvrA@__ZN16vtkQuadraticEdge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irA@__ZN16vtkQuadraticEdge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rA@__ZN16vtkQuadraticQuad11DerivativesEiPdS0_iS0_rA@__ZN16vtkQuadraticQuad11TriangulateEiP9vtkIdListP9vtkPointsrA@__ZN16vtkQuadraticQuad12CellBoundaryEiPdP9vtkIdListrB@__ZN16vtkQuadraticQuad16EvaluateLocationERiPdS1_S1_rB@__ZN16vtkQuadraticQuad16EvaluatePositionEPdS0_RiS0_RdS0_rB@__ZN16vtkQuadraticQuad17IntersectWithLineEPdS0_dRdS0_S0_RirB@__ZN16vtkQuadraticQuad19GetParametricCoordsEvrB@__ZN16vtkQuadraticQuad19InterpolationDerivsEPdS0_rB@__ZN16vtkQuadraticQuad22InterpolationFunctionsEPdS0_rB@__ZN16vtkQuadraticQuad3NewEvrB@__ZN16vtkQuadraticQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irB@__ZN16vtkQuadraticQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rB@__ZN16vtkQuadraticQuad7GetEdgeEirB@__ZN16vtkSelectionNode10FIELD_TYPEEvrB@__ZN16vtkSelectionNode10InitializeEvrB@__ZN16vtkSelectionNode10PROCESS_IDEvrB@__ZN16vtkSelectionNode11PIXEL_COUNTEvrB@__ZN16vtkSelectionNode11ShallowCopyEPS_rB@__ZN16vtkSelectionNode12CONTENT_TYPEEvrC@__ZN16vtkSelectionNode12GetFieldTypeEvrC@__ZN16vtkSelectionNode12SetFieldTypeEirC@__ZN16vtkSelectionNode14GetContentTypeEvrC@__ZN16vtkSelectionNode14SetContentTypeEirC@__ZN16vtkSelectionNode15COMPOSITE_INDEXEvrC@__ZN16vtkSelectionNode15EqualPropertiesEPS_brC@__ZN16vtkSelectionNode16COMPONENT_NUMBEREvrC@__ZN16vtkSelectionNode16CONTAINING_CELLSEvrC@__ZN16vtkSelectionNode16GetSelectionListEvrC@__ZN16vtkSelectionNode16INDEXED_VERTICESEvrC@__ZN16vtkSelectionNode16SetSelectionDataEP20vtkDataSetAttributesrC@__ZN16vtkSelectionNode16SetSelectionListEP16vtkAbstractArrayrC@__ZN16vtkSelectionNode18HIERARCHICAL_INDEXEvrC@__ZN16vtkSelectionNode18HIERARCHICAL_LEVELEvrC@__ZN16vtkSelectionNode18UnionSelectionListEPS_rC@__ZN16vtkSelectionNode21SubtractSelectionListEPS_rD@__ZN16vtkSelectionNode36ConvertAttributeTypeToSelectionFieldEirD@__ZN16vtkSelectionNode36ConvertSelectionFieldToAttributeTypeEirD@__ZN16vtkSelectionNode3NewEvrD@__ZN16vtkSelectionNode4PROPEvrD@__ZN16vtkSelectionNode6SOURCEEvrD@__ZN16vtkSelectionNode7EPSILONEvrD@__ZN16vtkSelectionNode7INVERSEEvrD@__ZN16vtkSelectionNode7PROP_IDEvrD@__ZN16vtkSelectionNode8DeepCopyEPS_rD@__ZN16vtkSelectionNode8GetMTimeEvrD@__ZN16vtkSelectionNode9SOURCE_IDEvrD@__ZN16vtkSortFieldData3NewEvrD@__ZN16vtkSortFieldData4SortEP12vtkFieldDataPKciiirD@__ZN16vtkTriangleStrip11DerivativesEiPdS0_iS0_rD@__ZN16vtkTriangleStrip11TriangulateEiP9vtkIdListP9vtkPointsrD@__ZN16vtkTriangleStrip12CellBoundaryEiPdP9vtkIdListrE@__ZN16vtkTriangleStrip14DecomposeStripEiPxP12vtkCellArrayrE@__ZN16vtkTriangleStrip16EvaluateLocationERiPdS1_S1_rE@__ZN16vtkTriangleStrip16EvaluatePositionEPdS0_RiS0_RdS0_rE@__ZN16vtkTriangleStrip17IntersectWithLineEPdS0_dRdS0_S0_RirE@__ZN16vtkTriangleStrip19GetParametricCenterEPdrE@__ZN16vtkTriangleStrip3NewEvrE@__ZN16vtkTriangleStrip4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irE@__ZN16vtkTriangleStrip7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rE@__ZN16vtkTriangleStrip7GetEdgeEirE@__ZN17vtkAMRInformation10GetParentsEjjRjrE@__ZN17vtkAMRInformation10GetSpacingEjPdrE@__ZN17vtkAMRInformation10HasSpacingEjrE@__ZN17vtkAMRInformation10InitializeEiPKirE@__ZN17vtkAMRInformation10SetSpacingEjPKdrE@__ZN17vtkAMRInformation11GetChildrenEjjRjrE@__ZN17vtkAMRInformation16ComputeIndexPairEjRjS0_rF@__ZN17vtkAMRInformation18HasRefinementRatioEvrF@__ZN17vtkAMRInformation18SetGridDescriptionEirF@__ZN17vtkAMRInformation18SetRefinementRatioEjirF@__ZN17vtkAMRInformation20PrintParentChildInfoEjjrF@__ZN17vtkAMRInformation22GetAMRBlockSourceIndexEirF@__ZN17vtkAMRInformation22HasChildrenInformationEvrF@__ZN17vtkAMRInformation22SetAMRBlockSourceIndexEiirF@__ZN17vtkAMRInformation23GenerateRefinementRatioEvrF@__ZN17vtkAMRInformation30GenerateParentChildInformationEvrF@__ZN17vtkAMRInformation3NewEvrF@__ZN17vtkAMRInformation5AuditEvrF@__ZN17vtkAMRInformation8DeepCopyEPS_rF@__ZN17vtkAMRInformation8FindCellEPdjjRirF@__ZN17vtkAMRInformation8FindGridEPdRjS1_rF@__ZN17vtkAMRInformation8FindGridEPdiRjrF@__ZN17vtkAMRInformation9GetBoundsEjjPdrG@__ZN17vtkAMRInformation9GetBoundsEvrG@__ZN17vtkAMRInformation9GetOriginEPdrG@__ZN17vtkAMRInformation9GetOriginEjjPdrG@__ZN17vtkAMRInformation9GetOriginEvrG@__ZN17vtkAMRInformation9SetAMRBoxEjjRK9vtkAMRBoxrG@__ZN17vtkAMRInformation9SetOriginEPKdrG@__ZN17vtkAnimationScene11SetTimeModeEirG@__ZN17vtkAnimationScene13RemoveAllCuesEvrG@__ZN17vtkAnimationScene15GetNumberOfCuesEvrG@__ZN17vtkAnimationScene16SetAnimationTimeEdrG@__ZN17vtkAnimationScene3NewEvrG@__ZN17vtkAnimationScene4PlayEvrG@__ZN17vtkAnimationScene4StopEvrG@__ZN17vtkAnimationScene6AddCueEP15vtkAnimationCuerG@__ZN17vtkAnimationScene9RemoveCueEP15vtkAnimationCuerG@__ZN17vtkConvexPointSet10InitializeEvrH@__ZN17vtkConvexPointSet11DerivativesEiPdS0_iS0_rH@__ZN17vtkConvexPointSet11TriangulateEiP9vtkIdListP9vtkPointsrH@__ZN17vtkConvexPointSet12CellBoundaryEiPdP9vtkIdListrH@__ZN17vtkConvexPointSet16EvaluateLocationERiPdS1_S1_rH@__ZN17vtkConvexPointSet16EvaluatePositionEPdS0_RiS0_RdS0_rH@__ZN17vtkConvexPointSet16GetNumberOfFacesEvrH@__ZN17vtkConvexPointSet17InterpolateDerivsEPdS0_rH@__ZN17vtkConvexPointSet17IntersectWithLineEPdS0_dRdS0_S0_RirH@__ZN17vtkConvexPointSet19GetParametricCoordsEvrH@__ZN17vtkConvexPointSet20InterpolateFunctionsEPdS0_rH@__ZN17vtkConvexPointSet3NewEvrH@__ZN17vtkConvexPointSet4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irH@__ZN17vtkConvexPointSet7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rH@__ZN17vtkConvexPointSet7GetFaceEirH@__ZN17vtkDataObjectTree10GetDataSetEP24vtkCompositeDataIteratorrH@__ZN17vtkDataObjectTree10InitializeEvrI@__ZN17vtkDataObjectTree10SetDataSetEP24vtkCompositeDataIteratorP13vtkDataObjectrI@__ZN17vtkDataObjectTree11GetMetaDataEP24vtkCompositeDataIteratorrI@__ZN17vtkDataObjectTree11HasMetaDataEP24vtkCompositeDataIteratorrI@__ZN17vtkDataObjectTree11NewIteratorEvrI@__ZN17vtkDataObjectTree11ShallowCopyEP13vtkDataObjectrI@__ZN17vtkDataObjectTree13CopyStructureEP19vtkCompositeDataSetrI@__ZN17vtkDataObjectTree14SetDataSetFromEP25vtkDataObjectTreeIteratorP13vtkDataObjectrI@__ZN17vtkDataObjectTree15NewTreeIteratorEvrI@__ZN17vtkDataObjectTree16GetChildMetaDataEjrI@__ZN17vtkDataObjectTree16HasChildMetaDataEjrI@__ZN17vtkDataObjectTree17GetNumberOfPointsEvrI@__ZN17vtkDataObjectTree19GetActualMemorySizeEvrI@__ZN17vtkDataObjectTree7GetDataEP14vtkInformationrI@__ZN17vtkDataObjectTree7GetDataEP20vtkInformationVectorirI@__ZN17vtkDataObjectTree8DeepCopyEP13vtkDataObjectrI@__ZN17vtkGenericDataSet12GetCellTypesEP12vtkCellTypesrJ@__ZN17vtkGenericDataSet14SetTessellatorEP25vtkGenericCellTessellatorrJ@__ZN17vtkGenericDataSet17GetDataObjectTypeEvrJ@__ZN17vtkGenericDataSet19GetActualMemorySizeEvrJ@__ZN17vtkGenericDataSet7GetDataEP14vtkInformationrJ@__ZN17vtkGenericDataSet7GetDataEP20vtkInformationVectorirJ@__ZN17vtkGenericDataSet8GetMTimeEvrJ@__ZN17vtkGenericDataSet9GetBoundsEPdrJ@__ZN17vtkGenericDataSet9GetBoundsEvrJ@__ZN17vtkGenericDataSet9GetCenterEPdrJ@__ZN17vtkGenericDataSet9GetCenterEvrJ@__ZN17vtkGenericDataSet9GetLengthEvrJ@__ZN17vtkGraphInternals3NewEvrJ@__ZN17vtkHexagonalPrism11DerivativesEiPdS0_iS0_rJ@__ZN17vtkHexagonalPrism11TriangulateEiP9vtkIdListP9vtkPointsrJ@__ZN17vtkHexagonalPrism12CellBoundaryEiPdP9vtkIdListrJ@__ZN17vtkHexagonalPrism12GetEdgeArrayEirK@__ZN17vtkHexagonalPrism12GetFaceArrayEirK@__ZN17vtkHexagonalPrism13GetEdgePointsEiRPirK@__ZN17vtkHexagonalPrism13GetFacePointsEiRPirK@__ZN17vtkHexagonalPrism16EvaluateLocationERiPdS1_S1_rK@__ZN17vtkHexagonalPrism16EvaluatePositionEPdS0_RiS0_RdS0_rK@__ZN17vtkHexagonalPrism17IntersectWithLineEPdS0_dRdS0_S0_RirK@__ZN17vtkHexagonalPrism19GetParametricCoordsEvrK@__ZN17vtkHexagonalPrism19InterpolationDerivsEPdS0_rK@__ZN17vtkHexagonalPrism22InterpolationFunctionsEPdS0_rK@__ZN17vtkHexagonalPrism3NewEvrK@__ZN17vtkHexagonalPrism7GetEdgeEirK@__ZN17vtkHexagonalPrism7GetFaceEirK@__ZN17vtkImplicitVolume16EvaluateFunctionEPdrK@__ZN17vtkImplicitVolume16EvaluateGradientEPdS0_rK@__ZN17vtkImplicitVolume3NewEvrK@__ZN17vtkImplicitVolume8GetMTimeEvrL@__ZN17vtkImplicitVolume9SetVolumeEP12vtkImageDatarL@__ZN17vtkInEdgeIterator10InitializeEP8vtkGraphxrL@__ZN17vtkInEdgeIterator13NextGraphEdgeEvrL@__ZN17vtkInEdgeIterator3NewEvrL@__ZN17vtkOStreamWrapperlsEPKcrL@__ZN17vtkOStreamWrapperlsEPvrL@__ZN17vtkOStreamWrapperlsEirL@__ZN17vtkOverlappingAMR10GetParentsEjjRjrL@__ZN17vtkOverlappingAMR10GetSpacingEjPdrL@__ZN17vtkOverlappingAMR10SetSpacingEjPKdrL@__ZN17vtkOverlappingAMR11GetChildrenEjjRjrL@__ZN17vtkOverlappingAMR11NewIteratorEvrL@__ZN17vtkOverlappingAMR18GetRefinementRatioEP24vtkCompositeDataIteratorrL@__ZN17vtkOverlappingAMR18GetRefinementRatioEjrL@__ZN17vtkOverlappingAMR18SetRefinementRatioEjirL@__ZN17vtkOverlappingAMR20PrintParentChildInfoEjjrM@__ZN17vtkOverlappingAMR22GetAMRBlockSourceIndexEjjrM@__ZN17vtkOverlappingAMR22HasChildrenInformationEvrM@__ZN17vtkOverlappingAMR22SetAMRBlockSourceIndexEjjirM@__ZN17vtkOverlappingAMR24NUMBER_OF_BLANKED_POINTSEvrM@__ZN17vtkOverlappingAMR30GenerateParentChildInformationEvrM@__ZN17vtkOverlappingAMR3NewEvrM@__ZN17vtkOverlappingAMR5AuditEvrM@__ZN17vtkOverlappingAMR8FindGridEPdRjS1_rM@__ZN17vtkOverlappingAMR9GetAMRBoxEjjrM@__ZN17vtkOverlappingAMR9GetBoundsEjjPdrM@__ZN17vtkOverlappingAMR9GetOriginEjjPdrM@__ZN17vtkOverlappingAMR9GetOriginEvrM@__ZN17vtkOverlappingAMR9SetAMRBoxEjjRK9vtkAMRBoxrM@__ZN17vtkOverlappingAMR9SetOriginEPKdrM@__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3_rM@__ZN17vtkQuadraticTetra11DerivativesEiPdS0_iS0_rN@__ZN17vtkQuadraticTetra11TriangulateEiP9vtkIdListP9vtkPointsrN@__ZN17vtkQuadraticTetra12CellBoundaryEiPdP9vtkIdListrN@__ZN17vtkQuadraticTetra12GetEdgeArrayEirN@__ZN17vtkQuadraticTetra12GetFaceArrayEirN@__ZN17vtkQuadraticTetra16EvaluateLocationERiPdS1_S1_rN@__ZN17vtkQuadraticTetra16EvaluatePositionEPdS0_RiS0_RdS0_rN@__ZN17vtkQuadraticTetra17IntersectWithLineEPdS0_dRdS0_S0_RirN@__ZN17vtkQuadraticTetra19GetParametricCenterEPdrN@__ZN17vtkQuadraticTetra19GetParametricCoordsEvrN@__ZN17vtkQuadraticTetra19InterpolationDerivsEPdS0_rN@__ZN17vtkQuadraticTetra21GetParametricDistanceEPdrN@__ZN17vtkQuadraticTetra22InterpolationFunctionsEPdS0_rN@__ZN17vtkQuadraticTetra3NewEvrN@__ZN17vtkQuadraticTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irN@__ZN17vtkQuadraticTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rN@__ZN17vtkQuadraticTetra7GetEdgeEirO@__ZN17vtkQuadraticTetra7GetFaceEirO@__ZN17vtkQuadraticWedge11DerivativesEiPdS0_iS0_rO@__ZN17vtkQuadraticWedge11TriangulateEiP9vtkIdListP9vtkPointsrO@__ZN17vtkQuadraticWedge12CellBoundaryEiPdP9vtkIdListrO@__ZN17vtkQuadraticWedge12GetEdgeArrayEirO@__ZN17vtkQuadraticWedge12GetFaceArrayEirO@__ZN17vtkQuadraticWedge16EvaluateLocationERiPdS1_S1_rO@__ZN17vtkQuadraticWedge16EvaluatePositionEPdS0_RiS0_RdS0_rO@__ZN17vtkQuadraticWedge17IntersectWithLineEPdS0_dRdS0_S0_RirO@__ZN17vtkQuadraticWedge19GetParametricCoordsEvrO@__ZN17vtkQuadraticWedge19InterpolationDerivsEPdS0_rO@__ZN17vtkQuadraticWedge22InterpolationFunctionsEPdS0_rO@__ZN17vtkQuadraticWedge3NewEvrO@__ZN17vtkQuadraticWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irO@__ZN17vtkQuadraticWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rO@__ZN17vtkQuadraticWedge7GetEdgeEirP@__ZN17vtkQuadraticWedge7GetFaceEirP@__ZN17vtkStructuredData13GetCellPointsExP9vtkIdListiPirP@__ZN17vtkStructuredData13GetPointCellsExP9vtkIdListPirP@__ZN17vtkStructuredData13SetDimensionsEPiS0_rP@__ZN17vtkStructuredData16GetCellNeighborsExP9vtkIdListS1_PirP@__ZN17vtkStructuredData16GetCellNeighborsExP9vtkIdListS1_PiS2_rP@__ZN17vtkStructuredData16GetDataDimensionEPirP@__ZN17vtkStructuredData16GetDataDimensionEirP@__ZN17vtkStructuredData18GetDataDescriptionEPirP@__ZN17vtkStructuredData28GetDataDescriptionFromExtentEPirP@__ZN17vtkStructuredData9SetExtentEPiS0_rP@__ZN17vtkStructuredGrid10BlankPointExrP@__ZN17vtkStructuredGrid10InitializeEvrP@__ZN17vtkStructuredGrid11GetCellDimsEPirP@__ZN17vtkStructuredGrid11GetCellTypeExrP@__ZN17vtkStructuredGrid11ShallowCopyEP13vtkDataObjectrQ@__ZN17vtkStructuredGrid11UnBlankCellExrQ@__ZN17vtkStructuredGrid12UnBlankPointExrQ@__ZN17vtkStructuredGrid13CopyStructureEP10vtkDataSetrQ@__ZN17vtkStructuredGrid13GetCellBoundsExPdrQ@__ZN17vtkStructuredGrid13GetCellPointsExP9vtkIdListrQ@__ZN17vtkStructuredGrid13GetDimensionsEPirQ@__ZN17vtkStructuredGrid13GetDimensionsEvrQ@__ZN17vtkStructuredGrid13IsCellVisibleExrQ@__ZN17vtkStructuredGrid13SetDimensionsEPirQ@__ZN17vtkStructuredGrid13SetDimensionsEiiirQ@__ZN17vtkStructuredGrid14IsPointVisibleExrQ@__ZN17vtkStructuredGrid16GetCellNeighborsExP9vtkIdListS1_rQ@__ZN17vtkStructuredGrid16GetCellNeighborsExP9vtkIdListS1_PirQ@__ZN17vtkStructuredGrid16HasAnyBlankCellsEvrQ@__ZN17vtkStructuredGrid17HasAnyBlankPointsEvrQ@__ZN17vtkStructuredGrid19GetActualMemorySizeEvrR@__ZN17vtkStructuredGrid3NewEvrR@__ZN17vtkStructuredGrid4CropEPKirR@__ZN17vtkStructuredGrid7GetCellEiiirR@__ZN17vtkStructuredGrid7GetCellExrR@__ZN17vtkStructuredGrid7GetCellExP14vtkGenericCellrR@__ZN17vtkStructuredGrid7GetDataEP14vtkInformationrR@__ZN17vtkStructuredGrid7GetDataEP20vtkInformationVectorirR@__ZN17vtkStructuredGrid8DeepCopyEP13vtkDataObjectrR@__ZN17vtkStructuredGrid8GetPointEiiiPdbrR@__ZN17vtkStructuredGrid9BlankCellExrR@__ZN17vtkStructuredGrid9SetExtentEPirR@__ZN17vtkStructuredGrid9SetExtentEiiiiiirR@__ZN17vtkUniformGridAMR10GetDataSetEP24vtkCompositeDataIteratorrR@__ZN17vtkUniformGridAMR10GetDataSetEjjrR@__ZN17vtkUniformGridAMR10InitializeEiPKirR@__ZN17vtkUniformGridAMR10InitializeEvrS@__ZN17vtkUniformGridAMR10SetAMRInfoEP17vtkAMRInformationrS@__ZN17vtkUniformGridAMR10SetDataSetEP24vtkCompositeDataIteratorP13vtkDataObjectrS@__ZN17vtkUniformGridAMR10SetDataSetEjjP14vtkUniformGridrS@__ZN17vtkUniformGridAMR11NewIteratorEvrS@__ZN17vtkUniformGridAMR11ShallowCopyEP13vtkDataObjectrS@__ZN17vtkUniformGridAMR13CopyStructureEP19vtkCompositeDataSetrS@__ZN17vtkUniformGridAMR16GetLevelAndIndexEjRjS0_rS@__ZN17vtkUniformGridAMR17GetCompositeIndexEjjrS@__ZN17vtkUniformGridAMR17GetNumberOfLevelsEvrS@__ZN17vtkUniformGridAMR18GetGridDescriptionEvrS@__ZN17vtkUniformGridAMR18SetGridDescriptionEirS@__ZN17vtkUniformGridAMR19GetNumberOfDataSetsEjrS@__ZN17vtkUniformGridAMR22GetTotalNumberOfBlocksEvrS@__ZN17vtkUniformGridAMR3NewEvrS@__ZN17vtkUniformGridAMR6GetMaxEPdrS@__ZN17vtkUniformGridAMR6GetMinEPdrT@__ZN17vtkUniformGridAMR7GetDataEP14vtkInformationrT@__ZN17vtkUniformGridAMR7GetDataEP20vtkInformationVectorirT@__ZN17vtkUniformGridAMR8DeepCopyEP13vtkDataObjectrT@__ZN17vtkUniformGridAMR9GetBoundsEPdrT@__ZN17vtkUniformGridAMR9GetBoundsEvrT@__ZN17vtkXMLDataElement12GetAttributeEPKcrT@__ZN17vtkXMLDataElement12SetAttributeEPKcS1_rT@__ZN17vtkXMLDataElement13LookupElementEPKcrT@__ZN17vtkXMLDataElement15RemoveAttributeEPKcrT@__ZN17vtkXMLDataElement15SetIntAttributeEPKcirT@__ZN17vtkXMLDataElement16AddNestedElementEPS_rT@__ZN17vtkXMLDataElement16GetAttributeNameEirT@__ZN17vtkXMLDataElement16GetNestedElementEirT@__ZN17vtkXMLDataElement16SetCharacterDataEPKcirT@__ZN17vtkXMLDataElement17FindNestedElementEPKcrT@__ZN17vtkXMLDataElement17GetAttributeValueEirU@__ZN17vtkXMLDataElement17SetFloatAttributeEPKcfrU@__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRdrU@__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRirU@__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRlrU@__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRxrU@__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPdrU@__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPirU@__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPlrU@__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPxrU@__ZN17vtkXMLDataElement18SetDoubleAttributeEPKcdrU@__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKdrU@__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKirU@__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKmrU@__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKxrU@__ZN17vtkXMLDataElement19RemoveAllAttributesEvrU@__ZN17vtkXMLDataElement19RemoveNestedElementEPS_rV@__ZN17vtkXMLDataElement20GetWordTypeAttributeEPKcRirV@__ZN17vtkXMLDataElement21LookupElementWithNameEPKcrV@__ZN17vtkXMLDataElement23RemoveAllNestedElementsEvrV@__ZN17vtkXMLDataElement24SetUnsignedLongAttributeEPKcmrV@__ZN17vtkXMLDataElement25FindNestedElementWithNameEPKcrV@__ZN17vtkXMLDataElement25GetNumberOfNestedElementsEvrV@__ZN17vtkXMLDataElement30FindNestedElementWithNameAndIdEPKcS1_rV@__ZN17vtkXMLDataElement37FindNestedElementWithNameAndAttributeEPKcS1_S1_rV@__ZN17vtkXMLDataElement3NewEvrV@__ZN17vtkXMLDataElement7GetRootEvrV@__ZN17vtkXMLDataElement7SetNameEPKcrV@__ZN17vtkXMLDataElement8DeepCopyEPS_rV@__ZN17vtkXMLDataElement8PrintXMLEPKcrV@__ZN17vtkXMLDataElement9GetParentEvrV@__ZN17vtkXMLDataElement9IsEqualToEPS_rV@__ZN17vtkXMLDataElement9SetParentEPS_rW@__ZN18vtkBiQuadraticQuad11DerivativesEiPdS0_iS0_rW@__ZN18vtkBiQuadraticQuad11TriangulateEiP9vtkIdListP9vtkPointsrW@__ZN18vtkBiQuadraticQuad12CellBoundaryEiPdP9vtkIdListrW@__ZN18vtkBiQuadraticQuad16EvaluateLocationERiPdS1_S1_rW@__ZN18vtkBiQuadraticQuad16EvaluatePositionEPdS0_RiS0_RdS0_rW@__ZN18vtkBiQuadraticQuad17IntersectWithLineEPdS0_dRdS0_S0_RirW@__ZN18vtkBiQuadraticQuad19GetParametricCoordsEvrW@__ZN18vtkBiQuadraticQuad26InterpolationDerivsPrivateEPdS0_rW@__ZN18vtkBiQuadraticQuad29InterpolationFunctionsPrivateEPdS0_rW@__ZN18vtkBiQuadraticQuad3NewEvrW@__ZN18vtkBiQuadraticQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irW@__ZN18vtkBiQuadraticQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rW@__ZN18vtkBiQuadraticQuad7GetEdgeEirW@__ZN18vtkDataObjectTypes13NewDataObjectEPKcrW@__ZN18vtkDataObjectTypes13NewDataObjectEirW@__ZN18vtkDataObjectTypes22GetClassNameFromTypeIdEirX@__ZN18vtkDataObjectTypes22GetTypeIdFromClassNameEPKcrX@__ZN18vtkDataObjectTypes3NewEvrX@__ZN18vtkImplicitBoolean11AddFunctionEP19vtkImplicitFunctionrX@__ZN18vtkImplicitBoolean14RemoveFunctionEP19vtkImplicitFunctionrX@__ZN18vtkImplicitBoolean16EvaluateFunctionEPdrX@__ZN18vtkImplicitBoolean16EvaluateGradientEPdS0_rX@__ZN18vtkImplicitBoolean3NewEvrX@__ZN18vtkImplicitBoolean8GetMTimeEvrX@__ZN18vtkImplicitDataSet10SetDataSetEP10vtkDataSetrX@__ZN18vtkImplicitDataSet16EvaluateFunctionEPdrX@__ZN18vtkImplicitDataSet16EvaluateGradientEPdS0_rX@__ZN18vtkImplicitDataSet3NewEvrX@__ZN18vtkImplicitDataSet8GetMTimeEvrX@__ZN18vtkOutEdgeIterator10InitializeEP8vtkGraphxrX@__ZN18vtkOutEdgeIterator13NextGraphEdgeEvrX@__ZN18vtkOutEdgeIterator3NewEvrY@__ZN18vtkPentagonalPrism11DerivativesEiPdS0_iS0_rY@__ZN18vtkPentagonalPrism11TriangulateEiP9vtkIdListP9vtkPointsrY@__ZN18vtkPentagonalPrism12CellBoundaryEiPdP9vtkIdListrY@__ZN18vtkPentagonalPrism12GetEdgeArrayEirY@__ZN18vtkPentagonalPrism12GetFaceArrayEirY@__ZN18vtkPentagonalPrism13GetEdgePointsEiRPirY@__ZN18vtkPentagonalPrism13GetFacePointsEiRPirY@__ZN18vtkPentagonalPrism16EvaluateLocationERiPdS1_S1_rY@__ZN18vtkPentagonalPrism16EvaluatePositionEPdS0_RiS0_RdS0_rY@__ZN18vtkPentagonalPrism17IntersectWithLineEPdS0_dRdS0_S0_RirY@__ZN18vtkPentagonalPrism19GetParametricCoordsEvrY@__ZN18vtkPentagonalPrism19InterpolationDerivsEPdS0_rY@__ZN18vtkPentagonalPrism22InterpolationFunctionsEPdS0_rY@__ZN18vtkPentagonalPrism3NewEvrY@__ZN18vtkPentagonalPrism7GetEdgeEirY@__ZN18vtkPentagonalPrism7GetFaceEirZ@__ZN18vtkPlaneCollection3NewEvrZ@__ZN18vtkRectilinearGrid10InitializeEvrZ@__ZN18vtkRectilinearGrid11GetCellTypeExrZ@__ZN18vtkRectilinearGrid11ShallowCopyEP13vtkDataObjectrZ@__ZN18vtkRectilinearGrid13ComputeBoundsEvrZ@__ZN18vtkRectilinearGrid13CopyStructureEP10vtkDataSetrZ@__ZN18vtkRectilinearGrid13GetCellBoundsExPdrZ@__ZN18vtkRectilinearGrid13SetDimensionsEPirZ@__ZN18vtkRectilinearGrid13SetDimensionsEiiirZ@__ZN18vtkRectilinearGrid14FindAndGetCellEPdP7vtkCellxdRiS0_S0_rZ@__ZN18vtkRectilinearGrid15SetXCoordinatesEP12vtkDataArrayrZ@__ZN18vtkRectilinearGrid15SetYCoordinatesEP12vtkDataArrayrZ@__ZN18vtkRectilinearGrid15SetZCoordinatesEP12vtkDataArrayrZ@__ZN18vtkRectilinearGrid16GetCellNeighborsExP9vtkIdListS1_rZ@__ZN18vtkRectilinearGrid19GetActualMemorySizeEvrZ@__ZN18vtkRectilinearGrid28ComputeStructuredCoordinatesEPdPiS0_r[@__ZN18vtkRectilinearGrid3NewEvr[@__ZN18vtkRectilinearGrid4CropEPKir[@__ZN18vtkRectilinearGrid7GetCellEiiir[@__ZN18vtkRectilinearGrid7GetCellExr[@__ZN18vtkRectilinearGrid7GetCellExP14vtkGenericCellr[@__ZN18vtkRectilinearGrid7GetDataEP14vtkInformationr[@__ZN18vtkRectilinearGrid7GetDataEP20vtkInformationVectorir[@__ZN18vtkRectilinearGrid8DeepCopyEP13vtkDataObjectr[@__ZN18vtkRectilinearGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_r[@__ZN18vtkRectilinearGrid8FindCellEPdP7vtkCellxdRiS0_S0_r[@__ZN18vtkRectilinearGrid8GetPointEiiiPdr[@__ZN18vtkRectilinearGrid8GetPointExr[@__ZN18vtkRectilinearGrid8GetPointExPdr[@__ZN18vtkRectilinearGrid9FindPointEPdr[@__ZN18vtkRectilinearGrid9GetPointsEP9vtkPointsr[@__ZN18vtkRectilinearGrid9SetExtentEPir\@__ZN18vtkRectilinearGrid9SetExtentEiiiiiir\@__ZN18vtkStaticCellLinks3NewEvr\@__ZN18vtkTreeBFSIterator3NewEvr\@__ZN18vtkTreeDFSIterator3NewEvr\@__ZN18vtkTreeDFSIterator7SetModeEir\@__ZN18vtkUndirectedGraph11GetInDegreeExr\@__ZN18vtkUndirectedGraph16IsStructureValidEP8vtkGraphr\@__ZN18vtkUndirectedGraph3NewEvr\@__ZN18vtkUndirectedGraph7GetDataEP14vtkInformationr\@__ZN18vtkUndirectedGraph7GetDataEP20vtkInformationVectorir\@__ZN18vtkUndirectedGraph9GetInEdgeExxr\@__ZN19vtkAMRDataInternals10GetDataSetEjr\@__ZN19vtkAMRDataInternals10InitializeEvr\@__ZN19vtkAMRDataInternals11ShallowCopyEP9vtkObjectr\@__ZN19vtkAMRDataInternals3NewEvr\@__ZN19vtkAMRDataInternals6InsertEjP14vtkUniformGridr]@__ZN19vtkAnnotationLayers10InitializeEvr]@__ZN19vtkAnnotationLayers11ShallowCopyEP13vtkDataObjectr]@__ZN19vtkAnnotationLayers13AddAnnotationEP13vtkAnnotationr]@__ZN19vtkAnnotationLayers13GetAnnotationEjr]@__ZN19vtkAnnotationLayers16RemoveAnnotationEP13vtkAnnotationr]@__ZN19vtkAnnotationLayers19GetCurrentSelectionEvr]@__ZN19vtkAnnotationLayers19SetCurrentSelectionEP12vtkSelectionr]@__ZN19vtkAnnotationLayers20SetCurrentAnnotationEP13vtkAnnotationr]@__ZN19vtkAnnotationLayers22GetNumberOfAnnotationsEvr]@__ZN19vtkAnnotationLayers3NewEvr]@__ZN19vtkAnnotationLayers7GetDataEP14vtkInformationr]@__ZN19vtkAnnotationLayers7GetDataEP20vtkInformationVectorir]@__ZN19vtkAnnotationLayers8DeepCopyEP13vtkDataObjectr]@__ZN19vtkAnnotationLayers8GetMTimeEvr]@__ZN19vtkBSPIntersections13IntersectsBoxEPiiPdr]@__ZN19vtkBSPIntersections13IntersectsBoxEPiiddddddr^@__ZN19vtkBSPIntersections13IntersectsBoxEiPdr^@__ZN19vtkBSPIntersections13IntersectsBoxEiddddddr^@__ZN19vtkBSPIntersections14IntersectsCellEPiiP7vtkCellir^@__ZN19vtkBSPIntersections14IntersectsCellEiP7vtkCellir^@__ZN19vtkBSPIntersections15GetRegionBoundsEiPdr^@__ZN19vtkBSPIntersections17IntersectsSphere2EPiiddddr^@__ZN19vtkBSPIntersections17IntersectsSphere2Eiddddr^@__ZN19vtkBSPIntersections18GetNumberOfRegionsEvr^@__ZN19vtkBSPIntersections19GetRegionDataBoundsEiPdr^@__ZN19vtkBSPIntersections37ComputeIntersectionsUsingDataBoundsOnEvr^@__ZN19vtkBSPIntersections38ComputeIntersectionsUsingDataBoundsOffEvr^@__ZN19vtkBSPIntersections38SetComputeIntersectionsUsingDataBoundsEir^@__ZN19vtkBSPIntersections3NewEvr^@__ZN19vtkBSPIntersections7SetCutsEP10vtkBSPCutsr^@__ZN19vtkBSPIntersections9GetBoundsEPdr^@__ZN19vtkCompositeDataSet10InitializeEvr_@__ZN19vtkCompositeDataSet11ShallowCopyEP13vtkDataObjectr_@__ZN19vtkCompositeDataSet17GetNumberOfPointsEvr_@__ZN19vtkCompositeDataSet19GetActualMemorySizeEvr_@__ZN19vtkCompositeDataSet30CURRENT_PROCESS_CAN_LOAD_BLOCKEvr_@__ZN19vtkCompositeDataSet4NAMEEvr_@__ZN19vtkCompositeDataSet7GetDataEP14vtkInformationr_@__ZN19vtkCompositeDataSet7GetDataEP20vtkInformationVectorir_@__ZN19vtkCompositeDataSet8DeepCopyEP13vtkDataObjectr_@__ZN19vtkEdgeListIterator13NextGraphEdgeEvr_@__ZN19vtkEdgeListIterator3NewEvr_@__ZN19vtkEdgeListIterator4NextEvr_@__ZN19vtkEdgeListIterator7HasNextEvr_@__ZN19vtkEdgeListIterator8SetGraphEP8vtkGraphr_@__ZN19vtkGenericEdgeTable10CheckPointExr_@__ZN19vtkGenericEdgeTable10CheckPointExPdS0_r_@__ZN19vtkGenericEdgeTable10InitializeExr`@__ZN19vtkGenericEdgeTable10InsertEdgeExxxir`@__ZN19vtkGenericEdgeTable10InsertEdgeExxxiRxr`@__ZN19vtkGenericEdgeTable10LoadFactorEvr`@__ZN19vtkGenericEdgeTable10RemoveEdgeExxr`@__ZN19vtkGenericEdgeTable11InsertPointExPdr`@__ZN19vtkGenericEdgeTable11RemovePointExr`@__ZN19vtkGenericEdgeTable20InsertPointAndScalarExPdS0_r`@__ZN19vtkGenericEdgeTable21GetNumberOfComponentsEvr`@__ZN19vtkGenericEdgeTable21SetNumberOfComponentsEir`@__ZN19vtkGenericEdgeTable23CheckEdgeReferenceCountExxr`@__ZN19vtkGenericEdgeTable27IncrementEdgeReferenceCountExxxr`@__ZN19vtkGenericEdgeTable28IncrementPointReferenceCountExr`@__ZN19vtkGenericEdgeTable3NewEvr`@__ZN19vtkGenericEdgeTable9CheckEdgeExxRxr`@__ZN19vtkGenericEdgeTable9DumpTableEvr`@__ZN19vtkImplicitFunction12SetTransformEP20vtkAbstractTransformra@__ZN19vtkImplicitFunction12SetTransformEPKdra@__ZN19vtkImplicitFunction13FunctionValueEP12vtkDataArrayS1_ra@__ZN19vtkImplicitFunction13FunctionValueEPKdra@__ZN19vtkImplicitFunction16EvaluateFunctionEP12vtkDataArrayS1_ra@__ZN19vtkImplicitFunction16FunctionGradientEPKdPdra@__ZN19vtkImplicitFunction8GetMTimeEvra@__ZN19vtkLagrangeTriangle10InitializeEvra@__ZN19vtkLagrangeTriangle11DerivativesEiPdS0_iS0_ra@__ZN19vtkLagrangeTriangle11TriangulateEiP9vtkIdListP9vtkPointsra@__ZN19vtkLagrangeTriangle12CellBoundaryEiPdP9vtkIdListra@__ZN19vtkLagrangeTriangle12ComputeOrderEvra@__ZN19vtkLagrangeTriangle16BarycentricIndexExPxxra@__ZN19vtkLagrangeTriangle16EvaluateLocationERiPdS1_S1_ra@__ZN19vtkLagrangeTriangle16EvaluatePositionEPdS0_RiS0_RdS0_ra@__ZN19vtkLagrangeTriangle17InterpolateDerivsEPdS0_ra@__ZN19vtkLagrangeTriangle17IntersectWithLineEPdS0_dRdS0_S0_Rirb@__ZN19vtkLagrangeTriangle18ToBarycentricIndexExPxrb@__ZN19vtkLagrangeTriangle19GetParametricCenterEPdrb@__ZN19vtkLagrangeTriangle19GetParametricCoordsEvrb@__ZN19vtkLagrangeTriangle20InterpolateFunctionsEPdS0_rb@__ZN19vtkLagrangeTriangle21GetParametricDistanceEPdrb@__ZN19vtkLagrangeTriangle23ComputeParametricCoordsEPdxrb@__ZN19vtkLagrangeTriangle3NewEvrb@__ZN19vtkLagrangeTriangle3etaExxdrb@__ZN19vtkLagrangeTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irb@__ZN19vtkLagrangeTriangle5IndexEPKxxrb@__ZN19vtkLagrangeTriangle5d_etaExxdrb@__ZN19vtkLagrangeTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rb@__ZN19vtkLagrangeTriangle7GetEdgeEirb@__ZN19vtkLagrangeTriangle7ToIndexEPKxrb@__ZN19vtkQuadraticPolygon11DerivativesEiPdS0_iS0_rb@__ZN19vtkQuadraticPolygon11TriangulateEP9vtkIdListrc@__ZN19vtkQuadraticPolygon11TriangulateEiP9vtkIdListP9vtkPointsrc@__ZN19vtkQuadraticPolygon12CellBoundaryEiPdP9vtkIdListrc@__ZN19vtkQuadraticPolygon14PointInPolygonEPdiS0_S0_S0_rc@__ZN19vtkQuadraticPolygon15ComputeCentroidEP14vtkIdTypeArrayP9vtkPointsPdrc@__ZN19vtkQuadraticPolygon16EvaluateLocationERiPdS1_S1_rc@__ZN19vtkQuadraticPolygon16EvaluatePositionEPdS0_RiS0_RdS0_rc@__ZN19vtkQuadraticPolygon17DistanceToPolygonEPdiS0_S0_S0_rc@__ZN19vtkQuadraticPolygon17IntersectWithLineEPdS0_dRdS0_S0_Rirc@__ZN19vtkQuadraticPolygon19ParameterizePolygonEPdS0_RdS0_S1_S0_rc@__ZN19vtkQuadraticPolygon20InterpolateFunctionsEPdS0_rc@__ZN19vtkQuadraticPolygon22IntersectConvex2DCellsEP7vtkCellS1_dPdS2_rc@__ZN19vtkQuadraticPolygon24NonDegenerateTriangulateEP9vtkIdListrc@__ZN19vtkQuadraticPolygon27IntersectPolygonWithPolygonEiPdS0_iS0_S0_dS0_rc@__ZN19vtkQuadraticPolygon3NewEvrc@__ZN19vtkQuadraticPolygon4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irc@__ZN19vtkQuadraticPolygon7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rd@__ZN19vtkQuadraticPolygon7GetEdgeEird@__ZN19vtkQuadraticPyramid11DerivativesEiPdS0_iS0_rd@__ZN19vtkQuadraticPyramid11TriangulateEiP9vtkIdListP9vtkPointsrd@__ZN19vtkQuadraticPyramid12CellBoundaryEiPdP9vtkIdListrd@__ZN19vtkQuadraticPyramid12GetEdgeArrayEird@__ZN19vtkQuadraticPyramid12GetFaceArrayEird@__ZN19vtkQuadraticPyramid16EvaluateLocationERiPdS1_S1_rd@__ZN19vtkQuadraticPyramid16EvaluatePositionEPdS0_RiS0_RdS0_rd@__ZN19vtkQuadraticPyramid17IntersectWithLineEPdS0_dRdS0_S0_Rird@__ZN19vtkQuadraticPyramid19GetParametricCoordsEvrd@__ZN19vtkQuadraticPyramid19InterpolationDerivsEPdS0_rd@__ZN19vtkQuadraticPyramid22InterpolationFunctionsEPdS0_rd@__ZN19vtkQuadraticPyramid3NewEvrd@__ZN19vtkQuadraticPyramid4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ird@__ZN19vtkQuadraticPyramid7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rd@__ZN19vtkQuadraticPyramid7GetEdgeEire@__ZN19vtkQuadraticPyramid7GetFaceEire@__ZN19vtkStructuredExtent3NewEvre@__ZN19vtkStructuredPoints3NewEvre@__ZN19vtkUnstructuredGrid10BuildLinksEvre@__ZN19vtkUnstructuredGrid10InitializeEvre@__ZN19vtkUnstructuredGrid11GetCellTypeExre@__ZN19vtkUnstructuredGrid11ReplaceCellExiPxre@__ZN19vtkUnstructuredGrid11ShallowCopyEP13vtkDataObjectre@__ZN19vtkUnstructuredGrid12GetMeshMTimeEvre@__ZN19vtkUnstructuredGrid13CopyStructureEP10vtkDataSetre@__ZN19vtkUnstructuredGrid13GetCellBoundsExPdre@__ZN19vtkUnstructuredGrid13GetCellPointsExP9vtkIdListre@__ZN19vtkUnstructuredGrid13GetCellPointsExRxRPxre@__ZN19vtkUnstructuredGrid13GetFaceStreamExP9vtkIdListre@__ZN19vtkUnstructuredGrid13GetFaceStreamExRxRPxre@__ZN19vtkUnstructuredGrid13GetGhostLevelEvrf@__ZN19vtkUnstructuredGrid13GetPointCellsExP9vtkIdListrf@__ZN19vtkUnstructuredGrid13IsHomogeneousEvrf@__ZN19vtkUnstructuredGrid14GetMaxCellSizeEvrf@__ZN19vtkUnstructuredGrid14InsertNextCellEiP9vtkIdListrf@__ZN19vtkUnstructuredGrid14InsertNextCellEixPxrf@__ZN19vtkUnstructuredGrid14InsertNextCellEixPxxS0_rf@__ZN19vtkUnstructuredGrid14ResizeCellListExirf@__ZN19vtkUnstructuredGrid15NewCellIteratorEvrf@__ZN19vtkUnstructuredGrid16GetCellNeighborsExP9vtkIdListS1_rf@__ZN19vtkUnstructuredGrid16GetNumberOfCellsEvrf@__ZN19vtkUnstructuredGrid16RemoveGhostCellsEvrf@__ZN19vtkUnstructuredGrid17GetNumberOfPiecesEvrf@__ZN19vtkUnstructuredGrid18AddReferenceToCellExxrf@__ZN19vtkUnstructuredGrid19GetActualMemorySizeEvrf@__ZN19vtkUnstructuredGrid19GetIdsOfCellsOfTypeEiP14vtkIdTypeArrayrf@__ZN19vtkUnstructuredGrid20InsertNextLinkedCellEiiPxrg@__ZN19vtkUnstructuredGrid21RemoveReferenceToCellExxrg@__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellEP12vtkCellArrayRxS2_S1_P14vtkIdTypeArrayrg@__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellEPxRxS1_P12vtkCellArrayP14vtkIdTypeArrayrg@__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellExPxRxP12vtkCellArrayP14vtkIdTypeArrayrg@__ZN19vtkUnstructuredGrid25ConvertFaceStreamPointIdsEP9vtkIdListPxrg@__ZN19vtkUnstructuredGrid25ConvertFaceStreamPointIdsExPxS0_rg@__ZN19vtkUnstructuredGrid29InitializeFacesRepresentationExrg@__ZN19vtkUnstructuredGrid3NewEvrg@__ZN19vtkUnstructuredGrid5ResetEvrg@__ZN19vtkUnstructuredGrid7GetCellExrg@__ZN19vtkUnstructuredGrid7GetCellExP14vtkGenericCellrg@__ZN19vtkUnstructuredGrid7GetDataEP14vtkInformationrg@__ZN19vtkUnstructuredGrid7GetDataEP20vtkInformationVectorirg@__ZN19vtkUnstructuredGrid7SqueezeEvrg@__ZN19vtkUnstructuredGrid8AllocateExirg@__ZN19vtkUnstructuredGrid8DeepCopyEP13vtkDataObjectrh@__ZN19vtkUnstructuredGrid8GetFacesExrh@__ZN19vtkUnstructuredGrid8GetPieceEvrh@__ZN19vtkUnstructuredGrid8SetCellsEP20vtkUnsignedCharArrayP14vtkIdTypeArrayP12vtkCellArrayrh@__ZN19vtkUnstructuredGrid8SetCellsEP20vtkUnsignedCharArrayP14vtkIdTypeArrayP12vtkCellArrayS3_S3_rh@__ZN19vtkUnstructuredGrid8SetCellsEPiP12vtkCellArrayrh@__ZN19vtkUnstructuredGrid8SetCellsEiP12vtkCellArrayrh@__ZN20vtkAbstractCellLinks9GetIdTypeExxP12vtkCellArrayrh@__ZN20vtkDataSetAttributes10CopyAllOffEirh@__ZN20vtkDataSetAttributes10CopyTuplesEP16vtkAbstractArrayS1_P9vtkIdListS3_rh@__ZN20vtkDataSetAttributes10CopyTuplesEP16vtkAbstractArrayS1_xxxrh@__ZN20vtkDataSetAttributes10GetNormalsEPKcrh@__ZN20vtkDataSetAttributes10GetNormalsEvrh@__ZN20vtkDataSetAttributes10GetScalarsEPKcrh@__ZN20vtkDataSetAttributes10GetScalarsEvrh@__ZN20vtkDataSetAttributes10GetTCoordsEPKcrh@__ZN20vtkDataSetAttributes10GetTCoordsEvri@__ZN20vtkDataSetAttributes10GetTensorsEPKcri@__ZN20vtkDataSetAttributes10GetTensorsEvri@__ZN20vtkDataSetAttributes10GetVectorsEPKcri@__ZN20vtkDataSetAttributes10GetVectorsEvri@__ZN20vtkDataSetAttributes10InitializeEvri@__ZN20vtkDataSetAttributes10SetNormalsEP12vtkDataArrayri@__ZN20vtkDataSetAttributes10SetScalarsEP12vtkDataArrayri@__ZN20vtkDataSetAttributes10SetTCoordsEP12vtkDataArrayri@__ZN20vtkDataSetAttributes10SetTensorsEP12vtkDataArrayri@__ZN20vtkDataSetAttributes10SetVectorsEP12vtkDataArrayri@__ZN20vtkDataSetAttributes11RemoveArrayEiri@__ZN20vtkDataSetAttributes11ShallowCopyEP12vtkFieldDatari@__ZN20vtkDataSetAttributes12CopyAllocateEPS_xxiri@__ZN20vtkDataSetAttributes12GetAttributeEiri@__ZN20vtkDataSetAttributes12GetGlobalIdsEPKcri@__ZN20vtkDataSetAttributes12GetGlobalIdsEvrj@__ZN20vtkDataSetAttributes12SetAttributeEP16vtkAbstractArrayirj@__ZN20vtkDataSetAttributes12SetGlobalIdsEP12vtkDataArrayrj@__ZN20vtkDataSetAttributes12SetupForCopyEPS_rj@__ZN20vtkDataSetAttributes14GetCopyNormalsEirj@__ZN20vtkDataSetAttributes14GetCopyScalarsEirj@__ZN20vtkDataSetAttributes14GetCopyTCoordsEirj@__ZN20vtkDataSetAttributes14GetCopyTensorsEirj@__ZN20vtkDataSetAttributes14GetCopyVectorsEirj@__ZN20vtkDataSetAttributes14GetPedigreeIdsEPKcrj@__ZN20vtkDataSetAttributes14GetPedigreeIdsEvrj@__ZN20vtkDataSetAttributes14SetCopyNormalsEiirj@__ZN20vtkDataSetAttributes14SetCopyScalarsEiirj@__ZN20vtkDataSetAttributes14SetCopyTCoordsEiirj@__ZN20vtkDataSetAttributes14SetCopyTensorsEiirj@__ZN20vtkDataSetAttributes14SetCopyVectorsEiirj@__ZN20vtkDataSetAttributes14SetPedigreeIdsEP16vtkAbstractArrayrk@__ZN20vtkDataSetAttributes15InterpolateEdgeEPS_xxxdrk@__ZN20vtkDataSetAttributes15InterpolateTimeEPS_S0_xdrk@__ZN20vtkDataSetAttributes16GetCopyAttributeEiirk@__ZN20vtkDataSetAttributes16GetCopyGlobalIdsEirk@__ZN20vtkDataSetAttributes16InterpolatePointEPS_xP9vtkIdListPdrk@__ZN20vtkDataSetAttributes16SetActiveNormalsEPKcrk@__ZN20vtkDataSetAttributes16SetActiveScalarsEPKcrk@__ZN20vtkDataSetAttributes16SetActiveTCoordsEPKcrk@__ZN20vtkDataSetAttributes16SetActiveTensorsEPKcrk@__ZN20vtkDataSetAttributes16SetActiveVectorsEPKcrk@__ZN20vtkDataSetAttributes16SetCopyAttributeEiiirk@__ZN20vtkDataSetAttributes16SetCopyGlobalIdsEiirk@__ZN20vtkDataSetAttributes18CopyStructuredDataEPS_PKiS2_brk@__ZN20vtkDataSetAttributes18GetCopyPedigreeIdsEirk@__ZN20vtkDataSetAttributes18IsArrayAnAttributeEirk@__ZN20vtkDataSetAttributes18SetActiveAttributeEPKcirl@__ZN20vtkDataSetAttributes18SetActiveAttributeEiirl@__ZN20vtkDataSetAttributes18SetActiveGlobalIdsEPKcrl@__ZN20vtkDataSetAttributes18SetCopyPedigreeIdsEiirl@__ZN20vtkDataSetAttributes19GetAttributeIndicesEPirl@__ZN20vtkDataSetAttributes19InterpolateAllocateEPS_xxirl@__ZN20vtkDataSetAttributes20GetAbstractAttributeEirl@__ZN20vtkDataSetAttributes20SetActivePedigreeIdsEPKcrl@__ZN20vtkDataSetAttributes24GetAttributeTypeAsStringEirl@__ZN20vtkDataSetAttributes28GetLongAttributeTypeAsStringEirl@__ZN20vtkDataSetAttributes3NewEvrl@__ZN20vtkDataSetAttributes8CopyDataEPS_P9vtkIdListS2_rl@__ZN20vtkDataSetAttributes8CopyDataEPS_xxrl@__ZN20vtkDataSetAttributes8CopyDataEPS_xxxrl@__ZN20vtkDataSetAttributes8DeepCopyEP12vtkFieldDatarl@__ZN20vtkDataSetAttributes8PassDataEP12vtkFieldDatarl@__ZN20vtkDataSetAttributes9CopyAllOnEirm@__ZN20vtkDataSetAttributes9CopyTupleEP16vtkAbstractArrayS1_xxrm@__ZN20vtkDataSetCollection3NewEvrm@__ZN20vtkDebugLeaksManagerC1Evrm@__ZN20vtkMultiBlockDataSet11RemoveBlockEjrm@__ZN20vtkMultiBlockDataSet17GetNumberOfBlocksEvrm@__ZN20vtkMultiBlockDataSet17SetNumberOfBlocksEjrm@__ZN20vtkMultiBlockDataSet3NewEvrm@__ZN20vtkMultiBlockDataSet7GetDataEP14vtkInformationrm@__ZN20vtkMultiBlockDataSet7GetDataEP20vtkInformationVectorirm@__ZN20vtkMultiBlockDataSet8GetBlockEjrm@__ZN20vtkMultiBlockDataSet8SetBlockEjP13vtkDataObjectrm@__ZN20vtkMultiPieceDataSet17GetNumberOfPiecesEvrm@__ZN20vtkMultiPieceDataSet17SetNumberOfPiecesEjrm@__ZN20vtkMultiPieceDataSet20GetPieceAsDataObjectEjrm@__ZN20vtkMultiPieceDataSet3NewEvrm@__ZN20vtkMultiPieceDataSet7GetDataEP14vtkInformationrn@__ZN20vtkMultiPieceDataSet7GetDataEP20vtkInformationVectorirn@__ZN20vtkMultiPieceDataSet8GetPieceEjrn@__ZN20vtkMultiPieceDataSet8SetPieceEjP13vtkDataObjectrn@__ZN20vtkNonOverlappingAMR3NewEvrn@__ZN20vtkOStrStreamWrapper3strEvrn@__ZN20vtkOStrStreamWrapper5rdbufEvrn@__ZN20vtkOStrStreamWrapper6freezeEirn@__ZN20vtkOStrStreamWrapperC1Evrn@__ZN20vtkOStrStreamWrapperD1Evrn@__ZN20vtkPiecewiseFunction10AddSegmentEddddrn@__ZN20vtkPiecewiseFunction10InitializeEvrn@__ZN20vtkPiecewiseFunction11AdjustRangeEPdrn@__ZN20vtkPiecewiseFunction11RemovePointEdrn@__ZN20vtkPiecewiseFunction11ShallowCopyEP13vtkDataObjectrn@__ZN20vtkPiecewiseFunction12GetNodeValueEiPdrn@__ZN20vtkPiecewiseFunction12SetNodeValueEiPdro@__ZN20vtkPiecewiseFunction14GetDataPointerEvro@__ZN20vtkPiecewiseFunction15RemoveAllPointsEvro@__ZN20vtkPiecewiseFunction19FillFromDataPointerEiPdro@__ZN20vtkPiecewiseFunction20GetFirstNonZeroValueEvro@__ZN20vtkPiecewiseFunction22BuildFunctionFromTableEddiPdiro@__ZN20vtkPiecewiseFunction26EstimateMinNumberOfSamplesERKdS1_ro@__ZN20vtkPiecewiseFunction3NewEvro@__ZN20vtkPiecewiseFunction7GetDataEP14vtkInformationro@__ZN20vtkPiecewiseFunction7GetDataEP20vtkInformationVectoriro@__ZN20vtkPiecewiseFunction7GetSizeEvro@__ZN20vtkPiecewiseFunction7GetTypeEvro@__ZN20vtkPiecewiseFunction8AddPointEddro@__ZN20vtkPiecewiseFunction8AddPointEddddro@__ZN20vtkPiecewiseFunction8DeepCopyEP13vtkDataObjectro@__ZN20vtkPiecewiseFunction8GetTableEddiPdiro@__ZN20vtkPiecewiseFunction8GetValueEdrp@__ZN20vtkQuadraticTriangle11DerivativesEiPdS0_iS0_rp@__ZN20vtkQuadraticTriangle11TriangulateEiP9vtkIdListP9vtkPointsrp@__ZN20vtkQuadraticTriangle12CellBoundaryEiPdP9vtkIdListrp@__ZN20vtkQuadraticTriangle16EvaluateLocationERiPdS1_S1_rp@__ZN20vtkQuadraticTriangle16EvaluatePositionEPdS0_RiS0_RdS0_rp@__ZN20vtkQuadraticTriangle17IntersectWithLineEPdS0_dRdS0_S0_Rirp@__ZN20vtkQuadraticTriangle19GetParametricCoordsEvrp@__ZN20vtkQuadraticTriangle19InterpolationDerivsEPdS0_rp@__ZN20vtkQuadraticTriangle21GetParametricDistanceEPdrp@__ZN20vtkQuadraticTriangle22InterpolationFunctionsEPdS0_rp@__ZN20vtkQuadraticTriangle3NewEvrp@__ZN20vtkQuadraticTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irp@__ZN20vtkQuadraticTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rp@__ZN20vtkQuadraticTriangle7GetEdgeEirp@__ZN20vtkSmoothErrorMetric17GetAngleToleranceEvrp@__ZN20vtkSmoothErrorMetric17SetAngleToleranceEdrq@__ZN20vtkSmoothErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_drq@__ZN20vtkSmoothErrorMetric3NewEvrq@__ZN20vtkSmoothErrorMetric8GetErrorEPdS0_S0_drq@__ZN20vtkStaticCellLocator12BuildLocatorEvrq@__ZN20vtkStaticCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCellrq@__ZN20vtkStaticCellLocator19FreeSearchStructureEvrq@__ZN20vtkStaticCellLocator21FindCellsWithinBoundsEPdP9vtkIdListrq@__ZN20vtkStaticCellLocator22GenerateRepresentationEiP11vtkPolyDatarq@__ZN20vtkStaticCellLocator3NewEvrq@__ZN20vtkStaticCellLocator8FindCellEPddP14vtkGenericCellS0_S0_rq@__ZN21vtkGenericAdaptorCell10GetLength2Evrq@__ZN21vtkGenericAdaptorCell10TessellateEP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatorP9vtkPointsP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataSB_P11vtkCellDataP20vtkUnsignedCharArrayrq@__ZN21vtkGenericAdaptorCell15TriangulateFaceEP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatoriP9vtkPointsP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataSB_P11vtkCellDatarq@__ZN21vtkGenericAdaptorCell16IsGeometryLinearEvrq@__ZN21vtkGenericAdaptorCell17IsAttributeLinearEP19vtkGenericAttributerq@__ZN21vtkGenericAdaptorCell24GetHighestOrderAttributeEP29vtkGenericAttributeCollectionrr@__ZN21vtkGenericAdaptorCell4ClipEdP19vtkImplicitFunctionP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatoriP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataP11vtkCellDataSB_SB_SD_rr@__ZN21vtkGenericAdaptorCell7ContourEP16vtkContourValuesP19vtkImplicitFunctionP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatorP26vtkIncrementalPointLocatorP12vtkCellArraySB_SB_P12vtkPointDataP11vtkCellDataSD_SD_SF_rr@__ZN21vtkGenericAdaptorCell9GetBoundsEvrr@__ZN21vtkKdTreePointLocator12BuildLocatorEvrr@__ZN21vtkKdTreePointLocator16FindClosestPointEPKdrr@__ZN21vtkKdTreePointLocator18FindClosestNPointsEiPKdP9vtkIdListrr@__ZN21vtkKdTreePointLocator19FreeSearchStructureEvrr@__ZN21vtkKdTreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdListrr@__ZN21vtkKdTreePointLocator22GenerateRepresentationEiP11vtkPolyDatarr@__ZN21vtkKdTreePointLocator28FindClosestPointWithinRadiusEdPKdRdrr@__ZN21vtkKdTreePointLocator3NewEvrr@__ZN21vtkLagrangeHexahedron10InitializeEvrr@__ZN21vtkLagrangeHexahedron11DerivativesEiPdS0_iS0_rr@__ZN21vtkLagrangeHexahedron11TriangulateEiP9vtkIdListP9vtkPointsrr@__ZN21vtkLagrangeHexahedron12CellBoundaryEiPdP9vtkIdListrr@__ZN21vtkLagrangeHexahedron16EvaluateLocationERiPdS1_S1_rs@__ZN21vtkLagrangeHexahedron16EvaluatePositionEPdS0_RiS0_RdS0_rs@__ZN21vtkLagrangeHexahedron17InterpolateDerivsEPdS0_rs@__ZN21vtkLagrangeHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Rirs@__ZN21vtkLagrangeHexahedron17PointIndexFromIJKEiiirs@__ZN21vtkLagrangeHexahedron17PointIndexFromIJKEiiiPKirs@__ZN21vtkLagrangeHexahedron19GetParametricCoordsEvrs@__ZN21vtkLagrangeHexahedron20InterpolateFunctionsEPdS0_rs@__ZN21vtkLagrangeHexahedron21GetParametricDistanceEPdrs@__ZN21vtkLagrangeHexahedron24SubCellCoordinatesFromIdER11vtkVector3iirs@__ZN21vtkLagrangeHexahedron24SubCellCoordinatesFromIdERiS0_S0_irs@__ZN21vtkLagrangeHexahedron25TransformFaceToCellParamsEiPdrs@__ZN21vtkLagrangeHexahedron27TransformApproxToCellParamsEiPdrs@__ZN21vtkLagrangeHexahedron3NewEvrs@__ZN21vtkLagrangeHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irs@__ZN21vtkLagrangeHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rs@__ZN21vtkLagrangeHexahedron7GetEdgeEirt@__ZN21vtkLagrangeHexahedron7GetFaceEirt@__ZN21vtkLagrangeHexahedron8GetOrderEvrt@__ZN21vtkOctreePointLocator12BuildLocatorEvrt@__ZN21vtkOctreePointLocator15GetRegionBoundsEiPdrt@__ZN21vtkOctreePointLocator16FindClosestPointEPKdrt@__ZN21vtkOctreePointLocator16FindClosestPointEdddRdrt@__ZN21vtkOctreePointLocator16FindPointsInAreaEPdP14vtkIdTypeArraybrt@__ZN21vtkOctreePointLocator17GetPointsInRegionEirt@__ZN21vtkOctreePointLocator18FindClosestNPointsEiPKdP9vtkIdListrt@__ZN21vtkOctreePointLocator19FreeSearchStructureEvrt@__ZN21vtkOctreePointLocator19GetRegionDataBoundsEiPdrt@__ZN21vtkOctreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdListrt@__ZN21vtkOctreePointLocator22GenerateRepresentationEiP11vtkPolyDatart@__ZN21vtkOctreePointLocator24FindClosestPointInRegionEiPdRdrt@__ZN21vtkOctreePointLocator24FindClosestPointInRegionEidddRdrt@__ZN21vtkOctreePointLocator24GetRegionContainingPointEdddru@__ZN21vtkOctreePointLocator28FindClosestPointWithinRadiusEdPKdRdru@__ZN21vtkOctreePointLocator3NewEvru@__ZN21vtkOctreePointLocator9GetBoundsEPdru@__ZN21vtkOctreePointLocator9GetBoundsEvru@__ZN21vtkPlanesIntersection13Convert3DCellEP7vtkCellru@__ZN21vtkPlanesIntersection16IntersectsRegionEP9vtkPointsru@__ZN21vtkPlanesIntersection17GetRegionVerticesEPdiru@__ZN21vtkPlanesIntersection17SetRegionVerticesEP9vtkPointsru@__ZN21vtkPlanesIntersection17SetRegionVerticesEPdiru@__ZN21vtkPlanesIntersection21PolygonIntersectsBBoxEPdP9vtkPointsru@__ZN21vtkPlanesIntersection25GetNumberOfRegionVerticesEvru@__ZN21vtkPlanesIntersection3NewEvru@__ZN21vtkPolyDataCollection3NewEvru@__ZN21vtkStaticPointLocator10InitializeEvru@__ZN21vtkStaticPointLocator12BuildLocatorEvru@__ZN21vtkStaticPointLocator12GetBucketIdsExP9vtkIdListrv@__ZN21vtkStaticPointLocator16FindClosestPointEPKdrv@__ZN21vtkStaticPointLocator18FindClosestNPointsEiPKdP9vtkIdListrv@__ZN21vtkStaticPointLocator19FreeSearchStructureEvrv@__ZN21vtkStaticPointLocator22FindPointsWithinRadiusEdPKdP9vtkIdListrv@__ZN21vtkStaticPointLocator22GenerateRepresentationEiP11vtkPolyDatarv@__ZN21vtkStaticPointLocator25GetNumberOfPointsInBucketExrv@__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKdRdrv@__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKddRdrv@__ZN21vtkStaticPointLocator3NewEvrv@__ZN21vtkVertexListIterator3NewEvrv@__ZN21vtkVertexListIterator8SetGraphEP8vtkGraphrv@__ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_P14vtkGenericCellRxRiRdrv@__ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_RxRiRdrv@__ZN22vtkAbstractCellLocator16InsideCellBoundsEPdxrv@__ZN22vtkAbstractCellLocator17IntersectWithLineEPKdS1_P9vtkPointsP9vtkIdListrv@__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_Rirw@__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxrw@__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCellrw@__ZN22vtkAbstractCellLocator18FindCellsAlongLineEPdS0_dP9vtkIdListrw@__ZN22vtkAbstractCellLocator21FindCellsWithinBoundsEPdP9vtkIdListrw@__ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdrw@__ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdS4_rw@__ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_RxRiRdrw@__ZN22vtkAbstractCellLocator8FindCellEPdrw@__ZN22vtkAbstractCellLocator8FindCellEPddP14vtkGenericCellS0_S0_rw@__ZN22vtkBiQuadraticTriangle11DerivativesEiPdS0_iS0_rw@__ZN22vtkBiQuadraticTriangle11TriangulateEiP9vtkIdListP9vtkPointsrw@__ZN22vtkBiQuadraticTriangle12CellBoundaryEiPdP9vtkIdListrw@__ZN22vtkBiQuadraticTriangle16EvaluateLocationERiPdS1_S1_rw@__ZN22vtkBiQuadraticTriangle16EvaluatePositionEPdS0_RiS0_RdS0_rw@__ZN22vtkBiQuadraticTriangle17IntersectWithLineEPdS0_dRdS0_S0_Rirw@__ZN22vtkBiQuadraticTriangle19GetParametricCoordsEvrx@__ZN22vtkBiQuadraticTriangle19InterpolationDerivsEPdS0_rx@__ZN22vtkBiQuadraticTriangle21GetParametricDistanceEPdrx@__ZN22vtkBiQuadraticTriangle22InterpolationFunctionsEPdS0_rx@__ZN22vtkBiQuadraticTriangle3NewEvrx@__ZN22vtkBiQuadraticTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irx@__ZN22vtkBiQuadraticTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rx@__ZN22vtkBiQuadraticTriangle7GetEdgeEirx@__ZN22vtkDataSetCellIterator19IsDoneWithTraversalEvrx@__ZN22vtkDataSetCellIterator3NewEvrx@__ZN22vtkDataSetCellIterator9GetCellIdEvrx@__ZN22vtkHyperTreeGridCursor10InitializeEP16vtkHyperTreeGridxrx@__ZN22vtkHyperTreeGridCursor11GetVertexIdEvrx@__ZN22vtkHyperTreeGridCursor12GetDimensionEvrx@__ZN22vtkHyperTreeGridCursor13GetChildIndexEvrx@__ZN22vtkHyperTreeGridCursor18GetGlobalNodeIndexEvrx@__ZN22vtkHyperTreeGridCursor19GetNumberOfChildrenEvry@__ZN22vtkHyperTreeGridCursor3NewEvry@__ZN22vtkHyperTreeGridCursor5CloneEvry@__ZN22vtkHyperTreeGridCursor6IsLeafEvry@__ZN22vtkHyperTreeGridCursor6IsRootEvry@__ZN22vtkHyperTreeGridCursor6ToRootEvry@__ZN22vtkHyperTreeGridCursor7SetGridEP16vtkHyperTreeGridry@__ZN22vtkHyperTreeGridCursor7SetTreeEP12vtkHyperTreery@__ZN22vtkHyperTreeGridCursor7ToChildEiry@__ZN22vtkHyperTreeGridCursor8ToParentEvry@__ZN22vtkOrderedTriangulator10GetPointIdExry@__ZN22vtkOrderedTriangulator11InsertPointExPdS0_iry@__ZN22vtkOrderedTriangulator11InsertPointExxPdS0_iry@__ZN22vtkOrderedTriangulator11InsertPointExxxPdS0_iry@__ZN22vtkOrderedTriangulator11TriangulateEvry@__ZN22vtkOrderedTriangulator12AddTrianglesEP12vtkCellArrayry@__ZN22vtkOrderedTriangulator12AddTrianglesExP12vtkCellArrayrz@__ZN22vtkOrderedTriangulator12GetNextTetraEiP8vtkTetraP12vtkDataArrayP14vtkDoubleArrayrz@__ZN22vtkOrderedTriangulator15UpdatePointTypeExirz@__ZN22vtkOrderedTriangulator16GetPointLocationExrz@__ZN22vtkOrderedTriangulator16GetPointPositionExrz@__ZN22vtkOrderedTriangulator17InitTriangulationEPdirz@__ZN22vtkOrderedTriangulator17InitTriangulationEddddddirz@__ZN22vtkOrderedTriangulator18InitTetraTraversalEvrz@__ZN22vtkOrderedTriangulator19TemplateTriangulateEiiirz@__ZN22vtkOrderedTriangulator3NewEvrz@__ZN22vtkOrderedTriangulator9AddTetrasEiP12vtkCellArrayrz@__ZN22vtkOrderedTriangulator9AddTetrasEiP19vtkUnstructuredGridrz@__ZN22vtkOrderedTriangulator9AddTetrasEiP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS5_P11vtkCellDataxS7_rz@__ZN22vtkOrderedTriangulator9AddTetrasEiP9vtkIdListP9vtkPointsrz@__ZN22vtkOrderedTriangulator9GetTetrasEiP19vtkUnstructuredGridrz@__ZN22vtkPointsProjectedHull10InitializeEvrz@__ZN22vtkPointsProjectedHull11GetCCWHullXEPdir{@__ZN22vtkPointsProjectedHull11GetCCWHullYEPdir{@__ZN22vtkPointsProjectedHull11GetCCWHullZEPdir{@__ZN22vtkPointsProjectedHull15GetSizeCCWHullXEvr{@__ZN22vtkPointsProjectedHull15GetSizeCCWHullYEvr{@__ZN22vtkPointsProjectedHull15GetSizeCCWHullZEvr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionXEP9vtkPointsr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionXEddddr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionYEP9vtkPointsr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionYEddddr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionZEP9vtkPointsr{@__ZN22vtkPointsProjectedHull22RectangleIntersectionZEddddr{@__ZN22vtkPointsProjectedHull3NewEvr{@__ZN22vtkPointsProjectedHull6UpdateEvr{@__ZN22vtkQuadraticHexahedron11DerivativesEiPdS0_iS0_r{@__ZN22vtkQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPointsr{@__ZN22vtkQuadraticHexahedron12CellBoundaryEiPdP9vtkIdListr|@__ZN22vtkQuadraticHexahedron12GetEdgeArrayEir|@__ZN22vtkQuadraticHexahedron12GetFaceArrayEir|@__ZN22vtkQuadraticHexahedron16EvaluateLocationERiPdS1_S1_r|@__ZN22vtkQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0_r|@__ZN22vtkQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Rir|@__ZN22vtkQuadraticHexahedron19GetParametricCoordsEvr|@__ZN22vtkQuadraticHexahedron19InterpolationDerivsEPdS0_r|@__ZN22vtkQuadraticHexahedron22InterpolationFunctionsEPdS0_r|@__ZN22vtkQuadraticHexahedron3NewEvr|@__ZN22vtkQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir|@__ZN22vtkQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r|@__ZN22vtkQuadraticHexahedron7GetEdgeEir|@__ZN22vtkQuadraticHexahedron7GetFaceEir|@__ZN22vtkQuadraticLinearQuad11DerivativesEiPdS0_iS0_r|@__ZN22vtkQuadraticLinearQuad11TriangulateEiP9vtkIdListP9vtkPointsr|@__ZN22vtkQuadraticLinearQuad12CellBoundaryEiPdP9vtkIdListr}@__ZN22vtkQuadraticLinearQuad12GetEdgeArrayEir}@__ZN22vtkQuadraticLinearQuad16EvaluateLocationERiPdS1_S1_r}@__ZN22vtkQuadraticLinearQuad16EvaluatePositionEPdS0_RiS0_RdS0_r}@__ZN22vtkQuadraticLinearQuad17IntersectWithLineEPdS0_dRdS0_S0_Rir}@__ZN22vtkQuadraticLinearQuad19GetParametricCoordsEvr}@__ZN22vtkQuadraticLinearQuad19InterpolationDerivsEPdS0_r}@__ZN22vtkQuadraticLinearQuad22InterpolationFunctionsEPdS0_r}@__ZN22vtkQuadraticLinearQuad3NewEvr}@__ZN22vtkQuadraticLinearQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir}@__ZN22vtkQuadraticLinearQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r}@__ZN22vtkQuadraticLinearQuad7GetEdgeEir}@__ZN23vtkAbstractPointLocator16FindClosestPointEdddr}@__ZN23vtkAbstractPointLocator18FindClosestNPointsEidddP9vtkIdListr}@__ZN23vtkAbstractPointLocator22FindPointsWithinRadiusEddddP9vtkIdListr~@__ZN23vtkAbstractPointLocator9GetBoundsEPdr~@__ZN23vtkDataObjectCollection3NewEvr~@__ZN23vtkDirectedAcyclicGraph3NewEvr~@__ZN23vtkDirectedAcyclicGraph7GetDataEP14vtkInformationr~@__ZN23vtkDirectedAcyclicGraph7GetDataEP20vtkInformationVectorir~@__ZN23vtkGeometricErrorMetric11GetRelativeEvr~@__ZN23vtkGeometricErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_dr~@__ZN23vtkGeometricErrorMetric29SetAbsoluteGeometricToleranceEdr~@__ZN23vtkGeometricErrorMetric29SetRelativeGeometricToleranceEdP17vtkGenericDataSetr~@__ZN23vtkGeometricErrorMetric3NewEvr~@__ZN23vtkGeometricErrorMetric8GetErrorEPdS0_S0_dr~@__ZN23vtkMutableDirectedGraph10RemoveEdgeExr~@__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArrayr~@__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArrayr~@__ZN23vtkMutableDirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArrayr~@__ZN23vtkMutableDirectedGraph11LazyAddEdgeExxP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph11RemoveEdgesEP14vtkIdTypeArrayr@__ZN23vtkMutableDirectedGraph12AddGraphEdgeExxr@__ZN23vtkMutableDirectedGraph12RemoveVertexExr@__ZN23vtkMutableDirectedGraph13LazyAddVertexEP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph13LazyAddVertexERK10vtkVariantr@__ZN23vtkMutableDirectedGraph13LazyAddVertexEvr@__ZN23vtkMutableDirectedGraph14RemoveVerticesEP14vtkIdTypeArrayr@__ZN23vtkMutableDirectedGraph19SetNumberOfVerticesExr@__ZN23vtkMutableDirectedGraph3NewEvr@__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph7AddEdgeExxr@__ZN23vtkMutableDirectedGraph7AddEdgeExxP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph8AddChildExP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph9AddVertexEP15vtkVariantArrayr@__ZN23vtkMutableDirectedGraph9AddVertexERK10vtkVariantr@__ZN23vtkMutableDirectedGraph9AddVertexEvr@__ZN23vtkPointSetCellIterator19IsDoneWithTraversalEvr@__ZN23vtkPointSetCellIterator3NewEvr@__ZN23vtkPointSetCellIterator9GetCellIdEvr@__ZN23vtkQuadraticLinearWedge11DerivativesEiPdS0_iS0_r@__ZN23vtkQuadraticLinearWedge11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN23vtkQuadraticLinearWedge12CellBoundaryEiPdP9vtkIdListr@__ZN23vtkQuadraticLinearWedge12GetEdgeArrayEirȀ@__ZN23vtkQuadraticLinearWedge12GetFaceArrayEirЀ@__ZN23vtkQuadraticLinearWedge16EvaluateLocationERiPdS1_S1_r؀@__ZN23vtkQuadraticLinearWedge16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN23vtkQuadraticLinearWedge17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN23vtkQuadraticLinearWedge19GetParametricCoordsEvr@__ZN23vtkQuadraticLinearWedge19InterpolationDerivsEPdS0_r@__ZN23vtkQuadraticLinearWedge22InterpolationFunctionsEPdS0_r@__ZN23vtkQuadraticLinearWedge3NewEvr@__ZN23vtkQuadraticLinearWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN23vtkQuadraticLinearWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN23vtkQuadraticLinearWedge7GetEdgeEir@__ZN23vtkQuadraticLinearWedge7GetFaceEir@__ZN23vtkUnstructuredGridBase7GetDataEP14vtkInformationr@__ZN23vtkUnstructuredGridBase7GetDataEP20vtkInformationVectorir@__ZN23vtkUnstructuredGridBase8DeepCopyEP13vtkDataObjectr@__ZN24vtkAttributesErrorMetric21SetAttributeToleranceEdrȁ@__ZN24vtkAttributesErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_drЁ@__ZN24vtkAttributesErrorMetric29SetAbsoluteAttributeToleranceEdr؁@__ZN24vtkAttributesErrorMetric3NewEvr@__ZN24vtkAttributesErrorMetric8GetErrorEPdS0_S0_dr@__ZN24vtkCompositeDataIterator10SetDataSetEP19vtkCompositeDataSetr@__ZN24vtkCompositeDataIterator13InitTraversalEvr@__ZN24vtkCompositeDataIterator20InitReverseTraversalEvr@__ZN24vtkImplicitSelectionLoop16EvaluateFunctionEPdr@__ZN24vtkImplicitSelectionLoop16EvaluateGradientEPdS0_r@__ZN24vtkImplicitSelectionLoop3NewEvr@__ZN24vtkImplicitSelectionLoop7SetLoopEP9vtkPointsr@__ZN24vtkImplicitSelectionLoop8GetMTimeEvr@__ZN24vtkIncrementalOctreeNode11InsertPointEP9vtkPointsPKdiPxir@__ZN24vtkIncrementalOctreeNode16DeleteChildNodesEvr@__ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPS_ir@__ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPdPS_irȂ@__ZN24vtkIncrementalOctreeNode27GetDistance2ToInnerBoundaryEPKdPS_rЂ@__ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByDirectSetEPxP9vtkIdListr؂@__ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByInsertionEP9vtkIdListr@__ZN24vtkIncrementalOctreeNode3NewEvr@__ZN24vtkIncrementalOctreeNode9SetBoundsEddddddr@__ZN24vtkLagrangeInterpolation13WedgeEvaluateEPKiPKdPdiS4_r@__ZN24vtkLagrangeInterpolation19WedgeShapeFunctionsEPKiPKdPdr@__ZN24vtkLagrangeInterpolation21Tensor1ShapeFunctionsEPKiPKdPdr@__ZN24vtkLagrangeInterpolation21Tensor2ShapeFunctionsEPKiPKdPdr@__ZN24vtkLagrangeInterpolation21Tensor3ShapeFunctionsEPKiPKdPdr@__ZN24vtkLagrangeInterpolation21WedgeShapeDerivativesEPKiPKdPdr@__ZN24vtkLagrangeInterpolation22EvaluateShapeFunctionsEidPdr@__ZN24vtkLagrangeInterpolation23Tensor1ShapeDerivativesEPKiPKdPdr@__ZN24vtkLagrangeInterpolation23Tensor2ShapeDerivativesEPKiPKdPdr@__ZN24vtkLagrangeInterpolation23Tensor3ShapeDerivativesEPKiPKdPdr@__ZN24vtkLagrangeInterpolation23WedgeEvaluateDerivativeEPKiPKdPdiS4_rȃ@__ZN24vtkLagrangeInterpolation24EvaluateShapeAndGradientEidPdS0_rЃ@__ZN24vtkLagrangeInterpolation25Tensor3EvaluateDerivativeEPKiPKdPdiS4_r؃@__ZN24vtkLagrangeInterpolation26GetFixedParameterOfHexFaceEir@__ZN24vtkLagrangeInterpolation27GetFixedParametersOfHexEdgeEir@__ZN24vtkLagrangeInterpolation27GetParametricHexCoordinatesEir@__ZN24vtkLagrangeInterpolation28GetFixedParameterOfWedgeFaceEir@__ZN24vtkLagrangeInterpolation28GetVaryingParameterOfHexEdgeEir@__ZN24vtkLagrangeInterpolation29GetEdgeIndicesBoundingHexFaceEir@__ZN24vtkLagrangeInterpolation29GetFixedParametersOfWedgeEdgeEir@__ZN24vtkLagrangeInterpolation29GetParametricWedgeCoordinatesEir@__ZN24vtkLagrangeInterpolation29GetVaryingParametersOfHexFaceEir@__ZN24vtkLagrangeInterpolation30GetPointIndicesBoundingHexEdgeEir@__ZN24vtkLagrangeInterpolation30GetPointIndicesBoundingHexFaceEir@__ZN24vtkLagrangeInterpolation30GetVaryingParameterOfWedgeEdgeEir@__ZN24vtkLagrangeInterpolation31GetEdgeIndicesBoundingWedgeFaceEir@__ZN24vtkLagrangeInterpolation31GetVaryingParametersOfWedgeFaceEirȄ@__ZN24vtkLagrangeInterpolation32GetPointIndicesBoundingWedgeEdgeEirЄ@__ZN24vtkLagrangeInterpolation32GetPointIndicesBoundingWedgeFaceEir؄@__ZN24vtkLagrangeInterpolation3NewEvr@__ZN24vtkLagrangeQuadrilateral10InitializeEvr@__ZN24vtkLagrangeQuadrilateral11DerivativesEiPdS0_iS0_r@__ZN24vtkLagrangeQuadrilateral11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN24vtkLagrangeQuadrilateral12CellBoundaryEiPdP9vtkIdListr@__ZN24vtkLagrangeQuadrilateral16EvaluateLocationERiPdS1_S1_r@__ZN24vtkLagrangeQuadrilateral16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN24vtkLagrangeQuadrilateral17InterpolateDerivsEPdS0_r@__ZN24vtkLagrangeQuadrilateral17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN24vtkLagrangeQuadrilateral17PointIndexFromIJKEiiPKir@__ZN24vtkLagrangeQuadrilateral17PointIndexFromIJKEiiir@__ZN24vtkLagrangeQuadrilateral19GetParametricCoordsEvr@__ZN24vtkLagrangeQuadrilateral20InterpolateFunctionsEPdS0_r@__ZN24vtkLagrangeQuadrilateral21GetParametricDistanceEPdrȅ@__ZN24vtkLagrangeQuadrilateral24SubCellCoordinatesFromIdER11vtkVector3iirЅ@__ZN24vtkLagrangeQuadrilateral24SubCellCoordinatesFromIdERiS0_S0_ir؅@__ZN24vtkLagrangeQuadrilateral27TransformApproxToCellParamsEiPdr@__ZN24vtkLagrangeQuadrilateral3NewEvr@__ZN24vtkLagrangeQuadrilateral4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN24vtkLagrangeQuadrilateral7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN24vtkLagrangeQuadrilateral7GetEdgeEir@__ZN24vtkLagrangeQuadrilateral8GetOrderEvr@__ZN24vtkSimpleCellTessellator10InitializeEP17vtkGenericDataSetr@__ZN24vtkSimpleCellTessellator10TessellateEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionP14vtkDoubleArrayP12vtkCellArrayP12vtkPointDatar@__ZN24vtkSimpleCellTessellator11TriangulateEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionP14vtkDoubleArrayP12vtkCellArrayP12vtkPointDatar@__ZN24vtkSimpleCellTessellator14TessellateFaceEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionxP14vtkDoubleArrayP12vtkCellArrayP12vtkPointDatar@__ZN24vtkSimpleCellTessellator20GetFixedSubdivisionsEvr@__ZN24vtkSimpleCellTessellator20SetFixedSubdivisionsEir@__ZN24vtkSimpleCellTessellator20SetSubdivisionLevelsEiir@__ZN24vtkSimpleCellTessellator22GetMaxSubdivisionLevelEvrȆ@__ZN24vtkSimpleCellTessellator22SetMaxSubdivisionLevelEirІ@__ZN24vtkSimpleCellTessellator26GetMaxAdaptiveSubdivisionsEvr؆@__ZN24vtkSimpleCellTessellator3NewEvr@__ZN24vtkSimpleCellTessellator5ResetEvr@__ZN25vtkAbstractElectronicData8DeepCopyEP13vtkDataObjectr@__ZN25vtkAdjacentVertexIterator10InitializeEP8vtkGraphxr@__ZN25vtkAdjacentVertexIterator3NewEvr@__ZN25vtkDataObjectTreeIterator12GoToNextItemEvr@__ZN25vtkDataObjectTreeIterator13GoToFirstItemEvr@__ZN25vtkDataObjectTreeIterator18GetCurrentMetaDataEvr@__ZN25vtkDataObjectTreeIterator18HasCurrentMetaDataEvr@__ZN25vtkDataObjectTreeIterator19GetCurrentFlatIndexEvr@__ZN25vtkDataObjectTreeIterator19IsDoneWithTraversalEvr@__ZN25vtkDataObjectTreeIterator20GetCurrentDataObjectEvr@__ZN25vtkDataObjectTreeIterator3NewEvr@__ZN25vtkDistributedGraphHelper17MakeDistributedIdEixrȇ@__ZN25vtkDistributedGraphHelper18DISTRIBUTEDEDGEIDSEvrЇ@__ZN25vtkDistributedGraphHelper20DISTRIBUTEDVERTEXIDSEvr؇@__ZN25vtkDistributedGraphHelper26GetVertexOwnerByPedigreeIdERK10vtkVariantr@__ZN25vtkGenericCellTessellator12GetMaxErrorsEPdr@__ZN25vtkGenericCellTessellator15SetErrorMetricsEP13vtkCollectionr@__ZN25vtkGenericCellTessellator16InitErrorMetricsEP17vtkGenericDataSetr@__ZN25vtkHierarchicalBoxDataSet11NewIteratorEvr@__ZN25vtkHierarchicalBoxDataSet3NewEvr@__ZN25vtkHierarchicalBoxDataSet7GetDataEP14vtkInformationr@__ZN25vtkHierarchicalBoxDataSet7GetDataEP20vtkInformationVectorir@__ZN25vtkImplicitWindowFunction16EvaluateFunctionEPdr@__ZN25vtkImplicitWindowFunction16EvaluateGradientEPdS0_r@__ZN25vtkImplicitWindowFunction19SetImplicitFunctionEP19vtkImplicitFunctionr@__ZN25vtkImplicitWindowFunction3NewEvr@__ZN25vtkImplicitWindowFunction8GetMTimeEvr@__ZN25vtkMutableUndirectedGraph10RemoveEdgeExrȈ@__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArrayrЈ@__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArrayr؈@__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExxr@__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExxP15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph11RemoveEdgesEP14vtkIdTypeArrayr@__ZN25vtkMutableUndirectedGraph12AddGraphEdgeExxr@__ZN25vtkMutableUndirectedGraph12RemoveVertexExr@__ZN25vtkMutableUndirectedGraph13LazyAddVertexEP15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph13LazyAddVertexERK10vtkVariantr@__ZN25vtkMutableUndirectedGraph13LazyAddVertexEvr@__ZN25vtkMutableUndirectedGraph14RemoveVerticesEP14vtkIdTypeArrayr@__ZN25vtkMutableUndirectedGraph19SetNumberOfVerticesExr@__ZN25vtkMutableUndirectedGraph3NewEvr@__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArrayrȉ@__ZN25vtkMutableUndirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArrayrЉ@__ZN25vtkMutableUndirectedGraph7AddEdgeExxr؉@__ZN25vtkMutableUndirectedGraph7AddEdgeExxP15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph9AddVertexEP15vtkVariantArrayr@__ZN25vtkMutableUndirectedGraph9AddVertexERK10vtkVariantr@__ZN25vtkMutableUndirectedGraph9AddVertexEvr@__ZN25vtkNonMergingPointLocator17InsertUniquePointEPKdRxr@__ZN25vtkNonMergingPointLocator3NewEvr@__ZN25vtkOctreePointLocatorNode13ContainsPointEdddir@__ZN25vtkOctreePointLocatorNode13SetDataBoundsEddddddr@__ZN25vtkOctreePointLocatorNode16CreateChildNodesEvr@__ZN25vtkOctreePointLocatorNode16DeleteChildNodesEvr@__ZN25vtkOctreePointLocatorNode16IntersectsRegionEP21vtkPlanesIntersectionir@__ZN25vtkOctreePointLocatorNode17GetSubOctantIndexEPdir@__ZN25vtkOctreePointLocatorNode22GetDistance2ToBoundaryEdddPS_ir@__ZN25vtkOctreePointLocatorNode22GetDistance2ToBoundaryEdddPdPS_irȊ@__ZN25vtkOctreePointLocatorNode27GetDistance2ToInnerBoundaryEdddPS_rЊ@__ZN25vtkOctreePointLocatorNode28ComputeOctreeNodeInformationEPS_RiS1_Pfr؊@__ZN25vtkOctreePointLocatorNode3NewEvr@__ZN25vtkOctreePointLocatorNode8GetChildEir@__ZN25vtkOctreePointLocatorNode9SetBoundsEddddddr@__ZN25vtkTriQuadraticHexahedron11DerivativesEiPdS0_iS0_r@__ZN25vtkTriQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN25vtkTriQuadraticHexahedron12CellBoundaryEiPdP9vtkIdListr@__ZN25vtkTriQuadraticHexahedron12GetEdgeArrayEir@__ZN25vtkTriQuadraticHexahedron12GetFaceArrayEir@__ZN25vtkTriQuadraticHexahedron16EvaluateLocationERiPdS1_S1_r@__ZN25vtkTriQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN25vtkTriQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN25vtkTriQuadraticHexahedron19GetParametricCoordsEvr@__ZN25vtkTriQuadraticHexahedron19InterpolationDerivsEPdS0_r@__ZN25vtkTriQuadraticHexahedron22InterpolationFunctionsEPdS0_rȋ@__ZN25vtkTriQuadraticHexahedron3NewEvrЋ@__ZN25vtkTriQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir؋@__ZN25vtkTriQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN25vtkTriQuadraticHexahedron7GetEdgeEir@__ZN25vtkTriQuadraticHexahedron7GetFaceEir@__ZN27vtkHyperOctreePointsGrabber12GetDimensionEvr@__ZN28vtkBiQuadraticQuadraticWedge11DerivativesEiPdS0_iS0_r@__ZN28vtkBiQuadraticQuadraticWedge11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN28vtkBiQuadraticQuadraticWedge12CellBoundaryEiPdP9vtkIdListr@__ZN28vtkBiQuadraticQuadraticWedge12GetEdgeArrayEir@__ZN28vtkBiQuadraticQuadraticWedge12GetFaceArrayEir@__ZN28vtkBiQuadraticQuadraticWedge16EvaluateLocationERiPdS1_S1_r@__ZN28vtkBiQuadraticQuadraticWedge16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN28vtkBiQuadraticQuadraticWedge17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN28vtkBiQuadraticQuadraticWedge19GetParametricCoordsEvr@__ZN28vtkBiQuadraticQuadraticWedge19InterpolationDerivsEPdS0_rȌ@__ZN28vtkBiQuadraticQuadraticWedge22InterpolationFunctionsEPdS0_rЌ@__ZN28vtkBiQuadraticQuadraticWedge3NewEvr،@__ZN28vtkBiQuadraticQuadraticWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN28vtkBiQuadraticQuadraticWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN28vtkBiQuadraticQuadraticWedge7GetEdgeEir@__ZN28vtkBiQuadraticQuadraticWedge7GetFaceEir@__ZN29vtkGenericAttributeCollection11ShallowCopyEPS_r@__ZN29vtkGenericAttributeCollection12GetAttributeEir@__ZN29vtkGenericAttributeCollection12HasAttributeEiPiir@__ZN29vtkGenericAttributeCollection13FindAttributeEPKcr@__ZN29vtkGenericAttributeCollection15InsertAttributeEiP19vtkGenericAttributer@__ZN29vtkGenericAttributeCollection15RemoveAttributeEir@__ZN29vtkGenericAttributeCollection17GetAttributeIndexEir@__ZN29vtkGenericAttributeCollection18SetActiveAttributeEiir@__ZN29vtkGenericAttributeCollection19GetActualMemorySizeEvr@__ZN29vtkGenericAttributeCollection19InsertNextAttributeEP19vtkGenericAttributerȍ@__ZN29vtkGenericAttributeCollection21GetNumberOfAttributesEvrЍ@__ZN29vtkGenericAttributeCollection21GetNumberOfComponentsEvr؍@__ZN29vtkGenericAttributeCollection24GetMaxNumberOfComponentsEvr@__ZN29vtkGenericAttributeCollection26GetAttributesToInterpolateEvr@__ZN29vtkGenericAttributeCollection26SetAttributesToInterpolateEiPir@__ZN29vtkGenericAttributeCollection31SetAttributesToInterpolateToAllEvr@__ZN29vtkGenericAttributeCollection34GetNumberOfPointCenteredComponentsEvr@__ZN29vtkGenericAttributeCollection3NewEvr@__ZN29vtkGenericAttributeCollection5ResetEvr@__ZN29vtkGenericAttributeCollection7IsEmptyEvr@__ZN29vtkGenericAttributeCollection8DeepCopyEPS_r@__ZN29vtkGenericAttributeCollection8GetMTimeEvr@__ZN29vtkImplicitFunctionCollection3NewEvr@__ZN29vtkQuadratureSchemeDefinition10DICTIONARYEvr@__ZN29vtkQuadratureSchemeDefinition10InitializeEiiiPdr@__ZN29vtkQuadratureSchemeDefinition10InitializeEiiiPdS0_rȎ@__ZN29vtkQuadratureSchemeDefinition12RestoreStateEP17vtkXMLDataElementrЎ@__ZN29vtkQuadratureSchemeDefinition28QUADRATURE_OFFSET_ARRAY_NAMEEvr؎@__ZN29vtkQuadratureSchemeDefinition3NewEvr@__ZN29vtkQuadratureSchemeDefinition5ClearEvr@__ZN29vtkQuadratureSchemeDefinition8DeepCopyEPKS_r@__ZN29vtkQuadratureSchemeDefinition9SaveStateEP17vtkXMLDataElementr@__ZN29vtkStructuredPointsCollection3NewEvr@__ZN29vtkUniformGridAMRDataIterator12GoToNextItemEvr@__ZN29vtkUniformGridAMRDataIterator13GoToFirstItemEvr@__ZN29vtkUniformGridAMRDataIterator15GetCurrentIndexEvr@__ZN29vtkUniformGridAMRDataIterator15GetCurrentLevelEvr@__ZN29vtkUniformGridAMRDataIterator18GetCurrentMetaDataEvr@__ZN29vtkUniformGridAMRDataIterator19GetCurrentFlatIndexEvr@__ZN29vtkUniformGridAMRDataIterator19IsDoneWithTraversalEvr@__ZN29vtkUniformGridAMRDataIterator20GetCurrentDataObjectEvr@__ZN29vtkUniformGridAMRDataIterator3NewEvrȏ@__ZN30vtkCommonInformationKeyManagerC1EvrЏ@__ZN30vtkExtractStructuredGridHelper10InitializeEPiS0_S0_br؏@__ZN30vtkExtractStructuredGridHelper12CopyCellDataEPiS0_P11vtkCellDataS2_r@__ZN30vtkExtractStructuredGridHelper14GetMappedIndexEiir@__ZN30vtkExtractStructuredGridHelper17GetPartitionedVOIEPKiS1_S1_bPir@__ZN30vtkExtractStructuredGridHelper18ComputeBeginAndEndEPiS0_S0_S0_r@__ZN30vtkExtractStructuredGridHelper20GetMappedExtentValueEiir@__ZN30vtkExtractStructuredGridHelper22CopyPointsAndPointDataEPiS0_P12vtkPointDataP9vtkPointsS2_S4_r@__ZN30vtkExtractStructuredGridHelper26GetPartitionedOutputExtentEPKiS1_S1_S1_bPir@__ZN30vtkExtractStructuredGridHelper29GetMappedExtentValueFromIndexEiir@__ZN30vtkExtractStructuredGridHelper29GetMappedIndexFromExtentValueEiir@__ZN30vtkExtractStructuredGridHelper3NewEvr@__ZN30vtkExtractStructuredGridHelper7GetSizeEir@__ZN30vtkHierarchicalBoxDataIterator3NewEvr@__ZN31vtkHyperOctreeLightWeightCursor10InitializeEP14vtkHyperOctreer@__ZN31vtkHyperOctreeLightWeightCursor6ToRootEvrȐ@__ZN31vtkHyperOctreeLightWeightCursor7ToChildEirА@__ZN31vtkHyperOctreeLightWeightCursor9GetIsLeafEvrؐ@__ZN31vtkHyperOctreeLightWeightCursorC1Evr@__ZN31vtkObjectFactoryRegistryCleanupC1Evr@__ZN31vtkUnstructuredGridCellIterator19IsDoneWithTraversalEvr@__ZN31vtkUnstructuredGridCellIterator3NewEvr@__ZN31vtkUnstructuredGridCellIterator9GetCellIdEvr@__ZN32vtkGenericSubdivisionErrorMetric10SetDataSetEP17vtkGenericDataSetr@__ZN32vtkGenericSubdivisionErrorMetric14SetGenericCellEP21vtkGenericAdaptorCellr@__ZN32vtkIncrementalOctreePointLocator11InsertPointExPKdr@__ZN32vtkIncrementalOctreePointLocator12BuildLocatorEvr@__ZN32vtkIncrementalOctreePointLocator15InsertNextPointEPKdr@__ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEPKdr@__ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEdddr@__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKdr@__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKdPdrȑ@__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEdddrБ@__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEdddPdrؑ@__ZN32vtkIncrementalOctreePointLocator17GetNumberOfPointsEvr@__ZN32vtkIncrementalOctreePointLocator17InsertUniquePointEPKdRxr@__ZN32vtkIncrementalOctreePointLocator18FindClosestNPointsEiPKdP9vtkIdListr@__ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKdr@__ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKdxr@__ZN32vtkIncrementalOctreePointLocator19FreeSearchStructureEvr@__ZN32vtkIncrementalOctreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdListr@__ZN32vtkIncrementalOctreePointLocator22GenerateRepresentationEiP11vtkPolyDatar@__ZN32vtkIncrementalOctreePointLocator24FindClosestInsertedPointEPKdr@__ZN32vtkIncrementalOctreePointLocator26InsertPointWithoutCheckingEPKdRxir@__ZN32vtkIncrementalOctreePointLocator28FindClosestPointWithinRadiusEdPKdRdr@__ZN32vtkIncrementalOctreePointLocator29FindPointsWithinSquaredRadiusEdPKdP9vtkIdListr@__ZN32vtkIncrementalOctreePointLocator35FindClosestPointWithinSquaredRadiusEdPKdRdr@__ZN32vtkIncrementalOctreePointLocator3NewEvrȒ@__ZN32vtkIncrementalOctreePointLocator9GetBoundsEPdrВ@__ZN32vtkReebGraphSimplificationMetric13ComputeMetricEP10vtkDataSetP12vtkDataArrayxP16vtkAbstractArrayxrؒ@__ZN32vtkReebGraphSimplificationMetric3NewEvr@__ZN33vtkBiQuadraticQuadraticHexahedron11DerivativesEiPdS0_iS0_r@__ZN33vtkBiQuadraticQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN33vtkBiQuadraticQuadraticHexahedron12CellBoundaryEiPdP9vtkIdListr@__ZN33vtkBiQuadraticQuadraticHexahedron12GetEdgeArrayEir@__ZN33vtkBiQuadraticQuadraticHexahedron12GetFaceArrayEir@__ZN33vtkBiQuadraticQuadraticHexahedron16EvaluateLocationERiPdS1_S1_r@__ZN33vtkBiQuadraticQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN33vtkBiQuadraticQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN33vtkBiQuadraticQuadraticHexahedron19GetParametricCoordsEvr@__ZN33vtkBiQuadraticQuadraticHexahedron19InterpolationDerivsEPdS0_r@__ZN33vtkBiQuadraticQuadraticHexahedron22InterpolationFunctionsEPdS0_r@__ZN33vtkBiQuadraticQuadraticHexahedron3NewEvr@__ZN33vtkBiQuadraticQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_irȓ@__ZN33vtkBiQuadraticQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rГ@__ZN33vtkBiQuadraticQuadraticHexahedron7GetEdgeEirؓ@__ZN33vtkBiQuadraticQuadraticHexahedron7GetFaceEir@__ZN33vtkIterativeClosestPointTransform10SetLocatorEP14vtkCellLocatorr@__ZN33vtkIterativeClosestPointTransform13MakeTransformEvr@__ZN33vtkIterativeClosestPointTransform27GetMeanDistanceModeAsStringEvr@__ZN33vtkIterativeClosestPointTransform3NewEvr@__ZN33vtkIterativeClosestPointTransform7InverseEvr@__ZN33vtkIterativeClosestPointTransform9SetSourceEP10vtkDataSetr@__ZN33vtkIterativeClosestPointTransform9SetTargetEP10vtkDataSetr@__ZN35vtkGenericInterpolatedVelocityField10AddDataSetEP17vtkGenericDataSetr@__ZN35vtkGenericInterpolatedVelocityField11GetLastCellEvr@__ZN35vtkGenericInterpolatedVelocityField13ClearLastCellEvr@__ZN35vtkGenericInterpolatedVelocityField14CopyParametersEPS_r@__ZN35vtkGenericInterpolatedVelocityField14FunctionValuesEPdS0_r@__ZN35vtkGenericInterpolatedVelocityField23GetLastLocalCoordinatesEPdrȔ@__ZN35vtkGenericInterpolatedVelocityField3NewEvrД@__ZN35vtkMeanValueCoordinatesInterpolator27ComputeInterpolationWeightsEPdP9vtkPointsP12vtkCellArrayS0_rؔ@__ZN35vtkMeanValueCoordinatesInterpolator27ComputeInterpolationWeightsEPdP9vtkPointsP9vtkIdListS0_r@__ZN35vtkMeanValueCoordinatesInterpolator3NewEvr@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey11ShallowCopyEP14vtkInformationS1_r@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey12RestoreStateEP14vtkInformationP17vtkXMLDataElementr@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey3GetEP14vtkInformationir@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey3SetEP14vtkInformationP29vtkQuadratureSchemeDefinitionir@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey4SizeEP14vtkInformationr@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey5ClearEP14vtkInformationr@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey6AppendEP14vtkInformationP29vtkQuadratureSchemeDefinitionr@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey6ResizeEP14vtkInformationir@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey8DeepCopyEP14vtkInformationS1_r@__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey9SaveStateEP14vtkInformationP17vtkXMLDataElementr@__ZN6vtkBox12IntersectBoxEPdS0_S0_S0_Rdr@__ZN6vtkBox16EvaluateFunctionEPdrȕ@__ZN6vtkBox16EvaluateGradientEPdS0_rЕ@__ZN6vtkBox17IntersectWithLineEPKdS1_S1_RdS2_PdS3_RiS4_rؕ@__ZN6vtkBox18IntersectWithPlaneEPdS0_S0_r@__ZN6vtkBox3NewEvr@__ZN6vtkBox7GetXMaxEPdr@__ZN6vtkBox7GetXMaxERdS0_S0_r@__ZN6vtkBox7GetXMinEPdr@__ZN6vtkBox7GetXMinERdS0_S0_r@__ZN6vtkBox7SetXMaxEdddr@__ZN6vtkBox7SetXMinEdddr@__ZN6vtkBox9AddBoundsEPKdr@__ZN6vtkBox9GetBoundsEPdr@__ZN6vtkBox9GetBoundsERdS0_S0_S0_S0_S0_r@__ZN6vtkBox9GetBoundsEvr@__ZN6vtkBox9SetBoundsEPKdr@__ZN6vtkBox9SetBoundsEddddddrȖ@__ZN7vtkAtom11SetPositionEPKfrЖ@__ZN7vtkAtom11SetPositionERK11vtkVector3frؖ@__ZN7vtkAtom11SetPositionEfffr@__ZN7vtkAtom15SetAtomicNumberEtr@__ZN7vtkBond10GetEndAtomEvr@__ZN7vtkBond12GetBeginAtomEvr@__ZN7vtkBond8GetOrderEvr@__ZN7vtkCell10GetLength2Evr@__ZN7vtkCell10InitializeEiP9vtkPointsr@__ZN7vtkCell10InitializeEiPxP9vtkPointsr@__ZN7vtkCell11ShallowCopyEPS_r@__ZN7vtkCell19GetParametricCenterEPdr@__ZN7vtkCell19GetParametricCoordsEvr@__ZN7vtkCell21GetParametricDistanceEPdr@__ZN7vtkCell8DeepCopyEPS_r@__ZN7vtkCell9GetBoundsEPdrȗ@__ZN7vtkCell9GetBoundsEvrЗ@__ZN7vtkCone16EvaluateFunctionEPdrؗ@__ZN7vtkCone16EvaluateGradientEPdS0_r@__ZN7vtkCone3NewEvr@__ZN7vtkLine11DerivativesEiPdS0_iS0_r@__ZN7vtkLine11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN7vtkLine12CellBoundaryEiPdP9vtkIdListr@__ZN7vtkLine12IntersectionEPKdS1_S1_S1_RdS2_r@__ZN7vtkLine14DistanceToLineEPKdS1_S1_r@__ZN7vtkLine14DistanceToLineEPKdS1_S1_RdPdr@__ZN7vtkLine14Intersection3DEPdS0_S0_S0_RdS1_r@__ZN7vtkLine16EvaluateLocationERiPdS1_S1_r@__ZN7vtkLine16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN7vtkLine17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN7vtkLine19GetParametricCoordsEvr@__ZN7vtkLine19InterpolationDerivsEPdS0_rȘ@__ZN7vtkLine20DistanceBetweenLinesEPdS0_S0_S0_S0_S0_RdS1_rИ@__ZN7vtkLine22InterpolationFunctionsEPdS0_rؘ@__ZN7vtkLine27DistanceBetweenLineSegmentsEPdS0_S0_S0_S0_S0_RdS1_r@__ZN7vtkLine3NewEvr@__ZN7vtkLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN7vtkLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN7vtkPath13GetCellPointsExP9vtkIdListr@__ZN7vtkPath13GetPointCellsExP9vtkIdListr@__ZN7vtkPath15InsertNextPointEPdir@__ZN7vtkPath15InsertNextPointEdddir@__ZN7vtkPath3NewEvr@__ZN7vtkPath5ResetEvr@__ZN7vtkPath7GetCellExP14vtkGenericCellr@__ZN7vtkPath7GetDataEP14vtkInformationr@__ZN7vtkPath7GetDataEP20vtkInformationVectorir@__ZN7vtkPath8AllocateExirș@__ZN7vtkPath8GetCodesEvrЙ@__ZN7vtkPath8SetCodesEP11vtkIntArrayrؙ@__ZN7vtkQuad11DerivativesEiPdS0_iS0_r@__ZN7vtkQuad11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN7vtkQuad12CellBoundaryEiPdP9vtkIdListr@__ZN7vtkQuad12GetEdgeArrayEir@__ZN7vtkQuad16EvaluateLocationERiPdS1_S1_r@__ZN7vtkQuad16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN7vtkQuad17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN7vtkQuad19GetParametricCoordsEvr@__ZN7vtkQuad19InterpolationDerivsEPdS0_r@__ZN7vtkQuad22InterpolationFunctionsEPdS0_r@__ZN7vtkQuad3NewEvr@__ZN7vtkQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN7vtkQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN7vtkQuad7GetEdgeEirȚ@__ZN7vtkTree13GetParentEdgeExrК@__ZN7vtkTree15ReorderChildrenExP14vtkIdTypeArrayrؚ@__ZN7vtkTree3NewEvr@__ZN7vtkTree6IsLeafExr@__ZN7vtkTree7GetDataEP14vtkInformationr@__ZN7vtkTree7GetDataEP20vtkInformationVectorir@__ZN7vtkTree8GetChildExxr@__ZN7vtkTree8GetLevelExr@__ZN7vtkTree9GetParentExr@__ZN8vtkGraph10FindVertexERK10vtkVariantr@__ZN8vtkGraph10GetInEdgesExP17vtkInEdgeIteratorr@__ZN8vtkGraph10GetOutEdgeExxr@__ZN8vtkGraph10GetOutEdgeExxP12vtkGraphEdger@__ZN8vtkGraph10InitializeEvr@__ZN8vtkGraph11GetInDegreeExr@__ZN8vtkGraph11GetOutEdgesExP18vtkOutEdgeIteratorrț@__ZN8vtkGraph11GetVerticesEP21vtkVertexListIteratorrЛ@__ZN8vtkGraph11ShallowCopyEP13vtkDataObjectr؛@__ZN8vtkGraph12AddEdgePointExPdr@__ZN8vtkGraph12GetEdgePointExxr@__ZN8vtkGraph12GetOutDegreeExr@__ZN8vtkGraph12SetEdgePointExxPdr@__ZN8vtkGraph13ComputeBoundsEvr@__ZN8vtkGraph13CopyStructureEPS_r@__ZN8vtkGraph13GetEdgePointsExRxRPdr@__ZN8vtkGraph13SetEdgePointsExxPdr@__ZN8vtkGraph15CheckedDeepCopyEPS_r@__ZN8vtkGraph15ClearEdgePointsExr@__ZN8vtkGraph15GetInducedEdgesEP14vtkIdTypeArrayS1_r@__ZN8vtkGraph15GetSourceVertexExr@__ZN8vtkGraph15GetTargetVertexExr@__ZN8vtkGraph15IsSameStructureEPS_rȜ@__ZN8vtkGraph15ToDirectedGraphEP16vtkDirectedGraphrМ@__ZN8vtkGraph16GetNumberOfEdgesEvr؜@__ZN8vtkGraph17GetGraphInternalsEbr@__ZN8vtkGraph17ToUndirectedGraphEP18vtkUndirectedGraphr@__ZN8vtkGraph18CheckedShallowCopyEPS_r@__ZN8vtkGraph18DeepCopyEdgePointsEPS_r@__ZN8vtkGraph18ReorderOutVerticesExP14vtkIdTypeArrayr@__ZN8vtkGraph19GetAdjacentVerticesExP25vtkAdjacentVertexIteratorr@__ZN8vtkGraph19GetNumberOfElementsEir@__ZN8vtkGraph19GetNumberOfVerticesEvr@__ZN8vtkGraph21GetNumberOfEdgePointsExr@__ZN8vtkGraph21ShallowCopyEdgePointsEPS_r@__ZN8vtkGraph24GetAttributesAsFieldDataEir@__ZN8vtkGraph25GetDistributedGraphHelperEvr@__ZN8vtkGraph25SetDistributedGraphHelperEP25vtkDistributedGraphHelperr@__ZN8vtkGraph4DumpEvrȝ@__ZN8vtkGraph7GetDataEP14vtkInformationrН@__ZN8vtkGraph7GetDataEP20vtkInformationVectorir؝@__ZN8vtkGraph7SqueezeEvr@__ZN8vtkGraph8DeepCopyEP13vtkDataObjectr@__ZN8vtkGraph8GetEdgesEP19vtkEdgeListIteratorr@__ZN8vtkGraph8GetMTimeEvr@__ZN8vtkGraph8GetPointExr@__ZN8vtkGraph8GetPointExPdr@__ZN8vtkGraph9GetBoundsEPdr@__ZN8vtkGraph9GetBoundsEvr@__ZN8vtkGraph9GetDegreeExr@__ZN8vtkGraph9GetEdgeIdExxr@__ZN8vtkGraph9GetInEdgeExxr@__ZN8vtkGraph9GetInEdgeExxP12vtkGraphEdger@__ZN8vtkGraph9GetPointsEvr@__ZN8vtkGraph9SetPointsEP9vtkPointsrȞ@__ZN8vtkPixel11DerivativesEiPdS0_iS0_rО@__ZN8vtkPixel11TriangulateEiP9vtkIdListP9vtkPointsr؞@__ZN8vtkPixel12CellBoundaryEiPdP9vtkIdListr@__ZN8vtkPixel16EvaluateLocationERiPdS1_S1_r@__ZN8vtkPixel16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN8vtkPixel17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN8vtkPixel19GetParametricCoordsEvr@__ZN8vtkPixel19InterpolationDerivsEPdS0_r@__ZN8vtkPixel22InterpolationFunctionsEPdS0_r@__ZN8vtkPixel3NewEvr@__ZN8vtkPixel4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN8vtkPixel7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN8vtkPixel7GetEdgeEir@__ZN8vtkPlane12ProjectPointEPdS0_r@__ZN8vtkPlane12ProjectPointEPdS0_S0_S0_r@__ZN8vtkPlane13ProjectVectorEPdS0_rȟ@__ZN8vtkPlane13ProjectVectorEPdS0_S0_S0_rП@__ZN8vtkPlane15DistanceToPlaneEPdr؟@__ZN8vtkPlane16EvaluateFunctionEP12vtkDataArrayS1_r@__ZN8vtkPlane16EvaluateFunctionEPdr@__ZN8vtkPlane16EvaluateGradientEPdS0_r@__ZN8vtkPlane17IntersectWithLineEPdS0_RdS0_r@__ZN8vtkPlane17IntersectWithLineEPdS0_S0_S0_RdS0_r@__ZN8vtkPlane23GeneralizedProjectPointEPdS0_r@__ZN8vtkPlane23GeneralizedProjectPointEPdS0_S0_S0_r@__ZN8vtkPlane3NewEvr@__ZN8vtkPlane4PushEdr@__ZN8vtkTable10InitializeEvr@__ZN8vtkTable10SetRowDataEP20vtkDataSetAttributesr@__ZN8vtkTable11ShallowCopyEP13vtkDataObjectr@__ZN8vtkTable12RemoveColumnExr@__ZN8vtkTable13GetColumnNameExrȠ@__ZN8vtkTable13InsertNextRowEP15vtkVariantArrayrР@__ZN8vtkTable14GetValueByNameExPKcrؠ@__ZN8vtkTable14SetValueByNameExPKc10vtkVariantr@__ZN8vtkTable15GetColumnByNameEPKcr@__ZN8vtkTable15GetNumberOfRowsEvr@__ZN8vtkTable15SetNumberOfRowsExr@__ZN8vtkTable18GetNumberOfColumnsEvr@__ZN8vtkTable18InsertNextBlankRowEdr@__ZN8vtkTable18RemoveColumnByNameEPKcr@__ZN8vtkTable19GetActualMemorySizeEvr@__ZN8vtkTable19GetNumberOfElementsEir@__ZN8vtkTable24GetAttributesAsFieldDataEir@__ZN8vtkTable3NewEvr@__ZN8vtkTable4DumpEjir@__ZN8vtkTable6GetRowExr@__ZN8vtkTable6GetRowExP15vtkVariantArrayrȡ@__ZN8vtkTable6SetRowExP15vtkVariantArrayrС@__ZN8vtkTable7GetDataEP14vtkInformationrء@__ZN8vtkTable7GetDataEP20vtkInformationVectorir@__ZN8vtkTable8DeepCopyEP13vtkDataObjectr@__ZN8vtkTable8GetValueExxr@__ZN8vtkTable8SetValueExx10vtkVariantr@__ZN8vtkTable9AddColumnEP16vtkAbstractArrayr@__ZN8vtkTable9GetColumnExr@__ZN8vtkTable9RemoveRowExr@__ZN8vtkTetra11DerivativesEiPdS0_iS0_r@__ZN8vtkTetra11TetraCenterEPdS0_S0_S0_S0_r@__ZN8vtkTetra11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN8vtkTetra12CellBoundaryEiPdP9vtkIdListr@__ZN8vtkTetra12CircumsphereEPdS0_S0_S0_S0_r@__ZN8vtkTetra12GetEdgeArrayEir@__ZN8vtkTetra12GetFaceArrayEirȢ@__ZN8vtkTetra13ComputeVolumeEPdS0_S0_S0_rТ@__ZN8vtkTetra13GetEdgePointsEiRPirآ@__ZN8vtkTetra13GetFacePointsEiRPir@__ZN8vtkTetra16EvaluateLocationERiPdS1_S1_r@__ZN8vtkTetra16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN8vtkTetra17BarycentricCoordsEPdS0_S0_S0_S0_S0_r@__ZN8vtkTetra17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN8vtkTetra19GetParametricCoordsEvr@__ZN8vtkTetra19InterpolationDerivsEPdS0_r@__ZN8vtkTetra21GetParametricDistanceEPdr@__ZN8vtkTetra22InterpolationFunctionsEPdS0_r@__ZN8vtkTetra3NewEvr@__ZN8vtkTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN8vtkTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN8vtkTetra7GetEdgeEir@__ZN8vtkTetra7GetFaceEirȣ@__ZN8vtkTetra8InsphereEPdS0_S0_S0_S0_rУ@__ZN8vtkVoxel11DerivativesEiPdS0_iS0_rأ@__ZN8vtkVoxel11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN8vtkVoxel12CellBoundaryEiPdP9vtkIdListr@__ZN8vtkVoxel12GetEdgeArrayEir@__ZN8vtkVoxel12GetFaceArrayEir@__ZN8vtkVoxel13GetEdgePointsEiRPir@__ZN8vtkVoxel13GetFacePointsEiRPir@__ZN8vtkVoxel16EvaluateLocationERiPdS1_S1_r@__ZN8vtkVoxel16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN8vtkVoxel17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN8vtkVoxel19GetParametricCoordsEvr@__ZN8vtkVoxel19InterpolationDerivsEPdS0_r@__ZN8vtkVoxel22InterpolationFunctionsEPdS0_r@__ZN8vtkVoxel3NewEvr@__ZN8vtkVoxel7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rȤ@__ZN8vtkVoxel7GetEdgeEirФ@__ZN8vtkVoxel7GetFaceEirؤ@__ZN8vtkWedge11DerivativesEiPdS0_iS0_r@__ZN8vtkWedge11TriangulateEiP9vtkIdListP9vtkPointsr@__ZN8vtkWedge12CellBoundaryEiPdP9vtkIdListr@__ZN8vtkWedge12GetEdgeArrayEir@__ZN8vtkWedge12GetFaceArrayEir@__ZN8vtkWedge13GetEdgePointsEiRPir@__ZN8vtkWedge13GetFacePointsEiRPir@__ZN8vtkWedge16EvaluateLocationERiPdS1_S1_r@__ZN8vtkWedge16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN8vtkWedge17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN8vtkWedge19GetParametricCoordsEvr@__ZN8vtkWedge19InterpolationDerivsEPdS0_r@__ZN8vtkWedge22InterpolationFunctionsEPdS0_r@__ZN8vtkWedge3NewEvrȥ@__ZN8vtkWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_rХ@__ZN8vtkWedge7GetEdgeEirإ@__ZN8vtkWedge7GetFaceEir@__ZN9vtkAMRBox11DeserializeEPhRKxr@__ZN9vtkAMRBox12GetBoxOriginERKS_PKdS3_Pdr@__ZN9vtkAMRBox12RemoveGhostsEir@__ZN9vtkAMRBox13SetDimensionsEPKiS1_ir@__ZN9vtkAMRBox13SetDimensionsEPKiir@__ZN9vtkAMRBox13SetDimensionsEiiiiiiir@__ZN9vtkAMRBox18GetCellLinearIndexERKS_iiiPir@__ZN9vtkAMRBox28ComputeStructuredCoordinatesERKS_PKdS3_S3_PiPdr@__ZN9vtkAMRBox4GrowEir@__ZN9vtkAMRBox5ShiftEPKir@__ZN9vtkAMRBox5ShiftEiiir@__ZN9vtkAMRBox6RefineEir@__ZN9vtkAMRBox6ShrinkEirȦ@__ZN9vtkAMRBox7CoarsenEirЦ@__ZN9vtkAMRBox8HasPointERKS_PKdS3_dddrئ@__ZN9vtkAMRBox9GetBoundsERKS_PKdS3_Pdr@__ZN9vtkAMRBox9IntersectERKS_r@__ZN9vtkAMRBox9SerializeERPhRxr@__ZN9vtkAMRBoxC1EPKdPKiS1_S1_ir@__ZN9vtkAMRBoxC1EPKir@__ZN9vtkAMRBoxC1EPKiS1_r@__ZN9vtkAMRBoxC1ERKS_r@__ZN9vtkAMRBoxC1Eiiiiiir@__ZN9vtkAMRBoxC1Evr@__ZN9vtkCell3D4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN9vtkCell3D7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZN9vtkKdNode11ContainsBoxEddddddir@__ZN9vtkKdNode12SetMaxBoundsEPKdr@__ZN9vtkKdNode12SetMinBoundsEPKdrȧ@__ZN9vtkKdNode13AddChildNodesEPS_S0_rЧ@__ZN9vtkKdNode13ContainsPointEdddirا@__ZN9vtkKdNode13IntersectsBoxEddddddir@__ZN9vtkKdNode13SetDataBoundsEPfr@__ZN9vtkKdNode13SetDataBoundsEddddddr@__ZN9vtkKdNode14IntersectsCellEP7vtkCelliiPdr@__ZN9vtkKdNode16DeleteChildNodesEvr@__ZN9vtkKdNode16IntersectsRegionEP21vtkPlanesIntersectionir@__ZN9vtkKdNode16PrintVerboseNodeEir@__ZN9vtkKdNode16SetMaxDataBoundsEPKdr@__ZN9vtkKdNode16SetMinDataBoundsEPKdr@__ZN9vtkKdNode17IntersectsSphere2Eddddir@__ZN9vtkKdNode19GetDivisionPositionEvr@__ZN9vtkKdNode22GetDistance2ToBoundaryEdddPdir@__ZN9vtkKdNode22GetDistance2ToBoundaryEdddir@__ZN9vtkKdNode27GetDistance2ToInnerBoundaryEdddrȨ@__ZN9vtkKdNode3NewEvrШ@__ZN9vtkKdNode5SetUpEPS_rب@__ZN9vtkKdNode7SetLeftEPS_r@__ZN9vtkKdNode8SetRightEPS_r@__ZN9vtkKdNode9PrintNodeEir@__ZN9vtkKdNode9SetBoundsEddddddr@__ZN9vtkKdTree10AddDataSetEP10vtkDataSetr@__ZN9vtkKdTree10GetDataSetEir@__ZN9vtkKdTree10SetDataSetEP10vtkDataSetr@__ZN9vtkKdTree11GetCellListEir@__ZN9vtkKdTree11NewGeometryEvr@__ZN9vtkKdTree11PrintRegionEir@__ZN9vtkKdTree12BuildLocatorEvr@__ZN9vtkKdTree12GetCellListsEP11vtkIntArrayP10vtkDataSetP9vtkIdListS5_r@__ZN9vtkKdTree12GetCellListsEP11vtkIntArrayP9vtkIdListS3_r@__ZN9vtkKdTree12GetCellListsEP11vtkIntArrayiP9vtkIdListS3_rȩ@__ZN9vtkKdTree12SetNewBoundsEPdrЩ@__ZN9vtkKdTree13RemoveDataSetEP10vtkDataSetrة@__ZN9vtkKdTree13RemoveDataSetEir@__ZN9vtkKdTree15CreateCellListsEP10vtkDataSetPiir@__ZN9vtkKdTree15CreateCellListsEPiir@__ZN9vtkKdTree15CreateCellListsEiPiir@__ZN9vtkKdTree15CreateCellListsEvr@__ZN9vtkKdTree15DeleteCellListsEvr@__ZN9vtkKdTree15GetDataSetIndexEP10vtkDataSetr@__ZN9vtkKdTree15GetRegionBoundsEiPdr@__ZN9vtkKdTree16FindClosestPointEPdRdr@__ZN9vtkKdTree16FindClosestPointEdddRdr@__ZN9vtkKdTree16FindPointsInAreaEPdP14vtkIdTypeArraybr@__ZN9vtkKdTree16PrintVerboseTreeEvr@__ZN9vtkKdTree17GetPointsInRegionEir@__ZN9vtkKdTree17OmitXPartitioningEvrȪ@__ZN9vtkKdTree17OmitYPartitioningEvrЪ@__ZN9vtkKdTree17OmitZPartitioningEvrت@__ZN9vtkKdTree17RemoveAllDataSetsEvr@__ZN9vtkKdTree18FindClosestNPointsEiPKdP9vtkIdListr@__ZN9vtkKdTree18InvalidateGeometryEvr@__ZN9vtkKdTree18OmitNoPartitioningEvr@__ZN9vtkKdTree18OmitXYPartitioningEvr@__ZN9vtkKdTree18OmitYZPartitioningEvr@__ZN9vtkKdTree18OmitZXPartitioningEvr@__ZN9vtkKdTree19FreeSearchStructureEvr@__ZN9vtkKdTree19GetBoundaryCellListEir@__ZN9vtkKdTree19GetNumberOfDataSetsEvr@__ZN9vtkKdTree19GetRegionDataBoundsEiPdr@__ZN9vtkKdTree22BuildLocatorFromPointsEP11vtkPointSetr@__ZN9vtkKdTree22BuildLocatorFromPointsEP9vtkPointsr@__ZN9vtkKdTree22FindPointsWithinRadiusEdPKdP9vtkIdListrȫ@__ZN9vtkKdTree22GenerateRepresentationEPiiP11vtkPolyDatarЫ@__ZN9vtkKdTree22GenerateRepresentationEiP11vtkPolyDatarث@__ZN9vtkKdTree23GetRegionContainingCellEP10vtkDataSetxr@__ZN9vtkKdTree23GetRegionContainingCellEixr@__ZN9vtkKdTree23GetRegionContainingCellExr@__ZN9vtkKdTree24FindClosestPointInRegionEiPdRdr@__ZN9vtkKdTree24FindClosestPointInRegionEidddRdr@__ZN9vtkKdTree24GetRegionContainingPointEdddr@__ZN9vtkKdTree26AllGetRegionContainingCellEvr@__ZN9vtkKdTree26BuildMapForDuplicatePointsEfr@__ZN9vtkKdTree27ViewOrderRegionsInDirectionEP11vtkIntArrayPKdS1_r@__ZN9vtkKdTree28FindClosestPointWithinRadiusEdPKdRdr@__ZN9vtkKdTree28ViewOrderRegionsFromPositionEP11vtkIntArrayPKdS1_r@__ZN9vtkKdTree30ViewOrderAllRegionsInDirectionEPKdP11vtkIntArrayr@__ZN9vtkKdTree31ViewOrderAllRegionsFromPositionEPKdP11vtkIntArrayr@__ZN9vtkKdTree3NewEvrȬ@__ZN9vtkKdTree7SetCutsEP10vtkBSPCutsrЬ@__ZN9vtkKdTree8CopyTreeEP9vtkKdNoderج@__ZN9vtkKdTree9FindPointEPdr@__ZN9vtkKdTree9FindPointEdddr@__ZN9vtkKdTree9GetBoundsEPdr@__ZN9vtkKdTree9PrintTreeEvr@__ZN9vtkObject11HasObserverEPKcr@__ZN9vtkObject11InvokeEventEPKcPvr@__ZN9vtkObject12BreakOnErrorEvr@__ZN9vtkObject23GetGlobalWarningDisplayEvr@__ZN9vtkPlanes10SetNormalsEP12vtkDataArrayr@__ZN9vtkPlanes16EvaluateFunctionEPdr@__ZN9vtkPlanes16EvaluateGradientEPdS0_r@__ZN9vtkPlanes16SetFrustumPlanesEPdr@__ZN9vtkPlanes17GetNumberOfPlanesEvr@__ZN9vtkPlanes3NewEvrȭ@__ZN9vtkPlanes8GetPlaneEirЭ@__ZN9vtkPlanes8GetPlaneEiP8vtkPlanerح@__ZN9vtkPlanes9SetBoundsEPKdr@__ZN9vtkPlanes9SetBoundsEddddddr@__ZN9vtkPlanes9SetPointsEP9vtkPointsr@__ZN9vtkSphere16EvaluateFunctionEPdr@__ZN9vtkSphere16EvaluateGradientEPdS0_r@__ZN9vtkSphere21ComputeBoundingSphereEPdxS0_Pxr@__ZN9vtkSphere3NewEvr@__ZN9vtkSpline11RemovePointEdr@__ZN9vtkSpline15RemoveAllPointsEvr@__ZN9vtkSpline17GetNumberOfPointsEvr@__ZN9vtkSpline18SetParametricRangeEddr@__ZN9vtkSpline8AddPointEddr@__ZN9vtkSpline8DeepCopyEPS_r@__ZN9vtkSpline8GetMTimeEvrȮ@__ZN9vtkVertex11DerivativesEiPdS0_iS0_rЮ@__ZN9vtkVertex11TriangulateEiP9vtkIdListP9vtkPointsrخ@__ZN9vtkVertex12CellBoundaryEiPdP9vtkIdListr@__ZN9vtkVertex16EvaluateLocationERiPdS1_S1_r@__ZN9vtkVertex16EvaluatePositionEPdS0_RiS0_RdS0_r@__ZN9vtkVertex17IntersectWithLineEPdS0_dRdS0_S0_Rir@__ZN9vtkVertex19GetParametricCoordsEvr@__ZN9vtkVertex19InterpolationDerivsEPdS0_r@__ZN9vtkVertex22InterpolationFunctionsEPdS0_r@__ZN9vtkVertex3NewEvr@__ZN9vtkVertex4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_ir@__ZN9vtkVertex7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9_r@__ZNK13vtkObjectBase12GetClassNameEvr@__ZNK14vtkBoundingBox10IntersectsERKS_r@__ZNK14vtkBoundingBox12GetMaxLengthEvr@__ZNK14vtkBoundingBox16ComputeDivisionsExPdPirȯ@__ZNK14vtkBoundingBox17GetDiagonalLengthEvrЯ@__ZNK14vtkBoundingBox8ContainsERKS_rد@__ZNK17vtkAMRInformation18GetCoarsenedAMRBoxEjjR9vtkAMRBoxr@__ZNK17vtkAMRInformation18GetRefinementRatioEjr@__ZNK17vtkAMRInformation19GetNumberOfDataSetsEjr@__ZNK17vtkAMRInformation9GetAMRBoxEjjr@__ZNK24vtkIncrementalOctreeNode9GetBoundsEPdr@__ZNK25vtkDistributedGraphHelper12GetEdgeIndexExr@__ZNK25vtkDistributedGraphHelper12GetEdgeOwnerExr@__ZNK25vtkDistributedGraphHelper14GetVertexIndexExr@__ZNK25vtkDistributedGraphHelper14GetVertexOwnerExr@__ZNK25vtkOctreePointLocatorNode13GetDataBoundsEPdr@__ZNK25vtkOctreePointLocatorNode9GetBoundsEPdr@__ZNK30vtkExtractStructuredGridHelper7IsValidEvr@__ZNK7vtkAtom11GetPositionEPdr@__ZNK7vtkAtom11GetPositionEvrȰ@__ZNK7vtkAtom15GetAtomicNumberEvrа@__ZNK7vtkBond12GetEndAtomIdEvrذ@__ZNK7vtkBond14GetBeginAtomIdEvr@__ZNK7vtkBond9GetLengthEvr@__ZNK9vtkAMRBox13DoesIntersectERKS_r@__ZNK9vtkAMRBox13GetDimensionsEPir@__ZNK9vtkAMRBox13GetDimensionsEPiS0_r@__ZNK9vtkAMRBox14GetGhostVectorEiPir@__ZNK9vtkAMRBox16ComputeDimensionEvr@__ZNK9vtkAMRBox16GetNumberOfCellsEPir@__ZNK9vtkAMRBox16GetNumberOfCellsEvr@__ZNK9vtkAMRBox16GetNumberOfNodesEPir@__ZNK9vtkAMRBox16GetNumberOfNodesEvr@__ZNK9vtkAMRBox16GetValidHiCornerEPir@__ZNK9vtkAMRBox30DoesBoxIntersectAlongDimensionERKS_ir@__ZNK9vtkAMRBox8ContainsEPKirȱ@__ZNK9vtkAMRBox8ContainsERKS_rб@__ZNK9vtkAMRBox8ContainsEiiirر@__ZNK9vtkAMRBox9SerializeEPir@__ZNK9vtkAMRBoxeqERKS_r@__ZNK9vtkKdNode13GetDataBoundsEPdr@__ZNK9vtkKdNode9GetBoundsEPdr@__ZNK9vtkSpline18GetParametricRangeEPdr@__ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEvr@__ZNKSt3__121__basic_string_commonILb1EE20__throw_length_errorEvr@__ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE6resizeEmcr@__ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE9push_backEcr@__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED2Evr@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEEC2Evr@__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEED2Evr@__ZNSt3__18ios_base4initEPvr@__ZNSt3__19basic_iosIcNS_11char_traitsIcEEED2Evrز@__Zeq11vtkEdgeBaseS_r@__ZlsRNSt3__113basic_ostreamIcNS_11char_traitsIcEEEE11vtkEdgeBaser@__ZlsRNSt3__113basic_ostreamIcNS_11char_traitsIcEEEERK14vtkPixelExtentr@__Zne11vtkEdgeBaseS_r@___cxa_atexitr@___cxa_begin_catchr@___cxa_end_catchr@___stack_chk_failr@_memcpyr@_memmover@_reallocr@_strcmprȳ@_strlen_Py4_Zreal_initvtkCommonDataModelPythondvtkLVTKAddFile_vtkAB C DEFieldData_ClassNewGO$I%V'H(Kd2L3M7Non;P=QuadFReJSLTSUnVWedge_ClassNewYXMLDataElement_ClassNewYbstractdjacentVertexIterator_ClassNewMRnrrayData_ClassNew t CellLPointLocator_ClassNewElectronicData_ClassNewYinks_ClassNewocator_ClassNewAB CDEFieldDataG H)I+Kd2L4M6NonQuadFReKSNTSUnWVXWedgeYXMLDataElementYbstractdjacentVertexIteratorMRnrray t CellLPointLocatorElectronicDataYinksocatorBox_TypeNewUtilities_ClassNewInformation_ClassNewbDataInternals_ClassNewbBoxUtilitiesInformationbDataInternalsb3452[Td8Pyvtk9PyvtkDataObject_AttributeTypes_FromEnumi5PyvtkAnimationScene_PlayModes_FromEnumiTreeDFSIterator_ModeType_FromEnumiUimationScene_ClassNewnotationimationScenenotation_ClassNewLayers_ClassNew Layers ЀData ListTemplate tributesErrorMetric_ClassNew om_TypeNewYзtributesErrorMetric omYiQuadratic o SP Quad Triangle_ClassNew _ClassNew ratic iQuadratic o SP Quad Triangle ratic Hexahedron_ClassNew Wedge_ClassNew Hexahedron Wedge x_ClassNew undingBox_TypeNewYnd_TypeNewY x undingBoxYndY Cuts_ClassNew Intersections_ClassNew  Cuts Intersections    ell oubicLine_ClassNewylinder_ClassNew3D_ClassNewArray_ClassNew_ClassNewData_ClassNewIterator_ClassNewLTypes_ClassNewл elloubicLineylinder3DArray     DataIteratorLType    inks_ClassNewocator_ClassNew inksocator sYmpositeDatanlor_Set_ClassNewIterator_ClassNewmpositeDatanloraSetIteratore_ClassNewvexPointSet_ClassNewevexPointSetataiSetObjectCAttributes_ClassNew_ClassNewellIterator_ClassNewollection_ClassNewataioubleDispatcherZSetObjectArrayDispatcherZCAttributesellIteratorollectionCollection_ClassNew_ClassNewTCollection2Pyvtk0PyvtkDataObject_FieldOperations_FromEnumi6PyvtkDataSetAttributes_7PyvtkDataSetAttributes_PointGhostTypes_FromEnumi3PyvtkImplicitBoolean_OperationType_FromEnumi,5PyvtkLagrangeInterpolation_Constants_FromEnumi54PyvtkSelectionNode_SelectionContent_FromEnumiNDataObject_FieldAssociations_FromEnumiSelectionNode_SelectionField_FromEnumiNЫTypes_ClassNewreeypesree_ClassNewIterator_ClassNewIteratorAttributeTypes_FromEnumiCellGhostTypes_FromEnumi1PyvtkDataSetAttributes_AttributeLimitTypes_FromEnumi5PyvtkDataSetAttributes_AttributeCopyOperations_FromEnumiDataSet_FieldDataType_FromEnumiPath_ControlPointType_FromEnumi=rectedstributedGraphHelper_ClassNewAcyclicGraph_ClassNewGraph_ClassNewrectedsAcyclicGraphGraphtributedGraphHelperpatcherZdgemptyCell_ClassNewxtractStructuredGridHelper_ClassNewListIterator_ClassNewTBase_TypeNew$dgemptyCellxtractStructuredGridHelperListIteratorTableable_ClassNewype_TypeNew&Вeraph&nericometricErrorMetric_ClassNew$A Cell"DataSet_ClassNew#EdgeTable_ClassNew#InterpolatedVelocityField_ClassNew#PointIterator_ClassNew$SubdivisionErrorMetric_ClassNew$daptorCell_ClassNew ttribute"e raph'neric!ometricErrorMetric$A!Cell#DataSet#EdgeTable#InterpolatedVelocityField#PointIterator$SubdivisionErrorMetric$daptorCell"ttribute"Collection_ClassNew"_ClassNew"Collection""Д_ClassNew#Iterator_ClassNew#Tessellator_ClassNew#Iterator#Tessellator#ГutEdge%ctreePointLocatore>i?lane@oByramid_ClassNewF:ath>e?i?laneAoByramidF:ntagonalPrism_ClassNew?rlinNoise_ClassNew?:ntagonalPrism?rlinNoise?:;;ecewiseFunction_ClassNew?xel@;ecewiseFunction@xel@;_ClassNew@Extent_TypeNew@Transfer_TypeNew@<<Extent@Transfer@==>>Collection_ClassNewA_ClassNewAsA>CollectionAA>>>sA_ClassNewAIntersection_ClassNewB??IntersectionBг??intBlyDData_ClassNewBLocator_ClassNewCSetCsProjectedHull_ClassNewD?intBlyEDataCLocatorCSetCsProjectedHullD???_ClassNewCCellIterator_ClassNewC@@CellIteratorC@@@@DataDgon_ClassNewEhedron_ClassNewELine_ClassNewFPlane_ClassNewFVertex_ClassNewFCollection_ClassNewE_ClassNewEADataEgonEhedronELineFPlaneFVertexFCollectionEEAЬAABBDDЯEEFFFFFF_ClassNewFrFGGrGatFic_ClassNewJicGureSchemeDefinition_ClassNewJEdge_ClassNewGHexahedron_ClassNewHLinearHPIQuad_ClassNewITJWedge_ClassNewJHatGicJicHureSchemeDefinitionJEdgeHHexahedronHLinearIPIQuadJTJWedgeJHIIQuad_ClassNewIWedge_ClassNewIJQuadIWedgeIдJKKolygon_ClassNewIyramid_ClassNewILolygonIyramidILMMNNetra_ClassNewJriangle_ClassNewJOetraJriangleJOPPЖQQRЙRRRctKebGraphLiK_Iaf_TypeNewad_TypeNewblinearGrid_ClassNewK_TypeNewaRctKebGraphLilinearGridLbR_ClassNewLSimplificationMetric_ClassNewLSSSimplificationMetricLTTelectionMimpleCellTessellator_ClassNewOmoothErrorMetric_ClassNewOortFieldData_ClassNewOpOtOuperquadric_ClassNewS_ClassNewNNode_ClassNewNTelectionNimpleCellTessellatorOmoothErrorMetricOortFieldDataOpOtPuperquadricSTNodeOTTTTTTUUUUhere_ClassNewOline_ClassNewOUhereOlineOUUUaticPructuredQCellLPPointLocator_ClassNewQinks_ClassNewPocator_ClassNewQVaticPructuredRCellLQPointLocatorQinksQocatorQVTemplateQVVVWWData_ClassNewRExtent_ClassNewRGrid_ClassNewRPointsRWDataRExtentRGridRPointsRWXXXXCollection_ClassNewR_ClassNewSYCollectionSSYYYYYable_ClassNewSetra_ClassNewSrSZableSetraSrTZZZeeSiUBFSIterator_ClassNewT_ClassNewTDFSIterator_ClassNewUIterator_ClassNewY[eeTiUBFSIteratorTT[[[DFSIteratorUIteratorY[[\angleUQuadraticHexahedron_ClassNewV_ClassNewUStrip_ClassNewV\angleVQuadraticHexahedronVЋ\StripV]]^^directedGraph_ClassNewViformGridWstructuredGridW_directedGraphWiformGridWstructuredGridX__ClassNewWAMRb__AMRb_ClassNewXBase_ClassNewXCellIterator_ClassNewX``BaseXCellIteratorXaaaaaeXoxelYrtexXctor^aListIteratorYbbbbccйddeeeeffffffЫgggggg_IZ2\3]dLiZfLiZiLi[4EE_TypeNewZ2EE_TypeNew[3EE_TypeNew[g4EE_TypeNew[2EE_TypeNew[3EE_TypeNew[g4EE_TypeNew[2EE_TypeNew[3EE_TypeNew[ggggggg3Pyvtk\4PyvtkVector]1PyvtkRect_TemplateNewvaVector_TemplateNewv\Color_g_I\i_TypeNew^f_TypeNew^d_TypeNew^dE_TypeNew]fE_TypeNew]iE_TypeNew]ggg2_TemplateNewv]3_TemplateNewv^g_I^i_TypeNew^f_TypeNew^d_TypeNew^dE_TypeNew^fE_TypeNew^iE_TypeNew^gggggggggggOperators^j3_4`_I_ub_TypeNewaf_TypeNewad_TypeNewadE_TypeNew_fE_TypeNew_hE_TypeNew_jjj3_TemplateNewv`4_TemplateNewvaj_I`ub_TypeNewaf_TypeNewad_TypeNewadE_TypeNew`fE_TypeNew`hE_TypeNew`jjjjjjjjjjjdE_TypeNewafE_TypeNewaiE_TypeNewaІllllЌlllБlmmmmmmnn_ClassNewbDataIterator_ClassNewbnnDataIteratorcoo_ClassNewcLightWeightCursor_TypeNewcCursor_ClassNewdPointsGrabber_ClassNewdoooCursordPointsGrabberdpppppSNSt3__11dINSt3__11e9basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEEe5basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEEe9basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEEf5basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEEfPP  PPPP0 `PPPP@pppppppP@P@`PP P  P   P PP/(@P `PP P PPPP  P@P@ppPPP P PPPPPPpppppppppppppppppppppppppppp@P0P@PPPPPPP@@PPP @P@P@PppPPP PP@P @PPP P PPP@P P PPP@00@P0 @@0P`000@PPPPPP   P  PP@P@PPpppp@PP   @PPPPP@PPPPPPPPPPPP P@@  PP @P P   P 0P`` P`` P P  P``P@0P`0P0PP@@@P@@@PPPPPPPPP P P PPP@P   PP@P P@00 P 0PP PPPPP@PPPPp@@P     P P PP P P P P P P   P   P   P P   P P   PppPP @P@PP@@@@PPPppppppppppppppppPPPPPP`P PP0PP@PPPP@P PP@PPP 00P P  P@P @P@0P@PP PP  P P@@@PP@0P00PP@0PPPPpP@P0P0P0P0P0P@P0P0000@0000000@000000000000000000000P@P0P0P@P0P000@00@ 000000000000P@P0P000@000000P@P p@@P @PP@PPP0ppp@0PPL(xpmp@ppp q0HqPtq`qqqpr +rSrzr r rP r -s0 Us@sspst @t@jt0t@ttup?upu0u0uvpJv!ov0"v#v0$v$-w%_w&w`'w(x(4x)gx`*x +x+xp,.y-Yy-yP.y0/y/z0Iz`1xz@2z2z3z4{5G{6v{@7{ 8{`8{8|@9I|9v| :|:|;|p;} <H}=s}=}>}`?}@@~@P~A|~B~C~D"pE_ FGGPHLIIJ0K"LSL0MMNO:0PdQ0RRS  T7TdpUVVW$PXQ0Y{ZZӄp[ \.\d]^υp_p`S0aab$PciluŇuv wTxy@z{*{bp|@}~, d@`ʊ`4`0ԋIЧ~pP:@|@L@юR׏Pp`'oQPܒpO09v` <u@%g0#`h0` & n@p@< z !0"#EP$}%&&''c@((қ)*=P,p.7 <@=VpD@EŝpGKA0MNĞPSCpVpZ[[ݟ]],^Xb@d fʠhpjl5nZstwԡ`{P~ ~Hk¢pHq@б<g@  ;pg0Х00bզp0G`pV @-Pg۩``1]ժ=upū BoŬ )WpܭpEu@׮ @v Я  , Z` װp'\`±``Aa  ٲ@% &&'N'{`( )ӳ)*=0+bp.@//۴p0 151]`2033̵4`6">OCsF H¶ L0M0T8PV_VPXYZP[L_zdd¸efpg?PiljkŹkl'pmX nno p#pSq0rrڻsPtEtow@xy޼@z z9{ep}`~~A@z ܾ>g ÿЉp;Pb@@;pF0rPpH л0'pGqGwPP4\`  @>hP`3`d`Q@([.`_@` @spMpP:`up2 r`0n0&0Af1V@) S`#@WP  1 hp @   ) TP$, %^P,./@0:4r99:;<<=i@>??`@(0AQBC FpN S9Tf[\ ^P`-a`fgpik6`nUo~oqqr,u]0x yy{|-~UP PQP% UP2pfЖ@5@fЛ@НO@:i@2`p0#pa00Epy )Y`0B`д@A upPP0R`л3@l (pQ{P0p'0Tz`p  < zP%]pP@@QN`@O~p ` FspPQP `Mp Rp Up ?qP0 0=mpP @zpp@P@P&` 6l    TP Awp  bpPT@ 3k` J `!"#)#`$P%@& '?'w()`*$  +^ + , - `.M / 0 0 1 4R 4 6  8 @9' `;d = `A B CO D `E 0F  G3HhpIJJL%LZMN0OO)P]STU`V`W,0XZYYpZ]]90`f0bbcdeGfpisy`zzE{l0|| >pl`Ѕ)pQPP Dt080r`I0fp00J ИЙ-КX` Aspp0p>Pn0@B|P1l/ @c  `  !?!pk!!0!0"6"c"`"""#@8#Pf####$`F$0z$$$% ;%0b%%%P% &/&]&&&P&'M'`v'0''' (PN((((  )?)@{)))1*y*p*@*-+o+`+0,Y,,,)-0n--@ - . +. Y.P .P .. /;/`n////!00K0y0 000)1U11`1@11`12 [222 2P!,3!_3"3#3$3P%4@&G4't4'4(4@) 5*>5+l5,5`-5`. 6/?6/q6p06 1617p2Z7@37 474 85I8@68078798<9`9z9p:9@;9p>':`?b:D:F: G ;I9;pLu;pP;T;PW<XR<pY<Z<[=]@=^w=@_=pb=d>`eb> f>g>`k?pF?p?`q?pr? s4@ t|@t@`uAvdAvA@wAw#BxcB`yBzBz/C{qCP|C|C}"D`~]D DD,EpE E F@ZFpFF0 G@>GrGGGH@EH~HHPHINI`IIPI JMJJpJ`JKQKsK`K0K`K%LRLаLLpLP M?MkM`MMNpENqNN0NO/O_O@OOOP@OP~PPP0QLQQQ0Q"RYR RR`S;SyS@SST RTT`TT1U@qUUU *VhV`VV(W@fWWW *XiX`XX.Y@sYYZ SZZ`Z[V[@[[ \C\pw\ \0\] F] y]@ ] ]p ^F^x^^p^p*_c_p__`pR`@`` aFaua a!ap"bp#p q  ׌   =t` >qߎ!0&IP'{.P/0,3f8<ِA B?pC`DD0FFG>`InJKϒ`L M,MVNPR0[P`Idwel۔moJsv{{P|E|}7d`͗p B |ІP`Љؙ@3@_ǚP,]` `D0u ՜09npP p: jПɞ+`Zp ЦN|0۠p>@k֡p p.Z`а<n֣P 0:kݤV0н¥0(\`Ʀ5Pl٧PpE0zPN0'a`P˪4pq`P@.0aì9r`ӭ1dp`ͮ*Zp@Gzp07p@p . l  ɲ p # W    &p \` @ ´  ( _0  ϵ @ 5 n P Զ  ? rp @   Rp @   ,@ a `    " :" g# $ ɺp%  & .' X@) + - ۻ0 0; 5@ bA B C D PE KF zG I P Q KS }T 0V ܾW [ F] q@` a οb  d /e ^k o p `s ?t |u v x 'y X| ~} ~   6 a`  Ѕ ` %0 bЇ  0  T   `  I }@  К  >p p`  P  : fФ 0  0  N  `  ! W 0  в B z@   C    $` O @ @  @ V `    V   P . m0 0  # T0 @    P0    ,0 e@   @ % M@ ~  0 p F` t 0   . Z `  @ 4@ r   P d0   AP x`   0  3 Z    ! M |    ` W   p @ Dp w       F` v@  ! " ?$ t% `& 0' `( E) * P- / ?p0  1 2 p3 95 w5 6 p7  8 A09 {9 : ; .@< l< > ? @ N@A B B `C 9D oE F H $K mL O @P ES yT U U 2V sW X `Y ^ Z Z [ 9`\  ] ] ^ P0_ _ d d me f Pg Ao Pq r 8s u Pv 0x `z p{ | -} }~ @  ` X    \ @ `  <P k    + Z@   @  fp  0 U0   9 @   g   XС   , k@ 0  * j `  * k 0  R p P 4 ~ p p e   P0 з  H P  -   #0 t  P O   p  .0 Y   p 0 / _   P  2@ ]  `    @  o    `   ,  S    @   ! ` H  l       H  r  0   5  d  ` 0 `   F n `    IP 0    Hp n  p  $ U  @   : f    P  I q `   - U   ` 0$ % T% & 0' ' #p( U ) P*  + + &, Q- . / 0 A1 v2 2 7 ; A= xB  C 0D D @E uI `J K IK L PM N N APR p S T @W Z /[ ]\ ] ^ @_ ?P` h` a c c 6d qe 0g h 6 i t j 0k pl !m >!m g!0o !o !p !q 1"`r m" s "s "t #Pu 3# v c#v #x # $ .$` X$ $Ў $ $ *% c% % %P & =&Ф {& & & 4' u' 'P '0 'p 6( l( ( ( )` Y) ) ) ) -*0 d* *@ *` + ;+ w+0 +P + !,P _, ,@ , - M- -0 -` . V. .P . . (/ b/` /` / %0p h0  0 0 51 x1 1 2@ E2 2$ 2* 3`1 Q31 32 33 043 |44 44 5 5 Z55 506 56 ?6@7 67 6P8 %78 r7`9 70: 7: 8; O8< 8= 8> 8`? 99 @ }9@ 9A 9PB .: C c:C :D :`F ;N Q;S ;0V ;`X ;\ 0<] i<d <e <@g .=h d=j =Pn =r +>t j>t >px >`y 7?z [?{ ?| ?} ?~ @ F@@ |@ @ @ $A@ QA ~A A A BP MB B` B B C GCP xCp C Cp DШ VD@ D D D` 'E _E@ E E E Fн EF qF F F G` GG G G GP (H XH H H H` 3I lIp I I J iS0? SB SpF -T@G gTH TI T`J T0K U`L 7UM _UN UN UO U@P VP 2VQ VVR VPT VV V_ V d %W@e MWpl }W@m Wpo Wq W@u %Xw PXz {X X Xp Y GYP xY` YP Y Y Z HZ rZ ZP Z@ Z -[ X[` [ [ [ \` /\ [\ \ \ \` ] ?] k]p ] ] ^Ф 4^@ t^ ^ ^ _ I_ _ _p _ 1` u`P ` `0 @a |a a b YbЯ b c )c Ucй |c c c d` Cd fd d@ d d #e` Xe` e e fp ;f mf f f g =g` eg g g h0 Eh yh h hP i 4i jip ip i0 j Pj j0 j j 'k \k0 kp k k %l ]l@ l l l (m` ]m m m m >n` tn0 n nP o Sop o op o 3p kp p0 p q ?q vq q q` r Xr r r s Fs@ s s s@ t0 Rt t t u K ?@ǂ DD+pE]F0G҃0HHRIpK„NP:PSu0TUV&WeXY ["\V@]]̇^ _B_`afLgk׉o@p5pdrrӊs`vG|~}~~4pp ЁY` ΍Є>`u Ї%`` Њя0>|0$ Jzpّ0 0>n`˒/J@o`` :@_PՔ'Qp| 0Õ(PO0uаЖ7l ԗ`  D|pژ@FP~pXPњ @H`  7^``%Uݝ p=e Ğ /aџP4i@֠> t ` P¢@ ,`@ͣ0<tP  p!H!"̥@# $O$%Ǧ@& ''=(^)p*p+ڧ0,,6-d`.0/0ب1 4P6M>{C@E۩IJ-Q^RPTêpVX$[D\k\\^P`Zz`aQa|bcЬ0dd-f\g`hpjݭPlm-oXq@s@u׮ v0w.px\yzP{߯ | |8~d@` 30Z@ЋʱJ`u@ܲ@ >mP гP#QPʹ`p0=g ǵ@If  ڶ3bP0۷P3[ ۸<s)0hpߺ0Ww0ƻP!Lo ļ%Vƽp 0TȾ@ @pؿK` P - [ @.pWP{@@-_ P' (4(bp) *++p,>P-g0.p.0/00E1u2`3`4&5\6678!`9X`:;`=>UB FI`J9KtKPLM M6NiPOP0Q0R6RlSXpXXY5Za[@\ ]]_Fp`tpbcdh+PkYll`m nn+oT p}pq@rr+s\ tt`uuy=pzh{{p|}}Q~|`p2@^Ј0SP SP@6PjП`T0 "N0p@ЭDpPP>i` й$KPr @pIz (@\AyMP@:peP@@H@~  !@"E"o#p$@%')P 2@7;<CBExGGLPPXQPT UV0W2 XQXzYZp[p\.`ZaPbccd=PejgpiksyKP}wp~P%OptPP3Б``p)X0Mw`0P!TЫ0PG0}`P=PjP"RPy #`S @`v@`:0fpPP?l@7[Pp 3 c P"$0&P(H*vp-.0/0P1L2}33405P5}67@9 ;?CuI0J`Q0R:`TqX0Z[p]Y_@bbceUefpg0h;hwijPkmHpow|~.0m0p[PH@r D{p0/bp@`<xд %U ` R   p `2 g     @ } P  + _ p 0  F ~   P  'Pe0(`i0 @ q@:sp0E{0P  "F*/04p8.9j=CDPEPJPSpU\FP]^0_` Pa>brccd@eQffg`ikOt0yPz,PY@ J0P+O}`P P:pУ@ 6hPp2c6 r   !A!p!p!!`!`1" h"""`#02#e## #p$3$e$$$% <%x%%`% *& b& &&&P"'0O'p' ' ')(c(`(((5)pf) ) ))@.*`/D*6*`7*9*='+P?f+@+B+`E!,G\,K,@L, M,`N -O?-Pq-P-Q-PR.SD.Sr.T.pV.X / aA/@fs/`g/n/`o 0qB0u|0Pw0pz0.1pf101Ћ11`82n2 2Џ2А(3@w33p30-4e444#5 f55@5E6c6@66@67570e7p7778pD8x8`8`8 9K9999:PP:P:::`;0O;@;@;;'<X<<`< <>=0t===>N>>0>>$?U??p?P?0(@T@@@@@@A01AVAAAA` B;BnBPBBBCP>C0hCCCCDDDD0D@D>EEEFJFP F F Fp F *GPWGPGGG`H0:HfHPHHHI>I@hIIIIJ?JiJ`J@J JK #?K#mK0$K@%K%K&)L'_L(L0)L*M*4Mp+bMP,M0-M-M`.'N0/[N/NP0N 1N19OP2O2O5O6P7NP7P7P`8P8Q@9=Q9gQ :Q:Q;Qp;1R;iRP<R<R=S@>GS?sS0@SAS0BTBMTCTDT0FTG6U0IiUIUJU@K'VKoVLV0MVM7WO_WOWpPWQWPR)XPSdXSXTXP]Y`f6YgdYgYiYiYjZl7Zm^ZPnZoZ0pZ0q[pt3[v[[w[`x[pz[0{\.\0P\@{\\\]3]_]p]0]]^`3^Z^Ќ^^^_)_`Q____p!` R````0 a KawaЙaaPab Gbrb bПbР cCcptc0ccdp8d `dddd*e`eePeеfpBfff`f4g{ggh@6h0_hhhh-iriiP jQjjjj Ak~kkkp2l illlp%m@em@mm5npknn`nn +o]oo0oo=p0tp`ppp&qdqPq q5rzr rprs Ws s`s0sHt0tt0uSuuuu@vP Fv!zv"v$v%w&=w)ow+w,w-w.#x/Vx/x0xp1xP2,y03[y7yp9yp;y@<&z=Zz>z?z@@zA+{`E_{0G{ I{I{K*|Ld|pM|PN|0O|O*}P]}PQ}R}R}`S(~T`~T~pU~V~X"@XGXxYpZ[[K]]Ȁ^_@`g aaāb@c-@dgeefނgh7pigpjmуor-rZtupvw"Px[yyÅz@{/{[|}`~Fb`Ӈ@@PM~ЇΈ`(LpЌˉp "Mz0Ȋ"pHptƋp<bp@ɌО5P[0|p ύ % N|`ώ0`;iƏ@`I`s א*0Pޑ`ApĒ`EyǓP `5]ߔ@,R|Pĕ;b`0`JyǗ`0`A m   ` # T |`љ30 _P!(P)) ,G-{/14P5A9u;<ڜ?B4@Ef0HL0LpO*SZVVZ^aOPdsdeʟfg-h^`i jʠjk-PlZ mn@qps{O @p TВpPY@@ͤ K@1gPpYΧS0ب`SpC`v` Btޫp2^00Ju@pӭ 3d Į0(XPp Op ߰`/]0J``P%[`Ǵ0?po ٵ  !A!w0$&ٶ ' *J-.÷/`031d022Ը3P4D05u677 @8P89:0;5;v <@DDEKH~I@JK9 O}pSSTUSVPWƾpXPY6`cnfg@hhS@i jjk2lspmpn o9 pVp}qrpspt0uMu|v@wxx{I`xPp-]0PKp{P`<r@90UЪ{ Evp0)pN@sи0Mv01`epPF@o@@Jx@?PmpPP@p@Pj p0 M0!{ "#$&4'g() + ,EP,{0-..+/d0P0P12K2345# 6S67088/9i:0;<<d=>? p@V ABBC&DipE0FFGR`H@I@J@KB@L~@MPPT2WnP[\^"p_^a`bpc d e@elf@ggh'0iSjsjkkm$nQ0q`su wPy0Pz]{|}FЄrЇ.0\`B vp 0 `"B@`P`( TО|0 p03`Qp PAjP$HuP)гQ0@:n`@0(Vp`&@Y E{`@  7b0<Pj`H`=0s`/d @,OPrPP!`Dd`!>[x P`<n0$WP  G y    /`b` P`R:m%]`0E0x0 00 h !`"P#&0$Pp%%&P'';'s0(()`*1@+[P,,-0.`.Fp.~ /00 1<2fP445P6)6Q60788:G;qp<<= p>4 >\ > P? @ @! AR B| C PD E E< Fa F @G `H 0I I= Je 0K K PL L MG Ml M N P P QH RpRpSST+PURUwUVWX+@YSY{Z [[P\6]]0]@]^_`6`a^bbPcdd'eXpf0gg h0h6pikjk@ll m20nZnopPq r>ress0t`uPv>wfw@xxy0z/p{`{|p}}}:~e Ѐ!PPt0@P0"Q` $ЈVЊPЋ=Pl@P5d@ @Dpf G @v    !L!w!!P!Р!*"PY""0""@"0###@B#_#P{# ##Э##$ 6$0j$p$`$$ %`8%b%%P%л%&P?&c&&&&`':'e'P''' (F(l(((()<)@g)))@)*`D*s****P+P@+i++P++,@>,i,, ,,-@-t-0- --p. B.l.p...`/J/`y/ /P/`/0F0@o000001D10o11P11 2B2t2223$3E3v3@333@ 4pA4r44@445?5q5p555@-6P6 q6066 6)7`L7m77077%8B80_8|8888 80 9@ B9 f99`999P#:L:v:P:::@;B;p;0;;;@<G<v<<< < = D="h= #=#=p$= %=%%>p&N>'x>'>`(>)>)?`*D?+r?+?P,?-?-!@0I@1x@P3@3@4@4A4FA6jA 7A7A`8A9A9'B`:PB;zB;BP<B<B=C >FC>tC`?C@C@CpA#DCKD`EzDFD GDGDHE H?E`IhEIEJEJEJF L)FLRF`MsFMFMFOFOGP;GQmGRGRGSHT@H`UqHUH0VH WI0X&IX^IYIZI[I[J\NJ]~J^J@aJ@bKc@KdpKeKjKk L@kFLlLPlL@mLn6Mn{M@oMppMqNprHN`tyNuNuNvOpw8O0xtOxOyOzP@{.PP|aP}P~P@P6QfQ0QpQRER`tR0RpR S =SБmSSST`PT0TT`U09UjU UU V EVVV VW0CWuWWWW0+X@`XXXXP)Y]YYYpYZCZ0vZZZг[C[|[`[[*\Pd\\\P\]pP]]]] ^T^^^^p_P___`H`p`0`a\a@aabPcbPbbb@ c6c bcc@ccdNd~d dde Leee0f -[ P- - -؎ p- .! .X . . 0 .ҏ . .# .? .^ P. . 0.А . ". P$.; p'.e '. p). +.ۑ -. 0.4 1.\ 2. 4. 5. 7. 8.! :.= <.k `<. >. @>.˓ ?. @.  A." I.C `I.] K.z `L. N.ܔ @N. O. P.< R.^ U.y W. `Z.Õ \. \. @^.C @_.u _. @a. @d.Җ d. @f. h.3 j.T t.} t. v.ȗ z. |. .* @.U . . . . P.$ Ћ.D p.g 0. А. . P. Д.6 0.S Ж.s p. .š .ޚ . . 0.> .e . P. .ޛ .  .= .e P. . P.ќ . .B P.t . . P. .֝ . .( p.O . 0. .՞ 0. . P.: .t p. . . 0.% .K `.t . @.à . `. .= @.^ . . . / `/4 /I @/a /y / / / /0 `/| / @/ /1 `/M /l / / @/ / /B `/d / / / / /= /e !/ !/Ǧ "/ #/1 #/X @%/ '/ '/ @(/  (/V `)/t +/ +/ `-/ @./  /// 3/V 4/ 8/ :/˩ >/ `>/ @/? `A/e B/z D/ F/ 0G/Ҫ H/ 0L/ M/0 pO/R Q/w U/ PV/ W/ӫ [/ \/ _/< P_/` _/ `/ `/ɬ pb/ b/ b/< d/_ e/u 0g/ pi/ k/ l/ n/ p/" q/? pr/\ t/| w/ 0y/ {/ծ 0|/ }/" ~/F P/m p/ P/ /ӯ / p/ Ќ/T P/l / 0/ /˰ 0/ P/ / /8 P/U /p 0/ Ф/ p/ /ֱ / Ю/  p/- /Q 0/x p/ /ò P/ / P/1 /U /v P/ / P/ٳ p/ / /< 0/a p/ / p/ʹ / P/ /. /N /q / p/ /ӵ / /$ 0/U p/o / p/ /׶ 0/ /" /Q /~ / / 0 0  0. @ 0S ` 0q 0 0 `0ø 0ڸ 0 0 09 0^ 0 0 !0ƹ "0 @&0 &0< @(0` )0 @+0 00˺ `00 20$ 20E 40i @50 60 :0 ;0ջ ?0 @@0  A0% F0E G0h `H0} J0 L0 `L0޼ M0 O0! pP0: R0V V0 0W0 W0 W0 @Y0$ \0K ]0u `0 b0 c0 @d0 e0 i0E i0f k0 @q0 q0 r0  r0E t0m u0 v0 w0 x0 @z0+ `}0N 0t 0 0 0 0 @0 0 `0H 0} 0 @0 0 `0  0* @0X 0m @0 0 `0 0 `0 0 0/ `0K @0r 0 @0 `0 0 00 @0O 0q 0 0 0 0  0) 0K `0w 0 0 @0 0 `0% 0Q 0p @0 0 0 0 0+ `0J 0l 0 @0 0 0 0 08 0b 0~ 0 `0 0 0 0, 0H 0g 0 `0 0 0 0 @0+ 0S @0l 0 0 0 0 0  0& 0B 0j @0 0 @0 0 0 0$ 0? `0] `0 0 0 0 0 0 0G 0b 0 0 0 0 `0  0$ 0B 0j @0 0 `0 1 1 1' 1@ @1h 1 1 1 1 1 1 `1= 1V `1r 1 `1 1 1 1 1' 1= 1_ 1u 1 1 1 1  1* "1L &1v &1 &1 (1 -1 -18 /1\ 01{ 21 51 51 71  81< :1[ @1 @B1 @C1 C1/ C1Q E1v `H1 J1 `K1 K1 K1 K1 K1D K1 xM1 yM1^ M1x O1 @O1 `O1 O1 O1 O1 O1A O1 `Q1 aQ1 bQ1 cQ1 pQ1 Q1 Q1 Q1 Q1 PS1 QS1 XS1 T1 T1 T1 V1 V16 V1R V1m V1 W1 W1 @W1 `W1 W1  W1% W1<z\0z 8!XP2tP@O`[0\`~*0L um!Pj Z5`K c~dhwP#:pa`@ 9pnЕ/Uu `S0IB h0*`ErP `*P pЫApi08Rg q2 ЉX o    C `|  ; X @{ , @    % p @ 0 _       4 @ Q  q %  6 S   8 0 x    `` l  ?` f@: z   I   D0 x 0   7 Z } 0 @P5Y0Do0@X@ ;^0'u \0%@^x 0 6 XM0X6R`k.PbPpEg^K Ќ7Pf 0# ?2OUpftl`0@5Uw-`Ze1Gph a`d)FfR0j0 УA0pY}@00y:[`~``P  ?,1F@O_r[~еt D@!g zi Z0cph Pw#> Wkp p+ D Z 0p `     P 8!n/!`S!y!!!!!`" I5"QL"p"""`"Я"##3#P^#w#*#o##$ ,$pG$e$P8$Q$g$p%p*%C%Pa%v%`% C%|%% &`K&+s&&@&  & &' ' >' ]' ' 'P ' ' ( !(p% G(` e(P~(6 (S (` ( 5)` c) y)` )p ) l )` )0 *9 :*z W* w*0 *pI *p *@ * +@ ?+0 Z+r+P +` +p + +,A,Pb,C,P,Po,В,-W$-8-W-r-0-[--&--`.4.0J.@c../..5.M/PV/W0/I/ c/z////@./a/"0F00f0@^000`0PK1p*1PA1PX1o1`11 1P112'2D2 ]2@?2N2f2l220 3Ч,3N3Pl33,3 Z30`3e4%4`:4Y4x4`444d4p5"5 L5 j5 5R5i5@5p6@)6C6Z6q6666667787U7r777778 8B8d8oz88888p8p989W9v9@Q9P9 90$:pR:: ::@ ;pH; |; ;;<pV<`< ,< p,&=><,m=;,=9===>+>A>N>[>k>|>>>>>>>>?&?5?F?_?x???????@@.@B@Y@m@~@@@@@@AA2AIA\AkAAAAAAB%BBB^BzBBBBBC"C>CZCvCCCCCC C *DSDDDDD E*EUEEEEEFMF|FFFFGBGeGGGGH+HQHzHHHHIHIuIIII/JJJuJJJJJK$KCKnKKKKL*L`LLLL,MSMMMM#NVNNNN%OROOOPPPQ/QfQQQQQ0R^RRRRRSKSSSSTTTTTT"UHUqUU U UUUV6VSVqVVVV+WKWkWWWWX?XaXXXXX!YUY}YYYZ\ZZZZ"[K[u[[[[$\<\X\t\\\\]B]g]]]] ^7^y^^^^_._N_n_____`F`h```` a0a^aaaa b2bXb~bbbbcBckcccc dMdxdddeJebe|eeee f@f\f}ffffgg;gfgggghChmhhhi6iliii@jXjjRkskkkl4l`llllmLm{mmmnQnznnnooop1pSpppppqMqtqqqq r1r[rtrrrrsTsussssst5tUtxtt u1u[uuuuuv'vGvrvvv w?wvwwww,xExxAybyyyyyz>zkzzzzz{S{{{{|8||4}U}v}}}}~,~Q~y~~~~DnOn΀7Yxށ -OԂCu3W;a+R|ن;d‡ G ?p _Ҋ7y/r&]v΍)]͎?_=Vt:qő7h֒*K|ȓ(EtՔ=mѕ5Ojږ=[ ϗ ;^ǘ4f֙2Yњ"Ktܛ1\=ŝ%iܞ@s6PjҠ%FeʡCkĢ2]أ[y N31Sۧ =sè(Sת6V{ū 3Z̬8\ʭ?gʮ$Efɯ ,MnѰ3Ssӱ3Sv߲%HwóY:Xwֵ<b˶A|ӷ-gLl2^ʺJӻ*cWrrؾ9dϿ'L~ 1mRz.XQ~J8Us'V2T%Pk(Up ?d:^&L*UpE9y!Lz3^"[>|)e.Jr+Hy"Iq(P 5bE|$] 7cGv^5Uv2b2VyQ"]^f3b'[.] 2St'[3a$eIfj>zV ;wS *Ot5\0[/\)h&Jl I}$_)!Gp"PGz?h&J{Hf 1aBn >\b    : {    W    / \    ( ^    1jCa+SV .P} Py   ?h/^(\"Ip*ZQ&Y^)YP(^|3 `   !4!c!!!!"8"_""""#D#x####$I$s$$$%B%q%%%%%)&[&&&&'7'`''''(O((((4)r)))),*Z*****+O++++,-,Z,,,,-:-f----!.S..../O////0N00001J1}1112S22223?3d33333*4h4445L5|555667?7k77778Y88889;9n9999:A:k::::/;X;;;;<L<<<<$=C=f=====.>X>>>>?P????9@i@@@@A1AeAAABNBBBBBCMCsCCCCCDED{DDDE-EUE}EEEF,FdFFFG7GvGGG H?HzHHHI5IbIIIJ0JeJJJJ>KKKKL=LeLLLL9MZMMMM(NHNiNNNNO8OcOOOO P5PlPPPQCQ}QQQQ,RXRRRS2SWSSSS'TQTTTT(UfUUUU1VeVVVV_WWW1XUX{XXXYVYYYZJZZZ[8[}[[\&\\0]T]]]]&^P^^^_2_g___@```a1aQayaaaa.bXbbbb"cXccccd@dwddde3eoeeee+f\fffgdggh]hhhhi:ioiiij(j\jjjkbkkkl+lwlll m7m`mmmmn3n\nnnn*oaoooo*pUpppp$qQq~qqqr2rarrrrsFstssstLt{tttuMu~uuuvJv{vvvwEwwwwwxIxxxxy{s{{{ |;|k||||0}V}}} } } ~ 4~ S~~~~~6cRʀ \́+V|'_ۃ Cx҄Tޅ3c†m߇"CAq֋ >~9zƎ;t `ɐ4j+h  7hΔB.r%fٗH{*cљ4fٚaۛ?aݜKٝpN\Ӡ Gǡ3jȢLأ3VDwΥ?eӦ"MMBsߩHk[٫2`_ڭUخ O\Ѱ DgwŲ<vݳ]ɴ'7^  5{ʷ&eӸe5ϺL{%Tɼ7ǽ+fؾ7[9gR 2Z1iBV{J X1n+j(i6s.m-m0r:_C;sSDX~P$KDzV| k%Tz*b-~L.p!X~^<h1e\+Q|*gF:`v7%e+i]I~ mS]*t)X#j6y Cz*f  g)gb.r- W d$`T L,jM9UT S! g  $    e    E    I   HxBr8EX>_ *A^v8V)Ow9Rt-Z3dViY@gBl7_  C q     !1!]!y!!!!("H"g""""" #,#O#p#### $<$^$$$$%9%z%%%%&>&i&&&&'3'['''''' (%(@([((((()G)r))))"*N*b**T+l++++,$,W,z,,,,+-^-r----..>.n..../%/I/m////0010H0q0000131Y11111 2<2g222223;3f3333 4I4q444&555556R6}66666(7X77778888889I9g99999$:V:{::::a;y;;;;;"<E<k<<<<==7=O=h=====>%>=>S>k>~>>r????? @F@g@@@@A:A_AAAAB,B\BqBBBBBB%CBCkCCCCC+DeDDDD E=EaEEEEEFBFiFFFF G.GRGvGGGGH=HbHHHHH2IeIII JCJnJJJJ$KQK~KKK5LvLLLLM2MOMkMM M M M N?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  !!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!5!6!7!8!9!:!;!!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!r!s!t!u!v!w!x!y!z!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!""""""""" " " " " """"""""""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""######### # # # # ################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~################################################################################################################################$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$%%%%%%%%% % % % % %%%%%%%%%%%%%%%%%%% %!%"%#%$%%%&%'%(%)%*%+%,%-%.%/%0%1%2%3%4%5%6%7%8%9%:%;%<%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%^%_%`%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%q%r%s%t%u%v%w%x%y%z%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&& & &&&&&&&& &!&"&#&$&%&&&'&)&+&,&-&.&/&!##(&*&0&      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  !!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!5!6!7!8!9!:!;!!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!r!s!t!u!v!w!x!y!z!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!""""""""" " " " " """"""""""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""######### # # # # ################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~################################################################################################################################$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$%%%%%%%%% % % % % %%%%%%%%%%%%%%%%%%% %!%"%#%$%%%&%'%(%)%*%+%,%-%.%/%0%1%2%3%4%5%6%7%8%9%:%;%<%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%^%_%`%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%q%r%s%t%u%v%w%x%y%z%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&& & &&&&&&&& &!&"&#&$&%&&&'&)&+&,&-&.&/& _PyVTKAddFile_vtkAMRBox_PyVTKAddFile_vtkAMRDataInternals_PyVTKAddFile_vtkAMRInformation_PyVTKAddFile_vtkAMRUtilities_PyVTKAddFile_vtkAbstractCellLinks_PyVTKAddFile_vtkAbstractCellLocator_PyVTKAddFile_vtkAbstractElectronicData_PyVTKAddFile_vtkAbstractPointLocator_PyVTKAddFile_vtkAdjacentVertexIterator_PyVTKAddFile_vtkAnimationScene_PyVTKAddFile_vtkAnnotation_PyVTKAddFile_vtkAnnotationLayers_PyVTKAddFile_vtkArrayData_PyVTKAddFile_vtkArrayListTemplate_PyVTKAddFile_vtkAtom_PyVTKAddFile_vtkAttributesErrorMetric_PyVTKAddFile_vtkBSPCuts_PyVTKAddFile_vtkBSPIntersections_PyVTKAddFile_vtkBiQuadraticQuad_PyVTKAddFile_vtkBiQuadraticQuadraticHexahedron_PyVTKAddFile_vtkBiQuadraticQuadraticWedge_PyVTKAddFile_vtkBiQuadraticTriangle_PyVTKAddFile_vtkBond_PyVTKAddFile_vtkBoundingBox_PyVTKAddFile_vtkBox_PyVTKAddFile_vtkCell_PyVTKAddFile_vtkCell3D_PyVTKAddFile_vtkCellArray_PyVTKAddFile_vtkCellData_PyVTKAddFile_vtkCellIterator_PyVTKAddFile_vtkCellLinks_PyVTKAddFile_vtkCellLocator_PyVTKAddFile_vtkCellType_PyVTKAddFile_vtkCellTypes_PyVTKAddFile_vtkColor_PyVTKAddFile_vtkCompositeDataIterator_PyVTKAddFile_vtkCompositeDataSet_PyVTKAddFile_vtkCone_PyVTKAddFile_vtkConvexPointSet_PyVTKAddFile_vtkCubicLine_PyVTKAddFile_vtkCylinder_PyVTKAddFile_vtkDataArrayDispatcher_PyVTKAddFile_vtkDataObject_PyVTKAddFile_vtkDataObjectCollection_PyVTKAddFile_vtkDataObjectTree_PyVTKAddFile_vtkDataObjectTreeIterator_PyVTKAddFile_vtkDataObjectTypes_PyVTKAddFile_vtkDataSet_PyVTKAddFile_vtkDataSetAttributes_PyVTKAddFile_vtkDataSetCellIterator_PyVTKAddFile_vtkDataSetCollection_PyVTKAddFile_vtkDirectedAcyclicGraph_PyVTKAddFile_vtkDirectedGraph_PyVTKAddFile_vtkDispatcher_PyVTKAddFile_vtkDistributedGraphHelper_PyVTKAddFile_vtkDoubleDispatcher_PyVTKAddFile_vtkEdgeListIterator_PyVTKAddFile_vtkEdgeTable_PyVTKAddFile_vtkEmptyCell_PyVTKAddFile_vtkExtractStructuredGridHelper_PyVTKAddFile_vtkFieldData_PyVTKAddFile_vtkGenericAdaptorCell_PyVTKAddFile_vtkGenericAttribute_PyVTKAddFile_vtkGenericAttributeCollection_PyVTKAddFile_vtkGenericCell_PyVTKAddFile_vtkGenericCellIterator_PyVTKAddFile_vtkGenericCellTessellator_PyVTKAddFile_vtkGenericDataSet_PyVTKAddFile_vtkGenericEdgeTable_PyVTKAddFile_vtkGenericInterpolatedVelocityField_PyVTKAddFile_vtkGenericPointIterator_PyVTKAddFile_vtkGenericSubdivisionErrorMetric_PyVTKAddFile_vtkGeometricErrorMetric_PyVTKAddFile_vtkGraph_PyVTKAddFile_vtkGraphEdge_PyVTKAddFile_vtkGraphInternals_PyVTKAddFile_vtkHexagonalPrism_PyVTKAddFile_vtkHexahedron_PyVTKAddFile_vtkHierarchicalBoxDataIterator_PyVTKAddFile_vtkHierarchicalBoxDataSet_PyVTKAddFile_vtkHyperOctree_PyVTKAddFile_vtkHyperOctreeCursor_PyVTKAddFile_vtkHyperOctreePointsGrabber_PyVTKAddFile_vtkHyperTree_PyVTKAddFile_vtkHyperTreeCursor_PyVTKAddFile_vtkHyperTreeGrid_PyVTKAddFile_vtkHyperTreeGridCursor_PyVTKAddFile_vtkImageData_PyVTKAddFile_vtkImageIterator_PyVTKAddFile_vtkImplicitBoolean_PyVTKAddFile_vtkImplicitDataSet_PyVTKAddFile_vtkImplicitFunction_PyVTKAddFile_vtkImplicitFunctionCollection_PyVTKAddFile_vtkImplicitHalo_PyVTKAddFile_vtkImplicitSelectionLoop_PyVTKAddFile_vtkImplicitSum_PyVTKAddFile_vtkImplicitVolume_PyVTKAddFile_vtkImplicitWindowFunction_PyVTKAddFile_vtkInEdgeIterator_PyVTKAddFile_vtkIncrementalOctreeNode_PyVTKAddFile_vtkIncrementalOctreePointLocator_PyVTKAddFile_vtkIncrementalPointLocator_PyVTKAddFile_vtkInformationQuadratureSchemeDefinitionVectorKey_PyVTKAddFile_vtkIterativeClosestPointTransform_PyVTKAddFile_vtkKdNode_PyVTKAddFile_vtkKdTree_PyVTKAddFile_vtkKdTreePointLocator_PyVTKAddFile_vtkLagrangeCurve_PyVTKAddFile_vtkLagrangeHexahedron_PyVTKAddFile_vtkLagrangeInterpolation_PyVTKAddFile_vtkLagrangeQuadrilateral_PyVTKAddFile_vtkLagrangeTetra_PyVTKAddFile_vtkLagrangeTriangle_PyVTKAddFile_vtkLagrangeWedge_PyVTKAddFile_vtkLine_PyVTKAddFile_vtkLocator_PyVTKAddFile_vtkMappedUnstructuredGrid_PyVTKAddFile_vtkMappedUnstructuredGridCellIterator_PyVTKAddFile_vtkMarchingCubesTriangleCases_PyVTKAddFile_vtkMarchingSquaresLineCases_PyVTKAddFile_vtkMeanValueCoordinatesInterpolator_PyVTKAddFile_vtkMergePoints_PyVTKAddFile_vtkMolecule_PyVTKAddFile_vtkMultiBlockDataSet_PyVTKAddFile_vtkMultiPieceDataSet_PyVTKAddFile_vtkMutableDirectedGraph_PyVTKAddFile_vtkMutableUndirectedGraph_PyVTKAddFile_vtkNonLinearCell_PyVTKAddFile_vtkNonMergingPointLocator_PyVTKAddFile_vtkNonOverlappingAMR_PyVTKAddFile_vtkOctreePointLocator_PyVTKAddFile_vtkOctreePointLocatorNode_PyVTKAddFile_vtkOrderedTriangulator_PyVTKAddFile_vtkOutEdgeIterator_PyVTKAddFile_vtkOverlappingAMR_PyVTKAddFile_vtkPath_PyVTKAddFile_vtkPentagonalPrism_PyVTKAddFile_vtkPerlinNoise_PyVTKAddFile_vtkPiecewiseFunction_PyVTKAddFile_vtkPixel_PyVTKAddFile_vtkPixelExtent_PyVTKAddFile_vtkPixelTransfer_PyVTKAddFile_vtkPlane_PyVTKAddFile_vtkPlaneCollection_PyVTKAddFile_vtkPlanes_PyVTKAddFile_vtkPlanesIntersection_PyVTKAddFile_vtkPointData_PyVTKAddFile_vtkPointLocator_PyVTKAddFile_vtkPointSet_PyVTKAddFile_vtkPointSetCellIterator_PyVTKAddFile_vtkPointsProjectedHull_PyVTKAddFile_vtkPolyData_PyVTKAddFile_vtkPolyDataCollection_PyVTKAddFile_vtkPolyLine_PyVTKAddFile_vtkPolyPlane_PyVTKAddFile_vtkPolyVertex_PyVTKAddFile_vtkPolygon_PyVTKAddFile_vtkPolyhedron_PyVTKAddFile_vtkPyramid_PyVTKAddFile_vtkQuad_PyVTKAddFile_vtkQuadraticEdge_PyVTKAddFile_vtkQuadraticHexahedron_PyVTKAddFile_vtkQuadraticLinearQuad_PyVTKAddFile_vtkQuadraticLinearWedge_PyVTKAddFile_vtkQuadraticPolygon_PyVTKAddFile_vtkQuadraticPyramid_PyVTKAddFile_vtkQuadraticQuad_PyVTKAddFile_vtkQuadraticTetra_PyVTKAddFile_vtkQuadraticTriangle_PyVTKAddFile_vtkQuadraticWedge_PyVTKAddFile_vtkQuadratureSchemeDefinition_PyVTKAddFile_vtkQuadric_PyVTKAddFile_vtkRect_PyVTKAddFile_vtkRectilinearGrid_PyVTKAddFile_vtkReebGraph_PyVTKAddFile_vtkReebGraphSimplificationMetric_PyVTKAddFile_vtkSelection_PyVTKAddFile_vtkSelectionNode_PyVTKAddFile_vtkSimpleCellTessellator_PyVTKAddFile_vtkSmoothErrorMetric_PyVTKAddFile_vtkSortFieldData_PyVTKAddFile_vtkSphere_PyVTKAddFile_vtkSpline_PyVTKAddFile_vtkStaticCellLinks_PyVTKAddFile_vtkStaticCellLinksTemplate_PyVTKAddFile_vtkStaticCellLocator_PyVTKAddFile_vtkStaticPointLocator_PyVTKAddFile_vtkStructuredData_PyVTKAddFile_vtkStructuredExtent_PyVTKAddFile_vtkStructuredGrid_PyVTKAddFile_vtkStructuredPoints_PyVTKAddFile_vtkStructuredPointsCollection_PyVTKAddFile_vtkSuperquadric_PyVTKAddFile_vtkTable_PyVTKAddFile_vtkTetra_PyVTKAddFile_vtkTree_PyVTKAddFile_vtkTreeBFSIterator_PyVTKAddFile_vtkTreeDFSIterator_PyVTKAddFile_vtkTreeIterator_PyVTKAddFile_vtkTriQuadraticHexahedron_PyVTKAddFile_vtkTriangle_PyVTKAddFile_vtkTriangleStrip_PyVTKAddFile_vtkUndirectedGraph_PyVTKAddFile_vtkUniformGrid_PyVTKAddFile_vtkUniformGridAMR_PyVTKAddFile_vtkUniformGridAMRDataIterator_PyVTKAddFile_vtkUnstructuredGrid_PyVTKAddFile_vtkUnstructuredGridBase_PyVTKAddFile_vtkUnstructuredGridCellIterator_PyVTKAddFile_vtkVector_PyVTKAddFile_vtkVectorOperators_PyVTKAddFile_vtkVertex_PyVTKAddFile_vtkVertexListIterator_PyVTKAddFile_vtkVoxel_PyVTKAddFile_vtkWedge_PyVTKAddFile_vtkXMLDataElement_PyvtkAMRBox_TypeNew_PyvtkAMRDataInternals_ClassNew_PyvtkAMRInformation_ClassNew_PyvtkAMRUtilities_ClassNew_PyvtkAbstractCellLinks_ClassNew_PyvtkAbstractCellLocator_ClassNew_PyvtkAbstractElectronicData_ClassNew_PyvtkAbstractPointLocator_ClassNew_PyvtkAdjacentVertexIterator_ClassNew_PyvtkAnimationScene_ClassNew_PyvtkAnnotationLayers_ClassNew_PyvtkAnnotation_ClassNew_PyvtkArrayData_ClassNew_PyvtkAtom_TypeNew_PyvtkAttributesErrorMetric_ClassNew_PyvtkBSPCuts_ClassNew_PyvtkBSPIntersections_ClassNew_PyvtkBiQuadraticQuad_ClassNew_PyvtkBiQuadraticQuadraticHexahedron_ClassNew_PyvtkBiQuadraticQuadraticWedge_ClassNew_PyvtkBiQuadraticTriangle_ClassNew_PyvtkBond_TypeNew_PyvtkBoundingBox_TypeNew_PyvtkBox_ClassNew_PyvtkCell3D_ClassNew_PyvtkCellArray_ClassNew_PyvtkCellData_ClassNew_PyvtkCellIterator_ClassNew_PyvtkCellLinks_ClassNew_PyvtkCellLocator_ClassNew_PyvtkCellTypes_ClassNew_PyvtkCell_ClassNew_PyvtkColor3_IdE_TypeNew_PyvtkColor3_IfE_TypeNew_PyvtkColor3_IhE_TypeNew_PyvtkColor3d_TypeNew_PyvtkColor3f_TypeNew_PyvtkColor3ub_TypeNew_PyvtkColor4_IdE_TypeNew_PyvtkColor4_IfE_TypeNew_PyvtkColor4_IhE_TypeNew_PyvtkColor4d_TypeNew_PyvtkColor4f_TypeNew_PyvtkColor4ub_TypeNew_PyvtkCompositeDataIterator_ClassNew_PyvtkCompositeDataSet_ClassNew_PyvtkCone_ClassNew_PyvtkConvexPointSet_ClassNew_PyvtkCubicLine_ClassNew_PyvtkCylinder_ClassNew_PyvtkDataObjectCollection_ClassNew_PyvtkDataObjectTreeIterator_ClassNew_PyvtkDataObjectTree_ClassNew_PyvtkDataObjectTypes_ClassNew_PyvtkDataObject_ClassNew_PyvtkDataSetAttributes_ClassNew_PyvtkDataSetCellIterator_ClassNew_PyvtkDataSetCollection_ClassNew_PyvtkDataSet_ClassNew_PyvtkDirectedAcyclicGraph_ClassNew_PyvtkDirectedGraph_ClassNew_PyvtkDistributedGraphHelper_ClassNew_PyvtkEdgeBase_TypeNew_PyvtkEdgeListIterator_ClassNew_PyvtkEdgeTable_ClassNew_PyvtkEdgeType_TypeNew_PyvtkEmptyCell_ClassNew_PyvtkExtractStructuredGridHelper_ClassNew_PyvtkFieldData_ClassNew_PyvtkGenericAdaptorCell_ClassNew_PyvtkGenericAttributeCollection_ClassNew_PyvtkGenericAttribute_ClassNew_PyvtkGenericCellIterator_ClassNew_PyvtkGenericCellTessellator_ClassNew_PyvtkGenericCell_ClassNew_PyvtkGenericDataSet_ClassNew_PyvtkGenericEdgeTable_ClassNew_PyvtkGenericInterpolatedVelocityField_ClassNew_PyvtkGenericPointIterator_ClassNew_PyvtkGenericSubdivisionErrorMetric_ClassNew_PyvtkGeometricErrorMetric_ClassNew_PyvtkGraphEdge_ClassNew_PyvtkGraphInternals_ClassNew_PyvtkGraph_ClassNew_PyvtkHexagonalPrism_ClassNew_PyvtkHexahedron_ClassNew_PyvtkHierarchicalBoxDataIterator_ClassNew_PyvtkHierarchicalBoxDataSet_ClassNew_PyvtkHyperOctreeCursor_ClassNew_PyvtkHyperOctreeLightWeightCursor_TypeNew_PyvtkHyperOctreePointsGrabber_ClassNew_PyvtkHyperOctree_ClassNew_PyvtkHyperTreeCursor_ClassNew_PyvtkHyperTreeGridCursor_ClassNew_PyvtkHyperTreeGrid_ClassNew_PyvtkHyperTree_ClassNew_PyvtkImageData_ClassNew_PyvtkImplicitBoolean_ClassNew_PyvtkImplicitDataSet_ClassNew_PyvtkImplicitFunctionCollection_ClassNew_PyvtkImplicitFunction_ClassNew_PyvtkImplicitHalo_ClassNew_PyvtkImplicitSelectionLoop_ClassNew_PyvtkImplicitSum_ClassNew_PyvtkImplicitVolume_ClassNew_PyvtkImplicitWindowFunction_ClassNew_PyvtkInEdgeIterator_ClassNew_PyvtkInEdgeType_TypeNew_PyvtkIncrementalOctreeNode_ClassNew_PyvtkIncrementalOctreePointLocator_ClassNew_PyvtkIncrementalPointLocator_ClassNew_PyvtkInformationQuadratureSchemeDefinitionVectorKey_ClassNew_PyvtkIterativeClosestPointTransform_ClassNew_PyvtkKdNode_ClassNew_PyvtkKdTreePointLocator_ClassNew_PyvtkKdTree_ClassNew_PyvtkLagrangeCurve_ClassNew_PyvtkLagrangeHexahedron_ClassNew_PyvtkLagrangeInterpolation_ClassNew_PyvtkLagrangeQuadrilateral_ClassNew_PyvtkLagrangeTetra_ClassNew_PyvtkLagrangeTriangle_ClassNew_PyvtkLagrangeWedge_ClassNew_PyvtkLine_ClassNew_PyvtkLocator_ClassNew_PyvtkMarchingCubesTriangleCases_TypeNew_PyvtkMarchingSquaresLineCases_TypeNew_PyvtkMeanValueCoordinatesInterpolator_ClassNew_PyvtkMergePoints_ClassNew_PyvtkMolecule_ClassNew_PyvtkMultiBlockDataSet_ClassNew_PyvtkMultiPieceDataSet_ClassNew_PyvtkMutableDirectedGraph_ClassNew_PyvtkMutableUndirectedGraph_ClassNew_PyvtkNonLinearCell_ClassNew_PyvtkNonMergingPointLocator_ClassNew_PyvtkNonOverlappingAMR_ClassNew_PyvtkOctreePointLocatorNode_ClassNew_PyvtkOctreePointLocator_ClassNew_PyvtkOrderedTriangulator_ClassNew_PyvtkOutEdgeIterator_ClassNew_PyvtkOutEdgeType_TypeNew_PyvtkOverlappingAMR_ClassNew_PyvtkPath_ClassNew_PyvtkPentagonalPrism_ClassNew_PyvtkPerlinNoise_ClassNew_PyvtkPiecewiseFunction_ClassNew_PyvtkPixelExtent_TypeNew_PyvtkPixelTransfer_TypeNew_PyvtkPixel_ClassNew_PyvtkPlaneCollection_ClassNew_PyvtkPlane_ClassNew_PyvtkPlanesIntersection_ClassNew_PyvtkPlanes_ClassNew_PyvtkPointData_ClassNew_PyvtkPointLocator_ClassNew_PyvtkPointSetCellIterator_ClassNew_PyvtkPointSet_ClassNew_PyvtkPointsProjectedHull_ClassNew_PyvtkPolyDataCollection_ClassNew_PyvtkPolyData_ClassNew_PyvtkPolyLine_ClassNew_PyvtkPolyPlane_ClassNew_PyvtkPolyVertex_ClassNew_PyvtkPolygon_ClassNew_PyvtkPolyhedron_ClassNew_PyvtkPyramid_ClassNew_PyvtkQuad_ClassNew_PyvtkQuadraticEdge_ClassNew_PyvtkQuadraticHexahedron_ClassNew_PyvtkQuadraticLinearQuad_ClassNew_PyvtkQuadraticLinearWedge_ClassNew_PyvtkQuadraticPolygon_ClassNew_PyvtkQuadraticPyramid_ClassNew_PyvtkQuadraticQuad_ClassNew_PyvtkQuadraticTetra_ClassNew_PyvtkQuadraticTriangle_ClassNew_PyvtkQuadraticWedge_ClassNew_PyvtkQuadratureSchemeDefinition_ClassNew_PyvtkQuadric_ClassNew_PyvtkRect_IdE_TypeNew_PyvtkRect_IfE_TypeNew_PyvtkRect_IiE_TypeNew_PyvtkRectd_TypeNew_PyvtkRectf_TypeNew_PyvtkRecti_TypeNew_PyvtkRectilinearGrid_ClassNew_PyvtkReebGraphSimplificationMetric_ClassNew_PyvtkReebGraph_ClassNew_PyvtkSelectionNode_ClassNew_PyvtkSelection_ClassNew_PyvtkSimpleCellTessellator_ClassNew_PyvtkSmoothErrorMetric_ClassNew_PyvtkSortFieldData_ClassNew_PyvtkSphere_ClassNew_PyvtkSpline_ClassNew_PyvtkStaticCellLinks_ClassNew_PyvtkStaticCellLocator_ClassNew_PyvtkStaticPointLocator_ClassNew_PyvtkStructuredData_ClassNew_PyvtkStructuredExtent_ClassNew_PyvtkStructuredGrid_ClassNew_PyvtkStructuredPointsCollection_ClassNew_PyvtkStructuredPoints_ClassNew_PyvtkSuperquadric_ClassNew_PyvtkTable_ClassNew_PyvtkTetra_ClassNew_PyvtkTreeBFSIterator_ClassNew_PyvtkTreeDFSIterator_ClassNew_PyvtkTreeIterator_ClassNew_PyvtkTree_ClassNew_PyvtkTriQuadraticHexahedron_ClassNew_PyvtkTriangleStrip_ClassNew_PyvtkTriangle_ClassNew_PyvtkUndirectedGraph_ClassNew_PyvtkUniformGridAMRDataIterator_ClassNew_PyvtkUniformGridAMR_ClassNew_PyvtkUniformGrid_ClassNew_PyvtkUnstructuredGridBase_ClassNew_PyvtkUnstructuredGridCellIterator_ClassNew_PyvtkUnstructuredGrid_ClassNew_PyvtkVector2_IdE_TypeNew_PyvtkVector2_IfE_TypeNew_PyvtkVector2_IiE_TypeNew_PyvtkVector2d_TypeNew_PyvtkVector2f_TypeNew_PyvtkVector2i_TypeNew_PyvtkVector3_IdE_TypeNew_PyvtkVector3_IfE_TypeNew_PyvtkVector3_IiE_TypeNew_PyvtkVector3d_TypeNew_PyvtkVector3f_TypeNew_PyvtkVector3i_TypeNew_PyvtkVector_IdLi2EE_TypeNew_PyvtkVector_IdLi3EE_TypeNew_PyvtkVector_IdLi4EE_TypeNew_PyvtkVector_IfLi2EE_TypeNew_PyvtkVector_IfLi3EE_TypeNew_PyvtkVector_IfLi4EE_TypeNew_PyvtkVector_IiLi2EE_TypeNew_PyvtkVector_IiLi3EE_TypeNew_PyvtkVector_IiLi4EE_TypeNew_PyvtkVertexAdjacencyList_TypeNew_PyvtkVertexListIterator_ClassNew_PyvtkVertex_ClassNew_PyvtkVoxel_ClassNew_PyvtkWedge_ClassNew_PyvtkXMLDataElement_ClassNew__Z21PyvtkRect_TemplateNewv__Z23PyvtkColor3_TemplateNewv__Z23PyvtkColor4_TemplateNewv__Z23PyvtkVector_TemplateNewv__Z24PyvtkVector2_TemplateNewv__Z24PyvtkVector3_TemplateNewv__Z35PyvtkDataSet_FieldDataType_FromEnumi__Z35PyvtkPath_ControlPointType_FromEnumi__Z38PyvtkAnimationScene_PlayModes_FromEnumi__Z38PyvtkTreeDFSIterator_ModeType_FromEnumi__Z39PyvtkDataObject_AttributeTypes_FromEnumi__Z40PyvtkDataObject_FieldOperations_FromEnumi__Z42PyvtkDataObject_FieldAssociations_FromEnumi__Z42PyvtkSelectionNode_SelectionField_FromEnumi__Z43PyvtkImplicitBoolean_OperationType_FromEnumi__Z44PyvtkSelectionNode_SelectionContent_FromEnumi__Z45PyvtkLagrangeInterpolation_Constants_FromEnumi__Z46PyvtkDataSetAttributes_AttributeTypes_FromEnumi__Z46PyvtkDataSetAttributes_CellGhostTypes_FromEnumi__Z47PyvtkDataSetAttributes_PointGhostTypes_FromEnumi__Z51PyvtkDataSetAttributes_AttributeLimitTypes_FromEnumi__Z55PyvtkDataSetAttributes_AttributeCopyOperations_FromEnumi__ZTINSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZTINSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZTSNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZTSNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE_real_initvtkCommonDataModelPython_PyBool_FromLong_PyBuffer_Release_PyBytes_FromStringAndSize_PyCFunction_Type_PyDict_SetItemString_PyDict_Size_PyErr_Clear_PyErr_Occurred_PyErr_SetString_PyExc_TypeError_PyFloat_FromDouble_PyLong_FromLong_PyLong_FromLongLong_PyLong_FromUnsignedLong_PyLong_Type_PyModule_Create2_PyModule_GetDict_PyObject_CallMethod_PyObject_Free_PyObject_GC_Del_PyObject_GenericGetAttr_PyObject_GenericSetAttr_PyObject_HashNotImplemented_PyType_IsSubtype_PyType_Ready_PyType_Type_PyUnicode_FromString_PyUnicode_FromStringAndSize_PyVTKClass_Add_PyVTKObject_AsBuffer_PyVTKObject_Check_PyVTKObject_Delete_PyVTKObject_GetObject_PyVTKObject_GetSet_PyVTKObject_New_PyVTKObject_Repr_PyVTKObject_SetFlag_PyVTKObject_String_PyVTKObject_Traverse_PyVTKSpecialObject_CopyNew_PyVTKSpecialObject_New_PyVTKSpecialObject_Repr_PyVTKSpecialType_Add_PyVTKTemplate_AddItem_PyVTKTemplate_New_Py_BuildValue_PyvtkAnimationCue_ClassNew_PyvtkCollection_ClassNew_PyvtkFunctionSet_ClassNew_PyvtkInformationKey_ClassNew_PyvtkLinearTransform_ClassNew_PyvtkObject_ClassNew_PyvtkPoints_ClassNew_PyvtkSortDataArray_ClassNew_PyvtkTuple_IdLi2EE_TypeNew_PyvtkTuple_IdLi3EE_TypeNew_PyvtkTuple_IdLi4EE_TypeNew_PyvtkTuple_IfLi2EE_TypeNew_PyvtkTuple_IfLi3EE_TypeNew_PyvtkTuple_IfLi4EE_TypeNew_PyvtkTuple_IhLi3EE_TypeNew_PyvtkTuple_IhLi4EE_TypeNew_PyvtkTuple_IiLi2EE_TypeNew_PyvtkTuple_IiLi3EE_TypeNew_PyvtkTuple_IiLi4EE_TypeNew__Py_Dealloc__Py_FatalErrorFunc__Py_NoneStruct__Py_NotImplementedStruct__Unwind_Resume__Z31vtkOutputWindowDisplayErrorTextPKc__Z40vtkOutputWindowDisplayGenericWarningTextPKc__ZN10vtkBSPCuts10CreateCutsEP9vtkKdNode__ZN10vtkBSPCuts10CreateCutsEPdiPiS0_S1_S1_S0_S0_S1___ZN10vtkBSPCuts10InitializeEv__ZN10vtkBSPCuts11PrintArraysEv__ZN10vtkBSPCuts11ShallowCopyEP13vtkDataObject__ZN10vtkBSPCuts3NewEv__ZN10vtkBSPCuts6EqualsEPS_d__ZN10vtkBSPCuts7GetDataEP14vtkInformation__ZN10vtkBSPCuts7GetDataEP20vtkInformationVectori__ZN10vtkBSPCuts8DeepCopyEP13vtkDataObject__ZN10vtkBSPCuts9GetArraysEiPiPdS0_S0_S1_S1_S0___ZN10vtkBSPCuts9PrintTreeEv__ZN10vtkDataSet10InitializeEv__ZN10vtkDataSet11ShallowCopyEP13vtkDataObject__ZN10vtkDataSet12GetCellTypesEP12vtkCellTypes__ZN10vtkDataSet13ComputeBoundsEv__ZN10vtkDataSet13GetCellBoundsExPd__ZN10vtkDataSet14CopyAttributesEPS___ZN10vtkDataSet14FindAndGetCellEPdP7vtkCellxdRiS0_S0___ZN10vtkDataSet14GetScalarRangeEPd__ZN10vtkDataSet14GetScalarRangeEv__ZN10vtkDataSet15CheckAttributesEv__ZN10vtkDataSet15NewCellIteratorEv__ZN10vtkDataSet16GetCellNeighborsExP9vtkIdListS1___ZN10vtkDataSet16HasAnyGhostCellsEv__ZN10vtkDataSet17GetCellGhostArrayEv__ZN10vtkDataSet17HasAnyGhostPointsEv__ZN10vtkDataSet18GenerateGhostArrayEPib__ZN10vtkDataSet18GetPointGhostArrayEv__ZN10vtkDataSet19GetActualMemorySizeEv__ZN10vtkDataSet19GetNumberOfElementsEi__ZN10vtkDataSet22AllocateCellGhostArrayEv__ZN10vtkDataSet23AllocatePointGhostArrayEv__ZN10vtkDataSet24GetAttributesAsFieldDataEi__ZN10vtkDataSet25UpdateCellGhostArrayCacheEv__ZN10vtkDataSet26UpdatePointGhostArrayCacheEv__ZN10vtkDataSet7GetDataEP14vtkInformation__ZN10vtkDataSet7GetDataEP20vtkInformationVectori__ZN10vtkDataSet7SqueezeEv__ZN10vtkDataSet8DeepCopyEP13vtkDataObject__ZN10vtkDataSet8GetMTimeEv__ZN10vtkDataSet9GetBoundsEPd__ZN10vtkDataSet9GetBoundsEv__ZN10vtkDataSet9GetCenterEPd__ZN10vtkDataSet9GetCenterEv__ZN10vtkDataSet9GetLengthEv__ZN10vtkLocator10InitializeEv__ZN10vtkLocator10SetDataSetEP10vtkDataSet__ZN10vtkLocator6UpdateEv__ZN10vtkPolygon11ComputeAreaEP9vtkPointsxPxPd__ZN10vtkPolygon11ComputeAreaEv__ZN10vtkPolygon11DerivativesEiPdS0_iS0___ZN10vtkPolygon11TriangulateEP9vtkIdList__ZN10vtkPolygon11TriangulateEiP9vtkIdListP9vtkPoints__ZN10vtkPolygon12CellBoundaryEiPdP9vtkIdList__ZN10vtkPolygon13ComputeNormalEP14vtkIdTypeArrayP9vtkPointsPd__ZN10vtkPolygon13ComputeNormalEP9vtkPointsPd__ZN10vtkPolygon13ComputeNormalEP9vtkPointsiPxPd__ZN10vtkPolygon13ComputeNormalEiPdS0___ZN10vtkPolygon14PointInPolygonEPdiS0_S0_S0___ZN10vtkPolygon15ComputeCentroidEP14vtkIdTypeArrayP9vtkPointsPd__ZN10vtkPolygon15ComputeCentroidEP9vtkPointsiPxPd__ZN10vtkPolygon16EvaluateLocationERiPdS1_S1___ZN10vtkPolygon16EvaluatePositionEPdS0_RiS0_RdS0___ZN10vtkPolygon17DistanceToPolygonEPdiS0_S0_S0___ZN10vtkPolygon17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN10vtkPolygon18BoundedTriangulateEP9vtkIdListd__ZN10vtkPolygon19ParameterizePolygonEPdS0_RdS0_S1_S0___ZN10vtkPolygon20InterpolateFunctionsEPdS0___ZN10vtkPolygon22IntersectConvex2DCellsEP7vtkCellS1_dPdS2___ZN10vtkPolygon24NonDegenerateTriangulateEP9vtkIdList__ZN10vtkPolygon27IntersectPolygonWithPolygonEiPdS0_iS0_S0_dS0___ZN10vtkPolygon3NewEv__ZN10vtkPolygon4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN10vtkPolygon7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN10vtkPolygon7GetEdgeEi__ZN10vtkPolygon8IsConvexEP14vtkIdTypeArrayP9vtkPoints__ZN10vtkPolygon8IsConvexEP9vtkPoints__ZN10vtkPolygon8IsConvexEP9vtkPointsiPx__ZN10vtkPolygon8IsConvexEv__ZN10vtkPyramid11DerivativesEiPdS0_iS0___ZN10vtkPyramid11TriangulateEiP9vtkIdListP9vtkPoints__ZN10vtkPyramid12CellBoundaryEiPdP9vtkIdList__ZN10vtkPyramid12GetEdgeArrayEi__ZN10vtkPyramid12GetFaceArrayEi__ZN10vtkPyramid13GetEdgePointsEiRPi__ZN10vtkPyramid13GetFacePointsEiRPi__ZN10vtkPyramid16EvaluateLocationERiPdS1_S1___ZN10vtkPyramid16EvaluatePositionEPdS0_RiS0_RdS0___ZN10vtkPyramid17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN10vtkPyramid19GetParametricCoordsEv__ZN10vtkPyramid19InterpolationDerivsEPdS0___ZN10vtkPyramid22InterpolationFunctionsEPdS0___ZN10vtkPyramid3NewEv__ZN10vtkPyramid7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN10vtkPyramid7GetEdgeEi__ZN10vtkPyramid7GetFaceEi__ZN10vtkQuadric15SetCoefficientsEPd__ZN10vtkQuadric15SetCoefficientsEdddddddddd__ZN10vtkQuadric16EvaluateFunctionEPd__ZN10vtkQuadric16EvaluateGradientEPdS0___ZN10vtkQuadric3NewEv__ZN10vtkVariantC1ERKS___ZN10vtkVariantD1Ev__ZN11vtkCellData3NewEv__ZN11vtkCylinder16EvaluateFunctionEPd__ZN11vtkCylinder16EvaluateGradientEPdS0___ZN11vtkCylinder3NewEv__ZN11vtkCylinder7SetAxisEPd__ZN11vtkCylinder7SetAxisEddd__ZN11vtkMolecule10AppendAtomEtRK11vtkVector3f__ZN11vtkMolecule10AppendBondExxt__ZN11vtkMolecule10GetLatticeER11vtkVector3dS1_S1___ZN11vtkMolecule10GetLatticeER11vtkVector3dS1_S1_S1___ZN11vtkMolecule10GetLatticeEv__ZN11vtkMolecule10HasLatticeEv__ZN11vtkMolecule10InitializeEv__ZN11vtkMolecule10SetLatticeEP12vtkMatrix3x3__ZN11vtkMolecule10SetLatticeERK11vtkVector3dS2_S2___ZN11vtkMolecule11ShallowCopyEP13vtkDataObject__ZN11vtkMolecule12ClearLatticeEv__ZN11vtkMolecule12GetBondOrderEx__ZN11vtkMolecule12SetBondOrderExt__ZN11vtkMolecule13GetBondLengthEx__ZN11vtkMolecule15CheckedDeepCopyEP8vtkGraph__ZN11vtkMolecule15GetAtomPositionEx__ZN11vtkMolecule15GetAtomPositionExPf__ZN11vtkMolecule15SetAtomPositionExRK11vtkVector3f__ZN11vtkMolecule15SetAtomPositionExddd__ZN11vtkMolecule16GetNumberOfAtomsEv__ZN11vtkMolecule16GetNumberOfBondsEv__ZN11vtkMolecule16GetPlaneFromBondERK7vtkAtomS2_RK11vtkVector3fP8vtkPlane__ZN11vtkMolecule16GetPlaneFromBondERK7vtkBondRK11vtkVector3fP8vtkPlane__ZN11vtkMolecule17DeepCopyStructureEPS___ZN11vtkMolecule17SetElectronicDataEP25vtkAbstractElectronicData__ZN11vtkMolecule18CheckedShallowCopyEP8vtkGraph__ZN11vtkMolecule18DeepCopyAttributesEPS___ZN11vtkMolecule19GetAtomAtomicNumberEx__ZN11vtkMolecule19SetAtomAtomicNumberExt__ZN11vtkMolecule20GetAtomicNumberArrayEv__ZN11vtkMolecule20ShallowCopyStructureEPS___ZN11vtkMolecule21ShallowCopyAttributesEPS___ZN11vtkMolecule22GetAtomicPositionArrayEv__ZN11vtkMolecule3NewEv__ZN11vtkMolecule7GetAtomEx__ZN11vtkMolecule7GetBondEx__ZN11vtkMolecule8DeepCopyEP13vtkDataObject__ZN11vtkPointSet10InitializeEv__ZN11vtkPointSet11ShallowCopyEP13vtkDataObject__ZN11vtkPointSet13ComputeBoundsEv__ZN11vtkPointSet13CopyStructureEP10vtkDataSet__ZN11vtkPointSet15NewCellIteratorEv__ZN11vtkPointSet19GetActualMemorySizeEv__ZN11vtkPointSet7GetDataEP14vtkInformation__ZN11vtkPointSet7GetDataEP20vtkInformationVectori__ZN11vtkPointSet7SqueezeEv__ZN11vtkPointSet8DeepCopyEP13vtkDataObject__ZN11vtkPointSet8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN11vtkPointSet8FindCellEPdP7vtkCellxdRiS0_S0___ZN11vtkPointSet8GetMTimeEv__ZN11vtkPointSet9FindPointEPd__ZN11vtkPointSet9SetPointsEP9vtkPoints__ZN11vtkPolyData10BuildCellsEv__ZN11vtkPolyData10BuildLinksEi__ZN11vtkPolyData10InitializeEv__ZN11vtkPolyData11DeleteCellsEv__ZN11vtkPolyData11DeleteLinksEv__ZN11vtkPolyData11GetCellTypeEx__ZN11vtkPolyData11ReplaceCellExiPx__ZN11vtkPolyData11ReverseCellEx__ZN11vtkPolyData11ShallowCopyEP13vtkDataObject__ZN11vtkPolyData12GetMeshMTimeEv__ZN11vtkPolyData13ComputeBoundsEv__ZN11vtkPolyData13CopyStructureEP10vtkDataSet__ZN11vtkPolyData13GetCellBoundsExPd__ZN11vtkPolyData13GetCellPointsExP9vtkIdList__ZN11vtkPolyData13GetGhostLevelEv__ZN11vtkPolyData13GetPointCellsExP9vtkIdList__ZN11vtkPolyData14GetMaxCellSizeEv__ZN11vtkPolyData14InsertNextCellEiP9vtkIdList__ZN11vtkPolyData14InsertNextCellEiiPx__ZN11vtkPolyData16GetCellNeighborsExP9vtkIdListS1___ZN11vtkPolyData16GetNumberOfCellsEv__ZN11vtkPolyData16GetNumberOfLinesEv__ZN11vtkPolyData16GetNumberOfPolysEv__ZN11vtkPolyData16GetNumberOfVertsEv__ZN11vtkPolyData16RemoveGhostCellsEv__ZN11vtkPolyData17GetNumberOfPiecesEv__ZN11vtkPolyData17GetNumberOfStripsEv__ZN11vtkPolyData17ReplaceLinkedCellExiPx__ZN11vtkPolyData18AddReferenceToCellExx__ZN11vtkPolyData18RemoveDeletedCellsEv__ZN11vtkPolyData19GetActualMemorySizeEv__ZN11vtkPolyData20GetCellEdgeNeighborsExxxP9vtkIdList__ZN11vtkPolyData20InsertNextLinkedCellEiiPx__ZN11vtkPolyData21InsertNextLinkedPointEPdi__ZN11vtkPolyData21InsertNextLinkedPointEi__ZN11vtkPolyData21RemoveReferenceToCellExx__ZN11vtkPolyData27GetScalarFieldCriticalIndexExP12vtkDataArray__ZN11vtkPolyData27GetScalarFieldCriticalIndexExPKc__ZN11vtkPolyData27GetScalarFieldCriticalIndexExi__ZN11vtkPolyData3NewEv__ZN11vtkPolyData5ResetEv__ZN11vtkPolyData6IsEdgeExx__ZN11vtkPolyData7GetCellEx__ZN11vtkPolyData7GetCellExP14vtkGenericCell__ZN11vtkPolyData7GetDataEP14vtkInformation__ZN11vtkPolyData7GetDataEP20vtkInformationVectori__ZN11vtkPolyData7SqueezeEv__ZN11vtkPolyData8AllocateEPS_xi__ZN11vtkPolyData8AllocateExi__ZN11vtkPolyData8DeepCopyEP13vtkDataObject__ZN11vtkPolyData8GetLinesEv__ZN11vtkPolyData8GetPieceEv__ZN11vtkPolyData8GetPolysEv__ZN11vtkPolyData8GetVertsEv__ZN11vtkPolyData8SetLinesEP12vtkCellArray__ZN11vtkPolyData8SetPolysEP12vtkCellArray__ZN11vtkPolyData8SetVertsEP12vtkCellArray__ZN11vtkPolyData9CopyCellsEPS_P9vtkIdListP15vtkPointLocator__ZN11vtkPolyData9GetStripsEv__ZN11vtkPolyData9SetStripsEP12vtkCellArray__ZN11vtkPolyLine11DerivativesEiPdS0_iS0___ZN11vtkPolyLine11TriangulateEiP9vtkIdListP9vtkPoints__ZN11vtkPolyLine12CellBoundaryEiPdP9vtkIdList__ZN11vtkPolyLine16EvaluateLocationERiPdS1_S1___ZN11vtkPolyLine16EvaluatePositionEPdS0_RiS0_RdS0___ZN11vtkPolyLine17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN11vtkPolyLine19GetParametricCenterEPd__ZN11vtkPolyLine22GenerateSlidingNormalsEP9vtkPointsP12vtkCellArrayP12vtkDataArray__ZN11vtkPolyLine22GenerateSlidingNormalsEP9vtkPointsP12vtkCellArrayP12vtkDataArrayPd__ZN11vtkPolyLine3NewEv__ZN11vtkPolyLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN11vtkPolyLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN11vtkTriangle11ComputeAreaEv__ZN11vtkTriangle11DerivativesEiPdS0_iS0___ZN11vtkTriangle11ProjectTo2DEPdS0_S0_S0_S0_S0___ZN11vtkTriangle11TriangulateEiP9vtkIdListP9vtkPoints__ZN11vtkTriangle12CellBoundaryEiPdP9vtkIdList__ZN11vtkTriangle12CircumcircleEPdS0_S0_S0___ZN11vtkTriangle12GetEdgeArrayEi__ZN11vtkTriangle13ComputeNormalEP9vtkPointsiPxPd__ZN11vtkTriangle14ComputeQuadricEPdS0_S0_P10vtkQuadric__ZN11vtkTriangle14ComputeQuadricEPdS0_S0_PA4_d__ZN11vtkTriangle15PointInTriangleEPdS0_S0_S0_d__ZN11vtkTriangle16EvaluateLocationERiPdS1_S1___ZN11vtkTriangle16EvaluatePositionEPdS0_RiS0_RdS0___ZN11vtkTriangle17BarycentricCoordsEPdS0_S0_S0_S0___ZN11vtkTriangle17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN11vtkTriangle18TrianglesIntersectEPdS0_S0_S0_S0_S0___ZN11vtkTriangle19GetParametricCoordsEv__ZN11vtkTriangle19InterpolationDerivsEPdS0___ZN11vtkTriangle21GetParametricDistanceEPd__ZN11vtkTriangle22InterpolationFunctionsEPdS0___ZN11vtkTriangle3NewEv__ZN11vtkTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN11vtkTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN11vtkTriangle7GetEdgeEi__ZN12vtkArrayData11ClearArraysEv__ZN12vtkArrayData11ShallowCopyEP13vtkDataObject__ZN12vtkArrayData14GetArrayByNameEPKc__ZN12vtkArrayData17GetNumberOfArraysEv__ZN12vtkArrayData3NewEv__ZN12vtkArrayData7GetDataEP14vtkInformation__ZN12vtkArrayData7GetDataEP20vtkInformationVectori__ZN12vtkArrayData8AddArrayEP8vtkArray__ZN12vtkArrayData8DeepCopyEP13vtkDataObject__ZN12vtkArrayData8GetArrayEx__ZN12vtkCellArray10InitializeEv__ZN12vtkCellArray11GetNextCellEP9vtkIdList__ZN12vtkCellArray14GetMaxCellSizeEv__ZN12vtkCellArray19GetActualMemorySizeEv__ZN12vtkCellArray3NewEv__ZN12vtkCellArray7GetCellExP9vtkIdList__ZN12vtkCellArray8DeepCopyEPS___ZN12vtkCellArray8SetCellsExP14vtkIdTypeArray__ZN12vtkCellLinks10BuildLinksEP10vtkDataSet__ZN12vtkCellLinks10BuildLinksEP10vtkDataSetP12vtkCellArray__ZN12vtkCellLinks10InitializeEv__ZN12vtkCellLinks15InsertNextPointEi__ZN12vtkCellLinks19GetActualMemorySizeEv__ZN12vtkCellLinks3NewEv__ZN12vtkCellLinks5ResetEv__ZN12vtkCellLinks7SqueezeEv__ZN12vtkCellLinks8AllocateExx__ZN12vtkCellLinks8DeepCopyEPS___ZN12vtkCellTypes10InsertCellExhx__ZN12vtkCellTypes12SetCellTypesExP20vtkUnsignedCharArrayP11vtkIntArray__ZN12vtkCellTypes12SetCellTypesExP20vtkUnsignedCharArrayP14vtkIdTypeArray__ZN12vtkCellTypes14InsertNextCellEhx__ZN12vtkCellTypes19GetActualMemorySizeEv__ZN12vtkCellTypes22GetClassNameFromTypeIdEi__ZN12vtkCellTypes22GetTypeIdFromClassNameEPKc__ZN12vtkCellTypes3NewEv__ZN12vtkCellTypes5ResetEv__ZN12vtkCellTypes7SqueezeEv__ZN12vtkCellTypes8AllocateEii__ZN12vtkCellTypes8DeepCopyEPS___ZN12vtkCubicLine11DerivativesEiPdS0_iS0___ZN12vtkCubicLine11TriangulateEiP9vtkIdListP9vtkPoints__ZN12vtkCubicLine12CellBoundaryEiPdP9vtkIdList__ZN12vtkCubicLine16EvaluateLocationERiPdS1_S1___ZN12vtkCubicLine16EvaluatePositionEPdS0_RiS0_RdS0___ZN12vtkCubicLine17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN12vtkCubicLine19GetParametricCoordsEv__ZN12vtkCubicLine19InterpolationDerivsEPdS0___ZN12vtkCubicLine21GetParametricDistanceEPd__ZN12vtkCubicLine22InterpolationFunctionsEPdS0___ZN12vtkCubicLine3NewEv__ZN12vtkCubicLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN12vtkCubicLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN12vtkEdgeTable10InitializeEv__ZN12vtkEdgeTable10InsertEdgeExx__ZN12vtkEdgeTable10InsertEdgeExxPv__ZN12vtkEdgeTable10InsertEdgeExxx__ZN12vtkEdgeTable11GetNextEdgeERxS0___ZN12vtkEdgeTable13InitTraversalEv__ZN12vtkEdgeTable17InitEdgeInsertionExi__ZN12vtkEdgeTable17InsertUniquePointExxPdRx__ZN12vtkEdgeTable18InitPointInsertionEP9vtkPointsx__ZN12vtkEdgeTable3NewEv__ZN12vtkEdgeTable5ResetEv__ZN12vtkEdgeTable6IsEdgeExx__ZN12vtkEmptyCell11DerivativesEiPdS0_iS0___ZN12vtkEmptyCell11TriangulateEiP9vtkIdListP9vtkPoints__ZN12vtkEmptyCell12CellBoundaryEiPdP9vtkIdList__ZN12vtkEmptyCell16EvaluateLocationERiPdS1_S1___ZN12vtkEmptyCell16EvaluatePositionEPdS0_RiS0_RdS0___ZN12vtkEmptyCell17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN12vtkEmptyCell3NewEv__ZN12vtkEmptyCell4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN12vtkEmptyCell7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN12vtkFieldData10CopyAllOffEi__ZN12vtkFieldData10InitializeEv__ZN12vtkFieldData11InsertTupleExxPS___ZN12vtkFieldData11RemoveArrayEPKc__ZN12vtkFieldData11RemoveArrayEi__ZN12vtkFieldData11ShallowCopyEPS___ZN12vtkFieldData13CopyStructureEPS___ZN12vtkFieldData14AllocateArraysEi__ZN12vtkFieldData14CopyFieldOnOffEPKci__ZN12vtkFieldData15InsertNextTupleExPS___ZN12vtkFieldData16GetAbstractArrayEPKcRi__ZN12vtkFieldData16GetAbstractArrayEi__ZN12vtkFieldData17GetNumberOfTuplesEv__ZN12vtkFieldData17SetNumberOfTuplesEx__ZN12vtkFieldData19GetActualMemorySizeEv__ZN12vtkFieldData21GetNumberOfComponentsEv__ZN12vtkFieldData27GetArrayContainingComponentEiRi__ZN12vtkFieldData3NewEv__ZN12vtkFieldData5ResetEv__ZN12vtkFieldData7SqueezeEv__ZN12vtkFieldData8AddArrayEP16vtkAbstractArray__ZN12vtkFieldData8AllocateExx__ZN12vtkFieldData8DeepCopyEPS___ZN12vtkFieldData8GetArrayEPKcRi__ZN12vtkFieldData8GetArrayEi__ZN12vtkFieldData8GetFieldEP9vtkIdListPS___ZN12vtkFieldData8GetMTimeEv__ZN12vtkFieldData8PassDataEPS___ZN12vtkFieldData8SetTupleExxPS___ZN12vtkFieldData9CopyAllOnEi__ZN12vtkGraphEdge3NewEv__ZN12vtkHyperTree14CreateInstanceEjj__ZN12vtkHyperTree15FindParentIndexERx__ZN12vtkHyperTree19FindChildParametersEiRxRb__ZN12vtkImageData10InitializeEv__ZN12vtkImageData11GetCellTypeEx__ZN12vtkImageData11ShallowCopyEP13vtkDataObject__ZN12vtkImageData13ComputeBoundsEv__ZN12vtkImageData13CopyStructureEP10vtkDataSet__ZN12vtkImageData13GetCellBoundsExPd__ZN12vtkImageData13GetDimensionsEPi__ZN12vtkImageData13GetDimensionsEv__ZN12vtkImageData13GetIncrementsEP12vtkDataArray__ZN12vtkImageData13GetIncrementsEP12vtkDataArrayPx__ZN12vtkImageData13GetIncrementsEP12vtkDataArrayRxS2_S2___ZN12vtkImageData13GetIncrementsEPx__ZN12vtkImageData13GetIncrementsERxS0_S0___ZN12vtkImageData13GetIncrementsEv__ZN12vtkImageData13GetScalarSizeEP14vtkInformation__ZN12vtkImageData13GetScalarSizeEv__ZN12vtkImageData13GetScalarTypeEP14vtkInformation__ZN12vtkImageData13GetScalarTypeEv__ZN12vtkImageData13HasScalarTypeEP14vtkInformation__ZN12vtkImageData13SetDimensionsEPKi__ZN12vtkImageData13SetDimensionsEiii__ZN12vtkImageData13SetScalarTypeEiP14vtkInformation__ZN12vtkImageData14FindAndGetCellEPdP7vtkCellxdRiS0_S0___ZN12vtkImageData15AllocateScalarsEP14vtkInformation__ZN12vtkImageData15AllocateScalarsEii__ZN12vtkImageData15CopyAndCastFromEPS_Pi__ZN12vtkImageData15GetArrayPointerEP12vtkDataArrayPi__ZN12vtkImageData16GetNumberOfCellsEv__ZN12vtkImageData16GetPointGradientEiiiP12vtkDataArrayPd__ZN12vtkImageData16GetScalarPointerEPi__ZN12vtkImageData16GetScalarPointerEiii__ZN12vtkImageData16GetScalarPointerEv__ZN12vtkImageData16GetScalarTypeMaxEP14vtkInformation__ZN12vtkImageData16GetScalarTypeMaxEv__ZN12vtkImageData16GetScalarTypeMinEP14vtkInformation__ZN12vtkImageData16GetScalarTypeMinEv__ZN12vtkImageData16GetVoxelGradientEiiiP12vtkDataArrayS1___ZN12vtkImageData17PrepareForNewDataEv__ZN12vtkImageData18GetArrayIncrementsEP12vtkDataArrayPx__ZN12vtkImageData19GetActualMemorySizeEv__ZN12vtkImageData19GetAxisUpdateExtentEiRiS0_PKi__ZN12vtkImageData19SetAxisUpdateExtentEiiiPKiPi__ZN12vtkImageData21ComputeInternalExtentEPiS0_S0___ZN12vtkImageData23GetContinuousIncrementsEP12vtkDataArrayPiRxS3_S3___ZN12vtkImageData23GetContinuousIncrementsEPiRxS1_S1___ZN12vtkImageData24GetArrayPointerForExtentEP12vtkDataArrayPi__ZN12vtkImageData25CopyInformationToPipelineEP14vtkInformation__ZN12vtkImageData25GetScalarComponentAsFloatEiiii__ZN12vtkImageData25GetScalarPointerForExtentEPi__ZN12vtkImageData26GetScalarComponentAsDoubleEiiii__ZN12vtkImageData27CopyInformationFromPipelineEP14vtkInformation__ZN12vtkImageData27GetNumberOfScalarComponentsEP14vtkInformation__ZN12vtkImageData27GetNumberOfScalarComponentsEv__ZN12vtkImageData27HasNumberOfScalarComponentsEP14vtkInformation__ZN12vtkImageData27SetNumberOfScalarComponentsEiP14vtkInformation__ZN12vtkImageData27SetScalarComponentFromFloatEiiiif__ZN12vtkImageData28ComputeStructuredCoordinatesEPKdPiPd__ZN12vtkImageData28ComputeStructuredCoordinatesEPKdPiPdPKiS1_S1_S1___ZN12vtkImageData28SetScalarComponentFromDoubleEiiiid__ZN12vtkImageData3NewEv__ZN12vtkImageData4CropEPKi__ZN12vtkImageData7GetCellEiii__ZN12vtkImageData7GetCellEx__ZN12vtkImageData7GetCellExP14vtkGenericCell__ZN12vtkImageData7GetDataEP14vtkInformation__ZN12vtkImageData7GetDataEP20vtkInformationVectori__ZN12vtkImageData8DeepCopyEP13vtkDataObject__ZN12vtkImageData8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN12vtkImageData8FindCellEPdP7vtkCellxdRiS0_S0___ZN12vtkImageData8GetPointExPd__ZN12vtkImageData9FindPointEPd__ZN12vtkImageData9SetExtentEPi__ZN12vtkImageData9SetExtentEiiiiii__ZN12vtkPointData3NewEv__ZN12vtkPointData9NullPointEx__ZN12vtkPolyPlane11SetPolyLineEP11vtkPolyLine__ZN12vtkPolyPlane16EvaluateFunctionEPd__ZN12vtkPolyPlane16EvaluateGradientEPdS0___ZN12vtkPolyPlane3NewEv__ZN12vtkPolyPlane8GetMTimeEv__ZN12vtkReebGraph11CloseStreamEv__ZN12vtkReebGraph14StreamTriangleExdxdxd__ZN12vtkReebGraph17StreamTetrahedronExdxdxdxd__ZN12vtkReebGraph3NewEv__ZN12vtkReebGraph3SetEP23vtkMutableDirectedGraph__ZN12vtkReebGraph5BuildEP11vtkPolyDataP12vtkDataArray__ZN12vtkReebGraph5BuildEP11vtkPolyDataPKc__ZN12vtkReebGraph5BuildEP11vtkPolyDatax__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridP12vtkDataArray__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridPKc__ZN12vtkReebGraph5BuildEP19vtkUnstructuredGridx__ZN12vtkReebGraph8DeepCopyEP13vtkDataObject__ZN12vtkReebGraph8SimplifyEdP32vtkReebGraphSimplificationMetric__ZN12vtkSelection10InitializeEv__ZN12vtkSelection10RemoveNodeEP16vtkSelectionNode__ZN12vtkSelection10RemoveNodeEj__ZN12vtkSelection11ShallowCopyEP13vtkDataObject__ZN12vtkSelection14RemoveAllNodesEv__ZN12vtkSelection16GetNumberOfNodesEv__ZN12vtkSelection3NewEv__ZN12vtkSelection4DumpEv__ZN12vtkSelection5UnionEP16vtkSelectionNode__ZN12vtkSelection5UnionEPS___ZN12vtkSelection7AddNodeEP16vtkSelectionNode__ZN12vtkSelection7GetDataEP14vtkInformation__ZN12vtkSelection7GetDataEP20vtkInformationVectori__ZN12vtkSelection7GetNodeEj__ZN12vtkSelection8DeepCopyEP13vtkDataObject__ZN12vtkSelection8GetMTimeEv__ZN12vtkSelection8SubtractEP16vtkSelectionNode__ZN12vtkSelection8SubtractEPS___ZN13vtkAnnotation10ICON_INDEXEv__ZN13vtkAnnotation10InitializeEv__ZN13vtkAnnotation11ShallowCopyEP13vtkDataObject__ZN13vtkAnnotation12SetSelectionEP12vtkSelection__ZN13vtkAnnotation3NewEv__ZN13vtkAnnotation4DATAEv__ZN13vtkAnnotation4HIDEEv__ZN13vtkAnnotation5COLOREv__ZN13vtkAnnotation5LABELEv__ZN13vtkAnnotation6ENABLEEv__ZN13vtkAnnotation7GetDataEP14vtkInformation__ZN13vtkAnnotation7GetDataEP20vtkInformationVectori__ZN13vtkAnnotation7OPACITYEv__ZN13vtkAnnotation8DeepCopyEP13vtkDataObject__ZN13vtkAnnotation8GetMTimeEv__ZN13vtkCollection15GetItemAsObjectEi__ZN13vtkCollection7AddItemEP9vtkObject__ZN13vtkDataObject10FIELD_NAMEEv__ZN13vtkDataObject10InitializeEv__ZN13vtkDataObject11DATA_EXTENTEv__ZN13vtkDataObject11DATA_OBJECTEv__ZN13vtkDataObject11FIELD_RANGEEv__ZN13vtkDataObject11ReleaseDataEv__ZN13vtkDataObject11ShallowCopyEPS___ZN13vtkDataObject12BOUNDING_BOXEv__ZN13vtkDataObject12PIECE_EXTENTEv__ZN13vtkDataObject12SetFieldDataEP12vtkFieldData__ZN13vtkDataObject13GetAttributesEi__ZN13vtkDataObject13GetUpdateTimeEv__ZN13vtkDataObject14DATA_TIME_STEPEv__ZN13vtkDataObject14DATA_TYPE_NAMEEv__ZN13vtkDataObject14SetInformationEP14vtkInformation__ZN13vtkDataObject15FIELD_OPERATIONEv__ZN13vtkDataObject16CELL_DATA_VECTOREv__ZN13vtkDataObject16DATA_EXTENT_TYPEEv__ZN13vtkDataObject16EDGE_DATA_VECTOREv__ZN13vtkDataObject16FIELD_ARRAY_TYPEEv__ZN13vtkDataObject17ALL_PIECES_EXTENTEv__ZN13vtkDataObject17DATA_PIECE_NUMBEREv__ZN13vtkDataObject17FIELD_ASSOCIATIONEv__ZN13vtkDataObject17POINT_DATA_VECTOREv__ZN13vtkDataObject18SetActiveAttributeEP14vtkInformationiPKci__ZN13vtkDataObject18VERTEX_DATA_VECTOREv__ZN13vtkDataObject19GetActualMemorySizeEv__ZN13vtkDataObject19GetNumberOfElementsEi__ZN13vtkDataObject20DataHasBeenGeneratedEv__ZN13vtkDataObject20FIELD_ATTRIBUTE_TYPEEv__ZN13vtkDataObject21DATA_NUMBER_OF_PIECESEv__ZN13vtkDataObject22FIELD_ACTIVE_ATTRIBUTEEv__ZN13vtkDataObject22FIELD_NUMBER_OF_TUPLESEv__ZN13vtkDataObject22SetActiveAttributeInfoEP14vtkInformationiiPKciii__ZN13vtkDataObject24GetAttributeTypeForArrayEP16vtkAbstractArray__ZN13vtkDataObject24GetAttributesAsFieldDataEi__ZN13vtkDataObject24GetGlobalReleaseDataFlagEv__ZN13vtkDataObject24GetNamedFieldInformationEP14vtkInformationiPKc__ZN13vtkDataObject24SetGlobalReleaseDataFlagEi__ZN13vtkDataObject25GetActiveFieldInformationEP14vtkInformationii__ZN13vtkDataObject26FIELD_NUMBER_OF_COMPONENTSEv__ZN13vtkDataObject26GetAssociationTypeAsStringEi__ZN13vtkDataObject27DATA_NUMBER_OF_GHOST_LEVELSEv__ZN13vtkDataObject27RemoveNamedFieldInformationEP14vtkInformationiPKc__ZN13vtkDataObject28GetAssociationTypeFromStringEPKc__ZN13vtkDataObject28SetPointDataActiveScalarInfoEP14vtkInformationii__ZN13vtkDataObject3NewEv__ZN13vtkDataObject3SILEv__ZN13vtkDataObject4CropEPKi__ZN13vtkDataObject6ORIGINEv__ZN13vtkDataObject7GetDataEP14vtkInformation__ZN13vtkDataObject7GetDataEP20vtkInformationVectori__ZN13vtkDataObject7SPACINGEv__ZN13vtkDataObject8DeepCopyEPS___ZN13vtkDataObject8GetMTimeEv__ZN13vtkHexahedron11DerivativesEiPdS0_iS0___ZN13vtkHexahedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN13vtkHexahedron12CellBoundaryEiPdP9vtkIdList__ZN13vtkHexahedron12GetEdgeArrayEi__ZN13vtkHexahedron12GetFaceArrayEi__ZN13vtkHexahedron13GetEdgePointsEiRPi__ZN13vtkHexahedron13GetFacePointsEiRPi__ZN13vtkHexahedron16EvaluateLocationERiPdS1_S1___ZN13vtkHexahedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN13vtkHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN13vtkHexahedron19GetParametricCoordsEv__ZN13vtkHexahedron19InterpolationDerivsEPdS0___ZN13vtkHexahedron22InterpolationFunctionsEPdS0___ZN13vtkHexahedron3NewEv__ZN13vtkHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN13vtkHexahedron7GetEdgeEi__ZN13vtkHexahedron7GetFaceEi__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPolyVertex11DerivativesEiPdS0_iS0___ZN13vtkPolyVertex11TriangulateEiP9vtkIdListP9vtkPoints__ZN13vtkPolyVertex12CellBoundaryEiPdP9vtkIdList__ZN13vtkPolyVertex16EvaluateLocationERiPdS1_S1___ZN13vtkPolyVertex16EvaluatePositionEPdS0_RiS0_RdS0___ZN13vtkPolyVertex17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN13vtkPolyVertex19GetParametricCenterEPd__ZN13vtkPolyVertex3NewEv__ZN13vtkPolyVertex4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN13vtkPolyVertex7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN13vtkPolyhedron10InitializeEv__ZN13vtkPolyhedron11DerivativesEiPdS0_iS0___ZN13vtkPolyhedron11GetPolyDataEv__ZN13vtkPolyhedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN13vtkPolyhedron12CellBoundaryEiPdP9vtkIdList__ZN13vtkPolyhedron16EvaluateLocationERiPdS1_S1___ZN13vtkPolyhedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN13vtkPolyhedron16GetNumberOfEdgesEv__ZN13vtkPolyhedron16GetNumberOfFacesEv__ZN13vtkPolyhedron17InterpolateDerivsEPdS0___ZN13vtkPolyhedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN13vtkPolyhedron19GetParametricCoordsEv__ZN13vtkPolyhedron20InterpolateFunctionsEPdS0___ZN13vtkPolyhedron3NewEv__ZN13vtkPolyhedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN13vtkPolyhedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN13vtkPolyhedron7GetEdgeEi__ZN13vtkPolyhedron7GetFaceEi__ZN13vtkPolyhedron8GetFacesEv__ZN13vtkPolyhedron8IsConvexEv__ZN13vtkPolyhedron8IsInsideEPdd__ZN13vtkPolyhedron8SetFacesEPx__ZN13vtkPythonArgs10BuildTupleEPKdi__ZN13vtkPythonArgs10BuildTupleEPKii__ZN13vtkPythonArgs10BuildTupleEPKji__ZN13vtkPythonArgs10BuildTupleEPKxi__ZN13vtkPythonArgs10GetArgSizeEi__ZN13vtkPythonArgs11SetArgValueEiPKdi__ZN13vtkPythonArgs11SetArgValueEiPKhi__ZN13vtkPythonArgs11SetArgValueEiPKii__ZN13vtkPythonArgs11SetArgValueEiPKxi__ZN13vtkPythonArgs11SetArgValueEib__ZN13vtkPythonArgs11SetArgValueEid__ZN13vtkPythonArgs11SetArgValueEii__ZN13vtkPythonArgs11SetArgValueEij__ZN13vtkPythonArgs11SetArgValueEil__ZN13vtkPythonArgs11SetArgValueEit__ZN13vtkPythonArgs11SetArgValueEix__ZN13vtkPythonArgs12PrecondErrorEPKc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs13CheckSizeHintEill__ZN13vtkPythonArgs16PureVirtualErrorEv__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_object__ZN13vtkPythonArgs5ArrayIdEC1El__ZN13vtkPythonArgs5ArrayIfEC1El__ZN13vtkPythonArgs5ArrayIhEC1El__ZN13vtkPythonArgs5ArrayIiEC1El__ZN13vtkPythonArgs5ArrayIlEC1El__ZN13vtkPythonArgs5ArrayImEC1El__ZN13vtkPythonArgs5ArrayIxEC1El__ZN13vtkPythonArgs8GetArrayEPdi__ZN13vtkPythonArgs8GetArrayEPfi__ZN13vtkPythonArgs8GetArrayEPhi__ZN13vtkPythonArgs8GetArrayEPii__ZN13vtkPythonArgs8GetArrayEPji__ZN13vtkPythonArgs8GetArrayEPli__ZN13vtkPythonArgs8GetArrayEPmi__ZN13vtkPythonArgs8GetArrayEPxi__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonArgs8GetValueERb__ZN13vtkPythonArgs8GetValueERd__ZN13vtkPythonArgs8GetValueERf__ZN13vtkPythonArgs8GetValueERh__ZN13vtkPythonArgs8GetValueERi__ZN13vtkPythonArgs8GetValueERj__ZN13vtkPythonArgs8GetValueERl__ZN13vtkPythonArgs8GetValueERm__ZN13vtkPythonArgs8GetValueERt__ZN13vtkPythonArgs8GetValueERx__ZN13vtkPythonArgs8SetArrayEiPKdi__ZN13vtkPythonArgs8SetArrayEiPKfi__ZN13vtkPythonArgs8SetArrayEiPKhi__ZN13vtkPythonArgs8SetArrayEiPKii__ZN13vtkPythonArgs8SetArrayEiPKji__ZN13vtkPythonArgs8SetArrayEiPKli__ZN13vtkPythonArgs8SetArrayEiPKxi__ZN13vtkPythonArgs9GetBufferERPvP10bufferinfo__ZN13vtkPythonArgs9GetNArrayEPdiPKi__ZN13vtkPythonArgs9SetNArrayEiPKdiPKi__ZN13vtkPythonUtil12AddEnumToMapEP11_typeobject__ZN13vtkPythonUtil13ManglePointerEPKvPKc__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZN13vtkPythonUtil27GetPointerFromSpecialObjectEP7_objectPKcPS1___ZN14vtkBoundingBox11SetMaxPointEddd__ZN14vtkBoundingBox11SetMinPointEddd__ZN14vtkBoundingBox12IntersectBoxERKS___ZN14vtkBoundingBox14IntersectPlaneEPdS0___ZN14vtkBoundingBox5ScaleEPd__ZN14vtkBoundingBox5ScaleEddd__ZN14vtkBoundingBox6AddBoxERKS___ZN14vtkBoundingBox7InflateEd__ZN14vtkBoundingBox7InflateEv__ZN14vtkBoundingBox8AddPointEPd__ZN14vtkBoundingBox8AddPointEddd__ZN14vtkBoundingBox9AddBoundsEPKd__ZN14vtkBoundingBox9SetBoundsEdddddd__ZN14vtkCellLocator12BuildLocatorEv__ZN14vtkCellLocator16FindClosestPointEPdS0_P14vtkGenericCellRxRiRd__ZN14vtkCellLocator17ForceBuildLocatorEv__ZN14vtkCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCell__ZN14vtkCellLocator18FindCellsAlongLineEPdS0_dP9vtkIdList__ZN14vtkCellLocator18GetNumberOfBucketsEv__ZN14vtkCellLocator19FreeSearchStructureEv__ZN14vtkCellLocator20BuildLocatorIfNeededEv__ZN14vtkCellLocator20BuildLocatorInternalEv__ZN14vtkCellLocator21FindCellsWithinBoundsEPdP9vtkIdList__ZN14vtkCellLocator22GenerateRepresentationEiP11vtkPolyData__ZN14vtkCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdS4___ZN14vtkCellLocator3NewEv__ZN14vtkCellLocator8FindCellEPddP14vtkGenericCellS0_S0___ZN14vtkCellLocator8GetCellsEi__ZN14vtkGenericCell10InitializeEv__ZN14vtkGenericCell11DerivativesEiPdS0_iS0___ZN14vtkGenericCell11GetCellTypeEv__ZN14vtkGenericCell11SetCellTypeEi__ZN14vtkGenericCell11SetPointIdsEP9vtkIdList__ZN14vtkGenericCell11ShallowCopyEP7vtkCell__ZN14vtkGenericCell11TriangulateEiP9vtkIdListP9vtkPoints__ZN14vtkGenericCell12CellBoundaryEiPdP9vtkIdList__ZN14vtkGenericCell13IsPrimaryCellEv__ZN14vtkGenericCell15InstantiateCellEi__ZN14vtkGenericCell16EvaluateLocationERiPdS1_S1___ZN14vtkGenericCell16EvaluatePositionEPdS0_RiS0_RdS0___ZN14vtkGenericCell16GetCellDimensionEv__ZN14vtkGenericCell16GetNumberOfEdgesEv__ZN14vtkGenericCell16GetNumberOfFacesEv__ZN14vtkGenericCell17InterpolateDerivsEPdS0___ZN14vtkGenericCell17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN14vtkGenericCell19GetParametricCenterEPd__ZN14vtkGenericCell19GetParametricCoordsEv__ZN14vtkGenericCell20InterpolateFunctionsEPdS0___ZN14vtkGenericCell22RequiresInitializationEv__ZN14vtkGenericCell34RequiresExplicitFaceRepresentationEv__ZN14vtkGenericCell3NewEv__ZN14vtkGenericCell4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN14vtkGenericCell7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN14vtkGenericCell7GetEdgeEi__ZN14vtkGenericCell7GetFaceEi__ZN14vtkGenericCell8DeepCopyEP7vtkCell__ZN14vtkGenericCell8GetFacesEv__ZN14vtkGenericCell8IsLinearEv__ZN14vtkGenericCell8SetFacesEPx__ZN14vtkGenericCell9SetPointsEP9vtkPoints__ZN14vtkHyperOctree10InitializeEv__ZN14vtkHyperOctree11GetCellTypeEx__ZN14vtkHyperOctree11GetLeafDataEv__ZN14vtkHyperOctree11ShallowCopyEP13vtkDataObject__ZN14vtkHyperOctree12GetDimensionEv__ZN14vtkHyperOctree12SetDimensionEi__ZN14vtkHyperOctree13CopyStructureEP10vtkDataSet__ZN14vtkHyperOctree13GetCellPointsExP9vtkIdList__ZN14vtkHyperOctree13GetCellPointsExRxRPx__ZN14vtkHyperOctree13GetPointCellsExP9vtkIdList__ZN14vtkHyperOctree13NewCellCursorEv__ZN14vtkHyperOctree13SubdivideLeafEP20vtkHyperOctreeCursor__ZN14vtkHyperOctree14GetMaxCellSizeEv__ZN14vtkHyperOctree15GetPointsOnEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree15GetPointsOnFaceEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree15SetDualGridFlagEi__ZN14vtkHyperOctree16GetCellNeighborsExP9vtkIdListS1___ZN14vtkHyperOctree16GetNumberOfCellsEv__ZN14vtkHyperOctree17GetDataObjectTypeEv__ZN14vtkHyperOctree17GetNumberOfLeavesEv__ZN14vtkHyperOctree17GetNumberOfLevelsEv__ZN14vtkHyperOctree17GetNumberOfPointsEv__ZN14vtkHyperOctree17GetPointsOnEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree19GetActualMemorySizeEv__ZN14vtkHyperOctree20CollapseTerminalNodeEP20vtkHyperOctreeCursor__ZN14vtkHyperOctree20GetMaxNumberOfPointsEi__ZN14vtkHyperOctree21GetPointsOnParentEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree22GetPointsOnParentFacesEPiiP20vtkHyperOctreeCursorP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree23GetPointsOnParentEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree29GetMaxNumberOfCellsOnBoundaryEi__ZN14vtkHyperOctree30GetMaxNumberOfPointsOnBoundaryEi__ZN14vtkHyperOctree3NewEv__ZN14vtkHyperOctree5SIZESEv__ZN14vtkHyperOctree6LEVELSEv__ZN14vtkHyperOctree7GetCellEx__ZN14vtkHyperOctree7GetCellExP14vtkGenericCell__ZN14vtkHyperOctree7GetDataEP14vtkInformation__ZN14vtkHyperOctree7GetDataEP20vtkInformationVectori__ZN14vtkHyperOctree8DeepCopyEP13vtkDataObject__ZN14vtkHyperOctree8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN14vtkHyperOctree8FindCellEPdP7vtkCellxdRiS0_S0___ZN14vtkHyperOctree8GetPointEx__ZN14vtkHyperOctree8GetPointExPd__ZN14vtkHyperOctree9DIMENSIONEv__ZN14vtkHyperOctree9FindPointEPd__ZN14vtkImplicitSum11AddFunctionEP19vtkImplicitFunctiond__ZN14vtkImplicitSum16EvaluateFunctionEPd__ZN14vtkImplicitSum16EvaluateGradientEPdS0___ZN14vtkImplicitSum17SetFunctionWeightEP19vtkImplicitFunctiond__ZN14vtkImplicitSum18RemoveAllFunctionsEv__ZN14vtkImplicitSum3NewEv__ZN14vtkImplicitSum8GetMTimeEv__ZN14vtkMergePoints15IsInsertedPointEPKd__ZN14vtkMergePoints17InsertUniquePointEPKdRx__ZN14vtkMergePoints3NewEv__ZN14vtkPerlinNoise16EvaluateFunctionEPd__ZN14vtkPerlinNoise16EvaluateGradientEPdS0___ZN14vtkPerlinNoise3NewEv__ZN14vtkPixelExtent10CellToNodeERKS___ZN14vtkPixelExtent10NodeToCellERKS___ZN14vtkPixelExtent4GrowERKS_S1_i__ZN14vtkPixelExtent4GrowERKS_i__ZN14vtkPixelExtent5ShiftEPiS0___ZN14vtkPixelExtent5ShiftEPii__ZN14vtkPixelExtent6ShrinkERKS_S1_i__ZN14vtkPixelExtent6ShrinkERKS_i__ZN14vtkPixelExtent7GrowLowERKS_ii__ZN14vtkPixelExtent8GrowHighERKS_ii__ZN14vtkUniformGrid10BlankPointEiii__ZN14vtkUniformGrid10BlankPointEx__ZN14vtkUniformGrid10InitializeEv__ZN14vtkUniformGrid11GetCellTypeEx__ZN14vtkUniformGrid11UnBlankCellEiii__ZN14vtkUniformGrid11UnBlankCellEx__ZN14vtkUniformGrid12UnBlankPointEiii__ZN14vtkUniformGrid12UnBlankPointEx__ZN14vtkUniformGrid13CopyStructureEP10vtkDataSet__ZN14vtkUniformGrid13IsCellVisibleEx__ZN14vtkUniformGrid14FindAndGetCellEPdP7vtkCellxdRiS0_S0___ZN14vtkUniformGrid14IsPointVisibleEx__ZN14vtkUniformGrid16HasAnyBlankCellsEv__ZN14vtkUniformGrid16NewImageDataCopyEv__ZN14vtkUniformGrid17HasAnyBlankPointsEv__ZN14vtkUniformGrid18GetGridDescriptionEv__ZN14vtkUniformGrid3NewEv__ZN14vtkUniformGrid7GetCellEiii__ZN14vtkUniformGrid7GetCellEx__ZN14vtkUniformGrid7GetCellExP14vtkGenericCell__ZN14vtkUniformGrid7GetDataEP14vtkInformation__ZN14vtkUniformGrid7GetDataEP20vtkInformationVectori__ZN14vtkUniformGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN14vtkUniformGrid8FindCellEPdP7vtkCellxdRiS0_S0___ZN14vtkUniformGrid9BlankCellEiii__ZN14vtkUniformGrid9BlankCellEx__ZN15vtkAMRUtilities10BlankCellsEP17vtkOverlappingAMR__ZN15vtkAMRUtilities16StripGhostLayersEP17vtkOverlappingAMRS1___ZN15vtkAMRUtilities33HasPartiallyOverlappingGhostCellsEP17vtkOverlappingAMR__ZN15vtkCellIterator16GetCellDimensionEv__ZN15vtkCellIterator7GetCellEP14vtkGenericCell__ZN15vtkImplicitHalo16EvaluateFunctionEPd__ZN15vtkImplicitHalo16EvaluateGradientEPdS0___ZN15vtkImplicitHalo3NewEv__ZN15vtkPointLocator10InitializeEv__ZN15vtkPointLocator11InsertPointExPKd__ZN15vtkPointLocator12BuildLocatorEv__ZN15vtkPointLocator15InsertNextPointEPKd__ZN15vtkPointLocator15IsInsertedPointEPKd__ZN15vtkPointLocator16FindClosestPointEPKd__ZN15vtkPointLocator17GetPointsInBucketEPKdPi__ZN15vtkPointLocator17InsertUniquePointEPKdRx__ZN15vtkPointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN15vtkPointLocator18InitPointInsertionEP9vtkPointsPKd__ZN15vtkPointLocator18InitPointInsertionEP9vtkPointsPKdx__ZN15vtkPointLocator19FreeSearchStructureEv__ZN15vtkPointLocator21FindDistributedPointsEiPKdP9vtkIdListi__ZN15vtkPointLocator21FindDistributedPointsEidddP9vtkIdListi__ZN15vtkPointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN15vtkPointLocator22GenerateRepresentationEiP11vtkPolyData__ZN15vtkPointLocator24FindClosestInsertedPointEPKd__ZN15vtkPointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN15vtkPointLocator28FindClosestPointWithinRadiusEdPKddRd__ZN15vtkPointLocator3NewEv__ZN15vtkSuperquadric15SetPhiRoundnessEd__ZN15vtkSuperquadric16EvaluateFunctionEPd__ZN15vtkSuperquadric16EvaluateGradientEPdS0___ZN15vtkSuperquadric17SetThetaRoundnessEd__ZN15vtkSuperquadric3NewEv__ZN15vtkTreeIterator14SetStartVertexEx__ZN15vtkTreeIterator4NextEv__ZN15vtkTreeIterator7HasNextEv__ZN15vtkTreeIterator7RestartEv__ZN15vtkTreeIterator7SetTreeEP7vtkTree__ZN16vtkDirectedGraph16IsStructureValidEP8vtkGraph__ZN16vtkDirectedGraph3NewEv__ZN16vtkDirectedGraph7GetDataEP14vtkInformation__ZN16vtkDirectedGraph7GetDataEP20vtkInformationVectori__ZN16vtkHyperTreeGrid10InitializeEv__ZN16vtkHyperTreeGrid11GetCellTypeEx__ZN16vtkHyperTreeGrid11ORIENTATIONEv__ZN16vtkHyperTreeGrid11SetGridSizeEPj__ZN16vtkHyperTreeGrid11SetGridSizeEjjj__ZN16vtkHyperTreeGrid11ShallowCopyEP13vtkDataObject__ZN16vtkHyperTreeGrid12GetChildMaskEj__ZN16vtkHyperTreeGrid12SetDimensionEj__ZN16vtkHyperTreeGrid13CopyStructureEP10vtkDataSet__ZN16vtkHyperTreeGrid13GenerateTreesEv__ZN16vtkHyperTreeGrid13GetCellPointsExP9vtkIdList__ZN16vtkHyperTreeGrid13GetCellPointsExRxRPx__ZN16vtkHyperTreeGrid13GetPointCellsExP9vtkIdList__ZN16vtkHyperTreeGrid13NewGridCursorExb__ZN16vtkHyperTreeGrid13SetGridExtentEPi__ZN16vtkHyperTreeGrid13SetGridExtentEiiiiii__ZN16vtkHyperTreeGrid13SubdivideLeafEP18vtkHyperTreeCursorx__ZN16vtkHyperTreeGrid14GetMaxCellSizeEv__ZN16vtkHyperTreeGrid14SetOrientationEj__ZN16vtkHyperTreeGrid15HasMaterialMaskEv__ZN16vtkHyperTreeGrid15SetBranchFactorEj__ZN16vtkHyperTreeGrid15SetMaterialMaskEP11vtkBitArray__ZN16vtkHyperTreeGrid15SetXCoordinatesEP12vtkDataArray__ZN16vtkHyperTreeGrid15SetYCoordinatesEP12vtkDataArray__ZN16vtkHyperTreeGrid15SetZCoordinatesEP12vtkDataArray__ZN16vtkHyperTreeGrid16GetCellNeighborsExP9vtkIdListS1___ZN16vtkHyperTreeGrid16GetNumberOfCellsEv__ZN16vtkHyperTreeGrid16GetNumberOfTreesEv__ZN16vtkHyperTreeGrid17GetDataObjectTypeEv__ZN16vtkHyperTreeGrid17GetNumberOfLeavesEv__ZN16vtkHyperTreeGrid17GetNumberOfLevelsEv__ZN16vtkHyperTreeGrid17GetNumberOfLevelsEx__ZN16vtkHyperTreeGrid17GetNumberOfPointsEv__ZN16vtkHyperTreeGrid18NewGeometricCursorExb__ZN16vtkHyperTreeGrid19GetActualMemorySizeEv__ZN16vtkHyperTreeGrid19GetNumberOfVerticesEv__ZN16vtkHyperTreeGrid19GetPureMaterialMaskEv__ZN16vtkHyperTreeGrid19NewMooreSuperCursorExb__ZN16vtkHyperTreeGrid20SetMaterialMaskIndexEP14vtkIdTypeArray__ZN16vtkHyperTreeGrid24GetShiftedLevelZeroIndexExiii__ZN16vtkHyperTreeGrid24NewVonNeumannSuperCursorExb__ZN16vtkHyperTreeGrid32GetIndexFromLevelZeroCoordinatesERxjjj__ZN16vtkHyperTreeGrid32GetLevelZeroCoordinatesFromIndexExRjS0_S0___ZN16vtkHyperTreeGrid37RecursivelyInitializePureMaterialMaskEP22vtkHyperTreeGridCursor__ZN16vtkHyperTreeGrid3NewEv__ZN16vtkHyperTreeGrid5SIZESEv__ZN16vtkHyperTreeGrid6LEVELSEv__ZN16vtkHyperTreeGrid7GetCellEx__ZN16vtkHyperTreeGrid7GetCellExP14vtkGenericCell__ZN16vtkHyperTreeGrid7GetDataEP14vtkInformation__ZN16vtkHyperTreeGrid7GetDataEP20vtkInformationVectori__ZN16vtkHyperTreeGrid7GetTreeEx__ZN16vtkHyperTreeGrid7SetTreeExP12vtkHyperTree__ZN16vtkHyperTreeGrid8DeepCopyEP13vtkDataObject__ZN16vtkHyperTreeGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN16vtkHyperTreeGrid8FindCellEPdP7vtkCellxdRiS0_S0___ZN16vtkHyperTreeGrid8GetPointEx__ZN16vtkHyperTreeGrid8GetPointExPd__ZN16vtkHyperTreeGrid9DIMENSIONEv__ZN16vtkHyperTreeGrid9FindPointEPd__ZN16vtkHyperTreeGrid9NewCursorExb__ZN16vtkLagrangeCurve10InitializeEv__ZN16vtkLagrangeCurve11DerivativesEiPdS0_iS0___ZN16vtkLagrangeCurve11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkLagrangeCurve12CellBoundaryEiPdP9vtkIdList__ZN16vtkLagrangeCurve16EvaluateLocationERiPdS1_S1___ZN16vtkLagrangeCurve16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkLagrangeCurve17InterpolateDerivsEPdS0___ZN16vtkLagrangeCurve17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkLagrangeCurve17PointIndexFromIJKEiii__ZN16vtkLagrangeCurve19GetParametricCoordsEv__ZN16vtkLagrangeCurve20InterpolateFunctionsEPdS0___ZN16vtkLagrangeCurve21GetParametricDistanceEPd__ZN16vtkLagrangeCurve24SubCellCoordinatesFromIdER11vtkVector3ii__ZN16vtkLagrangeCurve24SubCellCoordinatesFromIdERii__ZN16vtkLagrangeCurve27TransformApproxToCellParamsEiPd__ZN16vtkLagrangeCurve3NewEv__ZN16vtkLagrangeCurve4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkLagrangeCurve7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkLagrangeCurve8GetOrderEv__ZN16vtkLagrangeTetra10InitializeEv__ZN16vtkLagrangeTetra11DerivativesEiPdS0_iS0___ZN16vtkLagrangeTetra11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkLagrangeTetra12CellBoundaryEiPdP9vtkIdList__ZN16vtkLagrangeTetra12ComputeOrderEv__ZN16vtkLagrangeTetra16BarycentricIndexExPxx__ZN16vtkLagrangeTetra16EvaluateLocationERiPdS1_S1___ZN16vtkLagrangeTetra16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkLagrangeTetra17InterpolateDerivsEPdS0___ZN16vtkLagrangeTetra17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkLagrangeTetra18ToBarycentricIndexExPx__ZN16vtkLagrangeTetra19GetParametricCenterEPd__ZN16vtkLagrangeTetra19GetParametricCoordsEv__ZN16vtkLagrangeTetra20InterpolateFunctionsEPdS0___ZN16vtkLagrangeTetra21GetParametricDistanceEPd__ZN16vtkLagrangeTetra3NewEv__ZN16vtkLagrangeTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkLagrangeTetra5IndexEPKxx__ZN16vtkLagrangeTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkLagrangeTetra7GetEdgeEi__ZN16vtkLagrangeTetra7GetFaceEi__ZN16vtkLagrangeTetra7ToIndexEPKx__ZN16vtkLagrangeWedge10InitializeEv__ZN16vtkLagrangeWedge11DerivativesEiPdS0_iS0___ZN16vtkLagrangeWedge11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkLagrangeWedge12CellBoundaryEiPdP9vtkIdList__ZN16vtkLagrangeWedge16EvaluateLocationERiPdS1_S1___ZN16vtkLagrangeWedge16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkLagrangeWedge17InterpolateDerivsEPdS0___ZN16vtkLagrangeWedge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkLagrangeWedge17PointIndexFromIJKEiii__ZN16vtkLagrangeWedge17PointIndexFromIJKEiiiPKi__ZN16vtkLagrangeWedge19GetParametricCoordsEv__ZN16vtkLagrangeWedge20InterpolateFunctionsEPdS0___ZN16vtkLagrangeWedge21GetParametricDistanceEPd__ZN16vtkLagrangeWedge24SubCellCoordinatesFromIdER11vtkVector3ii__ZN16vtkLagrangeWedge24SubCellCoordinatesFromIdERiS0_S0_i__ZN16vtkLagrangeWedge25TransformFaceToCellParamsEiPd__ZN16vtkLagrangeWedge27TransformApproxToCellParamsEiPd__ZN16vtkLagrangeWedge30GetNumberOfApproximatingWedgesEPKi__ZN16vtkLagrangeWedge3NewEv__ZN16vtkLagrangeWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkLagrangeWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkLagrangeWedge7GetEdgeEi__ZN16vtkLagrangeWedge7GetFaceEi__ZN16vtkLagrangeWedge8GetOrderEv__ZN16vtkPixelTransfer4BlitERK14vtkPixelExtentS2_S2_S2_iiPviiS3___ZN16vtkQuadraticEdge11DerivativesEiPdS0_iS0___ZN16vtkQuadraticEdge11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkQuadraticEdge12CellBoundaryEiPdP9vtkIdList__ZN16vtkQuadraticEdge16EvaluateLocationERiPdS1_S1___ZN16vtkQuadraticEdge16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkQuadraticEdge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkQuadraticEdge19GetParametricCoordsEv__ZN16vtkQuadraticEdge19InterpolationDerivsEPdS0___ZN16vtkQuadraticEdge22InterpolationFunctionsEPdS0___ZN16vtkQuadraticEdge3NewEv__ZN16vtkQuadraticEdge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkQuadraticEdge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkQuadraticQuad11DerivativesEiPdS0_iS0___ZN16vtkQuadraticQuad11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkQuadraticQuad12CellBoundaryEiPdP9vtkIdList__ZN16vtkQuadraticQuad16EvaluateLocationERiPdS1_S1___ZN16vtkQuadraticQuad16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkQuadraticQuad17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkQuadraticQuad19GetParametricCoordsEv__ZN16vtkQuadraticQuad19InterpolationDerivsEPdS0___ZN16vtkQuadraticQuad22InterpolationFunctionsEPdS0___ZN16vtkQuadraticQuad3NewEv__ZN16vtkQuadraticQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkQuadraticQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkQuadraticQuad7GetEdgeEi__ZN16vtkSelectionNode10FIELD_TYPEEv__ZN16vtkSelectionNode10InitializeEv__ZN16vtkSelectionNode10PROCESS_IDEv__ZN16vtkSelectionNode11PIXEL_COUNTEv__ZN16vtkSelectionNode11ShallowCopyEPS___ZN16vtkSelectionNode12CONTENT_TYPEEv__ZN16vtkSelectionNode12GetFieldTypeEv__ZN16vtkSelectionNode12SetFieldTypeEi__ZN16vtkSelectionNode14GetContentTypeEv__ZN16vtkSelectionNode14SetContentTypeEi__ZN16vtkSelectionNode15COMPOSITE_INDEXEv__ZN16vtkSelectionNode15EqualPropertiesEPS_b__ZN16vtkSelectionNode16COMPONENT_NUMBEREv__ZN16vtkSelectionNode16CONTAINING_CELLSEv__ZN16vtkSelectionNode16GetSelectionListEv__ZN16vtkSelectionNode16INDEXED_VERTICESEv__ZN16vtkSelectionNode16SetSelectionDataEP20vtkDataSetAttributes__ZN16vtkSelectionNode16SetSelectionListEP16vtkAbstractArray__ZN16vtkSelectionNode18HIERARCHICAL_INDEXEv__ZN16vtkSelectionNode18HIERARCHICAL_LEVELEv__ZN16vtkSelectionNode18UnionSelectionListEPS___ZN16vtkSelectionNode21SubtractSelectionListEPS___ZN16vtkSelectionNode36ConvertAttributeTypeToSelectionFieldEi__ZN16vtkSelectionNode36ConvertSelectionFieldToAttributeTypeEi__ZN16vtkSelectionNode3NewEv__ZN16vtkSelectionNode4PROPEv__ZN16vtkSelectionNode6SOURCEEv__ZN16vtkSelectionNode7EPSILONEv__ZN16vtkSelectionNode7INVERSEEv__ZN16vtkSelectionNode7PROP_IDEv__ZN16vtkSelectionNode8DeepCopyEPS___ZN16vtkSelectionNode8GetMTimeEv__ZN16vtkSelectionNode9SOURCE_IDEv__ZN16vtkSortFieldData3NewEv__ZN16vtkSortFieldData4SortEP12vtkFieldDataPKciii__ZN16vtkTriangleStrip11DerivativesEiPdS0_iS0___ZN16vtkTriangleStrip11TriangulateEiP9vtkIdListP9vtkPoints__ZN16vtkTriangleStrip12CellBoundaryEiPdP9vtkIdList__ZN16vtkTriangleStrip14DecomposeStripEiPxP12vtkCellArray__ZN16vtkTriangleStrip16EvaluateLocationERiPdS1_S1___ZN16vtkTriangleStrip16EvaluatePositionEPdS0_RiS0_RdS0___ZN16vtkTriangleStrip17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN16vtkTriangleStrip19GetParametricCenterEPd__ZN16vtkTriangleStrip3NewEv__ZN16vtkTriangleStrip4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN16vtkTriangleStrip7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN16vtkTriangleStrip7GetEdgeEi__ZN17vtkAMRInformation10GetParentsEjjRj__ZN17vtkAMRInformation10GetSpacingEjPd__ZN17vtkAMRInformation10HasSpacingEj__ZN17vtkAMRInformation10InitializeEiPKi__ZN17vtkAMRInformation10SetSpacingEjPKd__ZN17vtkAMRInformation11GetChildrenEjjRj__ZN17vtkAMRInformation16ComputeIndexPairEjRjS0___ZN17vtkAMRInformation18HasRefinementRatioEv__ZN17vtkAMRInformation18SetGridDescriptionEi__ZN17vtkAMRInformation18SetRefinementRatioEji__ZN17vtkAMRInformation20PrintParentChildInfoEjj__ZN17vtkAMRInformation22GetAMRBlockSourceIndexEi__ZN17vtkAMRInformation22HasChildrenInformationEv__ZN17vtkAMRInformation22SetAMRBlockSourceIndexEii__ZN17vtkAMRInformation23GenerateRefinementRatioEv__ZN17vtkAMRInformation30GenerateParentChildInformationEv__ZN17vtkAMRInformation3NewEv__ZN17vtkAMRInformation5AuditEv__ZN17vtkAMRInformation8DeepCopyEPS___ZN17vtkAMRInformation8FindCellEPdjjRi__ZN17vtkAMRInformation8FindGridEPdRjS1___ZN17vtkAMRInformation8FindGridEPdiRj__ZN17vtkAMRInformation9GetBoundsEjjPd__ZN17vtkAMRInformation9GetBoundsEv__ZN17vtkAMRInformation9GetOriginEPd__ZN17vtkAMRInformation9GetOriginEjjPd__ZN17vtkAMRInformation9GetOriginEv__ZN17vtkAMRInformation9SetAMRBoxEjjRK9vtkAMRBox__ZN17vtkAMRInformation9SetOriginEPKd__ZN17vtkAnimationScene11SetTimeModeEi__ZN17vtkAnimationScene13RemoveAllCuesEv__ZN17vtkAnimationScene15GetNumberOfCuesEv__ZN17vtkAnimationScene16SetAnimationTimeEd__ZN17vtkAnimationScene3NewEv__ZN17vtkAnimationScene4PlayEv__ZN17vtkAnimationScene4StopEv__ZN17vtkAnimationScene6AddCueEP15vtkAnimationCue__ZN17vtkAnimationScene9RemoveCueEP15vtkAnimationCue__ZN17vtkConvexPointSet10InitializeEv__ZN17vtkConvexPointSet11DerivativesEiPdS0_iS0___ZN17vtkConvexPointSet11TriangulateEiP9vtkIdListP9vtkPoints__ZN17vtkConvexPointSet12CellBoundaryEiPdP9vtkIdList__ZN17vtkConvexPointSet16EvaluateLocationERiPdS1_S1___ZN17vtkConvexPointSet16EvaluatePositionEPdS0_RiS0_RdS0___ZN17vtkConvexPointSet16GetNumberOfFacesEv__ZN17vtkConvexPointSet17InterpolateDerivsEPdS0___ZN17vtkConvexPointSet17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN17vtkConvexPointSet19GetParametricCoordsEv__ZN17vtkConvexPointSet20InterpolateFunctionsEPdS0___ZN17vtkConvexPointSet3NewEv__ZN17vtkConvexPointSet4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN17vtkConvexPointSet7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN17vtkConvexPointSet7GetFaceEi__ZN17vtkDataObjectTree10GetDataSetEP24vtkCompositeDataIterator__ZN17vtkDataObjectTree10InitializeEv__ZN17vtkDataObjectTree10SetDataSetEP24vtkCompositeDataIteratorP13vtkDataObject__ZN17vtkDataObjectTree11GetMetaDataEP24vtkCompositeDataIterator__ZN17vtkDataObjectTree11HasMetaDataEP24vtkCompositeDataIterator__ZN17vtkDataObjectTree11NewIteratorEv__ZN17vtkDataObjectTree11ShallowCopyEP13vtkDataObject__ZN17vtkDataObjectTree13CopyStructureEP19vtkCompositeDataSet__ZN17vtkDataObjectTree14SetDataSetFromEP25vtkDataObjectTreeIteratorP13vtkDataObject__ZN17vtkDataObjectTree15NewTreeIteratorEv__ZN17vtkDataObjectTree16GetChildMetaDataEj__ZN17vtkDataObjectTree16HasChildMetaDataEj__ZN17vtkDataObjectTree17GetNumberOfPointsEv__ZN17vtkDataObjectTree19GetActualMemorySizeEv__ZN17vtkDataObjectTree7GetDataEP14vtkInformation__ZN17vtkDataObjectTree7GetDataEP20vtkInformationVectori__ZN17vtkDataObjectTree8DeepCopyEP13vtkDataObject__ZN17vtkGenericDataSet12GetCellTypesEP12vtkCellTypes__ZN17vtkGenericDataSet14SetTessellatorEP25vtkGenericCellTessellator__ZN17vtkGenericDataSet17GetDataObjectTypeEv__ZN17vtkGenericDataSet19GetActualMemorySizeEv__ZN17vtkGenericDataSet7GetDataEP14vtkInformation__ZN17vtkGenericDataSet7GetDataEP20vtkInformationVectori__ZN17vtkGenericDataSet8GetMTimeEv__ZN17vtkGenericDataSet9GetBoundsEPd__ZN17vtkGenericDataSet9GetBoundsEv__ZN17vtkGenericDataSet9GetCenterEPd__ZN17vtkGenericDataSet9GetCenterEv__ZN17vtkGenericDataSet9GetLengthEv__ZN17vtkGraphInternals3NewEv__ZN17vtkHexagonalPrism11DerivativesEiPdS0_iS0___ZN17vtkHexagonalPrism11TriangulateEiP9vtkIdListP9vtkPoints__ZN17vtkHexagonalPrism12CellBoundaryEiPdP9vtkIdList__ZN17vtkHexagonalPrism12GetEdgeArrayEi__ZN17vtkHexagonalPrism12GetFaceArrayEi__ZN17vtkHexagonalPrism13GetEdgePointsEiRPi__ZN17vtkHexagonalPrism13GetFacePointsEiRPi__ZN17vtkHexagonalPrism16EvaluateLocationERiPdS1_S1___ZN17vtkHexagonalPrism16EvaluatePositionEPdS0_RiS0_RdS0___ZN17vtkHexagonalPrism17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN17vtkHexagonalPrism19GetParametricCoordsEv__ZN17vtkHexagonalPrism19InterpolationDerivsEPdS0___ZN17vtkHexagonalPrism22InterpolationFunctionsEPdS0___ZN17vtkHexagonalPrism3NewEv__ZN17vtkHexagonalPrism7GetEdgeEi__ZN17vtkHexagonalPrism7GetFaceEi__ZN17vtkImplicitVolume16EvaluateFunctionEPd__ZN17vtkImplicitVolume16EvaluateGradientEPdS0___ZN17vtkImplicitVolume3NewEv__ZN17vtkImplicitVolume8GetMTimeEv__ZN17vtkImplicitVolume9SetVolumeEP12vtkImageData__ZN17vtkInEdgeIterator10InitializeEP8vtkGraphx__ZN17vtkInEdgeIterator13NextGraphEdgeEv__ZN17vtkInEdgeIterator3NewEv__ZN17vtkOStreamWrapperlsEPKc__ZN17vtkOStreamWrapperlsEPv__ZN17vtkOStreamWrapperlsEi__ZN17vtkOverlappingAMR10GetParentsEjjRj__ZN17vtkOverlappingAMR10GetSpacingEjPd__ZN17vtkOverlappingAMR10SetSpacingEjPKd__ZN17vtkOverlappingAMR11GetChildrenEjjRj__ZN17vtkOverlappingAMR11NewIteratorEv__ZN17vtkOverlappingAMR18GetRefinementRatioEP24vtkCompositeDataIterator__ZN17vtkOverlappingAMR18GetRefinementRatioEj__ZN17vtkOverlappingAMR18SetRefinementRatioEji__ZN17vtkOverlappingAMR20PrintParentChildInfoEjj__ZN17vtkOverlappingAMR22GetAMRBlockSourceIndexEjj__ZN17vtkOverlappingAMR22HasChildrenInformationEv__ZN17vtkOverlappingAMR22SetAMRBlockSourceIndexEjji__ZN17vtkOverlappingAMR24NUMBER_OF_BLANKED_POINTSEv__ZN17vtkOverlappingAMR30GenerateParentChildInformationEv__ZN17vtkOverlappingAMR3NewEv__ZN17vtkOverlappingAMR5AuditEv__ZN17vtkOverlappingAMR8FindGridEPdRjS1___ZN17vtkOverlappingAMR9GetAMRBoxEjj__ZN17vtkOverlappingAMR9GetBoundsEjjPd__ZN17vtkOverlappingAMR9GetOriginEjjPd__ZN17vtkOverlappingAMR9GetOriginEv__ZN17vtkOverlappingAMR9SetAMRBoxEjjRK9vtkAMRBox__ZN17vtkOverlappingAMR9SetOriginEPKd__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZN17vtkQuadraticTetra11DerivativesEiPdS0_iS0___ZN17vtkQuadraticTetra11TriangulateEiP9vtkIdListP9vtkPoints__ZN17vtkQuadraticTetra12CellBoundaryEiPdP9vtkIdList__ZN17vtkQuadraticTetra12GetEdgeArrayEi__ZN17vtkQuadraticTetra12GetFaceArrayEi__ZN17vtkQuadraticTetra16EvaluateLocationERiPdS1_S1___ZN17vtkQuadraticTetra16EvaluatePositionEPdS0_RiS0_RdS0___ZN17vtkQuadraticTetra17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN17vtkQuadraticTetra19GetParametricCenterEPd__ZN17vtkQuadraticTetra19GetParametricCoordsEv__ZN17vtkQuadraticTetra19InterpolationDerivsEPdS0___ZN17vtkQuadraticTetra21GetParametricDistanceEPd__ZN17vtkQuadraticTetra22InterpolationFunctionsEPdS0___ZN17vtkQuadraticTetra3NewEv__ZN17vtkQuadraticTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN17vtkQuadraticTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN17vtkQuadraticTetra7GetEdgeEi__ZN17vtkQuadraticTetra7GetFaceEi__ZN17vtkQuadraticWedge11DerivativesEiPdS0_iS0___ZN17vtkQuadraticWedge11TriangulateEiP9vtkIdListP9vtkPoints__ZN17vtkQuadraticWedge12CellBoundaryEiPdP9vtkIdList__ZN17vtkQuadraticWedge12GetEdgeArrayEi__ZN17vtkQuadraticWedge12GetFaceArrayEi__ZN17vtkQuadraticWedge16EvaluateLocationERiPdS1_S1___ZN17vtkQuadraticWedge16EvaluatePositionEPdS0_RiS0_RdS0___ZN17vtkQuadraticWedge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN17vtkQuadraticWedge19GetParametricCoordsEv__ZN17vtkQuadraticWedge19InterpolationDerivsEPdS0___ZN17vtkQuadraticWedge22InterpolationFunctionsEPdS0___ZN17vtkQuadraticWedge3NewEv__ZN17vtkQuadraticWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN17vtkQuadraticWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN17vtkQuadraticWedge7GetEdgeEi__ZN17vtkQuadraticWedge7GetFaceEi__ZN17vtkStructuredData13GetCellPointsExP9vtkIdListiPi__ZN17vtkStructuredData13GetPointCellsExP9vtkIdListPi__ZN17vtkStructuredData13SetDimensionsEPiS0___ZN17vtkStructuredData16GetCellNeighborsExP9vtkIdListS1_Pi__ZN17vtkStructuredData16GetCellNeighborsExP9vtkIdListS1_PiS2___ZN17vtkStructuredData16GetDataDimensionEPi__ZN17vtkStructuredData16GetDataDimensionEi__ZN17vtkStructuredData18GetDataDescriptionEPi__ZN17vtkStructuredData28GetDataDescriptionFromExtentEPi__ZN17vtkStructuredData9SetExtentEPiS0___ZN17vtkStructuredGrid10BlankPointEx__ZN17vtkStructuredGrid10InitializeEv__ZN17vtkStructuredGrid11GetCellDimsEPi__ZN17vtkStructuredGrid11GetCellTypeEx__ZN17vtkStructuredGrid11ShallowCopyEP13vtkDataObject__ZN17vtkStructuredGrid11UnBlankCellEx__ZN17vtkStructuredGrid12UnBlankPointEx__ZN17vtkStructuredGrid13CopyStructureEP10vtkDataSet__ZN17vtkStructuredGrid13GetCellBoundsExPd__ZN17vtkStructuredGrid13GetCellPointsExP9vtkIdList__ZN17vtkStructuredGrid13GetDimensionsEPi__ZN17vtkStructuredGrid13GetDimensionsEv__ZN17vtkStructuredGrid13IsCellVisibleEx__ZN17vtkStructuredGrid13SetDimensionsEPi__ZN17vtkStructuredGrid13SetDimensionsEiii__ZN17vtkStructuredGrid14IsPointVisibleEx__ZN17vtkStructuredGrid16GetCellNeighborsExP9vtkIdListS1___ZN17vtkStructuredGrid16GetCellNeighborsExP9vtkIdListS1_Pi__ZN17vtkStructuredGrid16HasAnyBlankCellsEv__ZN17vtkStructuredGrid17HasAnyBlankPointsEv__ZN17vtkStructuredGrid19GetActualMemorySizeEv__ZN17vtkStructuredGrid3NewEv__ZN17vtkStructuredGrid4CropEPKi__ZN17vtkStructuredGrid7GetCellEiii__ZN17vtkStructuredGrid7GetCellEx__ZN17vtkStructuredGrid7GetCellExP14vtkGenericCell__ZN17vtkStructuredGrid7GetDataEP14vtkInformation__ZN17vtkStructuredGrid7GetDataEP20vtkInformationVectori__ZN17vtkStructuredGrid8DeepCopyEP13vtkDataObject__ZN17vtkStructuredGrid8GetPointEiiiPdb__ZN17vtkStructuredGrid9BlankCellEx__ZN17vtkStructuredGrid9SetExtentEPi__ZN17vtkStructuredGrid9SetExtentEiiiiii__ZN17vtkUniformGridAMR10GetDataSetEP24vtkCompositeDataIterator__ZN17vtkUniformGridAMR10GetDataSetEjj__ZN17vtkUniformGridAMR10InitializeEiPKi__ZN17vtkUniformGridAMR10InitializeEv__ZN17vtkUniformGridAMR10SetAMRInfoEP17vtkAMRInformation__ZN17vtkUniformGridAMR10SetDataSetEP24vtkCompositeDataIteratorP13vtkDataObject__ZN17vtkUniformGridAMR10SetDataSetEjjP14vtkUniformGrid__ZN17vtkUniformGridAMR11NewIteratorEv__ZN17vtkUniformGridAMR11ShallowCopyEP13vtkDataObject__ZN17vtkUniformGridAMR13CopyStructureEP19vtkCompositeDataSet__ZN17vtkUniformGridAMR16GetLevelAndIndexEjRjS0___ZN17vtkUniformGridAMR17GetCompositeIndexEjj__ZN17vtkUniformGridAMR17GetNumberOfLevelsEv__ZN17vtkUniformGridAMR18GetGridDescriptionEv__ZN17vtkUniformGridAMR18SetGridDescriptionEi__ZN17vtkUniformGridAMR19GetNumberOfDataSetsEj__ZN17vtkUniformGridAMR22GetTotalNumberOfBlocksEv__ZN17vtkUniformGridAMR3NewEv__ZN17vtkUniformGridAMR6GetMaxEPd__ZN17vtkUniformGridAMR6GetMinEPd__ZN17vtkUniformGridAMR7GetDataEP14vtkInformation__ZN17vtkUniformGridAMR7GetDataEP20vtkInformationVectori__ZN17vtkUniformGridAMR8DeepCopyEP13vtkDataObject__ZN17vtkUniformGridAMR9GetBoundsEPd__ZN17vtkUniformGridAMR9GetBoundsEv__ZN17vtkXMLDataElement12GetAttributeEPKc__ZN17vtkXMLDataElement12SetAttributeEPKcS1___ZN17vtkXMLDataElement13LookupElementEPKc__ZN17vtkXMLDataElement15RemoveAttributeEPKc__ZN17vtkXMLDataElement15SetIntAttributeEPKci__ZN17vtkXMLDataElement16AddNestedElementEPS___ZN17vtkXMLDataElement16GetAttributeNameEi__ZN17vtkXMLDataElement16GetNestedElementEi__ZN17vtkXMLDataElement16SetCharacterDataEPKci__ZN17vtkXMLDataElement17FindNestedElementEPKc__ZN17vtkXMLDataElement17GetAttributeValueEi__ZN17vtkXMLDataElement17SetFloatAttributeEPKcf__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRd__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRi__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRl__ZN17vtkXMLDataElement18GetScalarAttributeEPKcRx__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPd__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPi__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPl__ZN17vtkXMLDataElement18GetVectorAttributeEPKciPx__ZN17vtkXMLDataElement18SetDoubleAttributeEPKcd__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKd__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKi__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKm__ZN17vtkXMLDataElement18SetVectorAttributeEPKciPKx__ZN17vtkXMLDataElement19RemoveAllAttributesEv__ZN17vtkXMLDataElement19RemoveNestedElementEPS___ZN17vtkXMLDataElement20GetWordTypeAttributeEPKcRi__ZN17vtkXMLDataElement21LookupElementWithNameEPKc__ZN17vtkXMLDataElement23RemoveAllNestedElementsEv__ZN17vtkXMLDataElement24SetUnsignedLongAttributeEPKcm__ZN17vtkXMLDataElement25FindNestedElementWithNameEPKc__ZN17vtkXMLDataElement25GetNumberOfNestedElementsEv__ZN17vtkXMLDataElement30FindNestedElementWithNameAndIdEPKcS1___ZN17vtkXMLDataElement37FindNestedElementWithNameAndAttributeEPKcS1_S1___ZN17vtkXMLDataElement3NewEv__ZN17vtkXMLDataElement7GetRootEv__ZN17vtkXMLDataElement7SetNameEPKc__ZN17vtkXMLDataElement8DeepCopyEPS___ZN17vtkXMLDataElement8PrintXMLEPKc__ZN17vtkXMLDataElement9GetParentEv__ZN17vtkXMLDataElement9IsEqualToEPS___ZN17vtkXMLDataElement9SetParentEPS___ZN18vtkBiQuadraticQuad11DerivativesEiPdS0_iS0___ZN18vtkBiQuadraticQuad11TriangulateEiP9vtkIdListP9vtkPoints__ZN18vtkBiQuadraticQuad12CellBoundaryEiPdP9vtkIdList__ZN18vtkBiQuadraticQuad16EvaluateLocationERiPdS1_S1___ZN18vtkBiQuadraticQuad16EvaluatePositionEPdS0_RiS0_RdS0___ZN18vtkBiQuadraticQuad17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN18vtkBiQuadraticQuad19GetParametricCoordsEv__ZN18vtkBiQuadraticQuad26InterpolationDerivsPrivateEPdS0___ZN18vtkBiQuadraticQuad29InterpolationFunctionsPrivateEPdS0___ZN18vtkBiQuadraticQuad3NewEv__ZN18vtkBiQuadraticQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN18vtkBiQuadraticQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN18vtkBiQuadraticQuad7GetEdgeEi__ZN18vtkDataObjectTypes13NewDataObjectEPKc__ZN18vtkDataObjectTypes13NewDataObjectEi__ZN18vtkDataObjectTypes22GetClassNameFromTypeIdEi__ZN18vtkDataObjectTypes22GetTypeIdFromClassNameEPKc__ZN18vtkDataObjectTypes3NewEv__ZN18vtkImplicitBoolean11AddFunctionEP19vtkImplicitFunction__ZN18vtkImplicitBoolean14RemoveFunctionEP19vtkImplicitFunction__ZN18vtkImplicitBoolean16EvaluateFunctionEPd__ZN18vtkImplicitBoolean16EvaluateGradientEPdS0___ZN18vtkImplicitBoolean3NewEv__ZN18vtkImplicitBoolean8GetMTimeEv__ZN18vtkImplicitDataSet10SetDataSetEP10vtkDataSet__ZN18vtkImplicitDataSet16EvaluateFunctionEPd__ZN18vtkImplicitDataSet16EvaluateGradientEPdS0___ZN18vtkImplicitDataSet3NewEv__ZN18vtkImplicitDataSet8GetMTimeEv__ZN18vtkOutEdgeIterator10InitializeEP8vtkGraphx__ZN18vtkOutEdgeIterator13NextGraphEdgeEv__ZN18vtkOutEdgeIterator3NewEv__ZN18vtkPentagonalPrism11DerivativesEiPdS0_iS0___ZN18vtkPentagonalPrism11TriangulateEiP9vtkIdListP9vtkPoints__ZN18vtkPentagonalPrism12CellBoundaryEiPdP9vtkIdList__ZN18vtkPentagonalPrism12GetEdgeArrayEi__ZN18vtkPentagonalPrism12GetFaceArrayEi__ZN18vtkPentagonalPrism13GetEdgePointsEiRPi__ZN18vtkPentagonalPrism13GetFacePointsEiRPi__ZN18vtkPentagonalPrism16EvaluateLocationERiPdS1_S1___ZN18vtkPentagonalPrism16EvaluatePositionEPdS0_RiS0_RdS0___ZN18vtkPentagonalPrism17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN18vtkPentagonalPrism19GetParametricCoordsEv__ZN18vtkPentagonalPrism19InterpolationDerivsEPdS0___ZN18vtkPentagonalPrism22InterpolationFunctionsEPdS0___ZN18vtkPentagonalPrism3NewEv__ZN18vtkPentagonalPrism7GetEdgeEi__ZN18vtkPentagonalPrism7GetFaceEi__ZN18vtkPlaneCollection3NewEv__ZN18vtkRectilinearGrid10InitializeEv__ZN18vtkRectilinearGrid11GetCellTypeEx__ZN18vtkRectilinearGrid11ShallowCopyEP13vtkDataObject__ZN18vtkRectilinearGrid13ComputeBoundsEv__ZN18vtkRectilinearGrid13CopyStructureEP10vtkDataSet__ZN18vtkRectilinearGrid13GetCellBoundsExPd__ZN18vtkRectilinearGrid13SetDimensionsEPi__ZN18vtkRectilinearGrid13SetDimensionsEiii__ZN18vtkRectilinearGrid14FindAndGetCellEPdP7vtkCellxdRiS0_S0___ZN18vtkRectilinearGrid15SetXCoordinatesEP12vtkDataArray__ZN18vtkRectilinearGrid15SetYCoordinatesEP12vtkDataArray__ZN18vtkRectilinearGrid15SetZCoordinatesEP12vtkDataArray__ZN18vtkRectilinearGrid16GetCellNeighborsExP9vtkIdListS1___ZN18vtkRectilinearGrid19GetActualMemorySizeEv__ZN18vtkRectilinearGrid28ComputeStructuredCoordinatesEPdPiS0___ZN18vtkRectilinearGrid3NewEv__ZN18vtkRectilinearGrid4CropEPKi__ZN18vtkRectilinearGrid7GetCellEiii__ZN18vtkRectilinearGrid7GetCellEx__ZN18vtkRectilinearGrid7GetCellExP14vtkGenericCell__ZN18vtkRectilinearGrid7GetDataEP14vtkInformation__ZN18vtkRectilinearGrid7GetDataEP20vtkInformationVectori__ZN18vtkRectilinearGrid8DeepCopyEP13vtkDataObject__ZN18vtkRectilinearGrid8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0___ZN18vtkRectilinearGrid8FindCellEPdP7vtkCellxdRiS0_S0___ZN18vtkRectilinearGrid8GetPointEiiiPd__ZN18vtkRectilinearGrid8GetPointEx__ZN18vtkRectilinearGrid8GetPointExPd__ZN18vtkRectilinearGrid9FindPointEPd__ZN18vtkRectilinearGrid9GetPointsEP9vtkPoints__ZN18vtkRectilinearGrid9SetExtentEPi__ZN18vtkRectilinearGrid9SetExtentEiiiiii__ZN18vtkStaticCellLinks3NewEv__ZN18vtkTreeBFSIterator3NewEv__ZN18vtkTreeDFSIterator3NewEv__ZN18vtkTreeDFSIterator7SetModeEi__ZN18vtkUndirectedGraph11GetInDegreeEx__ZN18vtkUndirectedGraph16IsStructureValidEP8vtkGraph__ZN18vtkUndirectedGraph3NewEv__ZN18vtkUndirectedGraph7GetDataEP14vtkInformation__ZN18vtkUndirectedGraph7GetDataEP20vtkInformationVectori__ZN18vtkUndirectedGraph9GetInEdgeExx__ZN19vtkAMRDataInternals10GetDataSetEj__ZN19vtkAMRDataInternals10InitializeEv__ZN19vtkAMRDataInternals11ShallowCopyEP9vtkObject__ZN19vtkAMRDataInternals3NewEv__ZN19vtkAMRDataInternals6InsertEjP14vtkUniformGrid__ZN19vtkAnnotationLayers10InitializeEv__ZN19vtkAnnotationLayers11ShallowCopyEP13vtkDataObject__ZN19vtkAnnotationLayers13AddAnnotationEP13vtkAnnotation__ZN19vtkAnnotationLayers13GetAnnotationEj__ZN19vtkAnnotationLayers16RemoveAnnotationEP13vtkAnnotation__ZN19vtkAnnotationLayers19GetCurrentSelectionEv__ZN19vtkAnnotationLayers19SetCurrentSelectionEP12vtkSelection__ZN19vtkAnnotationLayers20SetCurrentAnnotationEP13vtkAnnotation__ZN19vtkAnnotationLayers22GetNumberOfAnnotationsEv__ZN19vtkAnnotationLayers3NewEv__ZN19vtkAnnotationLayers7GetDataEP14vtkInformation__ZN19vtkAnnotationLayers7GetDataEP20vtkInformationVectori__ZN19vtkAnnotationLayers8DeepCopyEP13vtkDataObject__ZN19vtkAnnotationLayers8GetMTimeEv__ZN19vtkBSPIntersections13IntersectsBoxEPiiPd__ZN19vtkBSPIntersections13IntersectsBoxEPiidddddd__ZN19vtkBSPIntersections13IntersectsBoxEiPd__ZN19vtkBSPIntersections13IntersectsBoxEidddddd__ZN19vtkBSPIntersections14IntersectsCellEPiiP7vtkCelli__ZN19vtkBSPIntersections14IntersectsCellEiP7vtkCelli__ZN19vtkBSPIntersections15GetRegionBoundsEiPd__ZN19vtkBSPIntersections17IntersectsSphere2EPiidddd__ZN19vtkBSPIntersections17IntersectsSphere2Eidddd__ZN19vtkBSPIntersections18GetNumberOfRegionsEv__ZN19vtkBSPIntersections19GetRegionDataBoundsEiPd__ZN19vtkBSPIntersections37ComputeIntersectionsUsingDataBoundsOnEv__ZN19vtkBSPIntersections38ComputeIntersectionsUsingDataBoundsOffEv__ZN19vtkBSPIntersections38SetComputeIntersectionsUsingDataBoundsEi__ZN19vtkBSPIntersections3NewEv__ZN19vtkBSPIntersections7SetCutsEP10vtkBSPCuts__ZN19vtkBSPIntersections9GetBoundsEPd__ZN19vtkCompositeDataSet10InitializeEv__ZN19vtkCompositeDataSet11ShallowCopyEP13vtkDataObject__ZN19vtkCompositeDataSet17GetNumberOfPointsEv__ZN19vtkCompositeDataSet19GetActualMemorySizeEv__ZN19vtkCompositeDataSet30CURRENT_PROCESS_CAN_LOAD_BLOCKEv__ZN19vtkCompositeDataSet4NAMEEv__ZN19vtkCompositeDataSet7GetDataEP14vtkInformation__ZN19vtkCompositeDataSet7GetDataEP20vtkInformationVectori__ZN19vtkCompositeDataSet8DeepCopyEP13vtkDataObject__ZN19vtkEdgeListIterator13NextGraphEdgeEv__ZN19vtkEdgeListIterator3NewEv__ZN19vtkEdgeListIterator4NextEv__ZN19vtkEdgeListIterator7HasNextEv__ZN19vtkEdgeListIterator8SetGraphEP8vtkGraph__ZN19vtkGenericEdgeTable10CheckPointEx__ZN19vtkGenericEdgeTable10CheckPointExPdS0___ZN19vtkGenericEdgeTable10InitializeEx__ZN19vtkGenericEdgeTable10InsertEdgeExxxi__ZN19vtkGenericEdgeTable10InsertEdgeExxxiRx__ZN19vtkGenericEdgeTable10LoadFactorEv__ZN19vtkGenericEdgeTable10RemoveEdgeExx__ZN19vtkGenericEdgeTable11InsertPointExPd__ZN19vtkGenericEdgeTable11RemovePointEx__ZN19vtkGenericEdgeTable20InsertPointAndScalarExPdS0___ZN19vtkGenericEdgeTable21GetNumberOfComponentsEv__ZN19vtkGenericEdgeTable21SetNumberOfComponentsEi__ZN19vtkGenericEdgeTable23CheckEdgeReferenceCountExx__ZN19vtkGenericEdgeTable27IncrementEdgeReferenceCountExxx__ZN19vtkGenericEdgeTable28IncrementPointReferenceCountEx__ZN19vtkGenericEdgeTable3NewEv__ZN19vtkGenericEdgeTable9CheckEdgeExxRx__ZN19vtkGenericEdgeTable9DumpTableEv__ZN19vtkImplicitFunction12SetTransformEP20vtkAbstractTransform__ZN19vtkImplicitFunction12SetTransformEPKd__ZN19vtkImplicitFunction13FunctionValueEP12vtkDataArrayS1___ZN19vtkImplicitFunction13FunctionValueEPKd__ZN19vtkImplicitFunction16EvaluateFunctionEP12vtkDataArrayS1___ZN19vtkImplicitFunction16FunctionGradientEPKdPd__ZN19vtkImplicitFunction8GetMTimeEv__ZN19vtkLagrangeTriangle10InitializeEv__ZN19vtkLagrangeTriangle11DerivativesEiPdS0_iS0___ZN19vtkLagrangeTriangle11TriangulateEiP9vtkIdListP9vtkPoints__ZN19vtkLagrangeTriangle12CellBoundaryEiPdP9vtkIdList__ZN19vtkLagrangeTriangle12ComputeOrderEv__ZN19vtkLagrangeTriangle16BarycentricIndexExPxx__ZN19vtkLagrangeTriangle16EvaluateLocationERiPdS1_S1___ZN19vtkLagrangeTriangle16EvaluatePositionEPdS0_RiS0_RdS0___ZN19vtkLagrangeTriangle17InterpolateDerivsEPdS0___ZN19vtkLagrangeTriangle17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN19vtkLagrangeTriangle18ToBarycentricIndexExPx__ZN19vtkLagrangeTriangle19GetParametricCenterEPd__ZN19vtkLagrangeTriangle19GetParametricCoordsEv__ZN19vtkLagrangeTriangle20InterpolateFunctionsEPdS0___ZN19vtkLagrangeTriangle21GetParametricDistanceEPd__ZN19vtkLagrangeTriangle23ComputeParametricCoordsEPdx__ZN19vtkLagrangeTriangle3NewEv__ZN19vtkLagrangeTriangle3etaExxd__ZN19vtkLagrangeTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN19vtkLagrangeTriangle5IndexEPKxx__ZN19vtkLagrangeTriangle5d_etaExxd__ZN19vtkLagrangeTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN19vtkLagrangeTriangle7GetEdgeEi__ZN19vtkLagrangeTriangle7ToIndexEPKx__ZN19vtkQuadraticPolygon11DerivativesEiPdS0_iS0___ZN19vtkQuadraticPolygon11TriangulateEP9vtkIdList__ZN19vtkQuadraticPolygon11TriangulateEiP9vtkIdListP9vtkPoints__ZN19vtkQuadraticPolygon12CellBoundaryEiPdP9vtkIdList__ZN19vtkQuadraticPolygon14PointInPolygonEPdiS0_S0_S0___ZN19vtkQuadraticPolygon15ComputeCentroidEP14vtkIdTypeArrayP9vtkPointsPd__ZN19vtkQuadraticPolygon16EvaluateLocationERiPdS1_S1___ZN19vtkQuadraticPolygon16EvaluatePositionEPdS0_RiS0_RdS0___ZN19vtkQuadraticPolygon17DistanceToPolygonEPdiS0_S0_S0___ZN19vtkQuadraticPolygon17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN19vtkQuadraticPolygon19ParameterizePolygonEPdS0_RdS0_S1_S0___ZN19vtkQuadraticPolygon20InterpolateFunctionsEPdS0___ZN19vtkQuadraticPolygon22IntersectConvex2DCellsEP7vtkCellS1_dPdS2___ZN19vtkQuadraticPolygon24NonDegenerateTriangulateEP9vtkIdList__ZN19vtkQuadraticPolygon27IntersectPolygonWithPolygonEiPdS0_iS0_S0_dS0___ZN19vtkQuadraticPolygon3NewEv__ZN19vtkQuadraticPolygon4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN19vtkQuadraticPolygon7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN19vtkQuadraticPolygon7GetEdgeEi__ZN19vtkQuadraticPyramid11DerivativesEiPdS0_iS0___ZN19vtkQuadraticPyramid11TriangulateEiP9vtkIdListP9vtkPoints__ZN19vtkQuadraticPyramid12CellBoundaryEiPdP9vtkIdList__ZN19vtkQuadraticPyramid12GetEdgeArrayEi__ZN19vtkQuadraticPyramid12GetFaceArrayEi__ZN19vtkQuadraticPyramid16EvaluateLocationERiPdS1_S1___ZN19vtkQuadraticPyramid16EvaluatePositionEPdS0_RiS0_RdS0___ZN19vtkQuadraticPyramid17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN19vtkQuadraticPyramid19GetParametricCoordsEv__ZN19vtkQuadraticPyramid19InterpolationDerivsEPdS0___ZN19vtkQuadraticPyramid22InterpolationFunctionsEPdS0___ZN19vtkQuadraticPyramid3NewEv__ZN19vtkQuadraticPyramid4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN19vtkQuadraticPyramid7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN19vtkQuadraticPyramid7GetEdgeEi__ZN19vtkQuadraticPyramid7GetFaceEi__ZN19vtkStructuredExtent3NewEv__ZN19vtkStructuredPoints3NewEv__ZN19vtkUnstructuredGrid10BuildLinksEv__ZN19vtkUnstructuredGrid10InitializeEv__ZN19vtkUnstructuredGrid11GetCellTypeEx__ZN19vtkUnstructuredGrid11ReplaceCellExiPx__ZN19vtkUnstructuredGrid11ShallowCopyEP13vtkDataObject__ZN19vtkUnstructuredGrid12GetMeshMTimeEv__ZN19vtkUnstructuredGrid13CopyStructureEP10vtkDataSet__ZN19vtkUnstructuredGrid13GetCellBoundsExPd__ZN19vtkUnstructuredGrid13GetCellPointsExP9vtkIdList__ZN19vtkUnstructuredGrid13GetCellPointsExRxRPx__ZN19vtkUnstructuredGrid13GetFaceStreamExP9vtkIdList__ZN19vtkUnstructuredGrid13GetFaceStreamExRxRPx__ZN19vtkUnstructuredGrid13GetGhostLevelEv__ZN19vtkUnstructuredGrid13GetPointCellsExP9vtkIdList__ZN19vtkUnstructuredGrid13IsHomogeneousEv__ZN19vtkUnstructuredGrid14GetMaxCellSizeEv__ZN19vtkUnstructuredGrid14InsertNextCellEiP9vtkIdList__ZN19vtkUnstructuredGrid14InsertNextCellEixPx__ZN19vtkUnstructuredGrid14InsertNextCellEixPxxS0___ZN19vtkUnstructuredGrid14ResizeCellListExi__ZN19vtkUnstructuredGrid15NewCellIteratorEv__ZN19vtkUnstructuredGrid16GetCellNeighborsExP9vtkIdListS1___ZN19vtkUnstructuredGrid16GetNumberOfCellsEv__ZN19vtkUnstructuredGrid16RemoveGhostCellsEv__ZN19vtkUnstructuredGrid17GetNumberOfPiecesEv__ZN19vtkUnstructuredGrid18AddReferenceToCellExx__ZN19vtkUnstructuredGrid19GetActualMemorySizeEv__ZN19vtkUnstructuredGrid19GetIdsOfCellsOfTypeEiP14vtkIdTypeArray__ZN19vtkUnstructuredGrid20InsertNextLinkedCellEiiPx__ZN19vtkUnstructuredGrid21RemoveReferenceToCellExx__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellEP12vtkCellArrayRxS2_S1_P14vtkIdTypeArray__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellEPxRxS1_P12vtkCellArrayP14vtkIdTypeArray__ZN19vtkUnstructuredGrid24DecomposeAPolyhedronCellExPxRxP12vtkCellArrayP14vtkIdTypeArray__ZN19vtkUnstructuredGrid25ConvertFaceStreamPointIdsEP9vtkIdListPx__ZN19vtkUnstructuredGrid25ConvertFaceStreamPointIdsExPxS0___ZN19vtkUnstructuredGrid29InitializeFacesRepresentationEx__ZN19vtkUnstructuredGrid3NewEv__ZN19vtkUnstructuredGrid5ResetEv__ZN19vtkUnstructuredGrid7GetCellEx__ZN19vtkUnstructuredGrid7GetCellExP14vtkGenericCell__ZN19vtkUnstructuredGrid7GetDataEP14vtkInformation__ZN19vtkUnstructuredGrid7GetDataEP20vtkInformationVectori__ZN19vtkUnstructuredGrid7SqueezeEv__ZN19vtkUnstructuredGrid8AllocateExi__ZN19vtkUnstructuredGrid8DeepCopyEP13vtkDataObject__ZN19vtkUnstructuredGrid8GetFacesEx__ZN19vtkUnstructuredGrid8GetPieceEv__ZN19vtkUnstructuredGrid8SetCellsEP20vtkUnsignedCharArrayP14vtkIdTypeArrayP12vtkCellArray__ZN19vtkUnstructuredGrid8SetCellsEP20vtkUnsignedCharArrayP14vtkIdTypeArrayP12vtkCellArrayS3_S3___ZN19vtkUnstructuredGrid8SetCellsEPiP12vtkCellArray__ZN19vtkUnstructuredGrid8SetCellsEiP12vtkCellArray__ZN20vtkAbstractCellLinks9GetIdTypeExxP12vtkCellArray__ZN20vtkDataSetAttributes10CopyAllOffEi__ZN20vtkDataSetAttributes10CopyTuplesEP16vtkAbstractArrayS1_P9vtkIdListS3___ZN20vtkDataSetAttributes10CopyTuplesEP16vtkAbstractArrayS1_xxx__ZN20vtkDataSetAttributes10GetNormalsEPKc__ZN20vtkDataSetAttributes10GetNormalsEv__ZN20vtkDataSetAttributes10GetScalarsEPKc__ZN20vtkDataSetAttributes10GetScalarsEv__ZN20vtkDataSetAttributes10GetTCoordsEPKc__ZN20vtkDataSetAttributes10GetTCoordsEv__ZN20vtkDataSetAttributes10GetTensorsEPKc__ZN20vtkDataSetAttributes10GetTensorsEv__ZN20vtkDataSetAttributes10GetVectorsEPKc__ZN20vtkDataSetAttributes10GetVectorsEv__ZN20vtkDataSetAttributes10InitializeEv__ZN20vtkDataSetAttributes10SetNormalsEP12vtkDataArray__ZN20vtkDataSetAttributes10SetScalarsEP12vtkDataArray__ZN20vtkDataSetAttributes10SetTCoordsEP12vtkDataArray__ZN20vtkDataSetAttributes10SetTensorsEP12vtkDataArray__ZN20vtkDataSetAttributes10SetVectorsEP12vtkDataArray__ZN20vtkDataSetAttributes11RemoveArrayEi__ZN20vtkDataSetAttributes11ShallowCopyEP12vtkFieldData__ZN20vtkDataSetAttributes12CopyAllocateEPS_xxi__ZN20vtkDataSetAttributes12GetAttributeEi__ZN20vtkDataSetAttributes12GetGlobalIdsEPKc__ZN20vtkDataSetAttributes12GetGlobalIdsEv__ZN20vtkDataSetAttributes12SetAttributeEP16vtkAbstractArrayi__ZN20vtkDataSetAttributes12SetGlobalIdsEP12vtkDataArray__ZN20vtkDataSetAttributes12SetupForCopyEPS___ZN20vtkDataSetAttributes14GetCopyNormalsEi__ZN20vtkDataSetAttributes14GetCopyScalarsEi__ZN20vtkDataSetAttributes14GetCopyTCoordsEi__ZN20vtkDataSetAttributes14GetCopyTensorsEi__ZN20vtkDataSetAttributes14GetCopyVectorsEi__ZN20vtkDataSetAttributes14GetPedigreeIdsEPKc__ZN20vtkDataSetAttributes14GetPedigreeIdsEv__ZN20vtkDataSetAttributes14SetCopyNormalsEii__ZN20vtkDataSetAttributes14SetCopyScalarsEii__ZN20vtkDataSetAttributes14SetCopyTCoordsEii__ZN20vtkDataSetAttributes14SetCopyTensorsEii__ZN20vtkDataSetAttributes14SetCopyVectorsEii__ZN20vtkDataSetAttributes14SetPedigreeIdsEP16vtkAbstractArray__ZN20vtkDataSetAttributes15InterpolateEdgeEPS_xxxd__ZN20vtkDataSetAttributes15InterpolateTimeEPS_S0_xd__ZN20vtkDataSetAttributes16GetCopyAttributeEii__ZN20vtkDataSetAttributes16GetCopyGlobalIdsEi__ZN20vtkDataSetAttributes16InterpolatePointEPS_xP9vtkIdListPd__ZN20vtkDataSetAttributes16SetActiveNormalsEPKc__ZN20vtkDataSetAttributes16SetActiveScalarsEPKc__ZN20vtkDataSetAttributes16SetActiveTCoordsEPKc__ZN20vtkDataSetAttributes16SetActiveTensorsEPKc__ZN20vtkDataSetAttributes16SetActiveVectorsEPKc__ZN20vtkDataSetAttributes16SetCopyAttributeEiii__ZN20vtkDataSetAttributes16SetCopyGlobalIdsEii__ZN20vtkDataSetAttributes18CopyStructuredDataEPS_PKiS2_b__ZN20vtkDataSetAttributes18GetCopyPedigreeIdsEi__ZN20vtkDataSetAttributes18IsArrayAnAttributeEi__ZN20vtkDataSetAttributes18SetActiveAttributeEPKci__ZN20vtkDataSetAttributes18SetActiveAttributeEii__ZN20vtkDataSetAttributes18SetActiveGlobalIdsEPKc__ZN20vtkDataSetAttributes18SetCopyPedigreeIdsEii__ZN20vtkDataSetAttributes19GetAttributeIndicesEPi__ZN20vtkDataSetAttributes19InterpolateAllocateEPS_xxi__ZN20vtkDataSetAttributes20GetAbstractAttributeEi__ZN20vtkDataSetAttributes20SetActivePedigreeIdsEPKc__ZN20vtkDataSetAttributes24GetAttributeTypeAsStringEi__ZN20vtkDataSetAttributes28GetLongAttributeTypeAsStringEi__ZN20vtkDataSetAttributes3NewEv__ZN20vtkDataSetAttributes8CopyDataEPS_P9vtkIdListS2___ZN20vtkDataSetAttributes8CopyDataEPS_xx__ZN20vtkDataSetAttributes8CopyDataEPS_xxx__ZN20vtkDataSetAttributes8DeepCopyEP12vtkFieldData__ZN20vtkDataSetAttributes8PassDataEP12vtkFieldData__ZN20vtkDataSetAttributes9CopyAllOnEi__ZN20vtkDataSetAttributes9CopyTupleEP16vtkAbstractArrayS1_xx__ZN20vtkDataSetCollection3NewEv__ZN20vtkDebugLeaksManagerC1Ev__ZN20vtkDebugLeaksManagerD1Ev__ZN20vtkMultiBlockDataSet11RemoveBlockEj__ZN20vtkMultiBlockDataSet17GetNumberOfBlocksEv__ZN20vtkMultiBlockDataSet17SetNumberOfBlocksEj__ZN20vtkMultiBlockDataSet3NewEv__ZN20vtkMultiBlockDataSet7GetDataEP14vtkInformation__ZN20vtkMultiBlockDataSet7GetDataEP20vtkInformationVectori__ZN20vtkMultiBlockDataSet8GetBlockEj__ZN20vtkMultiBlockDataSet8SetBlockEjP13vtkDataObject__ZN20vtkMultiPieceDataSet17GetNumberOfPiecesEv__ZN20vtkMultiPieceDataSet17SetNumberOfPiecesEj__ZN20vtkMultiPieceDataSet20GetPieceAsDataObjectEj__ZN20vtkMultiPieceDataSet3NewEv__ZN20vtkMultiPieceDataSet7GetDataEP14vtkInformation__ZN20vtkMultiPieceDataSet7GetDataEP20vtkInformationVectori__ZN20vtkMultiPieceDataSet8GetPieceEj__ZN20vtkMultiPieceDataSet8SetPieceEjP13vtkDataObject__ZN20vtkNonOverlappingAMR3NewEv__ZN20vtkOStrStreamWrapper3strEv__ZN20vtkOStrStreamWrapper5rdbufEv__ZN20vtkOStrStreamWrapper6freezeEi__ZN20vtkOStrStreamWrapperC1Ev__ZN20vtkOStrStreamWrapperD1Ev__ZN20vtkPiecewiseFunction10AddSegmentEdddd__ZN20vtkPiecewiseFunction10InitializeEv__ZN20vtkPiecewiseFunction11AdjustRangeEPd__ZN20vtkPiecewiseFunction11RemovePointEd__ZN20vtkPiecewiseFunction11ShallowCopyEP13vtkDataObject__ZN20vtkPiecewiseFunction12GetNodeValueEiPd__ZN20vtkPiecewiseFunction12SetNodeValueEiPd__ZN20vtkPiecewiseFunction14GetDataPointerEv__ZN20vtkPiecewiseFunction15RemoveAllPointsEv__ZN20vtkPiecewiseFunction19FillFromDataPointerEiPd__ZN20vtkPiecewiseFunction20GetFirstNonZeroValueEv__ZN20vtkPiecewiseFunction22BuildFunctionFromTableEddiPdi__ZN20vtkPiecewiseFunction26EstimateMinNumberOfSamplesERKdS1___ZN20vtkPiecewiseFunction3NewEv__ZN20vtkPiecewiseFunction7GetDataEP14vtkInformation__ZN20vtkPiecewiseFunction7GetDataEP20vtkInformationVectori__ZN20vtkPiecewiseFunction7GetSizeEv__ZN20vtkPiecewiseFunction7GetTypeEv__ZN20vtkPiecewiseFunction8AddPointEdd__ZN20vtkPiecewiseFunction8AddPointEdddd__ZN20vtkPiecewiseFunction8DeepCopyEP13vtkDataObject__ZN20vtkPiecewiseFunction8GetTableEddiPdi__ZN20vtkPiecewiseFunction8GetValueEd__ZN20vtkQuadraticTriangle11DerivativesEiPdS0_iS0___ZN20vtkQuadraticTriangle11TriangulateEiP9vtkIdListP9vtkPoints__ZN20vtkQuadraticTriangle12CellBoundaryEiPdP9vtkIdList__ZN20vtkQuadraticTriangle16EvaluateLocationERiPdS1_S1___ZN20vtkQuadraticTriangle16EvaluatePositionEPdS0_RiS0_RdS0___ZN20vtkQuadraticTriangle17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN20vtkQuadraticTriangle19GetParametricCoordsEv__ZN20vtkQuadraticTriangle19InterpolationDerivsEPdS0___ZN20vtkQuadraticTriangle21GetParametricDistanceEPd__ZN20vtkQuadraticTriangle22InterpolationFunctionsEPdS0___ZN20vtkQuadraticTriangle3NewEv__ZN20vtkQuadraticTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN20vtkQuadraticTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN20vtkQuadraticTriangle7GetEdgeEi__ZN20vtkSmoothErrorMetric17GetAngleToleranceEv__ZN20vtkSmoothErrorMetric17SetAngleToleranceEd__ZN20vtkSmoothErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_d__ZN20vtkSmoothErrorMetric3NewEv__ZN20vtkSmoothErrorMetric8GetErrorEPdS0_S0_d__ZN20vtkStaticCellLocator12BuildLocatorEv__ZN20vtkStaticCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCell__ZN20vtkStaticCellLocator19FreeSearchStructureEv__ZN20vtkStaticCellLocator21FindCellsWithinBoundsEPdP9vtkIdList__ZN20vtkStaticCellLocator22GenerateRepresentationEiP11vtkPolyData__ZN20vtkStaticCellLocator3NewEv__ZN20vtkStaticCellLocator8FindCellEPddP14vtkGenericCellS0_S0___ZN21vtkGenericAdaptorCell10GetLength2Ev__ZN21vtkGenericAdaptorCell10TessellateEP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatorP9vtkPointsP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataSB_P11vtkCellDataP20vtkUnsignedCharArray__ZN21vtkGenericAdaptorCell15TriangulateFaceEP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatoriP9vtkPointsP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataSB_P11vtkCellData__ZN21vtkGenericAdaptorCell16IsGeometryLinearEv__ZN21vtkGenericAdaptorCell17IsAttributeLinearEP19vtkGenericAttribute__ZN21vtkGenericAdaptorCell24GetHighestOrderAttributeEP29vtkGenericAttributeCollection__ZN21vtkGenericAdaptorCell4ClipEdP19vtkImplicitFunctionP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatoriP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataP11vtkCellDataSB_SB_SD___ZN21vtkGenericAdaptorCell7ContourEP16vtkContourValuesP19vtkImplicitFunctionP29vtkGenericAttributeCollectionP25vtkGenericCellTessellatorP26vtkIncrementalPointLocatorP12vtkCellArraySB_SB_P12vtkPointDataP11vtkCellDataSD_SD_SF___ZN21vtkGenericAdaptorCell9GetBoundsEv__ZN21vtkKdTreePointLocator12BuildLocatorEv__ZN21vtkKdTreePointLocator16FindClosestPointEPKd__ZN21vtkKdTreePointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN21vtkKdTreePointLocator19FreeSearchStructureEv__ZN21vtkKdTreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN21vtkKdTreePointLocator22GenerateRepresentationEiP11vtkPolyData__ZN21vtkKdTreePointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN21vtkKdTreePointLocator3NewEv__ZN21vtkLagrangeHexahedron10InitializeEv__ZN21vtkLagrangeHexahedron11DerivativesEiPdS0_iS0___ZN21vtkLagrangeHexahedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN21vtkLagrangeHexahedron12CellBoundaryEiPdP9vtkIdList__ZN21vtkLagrangeHexahedron16EvaluateLocationERiPdS1_S1___ZN21vtkLagrangeHexahedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN21vtkLagrangeHexahedron17InterpolateDerivsEPdS0___ZN21vtkLagrangeHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN21vtkLagrangeHexahedron17PointIndexFromIJKEiii__ZN21vtkLagrangeHexahedron17PointIndexFromIJKEiiiPKi__ZN21vtkLagrangeHexahedron19GetParametricCoordsEv__ZN21vtkLagrangeHexahedron20InterpolateFunctionsEPdS0___ZN21vtkLagrangeHexahedron21GetParametricDistanceEPd__ZN21vtkLagrangeHexahedron24SubCellCoordinatesFromIdER11vtkVector3ii__ZN21vtkLagrangeHexahedron24SubCellCoordinatesFromIdERiS0_S0_i__ZN21vtkLagrangeHexahedron25TransformFaceToCellParamsEiPd__ZN21vtkLagrangeHexahedron27TransformApproxToCellParamsEiPd__ZN21vtkLagrangeHexahedron3NewEv__ZN21vtkLagrangeHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN21vtkLagrangeHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN21vtkLagrangeHexahedron7GetEdgeEi__ZN21vtkLagrangeHexahedron7GetFaceEi__ZN21vtkLagrangeHexahedron8GetOrderEv__ZN21vtkOctreePointLocator12BuildLocatorEv__ZN21vtkOctreePointLocator15GetRegionBoundsEiPd__ZN21vtkOctreePointLocator16FindClosestPointEPKd__ZN21vtkOctreePointLocator16FindClosestPointEdddRd__ZN21vtkOctreePointLocator16FindPointsInAreaEPdP14vtkIdTypeArrayb__ZN21vtkOctreePointLocator17GetPointsInRegionEi__ZN21vtkOctreePointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN21vtkOctreePointLocator19FreeSearchStructureEv__ZN21vtkOctreePointLocator19GetRegionDataBoundsEiPd__ZN21vtkOctreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN21vtkOctreePointLocator22GenerateRepresentationEiP11vtkPolyData__ZN21vtkOctreePointLocator24FindClosestPointInRegionEiPdRd__ZN21vtkOctreePointLocator24FindClosestPointInRegionEidddRd__ZN21vtkOctreePointLocator24GetRegionContainingPointEddd__ZN21vtkOctreePointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN21vtkOctreePointLocator3NewEv__ZN21vtkOctreePointLocator9GetBoundsEPd__ZN21vtkOctreePointLocator9GetBoundsEv__ZN21vtkPlanesIntersection13Convert3DCellEP7vtkCell__ZN21vtkPlanesIntersection16IntersectsRegionEP9vtkPoints__ZN21vtkPlanesIntersection17GetRegionVerticesEPdi__ZN21vtkPlanesIntersection17SetRegionVerticesEP9vtkPoints__ZN21vtkPlanesIntersection17SetRegionVerticesEPdi__ZN21vtkPlanesIntersection21PolygonIntersectsBBoxEPdP9vtkPoints__ZN21vtkPlanesIntersection25GetNumberOfRegionVerticesEv__ZN21vtkPlanesIntersection3NewEv__ZN21vtkPolyDataCollection3NewEv__ZN21vtkStaticPointLocator10InitializeEv__ZN21vtkStaticPointLocator12BuildLocatorEv__ZN21vtkStaticPointLocator12GetBucketIdsExP9vtkIdList__ZN21vtkStaticPointLocator16FindClosestPointEPKd__ZN21vtkStaticPointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN21vtkStaticPointLocator19FreeSearchStructureEv__ZN21vtkStaticPointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN21vtkStaticPointLocator22GenerateRepresentationEiP11vtkPolyData__ZN21vtkStaticPointLocator25GetNumberOfPointsInBucketEx__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKddRd__ZN21vtkStaticPointLocator3NewEv__ZN21vtkVertexListIterator3NewEv__ZN21vtkVertexListIterator8SetGraphEP8vtkGraph__ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_P14vtkGenericCellRxRiRd__ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_RxRiRd__ZN22vtkAbstractCellLocator16InsideCellBoundsEPdx__ZN22vtkAbstractCellLocator17IntersectWithLineEPKdS1_P9vtkPointsP9vtkIdList__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRx__ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCell__ZN22vtkAbstractCellLocator18FindCellsAlongLineEPdS0_dP9vtkIdList__ZN22vtkAbstractCellLocator21FindCellsWithinBoundsEPdP9vtkIdList__ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRd__ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdS4___ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_RxRiRd__ZN22vtkAbstractCellLocator8FindCellEPd__ZN22vtkAbstractCellLocator8FindCellEPddP14vtkGenericCellS0_S0___ZN22vtkBiQuadraticTriangle11DerivativesEiPdS0_iS0___ZN22vtkBiQuadraticTriangle11TriangulateEiP9vtkIdListP9vtkPoints__ZN22vtkBiQuadraticTriangle12CellBoundaryEiPdP9vtkIdList__ZN22vtkBiQuadraticTriangle16EvaluateLocationERiPdS1_S1___ZN22vtkBiQuadraticTriangle16EvaluatePositionEPdS0_RiS0_RdS0___ZN22vtkBiQuadraticTriangle17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN22vtkBiQuadraticTriangle19GetParametricCoordsEv__ZN22vtkBiQuadraticTriangle19InterpolationDerivsEPdS0___ZN22vtkBiQuadraticTriangle21GetParametricDistanceEPd__ZN22vtkBiQuadraticTriangle22InterpolationFunctionsEPdS0___ZN22vtkBiQuadraticTriangle3NewEv__ZN22vtkBiQuadraticTriangle4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN22vtkBiQuadraticTriangle7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN22vtkBiQuadraticTriangle7GetEdgeEi__ZN22vtkDataSetCellIterator19IsDoneWithTraversalEv__ZN22vtkDataSetCellIterator3NewEv__ZN22vtkDataSetCellIterator9GetCellIdEv__ZN22vtkHyperTreeGridCursor10InitializeEP16vtkHyperTreeGridx__ZN22vtkHyperTreeGridCursor11GetVertexIdEv__ZN22vtkHyperTreeGridCursor12GetDimensionEv__ZN22vtkHyperTreeGridCursor13GetChildIndexEv__ZN22vtkHyperTreeGridCursor18GetGlobalNodeIndexEv__ZN22vtkHyperTreeGridCursor19GetNumberOfChildrenEv__ZN22vtkHyperTreeGridCursor3NewEv__ZN22vtkHyperTreeGridCursor5CloneEv__ZN22vtkHyperTreeGridCursor6IsLeafEv__ZN22vtkHyperTreeGridCursor6IsRootEv__ZN22vtkHyperTreeGridCursor6ToRootEv__ZN22vtkHyperTreeGridCursor7SetGridEP16vtkHyperTreeGrid__ZN22vtkHyperTreeGridCursor7SetTreeEP12vtkHyperTree__ZN22vtkHyperTreeGridCursor7ToChildEi__ZN22vtkHyperTreeGridCursor8ToParentEv__ZN22vtkOrderedTriangulator10GetPointIdEx__ZN22vtkOrderedTriangulator11InsertPointExPdS0_i__ZN22vtkOrderedTriangulator11InsertPointExxPdS0_i__ZN22vtkOrderedTriangulator11InsertPointExxxPdS0_i__ZN22vtkOrderedTriangulator11TriangulateEv__ZN22vtkOrderedTriangulator12AddTrianglesEP12vtkCellArray__ZN22vtkOrderedTriangulator12AddTrianglesExP12vtkCellArray__ZN22vtkOrderedTriangulator12GetNextTetraEiP8vtkTetraP12vtkDataArrayP14vtkDoubleArray__ZN22vtkOrderedTriangulator15UpdatePointTypeExi__ZN22vtkOrderedTriangulator16GetPointLocationEx__ZN22vtkOrderedTriangulator16GetPointPositionEx__ZN22vtkOrderedTriangulator17InitTriangulationEPdi__ZN22vtkOrderedTriangulator17InitTriangulationEddddddi__ZN22vtkOrderedTriangulator18InitTetraTraversalEv__ZN22vtkOrderedTriangulator19TemplateTriangulateEiii__ZN22vtkOrderedTriangulator3NewEv__ZN22vtkOrderedTriangulator9AddTetrasEiP12vtkCellArray__ZN22vtkOrderedTriangulator9AddTetrasEiP19vtkUnstructuredGrid__ZN22vtkOrderedTriangulator9AddTetrasEiP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS5_P11vtkCellDataxS7___ZN22vtkOrderedTriangulator9AddTetrasEiP9vtkIdListP9vtkPoints__ZN22vtkOrderedTriangulator9GetTetrasEiP19vtkUnstructuredGrid__ZN22vtkPointsProjectedHull10InitializeEv__ZN22vtkPointsProjectedHull11GetCCWHullXEPdi__ZN22vtkPointsProjectedHull11GetCCWHullYEPdi__ZN22vtkPointsProjectedHull11GetCCWHullZEPdi__ZN22vtkPointsProjectedHull15GetSizeCCWHullXEv__ZN22vtkPointsProjectedHull15GetSizeCCWHullYEv__ZN22vtkPointsProjectedHull15GetSizeCCWHullZEv__ZN22vtkPointsProjectedHull22RectangleIntersectionXEP9vtkPoints__ZN22vtkPointsProjectedHull22RectangleIntersectionXEdddd__ZN22vtkPointsProjectedHull22RectangleIntersectionYEP9vtkPoints__ZN22vtkPointsProjectedHull22RectangleIntersectionYEdddd__ZN22vtkPointsProjectedHull22RectangleIntersectionZEP9vtkPoints__ZN22vtkPointsProjectedHull22RectangleIntersectionZEdddd__ZN22vtkPointsProjectedHull3NewEv__ZN22vtkPointsProjectedHull6UpdateEv__ZN22vtkQuadraticHexahedron11DerivativesEiPdS0_iS0___ZN22vtkQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN22vtkQuadraticHexahedron12CellBoundaryEiPdP9vtkIdList__ZN22vtkQuadraticHexahedron12GetEdgeArrayEi__ZN22vtkQuadraticHexahedron12GetFaceArrayEi__ZN22vtkQuadraticHexahedron16EvaluateLocationERiPdS1_S1___ZN22vtkQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN22vtkQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN22vtkQuadraticHexahedron19GetParametricCoordsEv__ZN22vtkQuadraticHexahedron19InterpolationDerivsEPdS0___ZN22vtkQuadraticHexahedron22InterpolationFunctionsEPdS0___ZN22vtkQuadraticHexahedron3NewEv__ZN22vtkQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN22vtkQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN22vtkQuadraticHexahedron7GetEdgeEi__ZN22vtkQuadraticHexahedron7GetFaceEi__ZN22vtkQuadraticLinearQuad11DerivativesEiPdS0_iS0___ZN22vtkQuadraticLinearQuad11TriangulateEiP9vtkIdListP9vtkPoints__ZN22vtkQuadraticLinearQuad12CellBoundaryEiPdP9vtkIdList__ZN22vtkQuadraticLinearQuad12GetEdgeArrayEi__ZN22vtkQuadraticLinearQuad16EvaluateLocationERiPdS1_S1___ZN22vtkQuadraticLinearQuad16EvaluatePositionEPdS0_RiS0_RdS0___ZN22vtkQuadraticLinearQuad17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN22vtkQuadraticLinearQuad19GetParametricCoordsEv__ZN22vtkQuadraticLinearQuad19InterpolationDerivsEPdS0___ZN22vtkQuadraticLinearQuad22InterpolationFunctionsEPdS0___ZN22vtkQuadraticLinearQuad3NewEv__ZN22vtkQuadraticLinearQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN22vtkQuadraticLinearQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN22vtkQuadraticLinearQuad7GetEdgeEi__ZN23vtkAOSDataArrayTemplateIxE10GetPointerEx__ZN23vtkAOSDataArrayTemplateIxE12WritePointerExx__ZN23vtkAbstractPointLocator16FindClosestPointEddd__ZN23vtkAbstractPointLocator18FindClosestNPointsEidddP9vtkIdList__ZN23vtkAbstractPointLocator22FindPointsWithinRadiusEddddP9vtkIdList__ZN23vtkAbstractPointLocator9GetBoundsEPd__ZN23vtkDataObjectCollection3NewEv__ZN23vtkDirectedAcyclicGraph3NewEv__ZN23vtkDirectedAcyclicGraph7GetDataEP14vtkInformation__ZN23vtkDirectedAcyclicGraph7GetDataEP20vtkInformationVectori__ZN23vtkGeometricErrorMetric11GetRelativeEv__ZN23vtkGeometricErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_d__ZN23vtkGeometricErrorMetric29SetAbsoluteGeometricToleranceEd__ZN23vtkGeometricErrorMetric29SetRelativeGeometricToleranceEdP17vtkGenericDataSet__ZN23vtkGeometricErrorMetric3NewEv__ZN23vtkGeometricErrorMetric8GetErrorEPdS0_S0_d__ZN23vtkMutableDirectedGraph10RemoveEdgeEx__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArray__ZN23vtkMutableDirectedGraph11LazyAddEdgeExxP15vtkVariantArray__ZN23vtkMutableDirectedGraph11RemoveEdgesEP14vtkIdTypeArray__ZN23vtkMutableDirectedGraph12AddGraphEdgeExx__ZN23vtkMutableDirectedGraph12RemoveVertexEx__ZN23vtkMutableDirectedGraph13LazyAddVertexEP15vtkVariantArray__ZN23vtkMutableDirectedGraph13LazyAddVertexERK10vtkVariant__ZN23vtkMutableDirectedGraph13LazyAddVertexEv__ZN23vtkMutableDirectedGraph14RemoveVerticesEP14vtkIdTypeArray__ZN23vtkMutableDirectedGraph19SetNumberOfVerticesEx__ZN23vtkMutableDirectedGraph3NewEv__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArray__ZN23vtkMutableDirectedGraph7AddEdgeExx__ZN23vtkMutableDirectedGraph7AddEdgeExxP15vtkVariantArray__ZN23vtkMutableDirectedGraph8AddChildExP15vtkVariantArray__ZN23vtkMutableDirectedGraph9AddVertexEP15vtkVariantArray__ZN23vtkMutableDirectedGraph9AddVertexERK10vtkVariant__ZN23vtkMutableDirectedGraph9AddVertexEv__ZN23vtkPointSetCellIterator19IsDoneWithTraversalEv__ZN23vtkPointSetCellIterator3NewEv__ZN23vtkPointSetCellIterator9GetCellIdEv__ZN23vtkQuadraticLinearWedge11DerivativesEiPdS0_iS0___ZN23vtkQuadraticLinearWedge11TriangulateEiP9vtkIdListP9vtkPoints__ZN23vtkQuadraticLinearWedge12CellBoundaryEiPdP9vtkIdList__ZN23vtkQuadraticLinearWedge12GetEdgeArrayEi__ZN23vtkQuadraticLinearWedge12GetFaceArrayEi__ZN23vtkQuadraticLinearWedge16EvaluateLocationERiPdS1_S1___ZN23vtkQuadraticLinearWedge16EvaluatePositionEPdS0_RiS0_RdS0___ZN23vtkQuadraticLinearWedge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN23vtkQuadraticLinearWedge19GetParametricCoordsEv__ZN23vtkQuadraticLinearWedge19InterpolationDerivsEPdS0___ZN23vtkQuadraticLinearWedge22InterpolationFunctionsEPdS0___ZN23vtkQuadraticLinearWedge3NewEv__ZN23vtkQuadraticLinearWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN23vtkQuadraticLinearWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN23vtkQuadraticLinearWedge7GetEdgeEi__ZN23vtkQuadraticLinearWedge7GetFaceEi__ZN23vtkUnstructuredGridBase7GetDataEP14vtkInformation__ZN23vtkUnstructuredGridBase7GetDataEP20vtkInformationVectori__ZN23vtkUnstructuredGridBase8DeepCopyEP13vtkDataObject__ZN24vtkAttributesErrorMetric21SetAttributeToleranceEd__ZN24vtkAttributesErrorMetric23RequiresEdgeSubdivisionEPdS0_S0_d__ZN24vtkAttributesErrorMetric29SetAbsoluteAttributeToleranceEd__ZN24vtkAttributesErrorMetric3NewEv__ZN24vtkAttributesErrorMetric8GetErrorEPdS0_S0_d__ZN24vtkCompositeDataIterator10SetDataSetEP19vtkCompositeDataSet__ZN24vtkCompositeDataIterator13InitTraversalEv__ZN24vtkCompositeDataIterator20InitReverseTraversalEv__ZN24vtkImplicitSelectionLoop16EvaluateFunctionEPd__ZN24vtkImplicitSelectionLoop16EvaluateGradientEPdS0___ZN24vtkImplicitSelectionLoop3NewEv__ZN24vtkImplicitSelectionLoop7SetLoopEP9vtkPoints__ZN24vtkImplicitSelectionLoop8GetMTimeEv__ZN24vtkIncrementalOctreeNode11InsertPointEP9vtkPointsPKdiPxi__ZN24vtkIncrementalOctreeNode16DeleteChildNodesEv__ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPS_i__ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPdPS_i__ZN24vtkIncrementalOctreeNode27GetDistance2ToInnerBoundaryEPKdPS___ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByDirectSetEPxP9vtkIdList__ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByInsertionEP9vtkIdList__ZN24vtkIncrementalOctreeNode3NewEv__ZN24vtkIncrementalOctreeNode9SetBoundsEdddddd__ZN24vtkLagrangeInterpolation13WedgeEvaluateEPKiPKdPdiS4___ZN24vtkLagrangeInterpolation19WedgeShapeFunctionsEPKiPKdPd__ZN24vtkLagrangeInterpolation21Tensor1ShapeFunctionsEPKiPKdPd__ZN24vtkLagrangeInterpolation21Tensor2ShapeFunctionsEPKiPKdPd__ZN24vtkLagrangeInterpolation21Tensor3ShapeFunctionsEPKiPKdPd__ZN24vtkLagrangeInterpolation21WedgeShapeDerivativesEPKiPKdPd__ZN24vtkLagrangeInterpolation22EvaluateShapeFunctionsEidPd__ZN24vtkLagrangeInterpolation23Tensor1ShapeDerivativesEPKiPKdPd__ZN24vtkLagrangeInterpolation23Tensor2ShapeDerivativesEPKiPKdPd__ZN24vtkLagrangeInterpolation23Tensor3ShapeDerivativesEPKiPKdPd__ZN24vtkLagrangeInterpolation23WedgeEvaluateDerivativeEPKiPKdPdiS4___ZN24vtkLagrangeInterpolation24EvaluateShapeAndGradientEidPdS0___ZN24vtkLagrangeInterpolation25Tensor3EvaluateDerivativeEPKiPKdPdiS4___ZN24vtkLagrangeInterpolation26GetFixedParameterOfHexFaceEi__ZN24vtkLagrangeInterpolation27GetFixedParametersOfHexEdgeEi__ZN24vtkLagrangeInterpolation27GetParametricHexCoordinatesEi__ZN24vtkLagrangeInterpolation28GetFixedParameterOfWedgeFaceEi__ZN24vtkLagrangeInterpolation28GetVaryingParameterOfHexEdgeEi__ZN24vtkLagrangeInterpolation29GetEdgeIndicesBoundingHexFaceEi__ZN24vtkLagrangeInterpolation29GetFixedParametersOfWedgeEdgeEi__ZN24vtkLagrangeInterpolation29GetParametricWedgeCoordinatesEi__ZN24vtkLagrangeInterpolation29GetVaryingParametersOfHexFaceEi__ZN24vtkLagrangeInterpolation30GetPointIndicesBoundingHexEdgeEi__ZN24vtkLagrangeInterpolation30GetPointIndicesBoundingHexFaceEi__ZN24vtkLagrangeInterpolation30GetVaryingParameterOfWedgeEdgeEi__ZN24vtkLagrangeInterpolation31GetEdgeIndicesBoundingWedgeFaceEi__ZN24vtkLagrangeInterpolation31GetVaryingParametersOfWedgeFaceEi__ZN24vtkLagrangeInterpolation32GetPointIndicesBoundingWedgeEdgeEi__ZN24vtkLagrangeInterpolation32GetPointIndicesBoundingWedgeFaceEi__ZN24vtkLagrangeInterpolation3NewEv__ZN24vtkLagrangeQuadrilateral10InitializeEv__ZN24vtkLagrangeQuadrilateral11DerivativesEiPdS0_iS0___ZN24vtkLagrangeQuadrilateral11TriangulateEiP9vtkIdListP9vtkPoints__ZN24vtkLagrangeQuadrilateral12CellBoundaryEiPdP9vtkIdList__ZN24vtkLagrangeQuadrilateral16EvaluateLocationERiPdS1_S1___ZN24vtkLagrangeQuadrilateral16EvaluatePositionEPdS0_RiS0_RdS0___ZN24vtkLagrangeQuadrilateral17InterpolateDerivsEPdS0___ZN24vtkLagrangeQuadrilateral17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN24vtkLagrangeQuadrilateral17PointIndexFromIJKEiiPKi__ZN24vtkLagrangeQuadrilateral17PointIndexFromIJKEiii__ZN24vtkLagrangeQuadrilateral19GetParametricCoordsEv__ZN24vtkLagrangeQuadrilateral20InterpolateFunctionsEPdS0___ZN24vtkLagrangeQuadrilateral21GetParametricDistanceEPd__ZN24vtkLagrangeQuadrilateral24SubCellCoordinatesFromIdER11vtkVector3ii__ZN24vtkLagrangeQuadrilateral24SubCellCoordinatesFromIdERiS0_S0_i__ZN24vtkLagrangeQuadrilateral27TransformApproxToCellParamsEiPd__ZN24vtkLagrangeQuadrilateral3NewEv__ZN24vtkLagrangeQuadrilateral4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN24vtkLagrangeQuadrilateral7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN24vtkLagrangeQuadrilateral7GetEdgeEi__ZN24vtkLagrangeQuadrilateral8GetOrderEv__ZN24vtkSimpleCellTessellator10InitializeEP17vtkGenericDataSet__ZN24vtkSimpleCellTessellator10TessellateEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionP14vtkDoubleArrayP12vtkCellArrayP12vtkPointData__ZN24vtkSimpleCellTessellator11TriangulateEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionP14vtkDoubleArrayP12vtkCellArrayP12vtkPointData__ZN24vtkSimpleCellTessellator14TessellateFaceEP21vtkGenericAdaptorCellP29vtkGenericAttributeCollectionxP14vtkDoubleArrayP12vtkCellArrayP12vtkPointData__ZN24vtkSimpleCellTessellator20GetFixedSubdivisionsEv__ZN24vtkSimpleCellTessellator20SetFixedSubdivisionsEi__ZN24vtkSimpleCellTessellator20SetSubdivisionLevelsEii__ZN24vtkSimpleCellTessellator22GetMaxSubdivisionLevelEv__ZN24vtkSimpleCellTessellator22SetMaxSubdivisionLevelEi__ZN24vtkSimpleCellTessellator26GetMaxAdaptiveSubdivisionsEv__ZN24vtkSimpleCellTessellator3NewEv__ZN24vtkSimpleCellTessellator5ResetEv__ZN25vtkAbstractElectronicData8DeepCopyEP13vtkDataObject__ZN25vtkAdjacentVertexIterator10InitializeEP8vtkGraphx__ZN25vtkAdjacentVertexIterator3NewEv__ZN25vtkDataObjectTreeIterator12GoToNextItemEv__ZN25vtkDataObjectTreeIterator13GoToFirstItemEv__ZN25vtkDataObjectTreeIterator18GetCurrentMetaDataEv__ZN25vtkDataObjectTreeIterator18HasCurrentMetaDataEv__ZN25vtkDataObjectTreeIterator19GetCurrentFlatIndexEv__ZN25vtkDataObjectTreeIterator19IsDoneWithTraversalEv__ZN25vtkDataObjectTreeIterator20GetCurrentDataObjectEv__ZN25vtkDataObjectTreeIterator3NewEv__ZN25vtkDistributedGraphHelper17MakeDistributedIdEix__ZN25vtkDistributedGraphHelper18DISTRIBUTEDEDGEIDSEv__ZN25vtkDistributedGraphHelper20DISTRIBUTEDVERTEXIDSEv__ZN25vtkDistributedGraphHelper26GetVertexOwnerByPedigreeIdERK10vtkVariant__ZN25vtkGenericCellTessellator12GetMaxErrorsEPd__ZN25vtkGenericCellTessellator15SetErrorMetricsEP13vtkCollection__ZN25vtkGenericCellTessellator16InitErrorMetricsEP17vtkGenericDataSet__ZN25vtkHierarchicalBoxDataSet11NewIteratorEv__ZN25vtkHierarchicalBoxDataSet3NewEv__ZN25vtkHierarchicalBoxDataSet7GetDataEP14vtkInformation__ZN25vtkHierarchicalBoxDataSet7GetDataEP20vtkInformationVectori__ZN25vtkImplicitWindowFunction16EvaluateFunctionEPd__ZN25vtkImplicitWindowFunction16EvaluateGradientEPdS0___ZN25vtkImplicitWindowFunction19SetImplicitFunctionEP19vtkImplicitFunction__ZN25vtkImplicitWindowFunction3NewEv__ZN25vtkImplicitWindowFunction8GetMTimeEv__ZN25vtkMutableUndirectedGraph10RemoveEdgeEx__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeERK10vtkVariantxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExRK10vtkVariantP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExx__ZN25vtkMutableUndirectedGraph11LazyAddEdgeExxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph11RemoveEdgesEP14vtkIdTypeArray__ZN25vtkMutableUndirectedGraph12AddGraphEdgeExx__ZN25vtkMutableUndirectedGraph12RemoveVertexEx__ZN25vtkMutableUndirectedGraph13LazyAddVertexEP15vtkVariantArray__ZN25vtkMutableUndirectedGraph13LazyAddVertexERK10vtkVariant__ZN25vtkMutableUndirectedGraph13LazyAddVertexEv__ZN25vtkMutableUndirectedGraph14RemoveVerticesEP14vtkIdTypeArray__ZN25vtkMutableUndirectedGraph19SetNumberOfVerticesEx__ZN25vtkMutableUndirectedGraph3NewEv__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantS2_P15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeERK10vtkVariantxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeExRK10vtkVariantP15vtkVariantArray__ZN25vtkMutableUndirectedGraph7AddEdgeExx__ZN25vtkMutableUndirectedGraph7AddEdgeExxP15vtkVariantArray__ZN25vtkMutableUndirectedGraph9AddVertexEP15vtkVariantArray__ZN25vtkMutableUndirectedGraph9AddVertexERK10vtkVariant__ZN25vtkMutableUndirectedGraph9AddVertexEv__ZN25vtkNonMergingPointLocator17InsertUniquePointEPKdRx__ZN25vtkNonMergingPointLocator3NewEv__ZN25vtkOctreePointLocatorNode13ContainsPointEdddi__ZN25vtkOctreePointLocatorNode13SetDataBoundsEdddddd__ZN25vtkOctreePointLocatorNode16CreateChildNodesEv__ZN25vtkOctreePointLocatorNode16DeleteChildNodesEv__ZN25vtkOctreePointLocatorNode16IntersectsRegionEP21vtkPlanesIntersectioni__ZN25vtkOctreePointLocatorNode17GetSubOctantIndexEPdi__ZN25vtkOctreePointLocatorNode22GetDistance2ToBoundaryEdddPS_i__ZN25vtkOctreePointLocatorNode22GetDistance2ToBoundaryEdddPdPS_i__ZN25vtkOctreePointLocatorNode27GetDistance2ToInnerBoundaryEdddPS___ZN25vtkOctreePointLocatorNode28ComputeOctreeNodeInformationEPS_RiS1_Pf__ZN25vtkOctreePointLocatorNode3NewEv__ZN25vtkOctreePointLocatorNode8GetChildEi__ZN25vtkOctreePointLocatorNode9SetBoundsEdddddd__ZN25vtkTriQuadraticHexahedron11DerivativesEiPdS0_iS0___ZN25vtkTriQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN25vtkTriQuadraticHexahedron12CellBoundaryEiPdP9vtkIdList__ZN25vtkTriQuadraticHexahedron12GetEdgeArrayEi__ZN25vtkTriQuadraticHexahedron12GetFaceArrayEi__ZN25vtkTriQuadraticHexahedron16EvaluateLocationERiPdS1_S1___ZN25vtkTriQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN25vtkTriQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN25vtkTriQuadraticHexahedron19GetParametricCoordsEv__ZN25vtkTriQuadraticHexahedron19InterpolationDerivsEPdS0___ZN25vtkTriQuadraticHexahedron22InterpolationFunctionsEPdS0___ZN25vtkTriQuadraticHexahedron3NewEv__ZN25vtkTriQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN25vtkTriQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN25vtkTriQuadraticHexahedron7GetEdgeEi__ZN25vtkTriQuadraticHexahedron7GetFaceEi__ZN27vtkHyperOctreePointsGrabber12GetDimensionEv__ZN28vtkBiQuadraticQuadraticWedge11DerivativesEiPdS0_iS0___ZN28vtkBiQuadraticQuadraticWedge11TriangulateEiP9vtkIdListP9vtkPoints__ZN28vtkBiQuadraticQuadraticWedge12CellBoundaryEiPdP9vtkIdList__ZN28vtkBiQuadraticQuadraticWedge12GetEdgeArrayEi__ZN28vtkBiQuadraticQuadraticWedge12GetFaceArrayEi__ZN28vtkBiQuadraticQuadraticWedge16EvaluateLocationERiPdS1_S1___ZN28vtkBiQuadraticQuadraticWedge16EvaluatePositionEPdS0_RiS0_RdS0___ZN28vtkBiQuadraticQuadraticWedge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN28vtkBiQuadraticQuadraticWedge19GetParametricCoordsEv__ZN28vtkBiQuadraticQuadraticWedge19InterpolationDerivsEPdS0___ZN28vtkBiQuadraticQuadraticWedge22InterpolationFunctionsEPdS0___ZN28vtkBiQuadraticQuadraticWedge3NewEv__ZN28vtkBiQuadraticQuadraticWedge4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN28vtkBiQuadraticQuadraticWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN28vtkBiQuadraticQuadraticWedge7GetEdgeEi__ZN28vtkBiQuadraticQuadraticWedge7GetFaceEi__ZN29vtkGenericAttributeCollection11ShallowCopyEPS___ZN29vtkGenericAttributeCollection12GetAttributeEi__ZN29vtkGenericAttributeCollection12HasAttributeEiPii__ZN29vtkGenericAttributeCollection13FindAttributeEPKc__ZN29vtkGenericAttributeCollection15InsertAttributeEiP19vtkGenericAttribute__ZN29vtkGenericAttributeCollection15RemoveAttributeEi__ZN29vtkGenericAttributeCollection17GetAttributeIndexEi__ZN29vtkGenericAttributeCollection18SetActiveAttributeEii__ZN29vtkGenericAttributeCollection19GetActualMemorySizeEv__ZN29vtkGenericAttributeCollection19InsertNextAttributeEP19vtkGenericAttribute__ZN29vtkGenericAttributeCollection21GetNumberOfAttributesEv__ZN29vtkGenericAttributeCollection21GetNumberOfComponentsEv__ZN29vtkGenericAttributeCollection24GetMaxNumberOfComponentsEv__ZN29vtkGenericAttributeCollection26GetAttributesToInterpolateEv__ZN29vtkGenericAttributeCollection26SetAttributesToInterpolateEiPi__ZN29vtkGenericAttributeCollection31SetAttributesToInterpolateToAllEv__ZN29vtkGenericAttributeCollection34GetNumberOfPointCenteredComponentsEv__ZN29vtkGenericAttributeCollection3NewEv__ZN29vtkGenericAttributeCollection5ResetEv__ZN29vtkGenericAttributeCollection7IsEmptyEv__ZN29vtkGenericAttributeCollection8DeepCopyEPS___ZN29vtkGenericAttributeCollection8GetMTimeEv__ZN29vtkImplicitFunctionCollection3NewEv__ZN29vtkQuadratureSchemeDefinition10DICTIONARYEv__ZN29vtkQuadratureSchemeDefinition10InitializeEiiiPd__ZN29vtkQuadratureSchemeDefinition10InitializeEiiiPdS0___ZN29vtkQuadratureSchemeDefinition12RestoreStateEP17vtkXMLDataElement__ZN29vtkQuadratureSchemeDefinition28QUADRATURE_OFFSET_ARRAY_NAMEEv__ZN29vtkQuadratureSchemeDefinition3NewEv__ZN29vtkQuadratureSchemeDefinition5ClearEv__ZN29vtkQuadratureSchemeDefinition8DeepCopyEPKS___ZN29vtkQuadratureSchemeDefinition9SaveStateEP17vtkXMLDataElement__ZN29vtkStructuredPointsCollection3NewEv__ZN29vtkUniformGridAMRDataIterator12GoToNextItemEv__ZN29vtkUniformGridAMRDataIterator13GoToFirstItemEv__ZN29vtkUniformGridAMRDataIterator15GetCurrentIndexEv__ZN29vtkUniformGridAMRDataIterator15GetCurrentLevelEv__ZN29vtkUniformGridAMRDataIterator18GetCurrentMetaDataEv__ZN29vtkUniformGridAMRDataIterator19GetCurrentFlatIndexEv__ZN29vtkUniformGridAMRDataIterator19IsDoneWithTraversalEv__ZN29vtkUniformGridAMRDataIterator20GetCurrentDataObjectEv__ZN29vtkUniformGridAMRDataIterator3NewEv__ZN30vtkCommonInformationKeyManagerC1Ev__ZN30vtkCommonInformationKeyManagerD1Ev__ZN30vtkExtractStructuredGridHelper10InitializeEPiS0_S0_b__ZN30vtkExtractStructuredGridHelper12CopyCellDataEPiS0_P11vtkCellDataS2___ZN30vtkExtractStructuredGridHelper14GetMappedIndexEii__ZN30vtkExtractStructuredGridHelper17GetPartitionedVOIEPKiS1_S1_bPi__ZN30vtkExtractStructuredGridHelper18ComputeBeginAndEndEPiS0_S0_S0___ZN30vtkExtractStructuredGridHelper20GetMappedExtentValueEii__ZN30vtkExtractStructuredGridHelper22CopyPointsAndPointDataEPiS0_P12vtkPointDataP9vtkPointsS2_S4___ZN30vtkExtractStructuredGridHelper26GetPartitionedOutputExtentEPKiS1_S1_S1_bPi__ZN30vtkExtractStructuredGridHelper29GetMappedExtentValueFromIndexEii__ZN30vtkExtractStructuredGridHelper29GetMappedIndexFromExtentValueEii__ZN30vtkExtractStructuredGridHelper3NewEv__ZN30vtkExtractStructuredGridHelper7GetSizeEi__ZN30vtkHierarchicalBoxDataIterator3NewEv__ZN31vtkHyperOctreeLightWeightCursor10InitializeEP14vtkHyperOctree__ZN31vtkHyperOctreeLightWeightCursor6ToRootEv__ZN31vtkHyperOctreeLightWeightCursor7ToChildEi__ZN31vtkHyperOctreeLightWeightCursor9GetIsLeafEv__ZN31vtkHyperOctreeLightWeightCursorC1Ev__ZN31vtkObjectFactoryRegistryCleanupC1Ev__ZN31vtkObjectFactoryRegistryCleanupD1Ev__ZN31vtkUnstructuredGridCellIterator19IsDoneWithTraversalEv__ZN31vtkUnstructuredGridCellIterator3NewEv__ZN31vtkUnstructuredGridCellIterator9GetCellIdEv__ZN32vtkGenericSubdivisionErrorMetric10SetDataSetEP17vtkGenericDataSet__ZN32vtkGenericSubdivisionErrorMetric14SetGenericCellEP21vtkGenericAdaptorCell__ZN32vtkIncrementalOctreePointLocator11InsertPointExPKd__ZN32vtkIncrementalOctreePointLocator12BuildLocatorEv__ZN32vtkIncrementalOctreePointLocator15InsertNextPointEPKd__ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEPKd__ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEddd__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKd__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKdPd__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEddd__ZN32vtkIncrementalOctreePointLocator16FindClosestPointEdddPd__ZN32vtkIncrementalOctreePointLocator17GetNumberOfPointsEv__ZN32vtkIncrementalOctreePointLocator17InsertUniquePointEPKdRx__ZN32vtkIncrementalOctreePointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKd__ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKdx__ZN32vtkIncrementalOctreePointLocator19FreeSearchStructureEv__ZN32vtkIncrementalOctreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN32vtkIncrementalOctreePointLocator22GenerateRepresentationEiP11vtkPolyData__ZN32vtkIncrementalOctreePointLocator24FindClosestInsertedPointEPKd__ZN32vtkIncrementalOctreePointLocator26InsertPointWithoutCheckingEPKdRxi__ZN32vtkIncrementalOctreePointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN32vtkIncrementalOctreePointLocator29FindPointsWithinSquaredRadiusEdPKdP9vtkIdList__ZN32vtkIncrementalOctreePointLocator35FindClosestPointWithinSquaredRadiusEdPKdRd__ZN32vtkIncrementalOctreePointLocator3NewEv__ZN32vtkIncrementalOctreePointLocator9GetBoundsEPd__ZN32vtkReebGraphSimplificationMetric13ComputeMetricEP10vtkDataSetP12vtkDataArrayxP16vtkAbstractArrayx__ZN32vtkReebGraphSimplificationMetric3NewEv__ZN33vtkBiQuadraticQuadraticHexahedron11DerivativesEiPdS0_iS0___ZN33vtkBiQuadraticQuadraticHexahedron11TriangulateEiP9vtkIdListP9vtkPoints__ZN33vtkBiQuadraticQuadraticHexahedron12CellBoundaryEiPdP9vtkIdList__ZN33vtkBiQuadraticQuadraticHexahedron12GetEdgeArrayEi__ZN33vtkBiQuadraticQuadraticHexahedron12GetFaceArrayEi__ZN33vtkBiQuadraticQuadraticHexahedron16EvaluateLocationERiPdS1_S1___ZN33vtkBiQuadraticQuadraticHexahedron16EvaluatePositionEPdS0_RiS0_RdS0___ZN33vtkBiQuadraticQuadraticHexahedron17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN33vtkBiQuadraticQuadraticHexahedron19GetParametricCoordsEv__ZN33vtkBiQuadraticQuadraticHexahedron19InterpolationDerivsEPdS0___ZN33vtkBiQuadraticQuadraticHexahedron22InterpolationFunctionsEPdS0___ZN33vtkBiQuadraticQuadraticHexahedron3NewEv__ZN33vtkBiQuadraticQuadraticHexahedron4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN33vtkBiQuadraticQuadraticHexahedron7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN33vtkBiQuadraticQuadraticHexahedron7GetEdgeEi__ZN33vtkBiQuadraticQuadraticHexahedron7GetFaceEi__ZN33vtkIterativeClosestPointTransform10SetLocatorEP14vtkCellLocator__ZN33vtkIterativeClosestPointTransform13MakeTransformEv__ZN33vtkIterativeClosestPointTransform27GetMeanDistanceModeAsStringEv__ZN33vtkIterativeClosestPointTransform3NewEv__ZN33vtkIterativeClosestPointTransform7InverseEv__ZN33vtkIterativeClosestPointTransform9SetSourceEP10vtkDataSet__ZN33vtkIterativeClosestPointTransform9SetTargetEP10vtkDataSet__ZN35vtkGenericInterpolatedVelocityField10AddDataSetEP17vtkGenericDataSet__ZN35vtkGenericInterpolatedVelocityField11GetLastCellEv__ZN35vtkGenericInterpolatedVelocityField13ClearLastCellEv__ZN35vtkGenericInterpolatedVelocityField14CopyParametersEPS___ZN35vtkGenericInterpolatedVelocityField14FunctionValuesEPdS0___ZN35vtkGenericInterpolatedVelocityField23GetLastLocalCoordinatesEPd__ZN35vtkGenericInterpolatedVelocityField3NewEv__ZN35vtkMeanValueCoordinatesInterpolator27ComputeInterpolationWeightsEPdP9vtkPointsP12vtkCellArrayS0___ZN35vtkMeanValueCoordinatesInterpolator27ComputeInterpolationWeightsEPdP9vtkPointsP9vtkIdListS0___ZN35vtkMeanValueCoordinatesInterpolator3NewEv__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey11ShallowCopyEP14vtkInformationS1___ZN49vtkInformationQuadratureSchemeDefinitionVectorKey12RestoreStateEP14vtkInformationP17vtkXMLDataElement__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey3GetEP14vtkInformationi__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey3SetEP14vtkInformationP29vtkQuadratureSchemeDefinitioni__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey4SizeEP14vtkInformation__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey5ClearEP14vtkInformation__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey6AppendEP14vtkInformationP29vtkQuadratureSchemeDefinition__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey6ResizeEP14vtkInformationi__ZN49vtkInformationQuadratureSchemeDefinitionVectorKey8DeepCopyEP14vtkInformationS1___ZN49vtkInformationQuadratureSchemeDefinitionVectorKey9SaveStateEP14vtkInformationP17vtkXMLDataElement__ZN6vtkBox12IntersectBoxEPdS0_S0_S0_Rd__ZN6vtkBox16EvaluateFunctionEPd__ZN6vtkBox16EvaluateGradientEPdS0___ZN6vtkBox17IntersectWithLineEPKdS1_S1_RdS2_PdS3_RiS4___ZN6vtkBox18IntersectWithPlaneEPdS0_S0___ZN6vtkBox3NewEv__ZN6vtkBox7GetXMaxEPd__ZN6vtkBox7GetXMaxERdS0_S0___ZN6vtkBox7GetXMinEPd__ZN6vtkBox7GetXMinERdS0_S0___ZN6vtkBox7SetXMaxEddd__ZN6vtkBox7SetXMinEddd__ZN6vtkBox9AddBoundsEPKd__ZN6vtkBox9GetBoundsEPd__ZN6vtkBox9GetBoundsERdS0_S0_S0_S0_S0___ZN6vtkBox9GetBoundsEv__ZN6vtkBox9SetBoundsEPKd__ZN6vtkBox9SetBoundsEdddddd__ZN7vtkAtom11SetPositionEPKf__ZN7vtkAtom11SetPositionERK11vtkVector3f__ZN7vtkAtom11SetPositionEfff__ZN7vtkAtom15SetAtomicNumberEt__ZN7vtkBond10GetEndAtomEv__ZN7vtkBond12GetBeginAtomEv__ZN7vtkBond8GetOrderEv__ZN7vtkCell10GetLength2Ev__ZN7vtkCell10InitializeEiP9vtkPoints__ZN7vtkCell10InitializeEiPxP9vtkPoints__ZN7vtkCell11ShallowCopyEPS___ZN7vtkCell19GetParametricCenterEPd__ZN7vtkCell19GetParametricCoordsEv__ZN7vtkCell21GetParametricDistanceEPd__ZN7vtkCell8DeepCopyEPS___ZN7vtkCell9GetBoundsEPd__ZN7vtkCell9GetBoundsEv__ZN7vtkCone16EvaluateFunctionEPd__ZN7vtkCone16EvaluateGradientEPdS0___ZN7vtkCone3NewEv__ZN7vtkLine11DerivativesEiPdS0_iS0___ZN7vtkLine11TriangulateEiP9vtkIdListP9vtkPoints__ZN7vtkLine12CellBoundaryEiPdP9vtkIdList__ZN7vtkLine12IntersectionEPKdS1_S1_S1_RdS2___ZN7vtkLine14DistanceToLineEPKdS1_S1___ZN7vtkLine14DistanceToLineEPKdS1_S1_RdPd__ZN7vtkLine14Intersection3DEPdS0_S0_S0_RdS1___ZN7vtkLine16EvaluateLocationERiPdS1_S1___ZN7vtkLine16EvaluatePositionEPdS0_RiS0_RdS0___ZN7vtkLine17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN7vtkLine19GetParametricCoordsEv__ZN7vtkLine19InterpolationDerivsEPdS0___ZN7vtkLine20DistanceBetweenLinesEPdS0_S0_S0_S0_S0_RdS1___ZN7vtkLine22InterpolationFunctionsEPdS0___ZN7vtkLine27DistanceBetweenLineSegmentsEPdS0_S0_S0_S0_S0_RdS1___ZN7vtkLine3NewEv__ZN7vtkLine4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN7vtkLine7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN7vtkPath13GetCellPointsExP9vtkIdList__ZN7vtkPath13GetPointCellsExP9vtkIdList__ZN7vtkPath15InsertNextPointEPdi__ZN7vtkPath15InsertNextPointEdddi__ZN7vtkPath3NewEv__ZN7vtkPath5ResetEv__ZN7vtkPath7GetCellExP14vtkGenericCell__ZN7vtkPath7GetDataEP14vtkInformation__ZN7vtkPath7GetDataEP20vtkInformationVectori__ZN7vtkPath8AllocateExi__ZN7vtkPath8GetCodesEv__ZN7vtkPath8SetCodesEP11vtkIntArray__ZN7vtkQuad11DerivativesEiPdS0_iS0___ZN7vtkQuad11TriangulateEiP9vtkIdListP9vtkPoints__ZN7vtkQuad12CellBoundaryEiPdP9vtkIdList__ZN7vtkQuad12GetEdgeArrayEi__ZN7vtkQuad16EvaluateLocationERiPdS1_S1___ZN7vtkQuad16EvaluatePositionEPdS0_RiS0_RdS0___ZN7vtkQuad17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN7vtkQuad19GetParametricCoordsEv__ZN7vtkQuad19InterpolationDerivsEPdS0___ZN7vtkQuad22InterpolationFunctionsEPdS0___ZN7vtkQuad3NewEv__ZN7vtkQuad4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN7vtkQuad7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN7vtkQuad7GetEdgeEi__ZN7vtkTree13GetParentEdgeEx__ZN7vtkTree15ReorderChildrenExP14vtkIdTypeArray__ZN7vtkTree3NewEv__ZN7vtkTree6IsLeafEx__ZN7vtkTree7GetDataEP14vtkInformation__ZN7vtkTree7GetDataEP20vtkInformationVectori__ZN7vtkTree8GetChildExx__ZN7vtkTree8GetLevelEx__ZN7vtkTree9GetParentEx__ZN8vtkGraph10FindVertexERK10vtkVariant__ZN8vtkGraph10GetInEdgesExP17vtkInEdgeIterator__ZN8vtkGraph10GetOutEdgeExx__ZN8vtkGraph10GetOutEdgeExxP12vtkGraphEdge__ZN8vtkGraph10InitializeEv__ZN8vtkGraph11GetInDegreeEx__ZN8vtkGraph11GetOutEdgesExP18vtkOutEdgeIterator__ZN8vtkGraph11GetVerticesEP21vtkVertexListIterator__ZN8vtkGraph11ShallowCopyEP13vtkDataObject__ZN8vtkGraph12AddEdgePointExPd__ZN8vtkGraph12GetEdgePointExx__ZN8vtkGraph12GetOutDegreeEx__ZN8vtkGraph12SetEdgePointExxPd__ZN8vtkGraph13ComputeBoundsEv__ZN8vtkGraph13CopyStructureEPS___ZN8vtkGraph13GetEdgePointsExRxRPd__ZN8vtkGraph13SetEdgePointsExxPd__ZN8vtkGraph15CheckedDeepCopyEPS___ZN8vtkGraph15ClearEdgePointsEx__ZN8vtkGraph15GetInducedEdgesEP14vtkIdTypeArrayS1___ZN8vtkGraph15GetSourceVertexEx__ZN8vtkGraph15GetTargetVertexEx__ZN8vtkGraph15IsSameStructureEPS___ZN8vtkGraph15ToDirectedGraphEP16vtkDirectedGraph__ZN8vtkGraph16GetNumberOfEdgesEv__ZN8vtkGraph17GetGraphInternalsEb__ZN8vtkGraph17ToUndirectedGraphEP18vtkUndirectedGraph__ZN8vtkGraph18CheckedShallowCopyEPS___ZN8vtkGraph18DeepCopyEdgePointsEPS___ZN8vtkGraph18ReorderOutVerticesExP14vtkIdTypeArray__ZN8vtkGraph19GetAdjacentVerticesExP25vtkAdjacentVertexIterator__ZN8vtkGraph19GetNumberOfElementsEi__ZN8vtkGraph19GetNumberOfVerticesEv__ZN8vtkGraph21GetNumberOfEdgePointsEx__ZN8vtkGraph21ShallowCopyEdgePointsEPS___ZN8vtkGraph24GetAttributesAsFieldDataEi__ZN8vtkGraph25GetDistributedGraphHelperEv__ZN8vtkGraph25SetDistributedGraphHelperEP25vtkDistributedGraphHelper__ZN8vtkGraph4DumpEv__ZN8vtkGraph7GetDataEP14vtkInformation__ZN8vtkGraph7GetDataEP20vtkInformationVectori__ZN8vtkGraph7SqueezeEv__ZN8vtkGraph8DeepCopyEP13vtkDataObject__ZN8vtkGraph8GetEdgesEP19vtkEdgeListIterator__ZN8vtkGraph8GetMTimeEv__ZN8vtkGraph8GetPointEx__ZN8vtkGraph8GetPointExPd__ZN8vtkGraph9GetBoundsEPd__ZN8vtkGraph9GetBoundsEv__ZN8vtkGraph9GetDegreeEx__ZN8vtkGraph9GetEdgeIdExx__ZN8vtkGraph9GetInEdgeExx__ZN8vtkGraph9GetInEdgeExxP12vtkGraphEdge__ZN8vtkGraph9GetPointsEv__ZN8vtkGraph9SetPointsEP9vtkPoints__ZN8vtkPixel11DerivativesEiPdS0_iS0___ZN8vtkPixel11TriangulateEiP9vtkIdListP9vtkPoints__ZN8vtkPixel12CellBoundaryEiPdP9vtkIdList__ZN8vtkPixel16EvaluateLocationERiPdS1_S1___ZN8vtkPixel16EvaluatePositionEPdS0_RiS0_RdS0___ZN8vtkPixel17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN8vtkPixel19GetParametricCoordsEv__ZN8vtkPixel19InterpolationDerivsEPdS0___ZN8vtkPixel22InterpolationFunctionsEPdS0___ZN8vtkPixel3NewEv__ZN8vtkPixel4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN8vtkPixel7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN8vtkPixel7GetEdgeEi__ZN8vtkPlane12ProjectPointEPdS0___ZN8vtkPlane12ProjectPointEPdS0_S0_S0___ZN8vtkPlane13ProjectVectorEPdS0___ZN8vtkPlane13ProjectVectorEPdS0_S0_S0___ZN8vtkPlane15DistanceToPlaneEPd__ZN8vtkPlane16EvaluateFunctionEP12vtkDataArrayS1___ZN8vtkPlane16EvaluateFunctionEPd__ZN8vtkPlane16EvaluateGradientEPdS0___ZN8vtkPlane17IntersectWithLineEPdS0_RdS0___ZN8vtkPlane17IntersectWithLineEPdS0_S0_S0_RdS0___ZN8vtkPlane23GeneralizedProjectPointEPdS0___ZN8vtkPlane23GeneralizedProjectPointEPdS0_S0_S0___ZN8vtkPlane3NewEv__ZN8vtkPlane4PushEd__ZN8vtkTable10InitializeEv__ZN8vtkTable10SetRowDataEP20vtkDataSetAttributes__ZN8vtkTable11ShallowCopyEP13vtkDataObject__ZN8vtkTable12RemoveColumnEx__ZN8vtkTable13GetColumnNameEx__ZN8vtkTable13InsertNextRowEP15vtkVariantArray__ZN8vtkTable14GetValueByNameExPKc__ZN8vtkTable14SetValueByNameExPKc10vtkVariant__ZN8vtkTable15GetColumnByNameEPKc__ZN8vtkTable15GetNumberOfRowsEv__ZN8vtkTable15SetNumberOfRowsEx__ZN8vtkTable18GetNumberOfColumnsEv__ZN8vtkTable18InsertNextBlankRowEd__ZN8vtkTable18RemoveColumnByNameEPKc__ZN8vtkTable19GetActualMemorySizeEv__ZN8vtkTable19GetNumberOfElementsEi__ZN8vtkTable24GetAttributesAsFieldDataEi__ZN8vtkTable3NewEv__ZN8vtkTable4DumpEji__ZN8vtkTable6GetRowEx__ZN8vtkTable6GetRowExP15vtkVariantArray__ZN8vtkTable6SetRowExP15vtkVariantArray__ZN8vtkTable7GetDataEP14vtkInformation__ZN8vtkTable7GetDataEP20vtkInformationVectori__ZN8vtkTable8DeepCopyEP13vtkDataObject__ZN8vtkTable8GetValueExx__ZN8vtkTable8SetValueExx10vtkVariant__ZN8vtkTable9AddColumnEP16vtkAbstractArray__ZN8vtkTable9GetColumnEx__ZN8vtkTable9RemoveRowEx__ZN8vtkTetra11DerivativesEiPdS0_iS0___ZN8vtkTetra11TetraCenterEPdS0_S0_S0_S0___ZN8vtkTetra11TriangulateEiP9vtkIdListP9vtkPoints__ZN8vtkTetra12CellBoundaryEiPdP9vtkIdList__ZN8vtkTetra12CircumsphereEPdS0_S0_S0_S0___ZN8vtkTetra12GetEdgeArrayEi__ZN8vtkTetra12GetFaceArrayEi__ZN8vtkTetra13ComputeVolumeEPdS0_S0_S0___ZN8vtkTetra13GetEdgePointsEiRPi__ZN8vtkTetra13GetFacePointsEiRPi__ZN8vtkTetra16EvaluateLocationERiPdS1_S1___ZN8vtkTetra16EvaluatePositionEPdS0_RiS0_RdS0___ZN8vtkTetra17BarycentricCoordsEPdS0_S0_S0_S0_S0___ZN8vtkTetra17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN8vtkTetra19GetParametricCoordsEv__ZN8vtkTetra19InterpolationDerivsEPdS0___ZN8vtkTetra21GetParametricDistanceEPd__ZN8vtkTetra22InterpolationFunctionsEPdS0___ZN8vtkTetra3NewEv__ZN8vtkTetra4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN8vtkTetra7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN8vtkTetra7GetEdgeEi__ZN8vtkTetra7GetFaceEi__ZN8vtkTetra8InsphereEPdS0_S0_S0_S0___ZN8vtkVoxel11DerivativesEiPdS0_iS0___ZN8vtkVoxel11TriangulateEiP9vtkIdListP9vtkPoints__ZN8vtkVoxel12CellBoundaryEiPdP9vtkIdList__ZN8vtkVoxel12GetEdgeArrayEi__ZN8vtkVoxel12GetFaceArrayEi__ZN8vtkVoxel13GetEdgePointsEiRPi__ZN8vtkVoxel13GetFacePointsEiRPi__ZN8vtkVoxel16EvaluateLocationERiPdS1_S1___ZN8vtkVoxel16EvaluatePositionEPdS0_RiS0_RdS0___ZN8vtkVoxel17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN8vtkVoxel19GetParametricCoordsEv__ZN8vtkVoxel19InterpolationDerivsEPdS0___ZN8vtkVoxel22InterpolationFunctionsEPdS0___ZN8vtkVoxel3NewEv__ZN8vtkVoxel7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN8vtkVoxel7GetEdgeEi__ZN8vtkVoxel7GetFaceEi__ZN8vtkWedge11DerivativesEiPdS0_iS0___ZN8vtkWedge11TriangulateEiP9vtkIdListP9vtkPoints__ZN8vtkWedge12CellBoundaryEiPdP9vtkIdList__ZN8vtkWedge12GetEdgeArrayEi__ZN8vtkWedge12GetFaceArrayEi__ZN8vtkWedge13GetEdgePointsEiRPi__ZN8vtkWedge13GetFacePointsEiRPi__ZN8vtkWedge16EvaluateLocationERiPdS1_S1___ZN8vtkWedge16EvaluatePositionEPdS0_RiS0_RdS0___ZN8vtkWedge17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN8vtkWedge19GetParametricCoordsEv__ZN8vtkWedge19InterpolationDerivsEPdS0___ZN8vtkWedge22InterpolationFunctionsEPdS0___ZN8vtkWedge3NewEv__ZN8vtkWedge7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN8vtkWedge7GetEdgeEi__ZN8vtkWedge7GetFaceEi__ZN9vtkAMRBox11DeserializeEPhRKx__ZN9vtkAMRBox12GetBoxOriginERKS_PKdS3_Pd__ZN9vtkAMRBox12RemoveGhostsEi__ZN9vtkAMRBox13SetDimensionsEPKiS1_i__ZN9vtkAMRBox13SetDimensionsEPKii__ZN9vtkAMRBox13SetDimensionsEiiiiiii__ZN9vtkAMRBox18GetCellLinearIndexERKS_iiiPi__ZN9vtkAMRBox28ComputeStructuredCoordinatesERKS_PKdS3_S3_PiPd__ZN9vtkAMRBox4GrowEi__ZN9vtkAMRBox5ShiftEPKi__ZN9vtkAMRBox5ShiftEiii__ZN9vtkAMRBox6RefineEi__ZN9vtkAMRBox6ShrinkEi__ZN9vtkAMRBox7CoarsenEi__ZN9vtkAMRBox8HasPointERKS_PKdS3_ddd__ZN9vtkAMRBox9GetBoundsERKS_PKdS3_Pd__ZN9vtkAMRBox9IntersectERKS___ZN9vtkAMRBox9SerializeERPhRx__ZN9vtkAMRBoxC1EPKdPKiS1_S1_i__ZN9vtkAMRBoxC1EPKi__ZN9vtkAMRBoxC1EPKiS1___ZN9vtkAMRBoxC1ERKS___ZN9vtkAMRBoxC1Eiiiiii__ZN9vtkAMRBoxC1Ev__ZN9vtkCell3D4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN9vtkCell3D7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZN9vtkKdNode11ContainsBoxEddddddi__ZN9vtkKdNode12SetMaxBoundsEPKd__ZN9vtkKdNode12SetMinBoundsEPKd__ZN9vtkKdNode13AddChildNodesEPS_S0___ZN9vtkKdNode13ContainsPointEdddi__ZN9vtkKdNode13IntersectsBoxEddddddi__ZN9vtkKdNode13SetDataBoundsEPf__ZN9vtkKdNode13SetDataBoundsEdddddd__ZN9vtkKdNode14IntersectsCellEP7vtkCelliiPd__ZN9vtkKdNode16DeleteChildNodesEv__ZN9vtkKdNode16IntersectsRegionEP21vtkPlanesIntersectioni__ZN9vtkKdNode16PrintVerboseNodeEi__ZN9vtkKdNode16SetMaxDataBoundsEPKd__ZN9vtkKdNode16SetMinDataBoundsEPKd__ZN9vtkKdNode17IntersectsSphere2Eddddi__ZN9vtkKdNode19GetDivisionPositionEv__ZN9vtkKdNode22GetDistance2ToBoundaryEdddPdi__ZN9vtkKdNode22GetDistance2ToBoundaryEdddi__ZN9vtkKdNode27GetDistance2ToInnerBoundaryEddd__ZN9vtkKdNode3NewEv__ZN9vtkKdNode5SetUpEPS___ZN9vtkKdNode7SetLeftEPS___ZN9vtkKdNode8SetRightEPS___ZN9vtkKdNode9PrintNodeEi__ZN9vtkKdNode9SetBoundsEdddddd__ZN9vtkKdTree10AddDataSetEP10vtkDataSet__ZN9vtkKdTree10GetDataSetEi__ZN9vtkKdTree10SetDataSetEP10vtkDataSet__ZN9vtkKdTree11GetCellListEi__ZN9vtkKdTree11NewGeometryEv__ZN9vtkKdTree11PrintRegionEi__ZN9vtkKdTree12BuildLocatorEv__ZN9vtkKdTree12GetCellListsEP11vtkIntArrayP10vtkDataSetP9vtkIdListS5___ZN9vtkKdTree12GetCellListsEP11vtkIntArrayP9vtkIdListS3___ZN9vtkKdTree12GetCellListsEP11vtkIntArrayiP9vtkIdListS3___ZN9vtkKdTree12SetNewBoundsEPd__ZN9vtkKdTree13RemoveDataSetEP10vtkDataSet__ZN9vtkKdTree13RemoveDataSetEi__ZN9vtkKdTree15CreateCellListsEP10vtkDataSetPii__ZN9vtkKdTree15CreateCellListsEPii__ZN9vtkKdTree15CreateCellListsEiPii__ZN9vtkKdTree15CreateCellListsEv__ZN9vtkKdTree15DeleteCellListsEv__ZN9vtkKdTree15GetDataSetIndexEP10vtkDataSet__ZN9vtkKdTree15GetRegionBoundsEiPd__ZN9vtkKdTree16FindClosestPointEPdRd__ZN9vtkKdTree16FindClosestPointEdddRd__ZN9vtkKdTree16FindPointsInAreaEPdP14vtkIdTypeArrayb__ZN9vtkKdTree16PrintVerboseTreeEv__ZN9vtkKdTree17GetPointsInRegionEi__ZN9vtkKdTree17OmitXPartitioningEv__ZN9vtkKdTree17OmitYPartitioningEv__ZN9vtkKdTree17OmitZPartitioningEv__ZN9vtkKdTree17RemoveAllDataSetsEv__ZN9vtkKdTree18FindClosestNPointsEiPKdP9vtkIdList__ZN9vtkKdTree18InvalidateGeometryEv__ZN9vtkKdTree18OmitNoPartitioningEv__ZN9vtkKdTree18OmitXYPartitioningEv__ZN9vtkKdTree18OmitYZPartitioningEv__ZN9vtkKdTree18OmitZXPartitioningEv__ZN9vtkKdTree19FreeSearchStructureEv__ZN9vtkKdTree19GetBoundaryCellListEi__ZN9vtkKdTree19GetNumberOfDataSetsEv__ZN9vtkKdTree19GetRegionDataBoundsEiPd__ZN9vtkKdTree22BuildLocatorFromPointsEP11vtkPointSet__ZN9vtkKdTree22BuildLocatorFromPointsEP9vtkPoints__ZN9vtkKdTree22FindPointsWithinRadiusEdPKdP9vtkIdList__ZN9vtkKdTree22GenerateRepresentationEPiiP11vtkPolyData__ZN9vtkKdTree22GenerateRepresentationEiP11vtkPolyData__ZN9vtkKdTree23GetRegionContainingCellEP10vtkDataSetx__ZN9vtkKdTree23GetRegionContainingCellEix__ZN9vtkKdTree23GetRegionContainingCellEx__ZN9vtkKdTree24FindClosestPointInRegionEiPdRd__ZN9vtkKdTree24FindClosestPointInRegionEidddRd__ZN9vtkKdTree24GetRegionContainingPointEddd__ZN9vtkKdTree26AllGetRegionContainingCellEv__ZN9vtkKdTree26BuildMapForDuplicatePointsEf__ZN9vtkKdTree27ViewOrderRegionsInDirectionEP11vtkIntArrayPKdS1___ZN9vtkKdTree28FindClosestPointWithinRadiusEdPKdRd__ZN9vtkKdTree28ViewOrderRegionsFromPositionEP11vtkIntArrayPKdS1___ZN9vtkKdTree30ViewOrderAllRegionsInDirectionEPKdP11vtkIntArray__ZN9vtkKdTree31ViewOrderAllRegionsFromPositionEPKdP11vtkIntArray__ZN9vtkKdTree3NewEv__ZN9vtkKdTree7SetCutsEP10vtkBSPCuts__ZN9vtkKdTree8CopyTreeEP9vtkKdNode__ZN9vtkKdTree9FindPointEPd__ZN9vtkKdTree9FindPointEddd__ZN9vtkKdTree9GetBoundsEPd__ZN9vtkKdTree9PrintTreeEv__ZN9vtkObject11HasObserverEPKc__ZN9vtkObject11InvokeEventEPKcPv__ZN9vtkObject12BreakOnErrorEv__ZN9vtkObject23GetGlobalWarningDisplayEv__ZN9vtkPlanes10SetNormalsEP12vtkDataArray__ZN9vtkPlanes16EvaluateFunctionEPd__ZN9vtkPlanes16EvaluateGradientEPdS0___ZN9vtkPlanes16SetFrustumPlanesEPd__ZN9vtkPlanes17GetNumberOfPlanesEv__ZN9vtkPlanes3NewEv__ZN9vtkPlanes8GetPlaneEi__ZN9vtkPlanes8GetPlaneEiP8vtkPlane__ZN9vtkPlanes9SetBoundsEPKd__ZN9vtkPlanes9SetBoundsEdddddd__ZN9vtkPlanes9SetPointsEP9vtkPoints__ZN9vtkSphere16EvaluateFunctionEPd__ZN9vtkSphere16EvaluateGradientEPdS0___ZN9vtkSphere21ComputeBoundingSphereEPdxS0_Px__ZN9vtkSphere3NewEv__ZN9vtkSpline11RemovePointEd__ZN9vtkSpline15RemoveAllPointsEv__ZN9vtkSpline17GetNumberOfPointsEv__ZN9vtkSpline18SetParametricRangeEdd__ZN9vtkSpline8AddPointEdd__ZN9vtkSpline8DeepCopyEPS___ZN9vtkSpline8GetMTimeEv__ZN9vtkVertex11DerivativesEiPdS0_iS0___ZN9vtkVertex11TriangulateEiP9vtkIdListP9vtkPoints__ZN9vtkVertex12CellBoundaryEiPdP9vtkIdList__ZN9vtkVertex16EvaluateLocationERiPdS1_S1___ZN9vtkVertex16EvaluatePositionEPdS0_RiS0_RdS0___ZN9vtkVertex17IntersectWithLineEPdS0_dRdS0_S0_Ri__ZN9vtkVertex19GetParametricCoordsEv__ZN9vtkVertex19InterpolationDerivsEPdS0___ZN9vtkVertex22InterpolationFunctionsEPdS0___ZN9vtkVertex3NewEv__ZN9vtkVertex4ClipEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayP12vtkPointDataS7_P11vtkCellDataxS9_i__ZN9vtkVertex7ContourEdP12vtkDataArrayP26vtkIncrementalPointLocatorP12vtkCellArrayS5_S5_P12vtkPointDataS7_P11vtkCellDataxS9___ZNK13vtkObjectBase12GetClassNameEv__ZNK14vtkBoundingBox10IntersectsERKS___ZNK14vtkBoundingBox12GetMaxLengthEv__ZNK14vtkBoundingBox16ComputeDivisionsExPdPi__ZNK14vtkBoundingBox17GetDiagonalLengthEv__ZNK14vtkBoundingBox8ContainsERKS___ZNK17vtkAMRInformation18GetCoarsenedAMRBoxEjjR9vtkAMRBox__ZNK17vtkAMRInformation18GetRefinementRatioEj__ZNK17vtkAMRInformation19GetNumberOfDataSetsEj__ZNK17vtkAMRInformation9GetAMRBoxEjj__ZNK24vtkIncrementalOctreeNode9GetBoundsEPd__ZNK25vtkDistributedGraphHelper12GetEdgeIndexEx__ZNK25vtkDistributedGraphHelper12GetEdgeOwnerEx__ZNK25vtkDistributedGraphHelper14GetVertexIndexEx__ZNK25vtkDistributedGraphHelper14GetVertexOwnerEx__ZNK25vtkOctreePointLocatorNode13GetDataBoundsEPd__ZNK25vtkOctreePointLocatorNode9GetBoundsEPd__ZNK30vtkExtractStructuredGridHelper7IsValidEv__ZNK7vtkAtom11GetPositionEPd__ZNK7vtkAtom11GetPositionEv__ZNK7vtkAtom15GetAtomicNumberEv__ZNK7vtkBond12GetEndAtomIdEv__ZNK7vtkBond14GetBeginAtomIdEv__ZNK7vtkBond9GetLengthEv__ZNK9vtkAMRBox13DoesIntersectERKS___ZNK9vtkAMRBox13GetDimensionsEPi__ZNK9vtkAMRBox13GetDimensionsEPiS0___ZNK9vtkAMRBox14GetGhostVectorEiPi__ZNK9vtkAMRBox16ComputeDimensionEv__ZNK9vtkAMRBox16GetNumberOfCellsEPi__ZNK9vtkAMRBox16GetNumberOfCellsEv__ZNK9vtkAMRBox16GetNumberOfNodesEPi__ZNK9vtkAMRBox16GetNumberOfNodesEv__ZNK9vtkAMRBox16GetValidHiCornerEPi__ZNK9vtkAMRBox30DoesBoxIntersectAlongDimensionERKS_i__ZNK9vtkAMRBox8ContainsEPKi__ZNK9vtkAMRBox8ContainsERKS___ZNK9vtkAMRBox8ContainsEiii__ZNK9vtkAMRBox9SerializeEPi__ZNK9vtkAMRBoxeqERKS___ZNK9vtkKdNode13GetDataBoundsEPd__ZNK9vtkKdNode9GetBoundsEPd__ZNK9vtkSpline18GetParametricRangeEPd__ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv__ZNKSt3__121__basic_string_commonILb1EE20__throw_length_errorEv__ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE6resizeEmc__ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE9push_backEc__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED0Ev__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED1Ev__ZNSt3__113basic_ostreamIcNS_11char_traitsIcEEED2Ev__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE4syncEv__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE5imbueERKNS_6localeE__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE5uflowEv__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6setbufEPcl__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6xsgetnEPcl__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE6xsputnEPKcl__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEE9showmanycEv__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEEC2Ev__ZNSt3__115basic_streambufIcNS_11char_traitsIcEEED2Ev__ZNSt3__18ios_base4initEPv__ZNSt3__19basic_iosIcNS_11char_traitsIcEEED2Ev__ZTINSt3__113basic_ostreamIcNS_11char_traitsIcEEEE__ZTINSt3__115basic_streambufIcNS_11char_traitsIcEEEE__ZTVN10__cxxabiv120__si_class_type_infoE__ZTv0_n24_NSt3__113basic_ostreamIcNS_11char_traitsIcEEED0Ev__ZTv0_n24_NSt3__113basic_ostreamIcNS_11char_traitsIcEEED1Ev__ZdaPv__ZdlPv__Zeq11vtkEdgeBaseS___ZlsRNSt3__113basic_ostreamIcNS_11char_traitsIcEEEE11vtkEdgeBase__ZlsRNSt3__113basic_ostreamIcNS_11char_traitsIcEEEERK14vtkPixelExtent__Znam__Zne11vtkEdgeBaseS___Znwm___cxa_atexit___cxa_begin_catch___cxa_end_catch___gxx_personality_v0___stack_chk_fail___stack_chk_guard_memcpy_memmove_realloc_strcmp_strlendyld_stub_binder__ZL31PyvtkAbstractCellLinks_IsTypeOfP7_objectS0___ZL26PyvtkAbstractCellLinks_IsAP7_objectS0___ZL35PyvtkAbstractCellLinks_SafeDownCastP7_objectS0___ZL34PyvtkAbstractCellLinks_NewInstanceP7_objectS0___ZL33PyvtkAbstractCellLinks_BuildLinksP7_objectS0___ZL32PyvtkAbstractCellLinks_GetIdTypeP7_objectS0___ZL33PyvtkAbstractCellLocator_IsTypeOfP7_objectS0___ZL28PyvtkAbstractCellLocator_IsAP7_objectS0___ZL37PyvtkAbstractCellLocator_SafeDownCastP7_objectS0___ZL36PyvtkAbstractCellLocator_NewInstanceP7_objectS0___ZL48PyvtkAbstractCellLocator_SetNumberOfCellsPerNodeP7_objectS0___ZL56PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeMinValueP7_objectS0___ZL56PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeMaxValueP7_objectS0___ZL48PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeP7_objectS0___ZL43PyvtkAbstractCellLocator_SetCacheCellBoundsP7_objectS0___ZL43PyvtkAbstractCellLocator_GetCacheCellBoundsP7_objectS0___ZL42PyvtkAbstractCellLocator_CacheCellBoundsOnP7_objectS0___ZL43PyvtkAbstractCellLocator_CacheCellBoundsOffP7_objectS0___ZL43PyvtkAbstractCellLocator_SetRetainCellListsP7_objectS0___ZL43PyvtkAbstractCellLocator_GetRetainCellListsP7_objectS0___ZL42PyvtkAbstractCellLocator_RetainCellListsOnP7_objectS0___ZL43PyvtkAbstractCellLocator_RetainCellListsOffP7_objectS0___ZL42PyvtkAbstractCellLocator_SetLazyEvaluationP7_objectS0___ZL42PyvtkAbstractCellLocator_GetLazyEvaluationP7_objectS0___ZL41PyvtkAbstractCellLocator_LazyEvaluationOnP7_objectS0___ZL42PyvtkAbstractCellLocator_LazyEvaluationOffP7_objectS0___ZL54PyvtkAbstractCellLocator_SetUseExistingSearchStructureP7_objectS0___ZL54PyvtkAbstractCellLocator_GetUseExistingSearchStructureP7_objectS0___ZL53PyvtkAbstractCellLocator_UseExistingSearchStructureOnP7_objectS0___ZL54PyvtkAbstractCellLocator_UseExistingSearchStructureOffP7_objectS0___ZL42PyvtkAbstractCellLocator_IntersectWithLineP7_objectS0___ZL41PyvtkAbstractCellLocator_FindClosestPointP7_objectS0___ZL53PyvtkAbstractCellLocator_FindClosestPointWithinRadiusP7_objectS0___ZL46PyvtkAbstractCellLocator_FindCellsWithinBoundsP7_objectS0___ZL43PyvtkAbstractCellLocator_FindCellsAlongLineP7_objectS0___ZL33PyvtkAbstractCellLocator_FindCellP7_objectS0___ZL41PyvtkAbstractCellLocator_InsideCellBoundsP7_objectS0___ZL34PyvtkAbstractPointLocator_IsTypeOfP7_objectS0___ZL29PyvtkAbstractPointLocator_IsAP7_objectS0___ZL38PyvtkAbstractPointLocator_SafeDownCastP7_objectS0___ZL37PyvtkAbstractPointLocator_NewInstanceP7_objectS0___ZL42PyvtkAbstractPointLocator_FindClosestPointP7_objectS0___ZL54PyvtkAbstractPointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL44PyvtkAbstractPointLocator_FindClosestNPointsP7_objectS0___ZL48PyvtkAbstractPointLocator_FindPointsWithinRadiusP7_objectS0___ZL35PyvtkAbstractPointLocator_GetBoundsP7_objectS0___ZL44PyvtkAbstractPointLocator_GetNumberOfBucketsP7_objectS0___ZL37PyvtkAdjacentVertexIterator_StaticNewv__ZL36PyvtkAdjacentVertexIterator_IsTypeOfP7_objectS0___ZL31PyvtkAdjacentVertexIterator_IsAP7_objectS0___ZL40PyvtkAdjacentVertexIterator_SafeDownCastP7_objectS0___ZL39PyvtkAdjacentVertexIterator_NewInstanceP7_objectS0___ZL38PyvtkAdjacentVertexIterator_InitializeP7_objectS0___ZL36PyvtkAdjacentVertexIterator_GetGraphP7_objectS0___ZL37PyvtkAdjacentVertexIterator_GetVertexP7_objectS0___ZL32PyvtkAdjacentVertexIterator_NextP7_objectS0___ZL35PyvtkAdjacentVertexIterator_HasNextP7_objectS0___ZL17PyvtkAMRBox_CCopyPKv__ZL18PyvtkAMRBox_DeleteP7_object__ZL16PyvtkAMRBox_HashP7_object__ZL23PyvtkAMRBox_RichCompareP7_objectS0_i__ZL15PyvtkAMRBox_NewP11_typeobjectP7_objectS2___ZL22PyvtkAMRBox_InvalidateP7_objectS0___ZL26PyvtkAMRBox_EmptyDimensionP7_objectS0___ZL25PyvtkAMRBox_SetDimensionsP7_objectS0___ZL25PyvtkAMRBox_GetDimensionsP7_objectS0___ZL28PyvtkAMRBox_GetNumberOfCellsP7_objectS0___ZL28PyvtkAMRBox_GetNumberOfNodesP7_objectS0___ZL28PyvtkAMRBox_ComputeDimensionP7_objectS0___ZL23PyvtkAMRBox_GetLoCornerP7_objectS0___ZL23PyvtkAMRBox_GetHiCornerP7_objectS0___ZL28PyvtkAMRBox_GetValidHiCornerP7_objectS0___ZL17PyvtkAMRBox_EmptyP7_objectS0___ZL21PyvtkAMRBox_IsInvalidP7_objectS0___ZL21PyvtkAMRBox_SerializeP7_objectS0___ZL23PyvtkAMRBox_DeserializeP7_objectS0___ZL42PyvtkAMRBox_DoesBoxIntersectAlongDimensionP7_objectS0___ZL25PyvtkAMRBox_DoesIntersectP7_objectS0___ZL19PyvtkAMRBox_CoarsenP7_objectS0___ZL18PyvtkAMRBox_RefineP7_objectS0___ZL16PyvtkAMRBox_GrowP7_objectS0___ZL18PyvtkAMRBox_ShrinkP7_objectS0___ZL17PyvtkAMRBox_ShiftP7_objectS0___ZL21PyvtkAMRBox_IntersectP7_objectS0___ZL20PyvtkAMRBox_ContainsP7_objectS0___ZL26PyvtkAMRBox_GetGhostVectorP7_objectS0___ZL24PyvtkAMRBox_RemoveGhostsP7_objectS0___ZL23PyvtkAMRBox_GetBytesizeP7_objectS0___ZL30PyvtkAMRBox_GetCellLinearIndexP7_objectS0___ZL21PyvtkAMRBox_GetBoundsP7_objectS0___ZL24PyvtkAMRBox_GetBoxOriginP7_objectS0___ZL20PyvtkAMRBox_HasPointP7_objectS0___ZL40PyvtkAMRBox_ComputeStructuredCoordinatesP7_objectS0___ZL28PyvtkAMRBox_SetDimensions_s2P7_objectS0___ZL28PyvtkAMRBox_SetDimensions_s3P7_objectS0___ZL23PyvtkAMRBox_Contains_s2P7_objectS0___ZL23PyvtkAMRBox_Contains_s3P7_objectS0___ZL24PyvtkAMRBox_vtkAMRBox_s2P7_objectS0___ZL24PyvtkAMRBox_vtkAMRBox_s6P7_objectS0___ZL26PyvtkAMRUtilities_IsTypeOfP7_objectS0___ZL21PyvtkAMRUtilities_IsAP7_objectS0___ZL30PyvtkAMRUtilities_SafeDownCastP7_objectS0___ZL29PyvtkAMRUtilities_NewInstanceP7_objectS0___ZL34PyvtkAMRUtilities_StripGhostLayersP7_objectS0___ZL51PyvtkAMRUtilities_HasPartiallyOverlappingGhostCellsP7_objectS0___ZL28PyvtkAMRUtilities_BlankCellsP7_objectS0___ZL29PyvtkAnimationScene_StaticNewv__ZL28PyvtkAnimationScene_IsTypeOfP7_objectS0___ZL23PyvtkAnimationScene_IsAP7_objectS0___ZL32PyvtkAnimationScene_SafeDownCastP7_objectS0___ZL31PyvtkAnimationScene_NewInstanceP7_objectS0___ZL31PyvtkAnimationScene_SetPlayModeP7_objectS0___ZL37PyvtkAnimationScene_SetModeToSequenceP7_objectS0___ZL37PyvtkAnimationScene_SetModeToRealTimeP7_objectS0___ZL31PyvtkAnimationScene_GetPlayModeP7_objectS0___ZL32PyvtkAnimationScene_SetFrameRateP7_objectS0___ZL32PyvtkAnimationScene_GetFrameRateP7_objectS0___ZL26PyvtkAnimationScene_AddCueP7_objectS0___ZL29PyvtkAnimationScene_RemoveCueP7_objectS0___ZL33PyvtkAnimationScene_RemoveAllCuesP7_objectS0___ZL35PyvtkAnimationScene_GetNumberOfCuesP7_objectS0___ZL24PyvtkAnimationScene_PlayP7_objectS0___ZL24PyvtkAnimationScene_StopP7_objectS0___ZL27PyvtkAnimationScene_SetLoopP7_objectS0___ZL27PyvtkAnimationScene_GetLoopP7_objectS0___ZL36PyvtkAnimationScene_SetAnimationTimeP7_objectS0___ZL31PyvtkAnimationScene_SetTimeModeP7_objectS0___ZL28PyvtkAnimationScene_IsInPlayP7_objectS0___ZL25PyvtkAnnotation_StaticNewv__ZL24PyvtkAnnotation_IsTypeOfP7_objectS0___ZL19PyvtkAnnotation_IsAP7_objectS0___ZL28PyvtkAnnotation_SafeDownCastP7_objectS0___ZL27PyvtkAnnotation_NewInstanceP7_objectS0___ZL28PyvtkAnnotation_GetSelectionP7_objectS0___ZL28PyvtkAnnotation_SetSelectionP7_objectS0___ZL23PyvtkAnnotation_GetDataP7_objectS0___ZL21PyvtkAnnotation_LABELP7_objectS0___ZL21PyvtkAnnotation_COLORP7_objectS0___ZL23PyvtkAnnotation_OPACITYP7_objectS0___ZL26PyvtkAnnotation_ICON_INDEXP7_objectS0___ZL22PyvtkAnnotation_ENABLEP7_objectS0___ZL20PyvtkAnnotation_HIDEP7_objectS0___ZL20PyvtkAnnotation_DATAP7_objectS0___ZL26PyvtkAnnotation_InitializeP7_objectS0___ZL27PyvtkAnnotation_ShallowCopyP7_objectS0___ZL24PyvtkAnnotation_DeepCopyP7_objectS0___ZL24PyvtkAnnotation_GetMTimeP7_objectS0___ZL26PyvtkAnnotation_GetData_s2P7_objectS0___ZL26PyvtkAnnotation_GetData_s1P7_objectS0___ZL31PyvtkAnnotationLayers_StaticNewv__ZL30PyvtkAnnotationLayers_IsTypeOfP7_objectS0___ZL25PyvtkAnnotationLayers_IsAP7_objectS0___ZL34PyvtkAnnotationLayers_SafeDownCastP7_objectS0___ZL33PyvtkAnnotationLayers_NewInstanceP7_objectS0___ZL42PyvtkAnnotationLayers_SetCurrentAnnotationP7_objectS0___ZL42PyvtkAnnotationLayers_GetCurrentAnnotationP7_objectS0___ZL41PyvtkAnnotationLayers_SetCurrentSelectionP7_objectS0___ZL41PyvtkAnnotationLayers_GetCurrentSelectionP7_objectS0___ZL44PyvtkAnnotationLayers_GetNumberOfAnnotationsP7_objectS0___ZL35PyvtkAnnotationLayers_GetAnnotationP7_objectS0___ZL35PyvtkAnnotationLayers_AddAnnotationP7_objectS0___ZL38PyvtkAnnotationLayers_RemoveAnnotationP7_objectS0___ZL32PyvtkAnnotationLayers_InitializeP7_objectS0___ZL33PyvtkAnnotationLayers_ShallowCopyP7_objectS0___ZL30PyvtkAnnotationLayers_DeepCopyP7_objectS0___ZL29PyvtkAnnotationLayers_GetDataP7_objectS0___ZL30PyvtkAnnotationLayers_GetMTimeP7_objectS0___ZL32PyvtkAnnotationLayers_GetData_s2P7_objectS0___ZL32PyvtkAnnotationLayers_GetData_s1P7_objectS0___ZL24PyvtkArrayData_StaticNewv__ZL23PyvtkArrayData_IsTypeOfP7_objectS0___ZL18PyvtkArrayData_IsAP7_objectS0___ZL27PyvtkArrayData_SafeDownCastP7_objectS0___ZL26PyvtkArrayData_NewInstanceP7_objectS0___ZL22PyvtkArrayData_GetDataP7_objectS0___ZL23PyvtkArrayData_AddArrayP7_objectS0___ZL26PyvtkArrayData_ClearArraysP7_objectS0___ZL32PyvtkArrayData_GetNumberOfArraysP7_objectS0___ZL23PyvtkArrayData_GetArrayP7_objectS0___ZL29PyvtkArrayData_GetArrayByNameP7_objectS0___ZL32PyvtkArrayData_GetDataObjectTypeP7_objectS0___ZL26PyvtkArrayData_ShallowCopyP7_objectS0___ZL23PyvtkArrayData_DeepCopyP7_objectS0___ZL25PyvtkArrayData_GetData_s2P7_objectS0___ZL25PyvtkArrayData_GetData_s1P7_objectS0___GLOBAL__sub_I_vtkArrayListTemplatePython.cxx__ZL36PyvtkAttributesErrorMetric_StaticNewv__ZL35PyvtkAttributesErrorMetric_IsTypeOfP7_objectS0___ZL30PyvtkAttributesErrorMetric_IsAP7_objectS0___ZL39PyvtkAttributesErrorMetric_SafeDownCastP7_objectS0___ZL38PyvtkAttributesErrorMetric_NewInstanceP7_objectS0___ZL56PyvtkAttributesErrorMetric_GetAbsoluteAttributeToleranceP7_objectS0___ZL56PyvtkAttributesErrorMetric_SetAbsoluteAttributeToleranceP7_objectS0___ZL48PyvtkAttributesErrorMetric_GetAttributeToleranceP7_objectS0___ZL48PyvtkAttributesErrorMetric_SetAttributeToleranceP7_objectS0___ZL50PyvtkAttributesErrorMetric_RequiresEdgeSubdivisionP7_objectS0___ZL35PyvtkAttributesErrorMetric_GetErrorP7_objectS0___ZL30PyvtkBiQuadraticQuad_StaticNewv__ZL29PyvtkBiQuadraticQuad_IsTypeOfP7_objectS0___ZL24PyvtkBiQuadraticQuad_IsAP7_objectS0___ZL33PyvtkBiQuadraticQuad_SafeDownCastP7_objectS0___ZL32PyvtkBiQuadraticQuad_NewInstanceP7_objectS0___ZL32PyvtkBiQuadraticQuad_GetCellTypeP7_objectS0___ZL37PyvtkBiQuadraticQuad_GetCellDimensionP7_objectS0___ZL37PyvtkBiQuadraticQuad_GetNumberOfEdgesP7_objectS0___ZL37PyvtkBiQuadraticQuad_GetNumberOfFacesP7_objectS0___ZL28PyvtkBiQuadraticQuad_GetEdgeP7_objectS0___ZL28PyvtkBiQuadraticQuad_GetFaceP7_objectS0___ZL33PyvtkBiQuadraticQuad_CellBoundaryP7_objectS0___ZL37PyvtkBiQuadraticQuad_EvaluatePositionP7_objectS0___ZL37PyvtkBiQuadraticQuad_EvaluateLocationP7_objectS0___ZL32PyvtkBiQuadraticQuad_TriangulateP7_objectS0___ZL32PyvtkBiQuadraticQuad_DerivativesP7_objectS0___ZL40PyvtkBiQuadraticQuad_GetParametricCoordsP7_objectS0___ZL28PyvtkBiQuadraticQuad_ContourP7_objectS0___ZL25PyvtkBiQuadraticQuad_ClipP7_objectS0___ZL38PyvtkBiQuadraticQuad_IntersectWithLineP7_objectS0___ZL40PyvtkBiQuadraticQuad_GetParametricCenterP7_objectS0___ZL41PyvtkBiQuadraticQuad_InterpolateFunctionsP7_objectS0___ZL38PyvtkBiQuadraticQuad_InterpolateDerivsP7_objectS0___ZL45PyvtkBiQuadraticQuadraticHexahedron_StaticNewv__ZL44PyvtkBiQuadraticQuadraticHexahedron_IsTypeOfP7_objectS0___ZL39PyvtkBiQuadraticQuadraticHexahedron_IsAP7_objectS0___ZL48PyvtkBiQuadraticQuadraticHexahedron_SafeDownCastP7_objectS0___ZL47PyvtkBiQuadraticQuadraticHexahedron_NewInstanceP7_objectS0___ZL47PyvtkBiQuadraticQuadraticHexahedron_GetCellTypeP7_objectS0___ZL52PyvtkBiQuadraticQuadraticHexahedron_GetCellDimensionP7_objectS0___ZL52PyvtkBiQuadraticQuadraticHexahedron_GetNumberOfEdgesP7_objectS0___ZL52PyvtkBiQuadraticQuadraticHexahedron_GetNumberOfFacesP7_objectS0___ZL43PyvtkBiQuadraticQuadraticHexahedron_GetEdgeP7_objectS0___ZL43PyvtkBiQuadraticQuadraticHexahedron_GetFaceP7_objectS0___ZL48PyvtkBiQuadraticQuadraticHexahedron_CellBoundaryP7_objectS0___ZL43PyvtkBiQuadraticQuadraticHexahedron_ContourP7_objectS0___ZL52PyvtkBiQuadraticQuadraticHexahedron_EvaluatePositionP7_objectS0___ZL52PyvtkBiQuadraticQuadraticHexahedron_EvaluateLocationP7_objectS0___ZL47PyvtkBiQuadraticQuadraticHexahedron_TriangulateP7_objectS0___ZL47PyvtkBiQuadraticQuadraticHexahedron_DerivativesP7_objectS0___ZL55PyvtkBiQuadraticQuadraticHexahedron_GetParametricCoordsP7_objectS0___ZL40PyvtkBiQuadraticQuadraticHexahedron_ClipP7_objectS0___ZL53PyvtkBiQuadraticQuadraticHexahedron_IntersectWithLineP7_objectS0___ZL58PyvtkBiQuadraticQuadraticHexahedron_InterpolationFunctionsP7_objectS0___ZL55PyvtkBiQuadraticQuadraticHexahedron_InterpolationDerivsP7_objectS0___ZL56PyvtkBiQuadraticQuadraticHexahedron_InterpolateFunctionsP7_objectS0___ZL53PyvtkBiQuadraticQuadraticHexahedron_InterpolateDerivsP7_objectS0___ZL48PyvtkBiQuadraticQuadraticHexahedron_GetEdgeArrayP7_objectS0___ZL48PyvtkBiQuadraticQuadraticHexahedron_GetFaceArrayP7_objectS0___ZL40PyvtkBiQuadraticQuadraticWedge_StaticNewv__ZL39PyvtkBiQuadraticQuadraticWedge_IsTypeOfP7_objectS0___ZL34PyvtkBiQuadraticQuadraticWedge_IsAP7_objectS0___ZL43PyvtkBiQuadraticQuadraticWedge_SafeDownCastP7_objectS0___ZL42PyvtkBiQuadraticQuadraticWedge_NewInstanceP7_objectS0___ZL42PyvtkBiQuadraticQuadraticWedge_GetCellTypeP7_objectS0___ZL47PyvtkBiQuadraticQuadraticWedge_GetCellDimensionP7_objectS0___ZL47PyvtkBiQuadraticQuadraticWedge_GetNumberOfEdgesP7_objectS0___ZL47PyvtkBiQuadraticQuadraticWedge_GetNumberOfFacesP7_objectS0___ZL38PyvtkBiQuadraticQuadraticWedge_GetEdgeP7_objectS0___ZL38PyvtkBiQuadraticQuadraticWedge_GetFaceP7_objectS0___ZL43PyvtkBiQuadraticQuadraticWedge_CellBoundaryP7_objectS0___ZL38PyvtkBiQuadraticQuadraticWedge_ContourP7_objectS0___ZL47PyvtkBiQuadraticQuadraticWedge_EvaluatePositionP7_objectS0___ZL47PyvtkBiQuadraticQuadraticWedge_EvaluateLocationP7_objectS0___ZL42PyvtkBiQuadraticQuadraticWedge_TriangulateP7_objectS0___ZL42PyvtkBiQuadraticQuadraticWedge_DerivativesP7_objectS0___ZL50PyvtkBiQuadraticQuadraticWedge_GetParametricCoordsP7_objectS0___ZL35PyvtkBiQuadraticQuadraticWedge_ClipP7_objectS0___ZL48PyvtkBiQuadraticQuadraticWedge_IntersectWithLineP7_objectS0___ZL50PyvtkBiQuadraticQuadraticWedge_GetParametricCenterP7_objectS0___ZL53PyvtkBiQuadraticQuadraticWedge_InterpolationFunctionsP7_objectS0___ZL50PyvtkBiQuadraticQuadraticWedge_InterpolationDerivsP7_objectS0___ZL51PyvtkBiQuadraticQuadraticWedge_InterpolateFunctionsP7_objectS0___ZL48PyvtkBiQuadraticQuadraticWedge_InterpolateDerivsP7_objectS0___ZL43PyvtkBiQuadraticQuadraticWedge_GetEdgeArrayP7_objectS0___ZL43PyvtkBiQuadraticQuadraticWedge_GetFaceArrayP7_objectS0___ZL34PyvtkBiQuadraticTriangle_StaticNewv__ZL33PyvtkBiQuadraticTriangle_IsTypeOfP7_objectS0___ZL28PyvtkBiQuadraticTriangle_IsAP7_objectS0___ZL37PyvtkBiQuadraticTriangle_SafeDownCastP7_objectS0___ZL36PyvtkBiQuadraticTriangle_NewInstanceP7_objectS0___ZL36PyvtkBiQuadraticTriangle_GetCellTypeP7_objectS0___ZL41PyvtkBiQuadraticTriangle_GetCellDimensionP7_objectS0___ZL41PyvtkBiQuadraticTriangle_GetNumberOfEdgesP7_objectS0___ZL41PyvtkBiQuadraticTriangle_GetNumberOfFacesP7_objectS0___ZL32PyvtkBiQuadraticTriangle_GetEdgeP7_objectS0___ZL32PyvtkBiQuadraticTriangle_GetFaceP7_objectS0___ZL37PyvtkBiQuadraticTriangle_CellBoundaryP7_objectS0___ZL32PyvtkBiQuadraticTriangle_ContourP7_objectS0___ZL41PyvtkBiQuadraticTriangle_EvaluatePositionP7_objectS0___ZL41PyvtkBiQuadraticTriangle_EvaluateLocationP7_objectS0___ZL36PyvtkBiQuadraticTriangle_TriangulateP7_objectS0___ZL36PyvtkBiQuadraticTriangle_DerivativesP7_objectS0___ZL44PyvtkBiQuadraticTriangle_GetParametricCoordsP7_objectS0___ZL29PyvtkBiQuadraticTriangle_ClipP7_objectS0___ZL42PyvtkBiQuadraticTriangle_IntersectWithLineP7_objectS0___ZL44PyvtkBiQuadraticTriangle_GetParametricCenterP7_objectS0___ZL46PyvtkBiQuadraticTriangle_GetParametricDistanceP7_objectS0___ZL47PyvtkBiQuadraticTriangle_InterpolationFunctionsP7_objectS0___ZL44PyvtkBiQuadraticTriangle_InterpolationDerivsP7_objectS0___ZL45PyvtkBiQuadraticTriangle_InterpolateFunctionsP7_objectS0___ZL42PyvtkBiQuadraticTriangle_InterpolateDerivsP7_objectS0___ZL18PyvtkBox_StaticNewv__ZL17PyvtkBox_IsTypeOfP7_objectS0___ZL12PyvtkBox_IsAP7_objectS0___ZL21PyvtkBox_SafeDownCastP7_objectS0___ZL20PyvtkBox_NewInstanceP7_objectS0___ZL25PyvtkBox_EvaluateFunctionP7_objectS0___ZL25PyvtkBox_EvaluateGradientP7_objectS0___ZL16PyvtkBox_SetXMinP7_objectS0___ZL16PyvtkBox_GetXMinP7_objectS0___ZL16PyvtkBox_SetXMaxP7_objectS0___ZL16PyvtkBox_GetXMaxP7_objectS0___ZL18PyvtkBox_SetBoundsP7_objectS0___ZL18PyvtkBox_GetBoundsP7_objectS0___ZL18PyvtkBox_AddBoundsP7_objectS0___ZL21PyvtkBox_IntersectBoxP7_objectS0___ZL26PyvtkBox_IntersectWithLineP7_objectS0___ZL27PyvtkBox_IntersectWithPlaneP7_objectS0___ZL22PyvtkBSPCuts_StaticNewv__ZL21PyvtkBSPCuts_IsTypeOfP7_objectS0___ZL16PyvtkBSPCuts_IsAP7_objectS0___ZL25PyvtkBSPCuts_SafeDownCastP7_objectS0___ZL24PyvtkBSPCuts_NewInstanceP7_objectS0___ZL23PyvtkBSPCuts_CreateCutsP7_objectS0___ZL26PyvtkBSPCuts_GetKdNodeTreeP7_objectS0___ZL28PyvtkBSPCuts_GetNumberOfCutsP7_objectS0___ZL22PyvtkBSPCuts_GetArraysP7_objectS0___ZL19PyvtkBSPCuts_EqualsP7_objectS0___ZL22PyvtkBSPCuts_PrintTreeP7_objectS0___ZL24PyvtkBSPCuts_PrintArraysP7_objectS0___ZL20PyvtkBSPCuts_GetDataP7_objectS0___ZL23PyvtkBSPCuts_InitializeP7_objectS0___ZL24PyvtkBSPCuts_ShallowCopyP7_objectS0___ZL21PyvtkBSPCuts_DeepCopyP7_objectS0___ZL23PyvtkBSPCuts_GetData_s2P7_objectS0___ZL23PyvtkBSPCuts_GetData_s1P7_objectS0___ZL31PyvtkBSPIntersections_StaticNewv__ZL30PyvtkBSPIntersections_IsTypeOfP7_objectS0___ZL25PyvtkBSPIntersections_IsAP7_objectS0___ZL34PyvtkBSPIntersections_SafeDownCastP7_objectS0___ZL33PyvtkBSPIntersections_NewInstanceP7_objectS0___ZL29PyvtkBSPIntersections_SetCutsP7_objectS0___ZL29PyvtkBSPIntersections_GetCutsP7_objectS0___ZL31PyvtkBSPIntersections_GetBoundsP7_objectS0___ZL40PyvtkBSPIntersections_GetNumberOfRegionsP7_objectS0___ZL37PyvtkBSPIntersections_GetRegionBoundsP7_objectS0___ZL41PyvtkBSPIntersections_GetRegionDataBoundsP7_objectS0___ZL35PyvtkBSPIntersections_IntersectsBoxP7_objectS0___ZL39PyvtkBSPIntersections_IntersectsSphere2P7_objectS0___ZL36PyvtkBSPIntersections_IntersectsCellP7_objectS0___ZL60PyvtkBSPIntersections_GetComputeIntersectionsUsingDataBoundsP7_objectS0___ZL60PyvtkBSPIntersections_SetComputeIntersectionsUsingDataBoundsP7_objectS0___ZL59PyvtkBSPIntersections_ComputeIntersectionsUsingDataBoundsOnP7_objectS0___ZL60PyvtkBSPIntersections_ComputeIntersectionsUsingDataBoundsOffP7_objectS0___ZL39PyvtkBSPIntersections_IntersectsCell_s1P7_objectS0___ZL39PyvtkBSPIntersections_IntersectsCell_s2P7_objectS0___ZL20PyvtkCell3D_IsTypeOfP7_objectS0___ZL15PyvtkCell3D_IsAP7_objectS0___ZL24PyvtkCell3D_SafeDownCastP7_objectS0___ZL23PyvtkCell3D_NewInstanceP7_objectS0___ZL25PyvtkCell3D_GetEdgePointsP7_objectS0___ZL25PyvtkCell3D_GetFacePointsP7_objectS0___ZL19PyvtkCell3D_ContourP7_objectS0___ZL16PyvtkCell3D_ClipP7_objectS0___ZL28PyvtkCell3D_GetCellDimensionP7_objectS0___ZL29PyvtkCell3D_SetMergeToleranceP7_objectS0___ZL37PyvtkCell3D_GetMergeToleranceMinValueP7_objectS0___ZL37PyvtkCell3D_GetMergeToleranceMaxValueP7_objectS0___ZL29PyvtkCell3D_GetMergeToleranceP7_objectS0___ZL24PyvtkCellArray_StaticNewv__ZL23PyvtkCellArray_IsTypeOfP7_objectS0___ZL18PyvtkCellArray_IsAP7_objectS0___ZL27PyvtkCellArray_SafeDownCastP7_objectS0___ZL26PyvtkCellArray_NewInstanceP7_objectS0___ZL23PyvtkCellArray_AllocateP7_objectS0___ZL25PyvtkCellArray_InitializeP7_objectS0___ZL31PyvtkCellArray_GetNumberOfCellsP7_objectS0___ZL31PyvtkCellArray_SetNumberOfCellsP7_objectS0___ZL27PyvtkCellArray_EstimateSizeP7_objectS0___ZL28PyvtkCellArray_InitTraversalP7_objectS0___ZL26PyvtkCellArray_GetNextCellP7_objectS0___ZL22PyvtkCellArray_GetSizeP7_objectS0___ZL45PyvtkCellArray_GetNumberOfConnectivityEntriesP7_objectS0___ZL22PyvtkCellArray_GetCellP7_objectS0___ZL29PyvtkCellArray_InsertNextCellP7_objectS0___ZL30PyvtkCellArray_InsertCellPointP7_objectS0___ZL30PyvtkCellArray_UpdateCellCountP7_objectS0___ZL32PyvtkCellArray_GetInsertLocationP7_objectS0___ZL35PyvtkCellArray_GetTraversalLocationP7_objectS0___ZL35PyvtkCellArray_SetTraversalLocationP7_objectS0___ZL26PyvtkCellArray_ReverseCellP7_objectS0___ZL26PyvtkCellArray_ReplaceCellP7_objectS0___ZL29PyvtkCellArray_GetMaxCellSizeP7_objectS0___ZL25PyvtkCellArray_GetPointerP7_objectS0___ZL27PyvtkCellArray_WritePointerP7_objectS0___ZL23PyvtkCellArray_SetCellsP7_objectS0___ZL23PyvtkCellArray_DeepCopyP7_objectS0___ZL22PyvtkCellArray_GetDataP7_objectS0___ZL20PyvtkCellArray_ResetP7_objectS0___ZL22PyvtkCellArray_SqueezeP7_objectS0___ZL34PyvtkCellArray_GetActualMemorySizeP7_objectS0___ZL32PyvtkCellArray_InsertNextCell_s1P7_objectS0___ZL32PyvtkCellArray_InsertNextCell_s3P7_objectS0___ZL32PyvtkCellArray_InsertNextCell_s4P7_objectS0___GLOBAL__sub_I_vtkCellArrayPython.cxx__ZL18PyvtkCell_IsTypeOfP7_objectS0___ZL13PyvtkCell_IsAP7_objectS0___ZL22PyvtkCell_SafeDownCastP7_objectS0___ZL21PyvtkCell_NewInstanceP7_objectS0___ZL20PyvtkCell_InitializeP7_objectS0___ZL21PyvtkCell_ShallowCopyP7_objectS0___ZL18PyvtkCell_DeepCopyP7_objectS0___ZL21PyvtkCell_GetCellTypeP7_objectS0___ZL26PyvtkCell_GetCellDimensionP7_objectS0___ZL18PyvtkCell_IsLinearP7_objectS0___ZL32PyvtkCell_RequiresInitializationP7_objectS0___ZL24PyvtkCell_IsExplicitCellP7_objectS0___ZL44PyvtkCell_RequiresExplicitFaceRepresentationP7_objectS0___ZL18PyvtkCell_SetFacesP7_objectS0___ZL18PyvtkCell_GetFacesP7_objectS0___ZL19PyvtkCell_GetPointsP7_objectS0___ZL27PyvtkCell_GetNumberOfPointsP7_objectS0___ZL26PyvtkCell_GetNumberOfEdgesP7_objectS0___ZL26PyvtkCell_GetNumberOfFacesP7_objectS0___ZL21PyvtkCell_GetPointIdsP7_objectS0___ZL20PyvtkCell_GetPointIdP7_objectS0___ZL17PyvtkCell_GetEdgeP7_objectS0___ZL17PyvtkCell_GetFaceP7_objectS0___ZL22PyvtkCell_CellBoundaryP7_objectS0___ZL26PyvtkCell_EvaluatePositionP7_objectS0___ZL26PyvtkCell_EvaluateLocationP7_objectS0___ZL17PyvtkCell_ContourP7_objectS0___ZL14PyvtkCell_ClipP7_objectS0___ZL27PyvtkCell_IntersectWithLineP7_objectS0___ZL21PyvtkCell_TriangulateP7_objectS0___ZL21PyvtkCell_DerivativesP7_objectS0___ZL19PyvtkCell_GetBoundsP7_objectS0___ZL20PyvtkCell_GetLength2P7_objectS0___ZL29PyvtkCell_GetParametricCenterP7_objectS0___ZL31PyvtkCell_GetParametricDistanceP7_objectS0___ZL23PyvtkCell_IsPrimaryCellP7_objectS0___ZL29PyvtkCell_GetParametricCoordsP7_objectS0___ZL30PyvtkCell_InterpolateFunctionsP7_objectS0___ZL27PyvtkCell_InterpolateDerivsP7_objectS0___ZL23PyvtkCellData_StaticNewv__ZL22PyvtkCellData_IsTypeOfP7_objectS0___ZL17PyvtkCellData_IsAP7_objectS0___ZL26PyvtkCellData_SafeDownCastP7_objectS0___ZL25PyvtkCellData_NewInstanceP7_objectS0___ZL26PyvtkCellIterator_IsTypeOfP7_objectS0___ZL21PyvtkCellIterator_IsAP7_objectS0___ZL30PyvtkCellIterator_SafeDownCastP7_objectS0___ZL29PyvtkCellIterator_NewInstanceP7_objectS0___ZL31PyvtkCellIterator_InitTraversalP7_objectS0___ZL30PyvtkCellIterator_GoToNextCellP7_objectS0___ZL37PyvtkCellIterator_IsDoneWithTraversalP7_objectS0___ZL29PyvtkCellIterator_GetCellTypeP7_objectS0___ZL34PyvtkCellIterator_GetCellDimensionP7_objectS0___ZL27PyvtkCellIterator_GetCellIdP7_objectS0___ZL29PyvtkCellIterator_GetPointIdsP7_objectS0___ZL27PyvtkCellIterator_GetPointsP7_objectS0___ZL26PyvtkCellIterator_GetFacesP7_objectS0___ZL25PyvtkCellIterator_GetCellP7_objectS0___ZL35PyvtkCellIterator_GetNumberOfPointsP7_objectS0___ZL34PyvtkCellIterator_GetNumberOfFacesP7_objectS0___ZN15vtkCellIterator16GetNumberOfFacesEv__ZL24PyvtkCellLinks_StaticNewv__ZL23PyvtkCellLinks_IsTypeOfP7_objectS0___ZL18PyvtkCellLinks_IsAP7_objectS0___ZL27PyvtkCellLinks_SafeDownCastP7_objectS0___ZL26PyvtkCellLinks_NewInstanceP7_objectS0___ZL25PyvtkCellLinks_BuildLinksP7_objectS0___ZL23PyvtkCellLinks_AllocateP7_objectS0___ZL25PyvtkCellLinks_InitializeP7_objectS0___ZL24PyvtkCellLinks_GetNcellsP7_objectS0___ZL23PyvtkCellLinks_GetCellsP7_objectS0___ZL30PyvtkCellLinks_InsertNextPointP7_objectS0___ZL38PyvtkCellLinks_InsertNextCellReferenceP7_objectS0___ZL26PyvtkCellLinks_DeletePointP7_objectS0___ZL34PyvtkCellLinks_RemoveCellReferenceP7_objectS0___ZL31PyvtkCellLinks_AddCellReferenceP7_objectS0___ZL29PyvtkCellLinks_ResizeCellListP7_objectS0___ZL22PyvtkCellLinks_SqueezeP7_objectS0___ZL20PyvtkCellLinks_ResetP7_objectS0___ZL34PyvtkCellLinks_GetActualMemorySizeP7_objectS0___ZL23PyvtkCellLinks_DeepCopyP7_objectS0___ZL26PyvtkCellLocator_StaticNewv__ZL25PyvtkCellLocator_IsTypeOfP7_objectS0___ZL20PyvtkCellLocator_IsAP7_objectS0___ZL29PyvtkCellLocator_SafeDownCastP7_objectS0___ZL28PyvtkCellLocator_NewInstanceP7_objectS0___ZL42PyvtkCellLocator_SetNumberOfCellsPerBucketP7_objectS0___ZL42PyvtkCellLocator_GetNumberOfCellsPerBucketP7_objectS0___ZL34PyvtkCellLocator_IntersectWithLineP7_objectS0___ZL33PyvtkCellLocator_FindClosestPointP7_objectS0___ZL45PyvtkCellLocator_FindClosestPointWithinRadiusP7_objectS0___ZL25PyvtkCellLocator_GetCellsP7_objectS0___ZL35PyvtkCellLocator_GetNumberOfBucketsP7_objectS0___ZL25PyvtkCellLocator_FindCellP7_objectS0___ZL38PyvtkCellLocator_FindCellsWithinBoundsP7_objectS0___ZL35PyvtkCellLocator_FindCellsAlongLineP7_objectS0___ZL36PyvtkCellLocator_FreeSearchStructureP7_objectS0___ZL29PyvtkCellLocator_BuildLocatorP7_objectS0___ZL37PyvtkCellLocator_BuildLocatorIfNeededP7_objectS0___ZL34PyvtkCellLocator_ForceBuildLocatorP7_objectS0___ZL37PyvtkCellLocator_BuildLocatorInternalP7_objectS0___ZL39PyvtkCellLocator_GenerateRepresentationP7_objectS0___ZL24PyvtkCellTypes_StaticNewv__ZL23PyvtkCellTypes_IsTypeOfP7_objectS0___ZL18PyvtkCellTypes_IsAP7_objectS0___ZL27PyvtkCellTypes_SafeDownCastP7_objectS0___ZL26PyvtkCellTypes_NewInstanceP7_objectS0___ZL23PyvtkCellTypes_AllocateP7_objectS0___ZL25PyvtkCellTypes_InsertCellP7_objectS0___ZL29PyvtkCellTypes_InsertNextCellP7_objectS0___ZL27PyvtkCellTypes_SetCellTypesP7_objectS0___ZL30PyvtkCellTypes_GetCellLocationP7_objectS0___ZL25PyvtkCellTypes_DeleteCellP7_objectS0___ZL31PyvtkCellTypes_GetNumberOfTypesP7_objectS0___ZL21PyvtkCellTypes_IsTypeP7_objectS0___ZL29PyvtkCellTypes_InsertNextTypeP7_objectS0___ZL26PyvtkCellTypes_GetCellTypeP7_objectS0___ZL22PyvtkCellTypes_SqueezeP7_objectS0___ZL20PyvtkCellTypes_ResetP7_objectS0___ZL34PyvtkCellTypes_GetActualMemorySizeP7_objectS0___ZL23PyvtkCellTypes_DeepCopyP7_objectS0___ZL37PyvtkCellTypes_GetClassNameFromTypeIdP7_objectS0___ZL37PyvtkCellTypes_GetTypeIdFromClassNameP7_objectS0___ZL23PyvtkCellTypes_IsLinearP7_objectS0___ZL30PyvtkCellTypes_SetCellTypes_s1P7_objectS0___ZL30PyvtkCellTypes_SetCellTypes_s2P7_objectS0___GLOBAL__sub_I_vtkCellTypesPython.cxx__ZL30PyvtkCompositeDataSet_IsTypeOfP7_objectS0___ZL25PyvtkCompositeDataSet_IsAP7_objectS0___ZL34PyvtkCompositeDataSet_SafeDownCastP7_objectS0___ZL33PyvtkCompositeDataSet_NewInstanceP7_objectS0___ZL33PyvtkCompositeDataSet_NewIteratorP7_objectS0___ZL39PyvtkCompositeDataSet_GetDataObjectTypeP7_objectS0___ZL35PyvtkCompositeDataSet_CopyStructureP7_objectS0___ZL32PyvtkCompositeDataSet_SetDataSetP7_objectS0___ZL32PyvtkCompositeDataSet_GetDataSetP7_objectS0___ZL41PyvtkCompositeDataSet_GetActualMemorySizeP7_objectS0___ZL29PyvtkCompositeDataSet_GetDataP7_objectS0___ZL32PyvtkCompositeDataSet_InitializeP7_objectS0___ZL33PyvtkCompositeDataSet_ShallowCopyP7_objectS0___ZL30PyvtkCompositeDataSet_DeepCopyP7_objectS0___ZL39PyvtkCompositeDataSet_GetNumberOfPointsP7_objectS0___ZL26PyvtkCompositeDataSet_NAMEP7_objectS0___ZL52PyvtkCompositeDataSet_CURRENT_PROCESS_CAN_LOAD_BLOCKP7_objectS0___ZL32PyvtkCompositeDataSet_GetData_s2P7_objectS0___ZL32PyvtkCompositeDataSet_GetData_s1P7_objectS0___ZL35PyvtkCompositeDataIterator_IsTypeOfP7_objectS0___ZL30PyvtkCompositeDataIterator_IsAP7_objectS0___ZL39PyvtkCompositeDataIterator_SafeDownCastP7_objectS0___ZL38PyvtkCompositeDataIterator_NewInstanceP7_objectS0___ZL37PyvtkCompositeDataIterator_SetDataSetP7_objectS0___ZL37PyvtkCompositeDataIterator_GetDataSetP7_objectS0___ZL40PyvtkCompositeDataIterator_InitTraversalP7_objectS0___ZL47PyvtkCompositeDataIterator_InitReverseTraversalP7_objectS0___ZL40PyvtkCompositeDataIterator_GoToFirstItemP7_objectS0___ZL39PyvtkCompositeDataIterator_GoToNextItemP7_objectS0___ZL46PyvtkCompositeDataIterator_IsDoneWithTraversalP7_objectS0___ZL47PyvtkCompositeDataIterator_GetCurrentDataObjectP7_objectS0___ZL45PyvtkCompositeDataIterator_GetCurrentMetaDataP7_objectS0___ZL45PyvtkCompositeDataIterator_HasCurrentMetaDataP7_objectS0___ZL44PyvtkCompositeDataIterator_SetSkipEmptyNodesP7_objectS0___ZL44PyvtkCompositeDataIterator_GetSkipEmptyNodesP7_objectS0___ZL43PyvtkCompositeDataIterator_SkipEmptyNodesOnP7_objectS0___ZL44PyvtkCompositeDataIterator_SkipEmptyNodesOffP7_objectS0___ZL46PyvtkCompositeDataIterator_GetCurrentFlatIndexP7_objectS0___ZL37PyvtkCompositeDataIterator_GetReverseP7_objectS0___ZL19PyvtkCone_StaticNewv__ZL18PyvtkCone_IsTypeOfP7_objectS0___ZL13PyvtkCone_IsAP7_objectS0___ZL22PyvtkCone_SafeDownCastP7_objectS0___ZL21PyvtkCone_NewInstanceP7_objectS0___ZL26PyvtkCone_EvaluateFunctionP7_objectS0___ZL26PyvtkCone_EvaluateGradientP7_objectS0___ZL18PyvtkCone_SetAngleP7_objectS0___ZL26PyvtkCone_GetAngleMinValueP7_objectS0___ZL26PyvtkCone_GetAngleMaxValueP7_objectS0___ZL18PyvtkCone_GetAngleP7_objectS0___ZL29PyvtkConvexPointSet_StaticNewv__ZL28PyvtkConvexPointSet_IsTypeOfP7_objectS0___ZL23PyvtkConvexPointSet_IsAP7_objectS0___ZL32PyvtkConvexPointSet_SafeDownCastP7_objectS0___ZL31PyvtkConvexPointSet_NewInstanceP7_objectS0___ZL36PyvtkConvexPointSet_HasFixedTopologyP7_objectS0___ZL33PyvtkConvexPointSet_GetEdgePointsP7_objectS0___ZL33PyvtkConvexPointSet_GetFacePointsP7_objectS0___ZL39PyvtkConvexPointSet_GetParametricCoordsP7_objectS0___ZL31PyvtkConvexPointSet_GetCellTypeP7_objectS0___ZL42PyvtkConvexPointSet_RequiresInitializationP7_objectS0___ZL30PyvtkConvexPointSet_InitializeP7_objectS0___ZL36PyvtkConvexPointSet_GetNumberOfEdgesP7_objectS0___ZL27PyvtkConvexPointSet_GetEdgeP7_objectS0___ZL36PyvtkConvexPointSet_GetNumberOfFacesP7_objectS0___ZL27PyvtkConvexPointSet_GetFaceP7_objectS0___ZL27PyvtkConvexPointSet_ContourP7_objectS0___ZL24PyvtkConvexPointSet_ClipP7_objectS0___ZL36PyvtkConvexPointSet_EvaluatePositionP7_objectS0___ZL36PyvtkConvexPointSet_EvaluateLocationP7_objectS0___ZL37PyvtkConvexPointSet_IntersectWithLineP7_objectS0___ZL31PyvtkConvexPointSet_TriangulateP7_objectS0___ZL31PyvtkConvexPointSet_DerivativesP7_objectS0___ZL32PyvtkConvexPointSet_CellBoundaryP7_objectS0___ZL39PyvtkConvexPointSet_GetParametricCenterP7_objectS0___ZL33PyvtkConvexPointSet_IsPrimaryCellP7_objectS0___ZL40PyvtkConvexPointSet_InterpolateFunctionsP7_objectS0___ZL37PyvtkConvexPointSet_InterpolateDerivsP7_objectS0___ZL24PyvtkCubicLine_StaticNewv__ZL23PyvtkCubicLine_IsTypeOfP7_objectS0___ZL18PyvtkCubicLine_IsAP7_objectS0___ZL27PyvtkCubicLine_SafeDownCastP7_objectS0___ZL26PyvtkCubicLine_NewInstanceP7_objectS0___ZL26PyvtkCubicLine_GetCellTypeP7_objectS0___ZL31PyvtkCubicLine_GetCellDimensionP7_objectS0___ZL31PyvtkCubicLine_GetNumberOfEdgesP7_objectS0___ZL31PyvtkCubicLine_GetNumberOfFacesP7_objectS0___ZL22PyvtkCubicLine_GetEdgeP7_objectS0___ZL22PyvtkCubicLine_GetFaceP7_objectS0___ZL27PyvtkCubicLine_CellBoundaryP7_objectS0___ZL22PyvtkCubicLine_ContourP7_objectS0___ZL31PyvtkCubicLine_EvaluatePositionP7_objectS0___ZL31PyvtkCubicLine_EvaluateLocationP7_objectS0___ZL26PyvtkCubicLine_TriangulateP7_objectS0___ZL26PyvtkCubicLine_DerivativesP7_objectS0___ZL34PyvtkCubicLine_GetParametricCoordsP7_objectS0___ZL36PyvtkCubicLine_GetParametricDistanceP7_objectS0___ZL19PyvtkCubicLine_ClipP7_objectS0___ZL34PyvtkCubicLine_GetParametricCenterP7_objectS0___ZL32PyvtkCubicLine_IntersectWithLineP7_objectS0___ZL37PyvtkCubicLine_InterpolationFunctionsP7_objectS0___ZL34PyvtkCubicLine_InterpolationDerivsP7_objectS0___ZL35PyvtkCubicLine_InterpolateFunctionsP7_objectS0___ZL32PyvtkCubicLine_InterpolateDerivsP7_objectS0___ZL23PyvtkCylinder_StaticNewv__ZL22PyvtkCylinder_IsTypeOfP7_objectS0___ZL17PyvtkCylinder_IsAP7_objectS0___ZL26PyvtkCylinder_SafeDownCastP7_objectS0___ZL25PyvtkCylinder_NewInstanceP7_objectS0___ZL30PyvtkCylinder_EvaluateFunctionP7_objectS0___ZL30PyvtkCylinder_EvaluateGradientP7_objectS0___ZL23PyvtkCylinder_SetRadiusP7_objectS0___ZL23PyvtkCylinder_GetRadiusP7_objectS0___ZL23PyvtkCylinder_SetCenterP7_objectS0___ZL23PyvtkCylinder_GetCenterP7_objectS0___ZL21PyvtkCylinder_SetAxisP7_objectS0___ZL21PyvtkCylinder_GetAxisP7_objectS0___ZL34PyvtkDataSetCellIterator_StaticNewv__ZL33PyvtkDataSetCellIterator_IsTypeOfP7_objectS0___ZL28PyvtkDataSetCellIterator_IsAP7_objectS0___ZL37PyvtkDataSetCellIterator_SafeDownCastP7_objectS0___ZL36PyvtkDataSetCellIterator_NewInstanceP7_objectS0___ZL44PyvtkDataSetCellIterator_IsDoneWithTraversalP7_objectS0___ZL34PyvtkDataSetCellIterator_GetCellIdP7_objectS0___ZL35PyvtkDataObjectCollection_StaticNewv__ZL34PyvtkDataObjectCollection_IsTypeOfP7_objectS0___ZL29PyvtkDataObjectCollection_IsAP7_objectS0___ZL38PyvtkDataObjectCollection_SafeDownCastP7_objectS0___ZL37PyvtkDataObjectCollection_NewInstanceP7_objectS0___ZL33PyvtkDataObjectCollection_AddItemP7_objectS0___ZL37PyvtkDataObjectCollection_GetNextItemP7_objectS0___ZL33PyvtkDataObjectCollection_GetItemP7_objectS0___ZL25PyvtkDataObject_StaticNewv__ZL24PyvtkDataObject_IsTypeOfP7_objectS0___ZL19PyvtkDataObject_IsAP7_objectS0___ZL28PyvtkDataObject_SafeDownCastP7_objectS0___ZL27PyvtkDataObject_NewInstanceP7_objectS0___ZL30PyvtkDataObject_GetInformationP7_objectS0___ZL30PyvtkDataObject_SetInformationP7_objectS0___ZL24PyvtkDataObject_GetMTimeP7_objectS0___ZL26PyvtkDataObject_InitializeP7_objectS0___ZL27PyvtkDataObject_ReleaseDataP7_objectS0___ZL31PyvtkDataObject_GetDataReleasedP7_objectS0___ZL40PyvtkDataObject_SetGlobalReleaseDataFlagP7_objectS0___ZL39PyvtkDataObject_GlobalReleaseDataFlagOnP7_objectS0___ZL40PyvtkDataObject_GlobalReleaseDataFlagOffP7_objectS0___ZL40PyvtkDataObject_GetGlobalReleaseDataFlagP7_objectS0___ZL28PyvtkDataObject_SetFieldDataP7_objectS0___ZL28PyvtkDataObject_GetFieldDataP7_objectS0___ZL33PyvtkDataObject_GetDataObjectTypeP7_objectS0___ZL29PyvtkDataObject_GetUpdateTimeP7_objectS0___ZL35PyvtkDataObject_GetActualMemorySizeP7_objectS0___ZL43PyvtkDataObject_CopyInformationFromPipelineP7_objectS0___ZL41PyvtkDataObject_CopyInformationToPipelineP7_objectS0___ZL41PyvtkDataObject_GetActiveFieldInformationP7_objectS0___ZL40PyvtkDataObject_GetNamedFieldInformationP7_objectS0___ZL43PyvtkDataObject_RemoveNamedFieldInformationP7_objectS0___ZL34PyvtkDataObject_SetActiveAttributeP7_objectS0___ZL38PyvtkDataObject_SetActiveAttributeInfoP7_objectS0___ZL44PyvtkDataObject_SetPointDataActiveScalarInfoP7_objectS0___ZL36PyvtkDataObject_DataHasBeenGeneratedP7_objectS0___ZL33PyvtkDataObject_PrepareForNewDataP7_objectS0___ZL27PyvtkDataObject_ShallowCopyP7_objectS0___ZL24PyvtkDataObject_DeepCopyP7_objectS0___ZL29PyvtkDataObject_GetExtentTypeP7_objectS0___ZL20PyvtkDataObject_CropP7_objectS0___ZL29PyvtkDataObject_GetAttributesP7_objectS0___ZL40PyvtkDataObject_GetAttributesAsFieldDataP7_objectS0___ZL40PyvtkDataObject_GetAttributeTypeForArrayP7_objectS0___ZL35PyvtkDataObject_GetNumberOfElementsP7_objectS0___ZL42PyvtkDataObject_GetAssociationTypeAsStringP7_objectS0___ZL44PyvtkDataObject_GetAssociationTypeFromStringP7_objectS0___ZL30PyvtkDataObject_DATA_TYPE_NAMEP7_objectS0___ZL27PyvtkDataObject_DATA_OBJECTP7_objectS0___ZL32PyvtkDataObject_DATA_EXTENT_TYPEP7_objectS0___ZL27PyvtkDataObject_DATA_EXTENTP7_objectS0___ZL33PyvtkDataObject_ALL_PIECES_EXTENTP7_objectS0___ZL33PyvtkDataObject_DATA_PIECE_NUMBERP7_objectS0___ZL37PyvtkDataObject_DATA_NUMBER_OF_PIECESP7_objectS0___ZL43PyvtkDataObject_DATA_NUMBER_OF_GHOST_LEVELSP7_objectS0___ZL30PyvtkDataObject_DATA_TIME_STEPP7_objectS0___ZL33PyvtkDataObject_POINT_DATA_VECTORP7_objectS0___ZL32PyvtkDataObject_CELL_DATA_VECTORP7_objectS0___ZL34PyvtkDataObject_VERTEX_DATA_VECTORP7_objectS0___ZL32PyvtkDataObject_EDGE_DATA_VECTORP7_objectS0___ZL32PyvtkDataObject_FIELD_ARRAY_TYPEP7_objectS0___ZL33PyvtkDataObject_FIELD_ASSOCIATIONP7_objectS0___ZL36PyvtkDataObject_FIELD_ATTRIBUTE_TYPEP7_objectS0___ZL38PyvtkDataObject_FIELD_ACTIVE_ATTRIBUTEP7_objectS0___ZL42PyvtkDataObject_FIELD_NUMBER_OF_COMPONENTSP7_objectS0___ZL38PyvtkDataObject_FIELD_NUMBER_OF_TUPLESP7_objectS0___ZL31PyvtkDataObject_FIELD_OPERATIONP7_objectS0___ZL27PyvtkDataObject_FIELD_RANGEP7_objectS0___ZL28PyvtkDataObject_PIECE_EXTENTP7_objectS0___ZL26PyvtkDataObject_FIELD_NAMEP7_objectS0___ZL22PyvtkDataObject_ORIGINP7_objectS0___ZL23PyvtkDataObject_SPACINGP7_objectS0___ZL28PyvtkDataObject_BOUNDING_BOXP7_objectS0___ZL19PyvtkDataObject_SILP7_objectS0___ZL23PyvtkDataObject_GetDataP7_objectS0___ZL26PyvtkDataObject_GetData_s2P7_objectS0___ZL26PyvtkDataObject_GetData_s1P7_objectS0___ZL30PyvtkDataObjectTypes_StaticNewv__ZL29PyvtkDataObjectTypes_IsTypeOfP7_objectS0___ZL24PyvtkDataObjectTypes_IsAP7_objectS0___ZL33PyvtkDataObjectTypes_SafeDownCastP7_objectS0___ZL32PyvtkDataObjectTypes_NewInstanceP7_objectS0___ZL43PyvtkDataObjectTypes_GetClassNameFromTypeIdP7_objectS0___ZL43PyvtkDataObjectTypes_GetTypeIdFromClassNameP7_objectS0___ZL34PyvtkDataObjectTypes_NewDataObjectP7_objectS0___ZL37PyvtkDataObjectTypes_NewDataObject_s1P7_objectS0___ZL37PyvtkDataObjectTypes_NewDataObject_s2P7_objectS0___ZL28PyvtkDataObjectTree_IsTypeOfP7_objectS0___ZL23PyvtkDataObjectTree_IsAP7_objectS0___ZL32PyvtkDataObjectTree_SafeDownCastP7_objectS0___ZL31PyvtkDataObjectTree_NewInstanceP7_objectS0___ZL35PyvtkDataObjectTree_NewTreeIteratorP7_objectS0___ZL31PyvtkDataObjectTree_NewIteratorP7_objectS0___ZL33PyvtkDataObjectTree_CopyStructureP7_objectS0___ZL30PyvtkDataObjectTree_SetDataSetP7_objectS0___ZL34PyvtkDataObjectTree_SetDataSetFromP7_objectS0___ZL30PyvtkDataObjectTree_GetDataSetP7_objectS0___ZL31PyvtkDataObjectTree_GetMetaDataP7_objectS0___ZL31PyvtkDataObjectTree_HasMetaDataP7_objectS0___ZL39PyvtkDataObjectTree_GetActualMemorySizeP7_objectS0___ZL30PyvtkDataObjectTree_InitializeP7_objectS0___ZL31PyvtkDataObjectTree_ShallowCopyP7_objectS0___ZL28PyvtkDataObjectTree_DeepCopyP7_objectS0___ZL37PyvtkDataObjectTree_GetNumberOfPointsP7_objectS0___ZL27PyvtkDataObjectTree_GetDataP7_objectS0___ZL30PyvtkDataObjectTree_GetData_s2P7_objectS0___ZL30PyvtkDataObjectTree_GetData_s1P7_objectS0___ZL37PyvtkDataObjectTreeIterator_StaticNewv__ZL36PyvtkDataObjectTreeIterator_IsTypeOfP7_objectS0___ZL31PyvtkDataObjectTreeIterator_IsAP7_objectS0___ZL40PyvtkDataObjectTreeIterator_SafeDownCastP7_objectS0___ZL39PyvtkDataObjectTreeIterator_NewInstanceP7_objectS0___ZL41PyvtkDataObjectTreeIterator_GoToFirstItemP7_objectS0___ZL40PyvtkDataObjectTreeIterator_GoToNextItemP7_objectS0___ZL47PyvtkDataObjectTreeIterator_IsDoneWithTraversalP7_objectS0___ZL48PyvtkDataObjectTreeIterator_GetCurrentDataObjectP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetCurrentMetaDataP7_objectS0___ZL46PyvtkDataObjectTreeIterator_HasCurrentMetaDataP7_objectS0___ZL47PyvtkDataObjectTreeIterator_GetCurrentFlatIndexP7_objectS0___ZL46PyvtkDataObjectTreeIterator_SetVisitOnlyLeavesP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetVisitOnlyLeavesP7_objectS0___ZL45PyvtkDataObjectTreeIterator_VisitOnlyLeavesOnP7_objectS0___ZL46PyvtkDataObjectTreeIterator_VisitOnlyLeavesOffP7_objectS0___ZL46PyvtkDataObjectTreeIterator_SetTraverseSubTreeP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetTraverseSubTreeP7_objectS0___ZL45PyvtkDataObjectTreeIterator_TraverseSubTreeOnP7_objectS0___ZL46PyvtkDataObjectTreeIterator_TraverseSubTreeOffP7_objectS0___ZL32PyvtkDataSetAttributes_StaticNewv__ZL31PyvtkDataSetAttributes_IsTypeOfP7_objectS0___ZL26PyvtkDataSetAttributes_IsAP7_objectS0___ZL35PyvtkDataSetAttributes_SafeDownCastP7_objectS0___ZL34PyvtkDataSetAttributes_NewInstanceP7_objectS0___ZL33PyvtkDataSetAttributes_InitializeP7_objectS0___ZL29PyvtkDataSetAttributes_UpdateP7_objectS0___ZL31PyvtkDataSetAttributes_DeepCopyP7_objectS0___ZL34PyvtkDataSetAttributes_ShallowCopyP7_objectS0___ZL37PyvtkDataSetAttributes_GhostArrayNameP7_objectS0___ZL33PyvtkDataSetAttributes_SetScalarsP7_objectS0___ZL39PyvtkDataSetAttributes_SetActiveScalarsP7_objectS0___ZL33PyvtkDataSetAttributes_GetScalarsP7_objectS0___ZL33PyvtkDataSetAttributes_SetVectorsP7_objectS0___ZL39PyvtkDataSetAttributes_SetActiveVectorsP7_objectS0___ZL33PyvtkDataSetAttributes_GetVectorsP7_objectS0___ZL33PyvtkDataSetAttributes_SetNormalsP7_objectS0___ZL39PyvtkDataSetAttributes_SetActiveNormalsP7_objectS0___ZL33PyvtkDataSetAttributes_GetNormalsP7_objectS0___ZL33PyvtkDataSetAttributes_SetTCoordsP7_objectS0___ZL39PyvtkDataSetAttributes_SetActiveTCoordsP7_objectS0___ZL33PyvtkDataSetAttributes_GetTCoordsP7_objectS0___ZL33PyvtkDataSetAttributes_SetTensorsP7_objectS0___ZL39PyvtkDataSetAttributes_SetActiveTensorsP7_objectS0___ZL33PyvtkDataSetAttributes_GetTensorsP7_objectS0___ZL35PyvtkDataSetAttributes_SetGlobalIdsP7_objectS0___ZL41PyvtkDataSetAttributes_SetActiveGlobalIdsP7_objectS0___ZL35PyvtkDataSetAttributes_GetGlobalIdsP7_objectS0___ZL37PyvtkDataSetAttributes_SetPedigreeIdsP7_objectS0___ZL43PyvtkDataSetAttributes_SetActivePedigreeIdsP7_objectS0___ZL37PyvtkDataSetAttributes_GetPedigreeIdsP7_objectS0___ZL41PyvtkDataSetAttributes_SetActiveAttributeP7_objectS0___ZL42PyvtkDataSetAttributes_GetAttributeIndicesP7_objectS0___ZL41PyvtkDataSetAttributes_IsArrayAnAttributeP7_objectS0___ZL35PyvtkDataSetAttributes_SetAttributeP7_objectS0___ZL35PyvtkDataSetAttributes_GetAttributeP7_objectS0___ZL43PyvtkDataSetAttributes_GetAbstractAttributeP7_objectS0___ZL34PyvtkDataSetAttributes_RemoveArrayP7_objectS0___ZL47PyvtkDataSetAttributes_GetAttributeTypeAsStringP7_objectS0___ZL51PyvtkDataSetAttributes_GetLongAttributeTypeAsStringP7_objectS0___ZL39PyvtkDataSetAttributes_SetCopyAttributeP7_objectS0___ZL39PyvtkDataSetAttributes_GetCopyAttributeP7_objectS0___ZL37PyvtkDataSetAttributes_SetCopyScalarsP7_objectS0___ZL37PyvtkDataSetAttributes_GetCopyScalarsP7_objectS0___ZL36PyvtkDataSetAttributes_CopyScalarsOnP7_objectS0___ZL37PyvtkDataSetAttributes_CopyScalarsOffP7_objectS0___ZL37PyvtkDataSetAttributes_SetCopyVectorsP7_objectS0___ZL37PyvtkDataSetAttributes_GetCopyVectorsP7_objectS0___ZL36PyvtkDataSetAttributes_CopyVectorsOnP7_objectS0___ZL37PyvtkDataSetAttributes_CopyVectorsOffP7_objectS0___ZL37PyvtkDataSetAttributes_SetCopyNormalsP7_objectS0___ZL37PyvtkDataSetAttributes_GetCopyNormalsP7_objectS0___ZL36PyvtkDataSetAttributes_CopyNormalsOnP7_objectS0___ZL37PyvtkDataSetAttributes_CopyNormalsOffP7_objectS0___ZL37PyvtkDataSetAttributes_SetCopyTCoordsP7_objectS0___ZL37PyvtkDataSetAttributes_GetCopyTCoordsP7_objectS0___ZL36PyvtkDataSetAttributes_CopyTCoordsOnP7_objectS0___ZL37PyvtkDataSetAttributes_CopyTCoordsOffP7_objectS0___ZL37PyvtkDataSetAttributes_SetCopyTensorsP7_objectS0___ZL37PyvtkDataSetAttributes_GetCopyTensorsP7_objectS0___ZL36PyvtkDataSetAttributes_CopyTensorsOnP7_objectS0___ZL37PyvtkDataSetAttributes_CopyTensorsOffP7_objectS0___ZL39PyvtkDataSetAttributes_SetCopyGlobalIdsP7_objectS0___ZL39PyvtkDataSetAttributes_GetCopyGlobalIdsP7_objectS0___ZL38PyvtkDataSetAttributes_CopyGlobalIdsOnP7_objectS0___ZL39PyvtkDataSetAttributes_CopyGlobalIdsOffP7_objectS0___ZL41PyvtkDataSetAttributes_SetCopyPedigreeIdsP7_objectS0___ZL41PyvtkDataSetAttributes_GetCopyPedigreeIdsP7_objectS0___ZL40PyvtkDataSetAttributes_CopyPedigreeIdsOnP7_objectS0___ZL41PyvtkDataSetAttributes_CopyPedigreeIdsOffP7_objectS0___ZL32PyvtkDataSetAttributes_CopyAllOnP7_objectS0___ZL33PyvtkDataSetAttributes_CopyAllOffP7_objectS0___ZL31PyvtkDataSetAttributes_PassDataP7_objectS0___ZL35PyvtkDataSetAttributes_CopyAllocateP7_objectS0___ZL35PyvtkDataSetAttributes_SetupForCopyP7_objectS0___ZL41PyvtkDataSetAttributes_CopyStructuredDataP7_objectS0___ZL31PyvtkDataSetAttributes_CopyDataP7_objectS0___ZL32PyvtkDataSetAttributes_CopyTupleP7_objectS0___ZL33PyvtkDataSetAttributes_CopyTuplesP7_objectS0___ZL42PyvtkDataSetAttributes_InterpolateAllocateP7_objectS0___ZL39PyvtkDataSetAttributes_InterpolatePointP7_objectS0___ZL38PyvtkDataSetAttributes_InterpolateEdgeP7_objectS0___ZL38PyvtkDataSetAttributes_InterpolateTimeP7_objectS0___ZL44PyvtkDataSetAttributes_SetActiveAttribute_s1P7_objectS0___ZL44PyvtkDataSetAttributes_SetActiveAttribute_s2P7_objectS0___ZL37PyvtkDataSetAttributes_RemoveArray_s1P7_objectS0___ZL37PyvtkDataSetAttributes_RemoveArray_s2P7_objectS0___ZL34PyvtkDataSetAttributes_CopyData_s1P7_objectS0___ZL34PyvtkDataSetAttributes_CopyData_s2P7_objectS0___ZL32PyvtkDataSetCollection_StaticNewv__ZL31PyvtkDataSetCollection_IsTypeOfP7_objectS0___ZL26PyvtkDataSetCollection_IsAP7_objectS0___ZL35PyvtkDataSetCollection_SafeDownCastP7_objectS0___ZL34PyvtkDataSetCollection_NewInstanceP7_objectS0___ZL30PyvtkDataSetCollection_AddItemP7_objectS0___ZL34PyvtkDataSetCollection_GetNextItemP7_objectS0___ZL37PyvtkDataSetCollection_GetNextDataSetP7_objectS0___ZL30PyvtkDataSetCollection_GetItemP7_objectS0___ZL33PyvtkDataSetCollection_GetDataSetP7_objectS0___ZL21PyvtkDataSet_IsTypeOfP7_objectS0___ZL16PyvtkDataSet_IsAP7_objectS0___ZL25PyvtkDataSet_SafeDownCastP7_objectS0___ZL24PyvtkDataSet_NewInstanceP7_objectS0___ZL26PyvtkDataSet_CopyStructureP7_objectS0___ZL27PyvtkDataSet_CopyAttributesP7_objectS0___ZL30PyvtkDataSet_GetNumberOfPointsP7_objectS0___ZL29PyvtkDataSet_GetNumberOfCellsP7_objectS0___ZL21PyvtkDataSet_GetPointP7_objectS0___ZL28PyvtkDataSet_NewCellIteratorP7_objectS0___ZL20PyvtkDataSet_GetCellP7_objectS0___ZL26PyvtkDataSet_GetCellBoundsP7_objectS0___ZL24PyvtkDataSet_GetCellTypeP7_objectS0___ZL25PyvtkDataSet_GetCellTypesP7_objectS0___ZL26PyvtkDataSet_GetCellPointsP7_objectS0___ZL26PyvtkDataSet_GetPointCellsP7_objectS0___ZL29PyvtkDataSet_GetCellNeighborsP7_objectS0___ZL22PyvtkDataSet_FindPointP7_objectS0___ZL21PyvtkDataSet_FindCellP7_objectS0___ZL27PyvtkDataSet_FindAndGetCellP7_objectS0___ZL21PyvtkDataSet_GetMTimeP7_objectS0___ZL24PyvtkDataSet_GetCellDataP7_objectS0___ZL25PyvtkDataSet_GetPointDataP7_objectS0___ZL20PyvtkDataSet_SqueezeP7_objectS0___ZL26PyvtkDataSet_ComputeBoundsP7_objectS0___ZL22PyvtkDataSet_GetBoundsP7_objectS0___ZL22PyvtkDataSet_GetCenterP7_objectS0___ZL22PyvtkDataSet_GetLengthP7_objectS0___ZL23PyvtkDataSet_InitializeP7_objectS0___ZL27PyvtkDataSet_GetScalarRangeP7_objectS0___ZL27PyvtkDataSet_GetMaxCellSizeP7_objectS0___ZL32PyvtkDataSet_GetActualMemorySizeP7_objectS0___ZL30PyvtkDataSet_GetDataObjectTypeP7_objectS0___ZL24PyvtkDataSet_ShallowCopyP7_objectS0___ZL21PyvtkDataSet_DeepCopyP7_objectS0___ZL28PyvtkDataSet_CheckAttributesP7_objectS0___ZL31PyvtkDataSet_GenerateGhostArrayP7_objectS0___ZL20PyvtkDataSet_GetDataP7_objectS0___ZL37PyvtkDataSet_GetAttributesAsFieldDataP7_objectS0___ZL32PyvtkDataSet_GetNumberOfElementsP7_objectS0___ZL29PyvtkDataSet_HasAnyGhostCellsP7_objectS0___ZL30PyvtkDataSet_HasAnyGhostPointsP7_objectS0___ZL29PyvtkDataSet_HasAnyBlankCellsP7_objectS0___ZL30PyvtkDataSet_HasAnyBlankPointsP7_objectS0___ZL31PyvtkDataSet_GetPointGhostArrayP7_objectS0___ZL39PyvtkDataSet_UpdatePointGhostArrayCacheP7_objectS0___ZL36PyvtkDataSet_AllocatePointGhostArrayP7_objectS0___ZL30PyvtkDataSet_GetCellGhostArrayP7_objectS0___ZL38PyvtkDataSet_UpdateCellGhostArrayCacheP7_objectS0___ZL35PyvtkDataSet_AllocateCellGhostArrayP7_objectS0___ZN10vtkDataSet7GetCellEiii__ZL23PyvtkDataSet_GetData_s2P7_objectS0___ZL23PyvtkDataSet_GetData_s1P7_objectS0___ZL35PyvtkDirectedAcyclicGraph_StaticNewv__ZL34PyvtkDirectedAcyclicGraph_IsTypeOfP7_objectS0___ZL29PyvtkDirectedAcyclicGraph_IsAP7_objectS0___ZL38PyvtkDirectedAcyclicGraph_SafeDownCastP7_objectS0___ZL37PyvtkDirectedAcyclicGraph_NewInstanceP7_objectS0___ZL43PyvtkDirectedAcyclicGraph_GetDataObjectTypeP7_objectS0___ZL33PyvtkDirectedAcyclicGraph_GetDataP7_objectS0___ZN23vtkDirectedAcyclicGraph8IsTypeOfEPKc__ZL36PyvtkDirectedAcyclicGraph_GetData_s2P7_objectS0___ZL36PyvtkDirectedAcyclicGraph_GetData_s1P7_objectS0___ZL28PyvtkDirectedGraph_StaticNewv__ZL27PyvtkDirectedGraph_IsTypeOfP7_objectS0___ZL22PyvtkDirectedGraph_IsAP7_objectS0___ZL31PyvtkDirectedGraph_SafeDownCastP7_objectS0___ZL30PyvtkDirectedGraph_NewInstanceP7_objectS0___ZL36PyvtkDirectedGraph_GetDataObjectTypeP7_objectS0___ZL26PyvtkDirectedGraph_GetDataP7_objectS0___ZL35PyvtkDirectedGraph_IsStructureValidP7_objectS0___ZL29PyvtkDirectedGraph_GetData_s2P7_objectS0___ZL29PyvtkDirectedGraph_GetData_s1P7_objectS0___ZL36PyvtkDistributedGraphHelper_IsTypeOfP7_objectS0___ZL31PyvtkDistributedGraphHelper_IsAP7_objectS0___ZL40PyvtkDistributedGraphHelper_SafeDownCastP7_objectS0___ZL39PyvtkDistributedGraphHelper_NewInstanceP7_objectS0___ZL42PyvtkDistributedGraphHelper_GetVertexOwnerP7_objectS0___ZL42PyvtkDistributedGraphHelper_GetVertexIndexP7_objectS0___ZL40PyvtkDistributedGraphHelper_GetEdgeOwnerP7_objectS0___ZL40PyvtkDistributedGraphHelper_GetEdgeIndexP7_objectS0___ZL45PyvtkDistributedGraphHelper_MakeDistributedIdP7_objectS0___ZL54PyvtkDistributedGraphHelper_GetVertexOwnerByPedigreeIdP7_objectS0___ZL39PyvtkDistributedGraphHelper_SynchronizeP7_objectS0___ZL33PyvtkDistributedGraphHelper_CloneP7_objectS0___ZL48PyvtkDistributedGraphHelper_DISTRIBUTEDVERTEXIDSP7_objectS0___ZL46PyvtkDistributedGraphHelper_DISTRIBUTEDEDGEIDSP7_objectS0___ZL31PyvtkEdgeListIterator_StaticNewv__ZL30PyvtkEdgeListIterator_IsTypeOfP7_objectS0___ZL25PyvtkEdgeListIterator_IsAP7_objectS0___ZL34PyvtkEdgeListIterator_SafeDownCastP7_objectS0___ZL33PyvtkEdgeListIterator_NewInstanceP7_objectS0___ZL30PyvtkEdgeListIterator_GetGraphP7_objectS0___ZL30PyvtkEdgeListIterator_SetGraphP7_objectS0___ZL26PyvtkEdgeListIterator_NextP7_objectS0___ZL35PyvtkEdgeListIterator_NextGraphEdgeP7_objectS0___ZL29PyvtkEdgeListIterator_HasNextP7_objectS0___ZL24PyvtkEdgeTable_StaticNewv__ZL23PyvtkEdgeTable_IsTypeOfP7_objectS0___ZL18PyvtkEdgeTable_IsAP7_objectS0___ZL27PyvtkEdgeTable_SafeDownCastP7_objectS0___ZL26PyvtkEdgeTable_NewInstanceP7_objectS0___ZL25PyvtkEdgeTable_InitializeP7_objectS0___ZL32PyvtkEdgeTable_InitEdgeInsertionP7_objectS0___ZL25PyvtkEdgeTable_InsertEdgeP7_objectS0___ZL21PyvtkEdgeTable_IsEdgeP7_objectS0___ZL33PyvtkEdgeTable_InitPointInsertionP7_objectS0___ZL32PyvtkEdgeTable_InsertUniquePointP7_objectS0___ZL31PyvtkEdgeTable_GetNumberOfEdgesP7_objectS0___ZL28PyvtkEdgeTable_InitTraversalP7_objectS0___ZL26PyvtkEdgeTable_GetNextEdgeP7_objectS0___ZL20PyvtkEdgeTable_ResetP7_objectS0___ZL28PyvtkEdgeTable_InsertEdge_s2P7_objectS0___ZL28PyvtkEdgeTable_InsertEdge_s3P7_objectS0___ZL24PyvtkEmptyCell_StaticNewv__ZL23PyvtkEmptyCell_IsTypeOfP7_objectS0___ZL18PyvtkEmptyCell_IsAP7_objectS0___ZL27PyvtkEmptyCell_SafeDownCastP7_objectS0___ZL26PyvtkEmptyCell_NewInstanceP7_objectS0___ZL26PyvtkEmptyCell_GetCellTypeP7_objectS0___ZL31PyvtkEmptyCell_GetCellDimensionP7_objectS0___ZL31PyvtkEmptyCell_GetNumberOfEdgesP7_objectS0___ZL31PyvtkEmptyCell_GetNumberOfFacesP7_objectS0___ZL22PyvtkEmptyCell_GetEdgeP7_objectS0___ZL22PyvtkEmptyCell_GetFaceP7_objectS0___ZL27PyvtkEmptyCell_CellBoundaryP7_objectS0___ZL22PyvtkEmptyCell_ContourP7_objectS0___ZL19PyvtkEmptyCell_ClipP7_objectS0___ZL31PyvtkEmptyCell_EvaluatePositionP7_objectS0___ZL31PyvtkEmptyCell_EvaluateLocationP7_objectS0___ZL32PyvtkEmptyCell_IntersectWithLineP7_objectS0___ZL26PyvtkEmptyCell_TriangulateP7_objectS0___ZL26PyvtkEmptyCell_DerivativesP7_objectS0___ZL42PyvtkExtractStructuredGridHelper_StaticNewv__ZL41PyvtkExtractStructuredGridHelper_IsTypeOfP7_objectS0___ZL36PyvtkExtractStructuredGridHelper_IsAP7_objectS0___ZL45PyvtkExtractStructuredGridHelper_SafeDownCastP7_objectS0___ZL44PyvtkExtractStructuredGridHelper_NewInstanceP7_objectS0___ZL53PyvtkExtractStructuredGridHelper_GetOutputWholeExtentP7_objectS0___ZL43PyvtkExtractStructuredGridHelper_InitializeP7_objectS0___ZL40PyvtkExtractStructuredGridHelper_IsValidP7_objectS0___ZL40PyvtkExtractStructuredGridHelper_GetSizeP7_objectS0___ZL47PyvtkExtractStructuredGridHelper_GetMappedIndexP7_objectS0___ZL62PyvtkExtractStructuredGridHelper_GetMappedIndexFromExtentValueP7_objectS0___ZL53PyvtkExtractStructuredGridHelper_GetMappedExtentValueP7_objectS0___ZL62PyvtkExtractStructuredGridHelper_GetMappedExtentValueFromIndexP7_objectS0___ZL51PyvtkExtractStructuredGridHelper_ComputeBeginAndEndP7_objectS0___ZL55PyvtkExtractStructuredGridHelper_CopyPointsAndPointDataP7_objectS0___ZL45PyvtkExtractStructuredGridHelper_CopyCellDataP7_objectS0___ZL50PyvtkExtractStructuredGridHelper_GetPartitionedVOIP7_objectS0___ZL59PyvtkExtractStructuredGridHelper_GetPartitionedOutputExtentP7_objectS0___ZL24PyvtkFieldData_StaticNewv__ZL23PyvtkFieldData_IsTypeOfP7_objectS0___ZL18PyvtkFieldData_IsAP7_objectS0___ZL27PyvtkFieldData_SafeDownCastP7_objectS0___ZL26PyvtkFieldData_NewInstanceP7_objectS0___ZL25PyvtkFieldData_InitializeP7_objectS0___ZL23PyvtkFieldData_AllocateP7_objectS0___ZL28PyvtkFieldData_CopyStructureP7_objectS0___ZL29PyvtkFieldData_AllocateArraysP7_objectS0___ZL32PyvtkFieldData_GetNumberOfArraysP7_objectS0___ZL23PyvtkFieldData_AddArrayP7_objectS0___ZL26PyvtkFieldData_RemoveArrayP7_objectS0___ZL23PyvtkFieldData_GetArrayP7_objectS0___ZL31PyvtkFieldData_GetAbstractArrayP7_objectS0___ZL23PyvtkFieldData_HasArrayP7_objectS0___ZL27PyvtkFieldData_GetArrayNameP7_objectS0___ZL23PyvtkFieldData_PassDataP7_objectS0___ZL26PyvtkFieldData_CopyFieldOnP7_objectS0___ZL27PyvtkFieldData_CopyFieldOffP7_objectS0___ZL24PyvtkFieldData_CopyAllOnP7_objectS0___ZL25PyvtkFieldData_CopyAllOffP7_objectS0___ZL23PyvtkFieldData_DeepCopyP7_objectS0___ZL26PyvtkFieldData_ShallowCopyP7_objectS0___ZL22PyvtkFieldData_SqueezeP7_objectS0___ZL20PyvtkFieldData_ResetP7_objectS0___ZL34PyvtkFieldData_GetActualMemorySizeP7_objectS0___ZL23PyvtkFieldData_GetMTimeP7_objectS0___ZL23PyvtkFieldData_GetFieldP7_objectS0___ZL42PyvtkFieldData_GetArrayContainingComponentP7_objectS0___ZL36PyvtkFieldData_GetNumberOfComponentsP7_objectS0___ZL32PyvtkFieldData_GetNumberOfTuplesP7_objectS0___ZL32PyvtkFieldData_SetNumberOfTuplesP7_objectS0___ZL23PyvtkFieldData_SetTupleP7_objectS0___ZL26PyvtkFieldData_InsertTupleP7_objectS0___ZL30PyvtkFieldData_InsertNextTupleP7_objectS0___ZL29PyvtkFieldData_RemoveArray_s1P7_objectS0___ZL29PyvtkFieldData_RemoveArray_s2P7_objectS0___ZL26PyvtkFieldData_GetArray_s1P7_objectS0___ZL26PyvtkFieldData_GetArray_s3P7_objectS0___ZL34PyvtkFieldData_GetAbstractArray_s1P7_objectS0___ZL34PyvtkFieldData_GetAbstractArray_s3P7_objectS0___ZL32PyvtkGenericAdaptorCell_IsTypeOfP7_objectS0___ZL27PyvtkGenericAdaptorCell_IsAP7_objectS0___ZL36PyvtkGenericAdaptorCell_SafeDownCastP7_objectS0___ZL35PyvtkGenericAdaptorCell_NewInstanceP7_objectS0___ZL29PyvtkGenericAdaptorCell_GetIdP7_objectS0___ZL35PyvtkGenericAdaptorCell_IsInDataSetP7_objectS0___ZL31PyvtkGenericAdaptorCell_GetTypeP7_objectS0___ZL36PyvtkGenericAdaptorCell_GetDimensionP7_objectS0___ZL40PyvtkGenericAdaptorCell_GetGeometryOrderP7_objectS0___ZL40PyvtkGenericAdaptorCell_IsGeometryLinearP7_objectS0___ZL41PyvtkGenericAdaptorCell_GetAttributeOrderP7_objectS0___ZL48PyvtkGenericAdaptorCell_GetHighestOrderAttributeP7_objectS0___ZL41PyvtkGenericAdaptorCell_IsAttributeLinearP7_objectS0___ZL33PyvtkGenericAdaptorCell_IsPrimaryP7_objectS0___ZL41PyvtkGenericAdaptorCell_GetNumberOfPointsP7_objectS0___ZL45PyvtkGenericAdaptorCell_GetNumberOfBoundariesP7_objectS0___ZL43PyvtkGenericAdaptorCell_GetNumberOfDOFNodesP7_objectS0___ZL40PyvtkGenericAdaptorCell_GetPointIteratorP7_objectS0___ZL39PyvtkGenericAdaptorCell_NewCellIteratorP7_objectS0___ZL43PyvtkGenericAdaptorCell_GetBoundaryIteratorP7_objectS0___ZL38PyvtkGenericAdaptorCell_CountNeighborsP7_objectS0___ZL42PyvtkGenericAdaptorCell_CountEdgeNeighborsP7_objectS0___ZL36PyvtkGenericAdaptorCell_GetNeighborsP7_objectS0___ZL40PyvtkGenericAdaptorCell_EvaluatePositionP7_objectS0___ZL40PyvtkGenericAdaptorCell_EvaluateLocationP7_objectS0___ZL40PyvtkGenericAdaptorCell_InterpolateTupleP7_objectS0___ZL31PyvtkGenericAdaptorCell_ContourP7_objectS0___ZL28PyvtkGenericAdaptorCell_ClipP7_objectS0___ZL41PyvtkGenericAdaptorCell_IntersectWithLineP7_objectS0___ZL35PyvtkGenericAdaptorCell_DerivativesP7_objectS0___ZL33PyvtkGenericAdaptorCell_GetBoundsP7_objectS0___ZL34PyvtkGenericAdaptorCell_GetLength2P7_objectS0___ZL43PyvtkGenericAdaptorCell_GetParametricCenterP7_objectS0___ZL45PyvtkGenericAdaptorCell_GetParametricDistanceP7_objectS0___ZL43PyvtkGenericAdaptorCell_GetParametricCoordsP7_objectS0___ZL34PyvtkGenericAdaptorCell_TessellateP7_objectS0___ZL40PyvtkGenericAdaptorCell_IsFaceOnBoundaryP7_objectS0___ZL36PyvtkGenericAdaptorCell_IsOnBoundaryP7_objectS0___ZL35PyvtkGenericAdaptorCell_GetPointIdsP7_objectS0___ZL39PyvtkGenericAdaptorCell_TriangulateFaceP7_objectS0___ZL36PyvtkGenericAdaptorCell_GetFaceArrayP7_objectS0___ZL49PyvtkGenericAdaptorCell_GetNumberOfVerticesOnFaceP7_objectS0___ZL36PyvtkGenericAdaptorCell_GetEdgeArrayP7_objectS0___ZL43PyvtkGenericAdaptorCell_InterpolateTuple_s1P7_objectS0___ZL43PyvtkGenericAdaptorCell_InterpolateTuple_s2P7_objectS0___ZL41PyvtkGenericAttributeCollection_StaticNewv__ZL40PyvtkGenericAttributeCollection_IsTypeOfP7_objectS0___ZL35PyvtkGenericAttributeCollection_IsAP7_objectS0___ZL44PyvtkGenericAttributeCollection_SafeDownCastP7_objectS0___ZL43PyvtkGenericAttributeCollection_NewInstanceP7_objectS0___ZL53PyvtkGenericAttributeCollection_GetNumberOfAttributesP7_objectS0___ZL53PyvtkGenericAttributeCollection_GetNumberOfComponentsP7_objectS0___ZL66PyvtkGenericAttributeCollection_GetNumberOfPointCenteredComponentsP7_objectS0___ZL56PyvtkGenericAttributeCollection_GetMaxNumberOfComponentsP7_objectS0___ZL51PyvtkGenericAttributeCollection_GetActualMemorySizeP7_objectS0___ZL39PyvtkGenericAttributeCollection_IsEmptyP7_objectS0___ZL44PyvtkGenericAttributeCollection_GetAttributeP7_objectS0___ZL45PyvtkGenericAttributeCollection_FindAttributeP7_objectS0___ZL49PyvtkGenericAttributeCollection_GetAttributeIndexP7_objectS0___ZL51PyvtkGenericAttributeCollection_InsertNextAttributeP7_objectS0___ZL47PyvtkGenericAttributeCollection_InsertAttributeP7_objectS0___ZL47PyvtkGenericAttributeCollection_RemoveAttributeP7_objectS0___ZL37PyvtkGenericAttributeCollection_ResetP7_objectS0___ZL40PyvtkGenericAttributeCollection_DeepCopyP7_objectS0___ZL43PyvtkGenericAttributeCollection_ShallowCopyP7_objectS0___ZL40PyvtkGenericAttributeCollection_GetMTimeP7_objectS0___ZL50PyvtkGenericAttributeCollection_GetActiveAttributeP7_objectS0___ZL50PyvtkGenericAttributeCollection_GetActiveComponentP7_objectS0___ZL50PyvtkGenericAttributeCollection_SetActiveAttributeP7_objectS0___ZL66PyvtkGenericAttributeCollection_GetNumberOfAttributesToInterpolateP7_objectS0___ZL58PyvtkGenericAttributeCollection_GetAttributesToInterpolateP7_objectS0___ZL44PyvtkGenericAttributeCollection_HasAttributeP7_objectS0___ZL58PyvtkGenericAttributeCollection_SetAttributesToInterpolateP7_objectS0___ZL63PyvtkGenericAttributeCollection_SetAttributesToInterpolateToAllP7_objectS0___ZL30PyvtkGenericAttribute_IsTypeOfP7_objectS0___ZL25PyvtkGenericAttribute_IsAP7_objectS0___ZL34PyvtkGenericAttribute_SafeDownCastP7_objectS0___ZL33PyvtkGenericAttribute_NewInstanceP7_objectS0___ZL29PyvtkGenericAttribute_GetNameP7_objectS0___ZL43PyvtkGenericAttribute_GetNumberOfComponentsP7_objectS0___ZL34PyvtkGenericAttribute_GetCenteringP7_objectS0___ZL29PyvtkGenericAttribute_GetTypeP7_objectS0___ZL38PyvtkGenericAttribute_GetComponentTypeP7_objectS0___ZL29PyvtkGenericAttribute_GetSizeP7_objectS0___ZL41PyvtkGenericAttribute_GetActualMemorySizeP7_objectS0___ZL30PyvtkGenericAttribute_GetRangeP7_objectS0___ZL32PyvtkGenericAttribute_GetMaxNormP7_objectS0___ZL30PyvtkGenericAttribute_GetTupleP7_objectS0___ZL34PyvtkGenericAttribute_GetComponentP7_objectS0___ZL30PyvtkGenericAttribute_DeepCopyP7_objectS0___ZL33PyvtkGenericAttribute_ShallowCopyP7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s1P7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s2P7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s3P7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s4P7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s5P7_objectS0___ZL33PyvtkGenericAttribute_GetTuple_s6P7_objectS0___ZL26PyvtkGenericCell_StaticNewv__ZL25PyvtkGenericCell_IsTypeOfP7_objectS0___ZL20PyvtkGenericCell_IsAP7_objectS0___ZL29PyvtkGenericCell_SafeDownCastP7_objectS0___ZL28PyvtkGenericCell_NewInstanceP7_objectS0___ZL26PyvtkGenericCell_SetPointsP7_objectS0___ZL28PyvtkGenericCell_SetPointIdsP7_objectS0___ZL28PyvtkGenericCell_ShallowCopyP7_objectS0___ZL25PyvtkGenericCell_DeepCopyP7_objectS0___ZL28PyvtkGenericCell_GetCellTypeP7_objectS0___ZL33PyvtkGenericCell_GetCellDimensionP7_objectS0___ZL25PyvtkGenericCell_IsLinearP7_objectS0___ZL39PyvtkGenericCell_RequiresInitializationP7_objectS0___ZL27PyvtkGenericCell_InitializeP7_objectS0___ZL51PyvtkGenericCell_RequiresExplicitFaceRepresentationP7_objectS0___ZL25PyvtkGenericCell_SetFacesP7_objectS0___ZL25PyvtkGenericCell_GetFacesP7_objectS0___ZL33PyvtkGenericCell_GetNumberOfEdgesP7_objectS0___ZL33PyvtkGenericCell_GetNumberOfFacesP7_objectS0___ZL24PyvtkGenericCell_GetEdgeP7_objectS0___ZL24PyvtkGenericCell_GetFaceP7_objectS0___ZL29PyvtkGenericCell_CellBoundaryP7_objectS0___ZL33PyvtkGenericCell_EvaluatePositionP7_objectS0___ZL33PyvtkGenericCell_EvaluateLocationP7_objectS0___ZL24PyvtkGenericCell_ContourP7_objectS0___ZL21PyvtkGenericCell_ClipP7_objectS0___ZL34PyvtkGenericCell_IntersectWithLineP7_objectS0___ZL28PyvtkGenericCell_TriangulateP7_objectS0___ZL28PyvtkGenericCell_DerivativesP7_objectS0___ZL36PyvtkGenericCell_GetParametricCenterP7_objectS0___ZL36PyvtkGenericCell_GetParametricCoordsP7_objectS0___ZL30PyvtkGenericCell_IsPrimaryCellP7_objectS0___ZL37PyvtkGenericCell_InterpolateFunctionsP7_objectS0___ZL34PyvtkGenericCell_InterpolateDerivsP7_objectS0___ZL28PyvtkGenericCell_SetCellTypeP7_objectS0___ZL39PyvtkGenericCell_SetCellTypeToEmptyCellP7_objectS0___ZL36PyvtkGenericCell_SetCellTypeToVertexP7_objectS0___ZL40PyvtkGenericCell_SetCellTypeToPolyVertexP7_objectS0___ZL34PyvtkGenericCell_SetCellTypeToLineP7_objectS0___ZL38PyvtkGenericCell_SetCellTypeToPolyLineP7_objectS0___ZL38PyvtkGenericCell_SetCellTypeToTriangleP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToTriangleStripP7_objectS0___ZL37PyvtkGenericCell_SetCellTypeToPolygonP7_objectS0___ZL35PyvtkGenericCell_SetCellTypeToPixelP7_objectS0___ZL34PyvtkGenericCell_SetCellTypeToQuadP7_objectS0___ZL35PyvtkGenericCell_SetCellTypeToTetraP7_objectS0___ZL35PyvtkGenericCell_SetCellTypeToVoxelP7_objectS0___ZL40PyvtkGenericCell_SetCellTypeToHexahedronP7_objectS0___ZL35PyvtkGenericCell_SetCellTypeToWedgeP7_objectS0___ZL37PyvtkGenericCell_SetCellTypeToPyramidP7_objectS0___ZL45PyvtkGenericCell_SetCellTypeToPentagonalPrismP7_objectS0___ZL44PyvtkGenericCell_SetCellTypeToHexagonalPrismP7_objectS0___ZL40PyvtkGenericCell_SetCellTypeToPolyhedronP7_objectS0___ZL44PyvtkGenericCell_SetCellTypeToConvexPointSetP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToQuadraticEdgeP7_objectS0___ZL39PyvtkGenericCell_SetCellTypeToCubicLineP7_objectS0___ZL47PyvtkGenericCell_SetCellTypeToQuadraticTriangleP7_objectS0___ZL49PyvtkGenericCell_SetCellTypeToBiQuadraticTriangleP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToQuadraticQuadP7_objectS0___ZL46PyvtkGenericCell_SetCellTypeToQuadraticPolygonP7_objectS0___ZL44PyvtkGenericCell_SetCellTypeToQuadraticTetraP7_objectS0___ZL49PyvtkGenericCell_SetCellTypeToQuadraticHexahedronP7_objectS0___ZL44PyvtkGenericCell_SetCellTypeToQuadraticWedgeP7_objectS0___ZL46PyvtkGenericCell_SetCellTypeToQuadraticPyramidP7_objectS0___ZL49PyvtkGenericCell_SetCellTypeToQuadraticLinearQuadP7_objectS0___ZL45PyvtkGenericCell_SetCellTypeToBiQuadraticQuadP7_objectS0___ZL50PyvtkGenericCell_SetCellTypeToQuadraticLinearWedgeP7_objectS0___ZL55PyvtkGenericCell_SetCellTypeToBiQuadraticQuadraticWedgeP7_objectS0___ZL52PyvtkGenericCell_SetCellTypeToTriQuadraticHexahedronP7_objectS0___ZL60PyvtkGenericCell_SetCellTypeToBiQuadraticQuadraticHexahedronP7_objectS0___ZL46PyvtkGenericCell_SetCellTypeToLagrangeTriangleP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToLagrangeTetraP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToLagrangeCurveP7_objectS0___ZL51PyvtkGenericCell_SetCellTypeToLagrangeQuadrilateralP7_objectS0___ZL48PyvtkGenericCell_SetCellTypeToLagrangeHexahedronP7_objectS0___ZL43PyvtkGenericCell_SetCellTypeToLagrangeWedgeP7_objectS0___ZL32PyvtkGenericCell_InstantiateCellP7_objectS0___ZL38PyvtkGenericCell_GetRepresentativeCellP7_objectS0___ZL33PyvtkGenericCellIterator_IsTypeOfP7_objectS0___ZL28PyvtkGenericCellIterator_IsAP7_objectS0___ZL37PyvtkGenericCellIterator_SafeDownCastP7_objectS0___ZL36PyvtkGenericCellIterator_NewInstanceP7_objectS0___ZL30PyvtkGenericCellIterator_BeginP7_objectS0___ZL32PyvtkGenericCellIterator_IsAtEndP7_objectS0___ZL32PyvtkGenericCellIterator_NewCellP7_objectS0___ZL32PyvtkGenericCellIterator_GetCellP7_objectS0___ZL29PyvtkGenericCellIterator_NextP7_objectS0___ZL36PyvtkGenericCellTessellator_IsTypeOfP7_objectS0___ZL31PyvtkGenericCellTessellator_IsAP7_objectS0___ZL40PyvtkGenericCellTessellator_SafeDownCastP7_objectS0___ZL39PyvtkGenericCellTessellator_NewInstanceP7_objectS0___ZL42PyvtkGenericCellTessellator_TessellateFaceP7_objectS0___ZL38PyvtkGenericCellTessellator_TessellateP7_objectS0___ZL39PyvtkGenericCellTessellator_TriangulateP7_objectS0___ZL43PyvtkGenericCellTessellator_SetErrorMetricsP7_objectS0___ZL43PyvtkGenericCellTessellator_GetErrorMetricsP7_objectS0___ZL38PyvtkGenericCellTessellator_InitializeP7_objectS0___ZL44PyvtkGenericCellTessellator_InitErrorMetricsP7_objectS0___ZL42PyvtkGenericCellTessellator_GetMeasurementP7_objectS0___ZL42PyvtkGenericCellTessellator_SetMeasurementP7_objectS0___ZL40PyvtkGenericCellTessellator_GetMaxErrorsP7_objectS0___ZL28PyvtkGenericDataSet_IsTypeOfP7_objectS0___ZL23PyvtkGenericDataSet_IsAP7_objectS0___ZL32PyvtkGenericDataSet_SafeDownCastP7_objectS0___ZL31PyvtkGenericDataSet_NewInstanceP7_objectS0___ZL37PyvtkGenericDataSet_GetNumberOfPointsP7_objectS0___ZL36PyvtkGenericDataSet_GetNumberOfCellsP7_objectS0___ZL36PyvtkGenericDataSet_GetCellDimensionP7_objectS0___ZL32PyvtkGenericDataSet_GetCellTypesP7_objectS0___ZL35PyvtkGenericDataSet_NewCellIteratorP7_objectS0___ZL39PyvtkGenericDataSet_NewBoundaryIteratorP7_objectS0___ZL36PyvtkGenericDataSet_NewPointIteratorP7_objectS0___ZL29PyvtkGenericDataSet_FindPointP7_objectS0___ZL28PyvtkGenericDataSet_GetMTimeP7_objectS0___ZL33PyvtkGenericDataSet_ComputeBoundsP7_objectS0___ZL29PyvtkGenericDataSet_GetBoundsP7_objectS0___ZL29PyvtkGenericDataSet_GetCenterP7_objectS0___ZL29PyvtkGenericDataSet_GetLengthP7_objectS0___ZL33PyvtkGenericDataSet_GetAttributesP7_objectS0___ZL34PyvtkGenericDataSet_SetTessellatorP7_objectS0___ZL34PyvtkGenericDataSet_GetTessellatorP7_objectS0___ZL39PyvtkGenericDataSet_GetActualMemorySizeP7_objectS0___ZL37PyvtkGenericDataSet_GetDataObjectTypeP7_objectS0___ZL36PyvtkGenericDataSet_GetEstimatedSizeP7_objectS0___ZL27PyvtkGenericDataSet_GetDataP7_objectS0___ZL30PyvtkGenericDataSet_GetData_s2P7_objectS0___ZL30PyvtkGenericDataSet_GetData_s1P7_objectS0___ZL31PyvtkGenericEdgeTable_StaticNewv__ZL30PyvtkGenericEdgeTable_IsTypeOfP7_objectS0___ZL25PyvtkGenericEdgeTable_IsAP7_objectS0___ZL34PyvtkGenericEdgeTable_SafeDownCastP7_objectS0___ZL33PyvtkGenericEdgeTable_NewInstanceP7_objectS0___ZL32PyvtkGenericEdgeTable_InsertEdgeP7_objectS0___ZL32PyvtkGenericEdgeTable_RemoveEdgeP7_objectS0___ZL31PyvtkGenericEdgeTable_CheckEdgeP7_objectS0___ZL49PyvtkGenericEdgeTable_IncrementEdgeReferenceCountP7_objectS0___ZL45PyvtkGenericEdgeTable_CheckEdgeReferenceCountP7_objectS0___ZL32PyvtkGenericEdgeTable_InitializeP7_objectS0___ZL43PyvtkGenericEdgeTable_GetNumberOfComponentsP7_objectS0___ZL43PyvtkGenericEdgeTable_SetNumberOfComponentsP7_objectS0___ZL32PyvtkGenericEdgeTable_CheckPointP7_objectS0___ZL33PyvtkGenericEdgeTable_InsertPointP7_objectS0___ZL42PyvtkGenericEdgeTable_InsertPointAndScalarP7_objectS0___ZL33PyvtkGenericEdgeTable_RemovePointP7_objectS0___ZL50PyvtkGenericEdgeTable_IncrementPointReferenceCountP7_objectS0___ZL31PyvtkGenericEdgeTable_DumpTableP7_objectS0___ZL32PyvtkGenericEdgeTable_LoadFactorP7_objectS0___ZL47PyvtkGenericInterpolatedVelocityField_StaticNewv__ZL46PyvtkGenericInterpolatedVelocityField_IsTypeOfP7_objectS0___ZL41PyvtkGenericInterpolatedVelocityField_IsAP7_objectS0___ZL50PyvtkGenericInterpolatedVelocityField_SafeDownCastP7_objectS0___ZL49PyvtkGenericInterpolatedVelocityField_NewInstanceP7_objectS0___ZL52PyvtkGenericInterpolatedVelocityField_FunctionValuesP7_objectS0___ZL48PyvtkGenericInterpolatedVelocityField_AddDataSetP7_objectS0___ZL51PyvtkGenericInterpolatedVelocityField_ClearLastCellP7_objectS0___ZL49PyvtkGenericInterpolatedVelocityField_GetLastCellP7_objectS0___ZL61PyvtkGenericInterpolatedVelocityField_GetLastLocalCoordinatesP7_objectS0___ZL48PyvtkGenericInterpolatedVelocityField_GetCachingP7_objectS0___ZL48PyvtkGenericInterpolatedVelocityField_SetCachingP7_objectS0___ZL47PyvtkGenericInterpolatedVelocityField_CachingOnP7_objectS0___ZL48PyvtkGenericInterpolatedVelocityField_CachingOffP7_objectS0___ZL49PyvtkGenericInterpolatedVelocityField_GetCacheHitP7_objectS0___ZL50PyvtkGenericInterpolatedVelocityField_GetCacheMissP7_objectS0___ZL57PyvtkGenericInterpolatedVelocityField_GetVectorsSelectionP7_objectS0___ZL51PyvtkGenericInterpolatedVelocityField_SelectVectorsP7_objectS0___ZL52PyvtkGenericInterpolatedVelocityField_GetLastDataSetP7_objectS0___ZL52PyvtkGenericInterpolatedVelocityField_CopyParametersP7_objectS0___ZL34PyvtkGenericPointIterator_IsTypeOfP7_objectS0___ZL29PyvtkGenericPointIterator_IsAP7_objectS0___ZL38PyvtkGenericPointIterator_SafeDownCastP7_objectS0___ZL37PyvtkGenericPointIterator_NewInstanceP7_objectS0___ZL31PyvtkGenericPointIterator_BeginP7_objectS0___ZL33PyvtkGenericPointIterator_IsAtEndP7_objectS0___ZL30PyvtkGenericPointIterator_NextP7_objectS0___ZL37PyvtkGenericPointIterator_GetPositionP7_objectS0___ZL31PyvtkGenericPointIterator_GetIdP7_objectS0___ZL43PyvtkGenericSubdivisionErrorMetric_IsTypeOfP7_objectS0___ZL38PyvtkGenericSubdivisionErrorMetric_IsAP7_objectS0___ZL47PyvtkGenericSubdivisionErrorMetric_SafeDownCastP7_objectS0___ZL46PyvtkGenericSubdivisionErrorMetric_NewInstanceP7_objectS0___ZL58PyvtkGenericSubdivisionErrorMetric_RequiresEdgeSubdivisionP7_objectS0___ZL43PyvtkGenericSubdivisionErrorMetric_GetErrorP7_objectS0___ZL49PyvtkGenericSubdivisionErrorMetric_SetGenericCellP7_objectS0___ZL49PyvtkGenericSubdivisionErrorMetric_GetGenericCellP7_objectS0___ZL45PyvtkGenericSubdivisionErrorMetric_SetDataSetP7_objectS0___ZL45PyvtkGenericSubdivisionErrorMetric_GetDataSetP7_objectS0___ZL35PyvtkGeometricErrorMetric_StaticNewv__ZL34PyvtkGeometricErrorMetric_IsTypeOfP7_objectS0___ZL29PyvtkGeometricErrorMetric_IsAP7_objectS0___ZL38PyvtkGeometricErrorMetric_SafeDownCastP7_objectS0___ZL37PyvtkGeometricErrorMetric_NewInstanceP7_objectS0___ZL55PyvtkGeometricErrorMetric_GetAbsoluteGeometricToleranceP7_objectS0___ZL55PyvtkGeometricErrorMetric_SetAbsoluteGeometricToleranceP7_objectS0___ZL55PyvtkGeometricErrorMetric_SetRelativeGeometricToleranceP7_objectS0___ZL49PyvtkGeometricErrorMetric_RequiresEdgeSubdivisionP7_objectS0___ZL34PyvtkGeometricErrorMetric_GetErrorP7_objectS0___ZL37PyvtkGeometricErrorMetric_GetRelativeP7_objectS0___ZL22PyvtkOutEdgeType_CCopyPKv__ZL21PyvtkInEdgeType_CCopyPKv__ZL19PyvtkEdgeType_CCopyPKv__ZL20PyvtkEdgeBase_DeleteP7_object__ZL18PyvtkEdgeBase_HashP7_object__ZL20PyvtkEdgeBase_StringP7_object__ZL25PyvtkEdgeBase_RichCompareP7_objectS0_i__ZL17PyvtkEdgeBase_NewP11_typeobjectP7_objectS2___ZNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEED1Ev__ZNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEED0Ev__ZTv0_n24_NSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEED1Ev__ZTv0_n24_NSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEED0Ev__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEED1Ev__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEED0Ev__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE7seekoffExNS_8ios_base7seekdirEj__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE7seekposENS_4fposI11__mbstate_tEEj__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE9underflowEv__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE9pbackfailEi__ZNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE8overflowEi__ZNKSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEE3strEv__ZL23PyvtkOutEdgeType_DeleteP7_object__ZL21PyvtkOutEdgeType_HashP7_object__ZL20PyvtkOutEdgeType_NewP11_typeobjectP7_objectS2___ZL34PyvtkOutEdgeType_vtkOutEdgeType_s3P7_objectS0___ZL22PyvtkInEdgeType_DeleteP7_object__ZL20PyvtkInEdgeType_HashP7_object__ZL19PyvtkInEdgeType_NewP11_typeobjectP7_objectS2___ZL32PyvtkInEdgeType_vtkInEdgeType_s3P7_objectS0___ZL20PyvtkEdgeType_DeleteP7_object__ZL18PyvtkEdgeType_HashP7_object__ZL17PyvtkEdgeType_NewP11_typeobjectP7_objectS2___ZL28PyvtkEdgeType_vtkEdgeType_s3P7_objectS0___ZL19PyvtkGraph_IsTypeOfP7_objectS0___ZL14PyvtkGraph_IsAP7_objectS0___ZL23PyvtkGraph_SafeDownCastP7_objectS0___ZL22PyvtkGraph_NewInstanceP7_objectS0___ZL24PyvtkGraph_GetVertexDataP7_objectS0___ZL22PyvtkGraph_GetEdgeDataP7_objectS0___ZL28PyvtkGraph_GetDataObjectTypeP7_objectS0___ZL21PyvtkGraph_InitializeP7_objectS0___ZL19PyvtkGraph_GetPointP7_objectS0___ZL20PyvtkGraph_GetPointsP7_objectS0___ZL20PyvtkGraph_SetPointsP7_objectS0___ZL24PyvtkGraph_ComputeBoundsP7_objectS0___ZL20PyvtkGraph_GetBoundsP7_objectS0___ZL19PyvtkGraph_GetMTimeP7_objectS0___ZL22PyvtkGraph_GetOutEdgesP7_objectS0___ZL20PyvtkGraph_GetDegreeP7_objectS0___ZL23PyvtkGraph_GetOutDegreeP7_objectS0___ZL21PyvtkGraph_GetOutEdgeP7_objectS0___ZL21PyvtkGraph_GetInEdgesP7_objectS0___ZL22PyvtkGraph_GetInDegreeP7_objectS0___ZL20PyvtkGraph_GetInEdgeP7_objectS0___ZL30PyvtkGraph_GetAdjacentVerticesP7_objectS0___ZL19PyvtkGraph_GetEdgesP7_objectS0___ZL27PyvtkGraph_GetNumberOfEdgesP7_objectS0___ZL22PyvtkGraph_GetVerticesP7_objectS0___ZL30PyvtkGraph_GetNumberOfVerticesP7_objectS0___ZL36PyvtkGraph_SetDistributedGraphHelperP7_objectS0___ZL36PyvtkGraph_GetDistributedGraphHelperP7_objectS0___ZL21PyvtkGraph_FindVertexP7_objectS0___ZL22PyvtkGraph_ShallowCopyP7_objectS0___ZL19PyvtkGraph_DeepCopyP7_objectS0___ZL24PyvtkGraph_CopyStructureP7_objectS0___ZL29PyvtkGraph_CheckedShallowCopyP7_objectS0___ZL26PyvtkGraph_CheckedDeepCopyP7_objectS0___ZL18PyvtkGraph_SqueezeP7_objectS0___ZL18PyvtkGraph_GetDataP7_objectS0___ZL29PyvtkGraph_ReorderOutVerticesP7_objectS0___ZL26PyvtkGraph_IsSameStructureP7_objectS0___ZL26PyvtkGraph_GetSourceVertexP7_objectS0___ZL26PyvtkGraph_GetTargetVertexP7_objectS0___ZL24PyvtkGraph_SetEdgePointsP7_objectS0___ZL24PyvtkGraph_GetEdgePointsP7_objectS0___ZL32PyvtkGraph_GetNumberOfEdgePointsP7_objectS0___ZL23PyvtkGraph_GetEdgePointP7_objectS0___ZL26PyvtkGraph_ClearEdgePointsP7_objectS0___ZL23PyvtkGraph_SetEdgePointP7_objectS0___ZL23PyvtkGraph_AddEdgePointP7_objectS0___ZL32PyvtkGraph_ShallowCopyEdgePointsP7_objectS0___ZL29PyvtkGraph_DeepCopyEdgePointsP7_objectS0___ZL28PyvtkGraph_GetGraphInternalsP7_objectS0___ZL26PyvtkGraph_GetInducedEdgesP7_objectS0___ZL35PyvtkGraph_GetAttributesAsFieldDataP7_objectS0___ZL30PyvtkGraph_GetNumberOfElementsP7_objectS0___ZL15PyvtkGraph_DumpP7_objectS0___ZL20PyvtkGraph_GetEdgeIdP7_objectS0___ZL26PyvtkGraph_ToDirectedGraphP7_objectS0___ZL28PyvtkGraph_ToUndirectedGraphP7_objectS0___ZL21PyvtkGraph_GetData_s2P7_objectS0___ZL21PyvtkGraph_GetData_s1P7_objectS0___ZL24PyvtkGraphEdge_StaticNewv__ZL23PyvtkGraphEdge_IsTypeOfP7_objectS0___ZL18PyvtkGraphEdge_IsAP7_objectS0___ZL27PyvtkGraphEdge_SafeDownCastP7_objectS0___ZL26PyvtkGraphEdge_NewInstanceP7_objectS0___ZL24PyvtkGraphEdge_SetSourceP7_objectS0___ZL24PyvtkGraphEdge_GetSourceP7_objectS0___ZL24PyvtkGraphEdge_SetTargetP7_objectS0___ZL24PyvtkGraphEdge_GetTargetP7_objectS0___ZL20PyvtkGraphEdge_SetIdP7_objectS0___ZL20PyvtkGraphEdge_GetIdP7_objectS0___ZL30PyvtkVertexAdjacencyList_CCopyPKv__ZL29PyvtkGraphInternals_StaticNewv__ZL31PyvtkVertexAdjacencyList_DeleteP7_object__ZL29PyvtkVertexAdjacencyList_HashP7_object__ZL28PyvtkVertexAdjacencyList_NewP11_typeobjectP7_objectS2___ZL50PyvtkVertexAdjacencyList_vtkVertexAdjacencyList_s2P7_objectS0___ZN22vtkVertexAdjacencyListC2ERKS___ZL28PyvtkGraphInternals_IsTypeOfP7_objectS0___ZL23PyvtkGraphInternals_IsAP7_objectS0___ZL32PyvtkGraphInternals_SafeDownCastP7_objectS0___ZL31PyvtkGraphInternals_NewInstanceP7_objectS0___ZL29PyvtkHexagonalPrism_StaticNewv__ZL28PyvtkHexagonalPrism_IsTypeOfP7_objectS0___ZL23PyvtkHexagonalPrism_IsAP7_objectS0___ZL32PyvtkHexagonalPrism_SafeDownCastP7_objectS0___ZL31PyvtkHexagonalPrism_NewInstanceP7_objectS0___ZL33PyvtkHexagonalPrism_GetEdgePointsP7_objectS0___ZL33PyvtkHexagonalPrism_GetFacePointsP7_objectS0___ZL31PyvtkHexagonalPrism_GetCellTypeP7_objectS0___ZL36PyvtkHexagonalPrism_GetCellDimensionP7_objectS0___ZL36PyvtkHexagonalPrism_GetNumberOfEdgesP7_objectS0___ZL36PyvtkHexagonalPrism_GetNumberOfFacesP7_objectS0___ZL27PyvtkHexagonalPrism_GetEdgeP7_objectS0___ZL27PyvtkHexagonalPrism_GetFaceP7_objectS0___ZL32PyvtkHexagonalPrism_CellBoundaryP7_objectS0___ZL36PyvtkHexagonalPrism_EvaluatePositionP7_objectS0___ZL36PyvtkHexagonalPrism_EvaluateLocationP7_objectS0___ZL37PyvtkHexagonalPrism_IntersectWithLineP7_objectS0___ZL31PyvtkHexagonalPrism_TriangulateP7_objectS0___ZL31PyvtkHexagonalPrism_DerivativesP7_objectS0___ZL39PyvtkHexagonalPrism_GetParametricCoordsP7_objectS0___ZL39PyvtkHexagonalPrism_GetParametricCenterP7_objectS0___ZL42PyvtkHexagonalPrism_InterpolationFunctionsP7_objectS0___ZL39PyvtkHexagonalPrism_InterpolationDerivsP7_objectS0___ZL40PyvtkHexagonalPrism_InterpolateFunctionsP7_objectS0___ZL37PyvtkHexagonalPrism_InterpolateDerivsP7_objectS0___ZL32PyvtkHexagonalPrism_GetEdgeArrayP7_objectS0___ZL32PyvtkHexagonalPrism_GetFaceArrayP7_objectS0___ZL25PyvtkHexahedron_StaticNewv__ZL24PyvtkHexahedron_IsTypeOfP7_objectS0___ZL19PyvtkHexahedron_IsAP7_objectS0___ZL28PyvtkHexahedron_SafeDownCastP7_objectS0___ZL27PyvtkHexahedron_NewInstanceP7_objectS0___ZL29PyvtkHexahedron_GetEdgePointsP7_objectS0___ZL29PyvtkHexahedron_GetFacePointsP7_objectS0___ZL27PyvtkHexahedron_GetCellTypeP7_objectS0___ZL32PyvtkHexahedron_GetNumberOfEdgesP7_objectS0___ZL32PyvtkHexahedron_GetNumberOfFacesP7_objectS0___ZL23PyvtkHexahedron_GetEdgeP7_objectS0___ZL23PyvtkHexahedron_GetFaceP7_objectS0___ZL28PyvtkHexahedron_CellBoundaryP7_objectS0___ZL23PyvtkHexahedron_ContourP7_objectS0___ZL32PyvtkHexahedron_EvaluatePositionP7_objectS0___ZL32PyvtkHexahedron_EvaluateLocationP7_objectS0___ZL33PyvtkHexahedron_IntersectWithLineP7_objectS0___ZL27PyvtkHexahedron_TriangulateP7_objectS0___ZL27PyvtkHexahedron_DerivativesP7_objectS0___ZL35PyvtkHexahedron_GetParametricCoordsP7_objectS0___ZL38PyvtkHexahedron_InterpolationFunctionsP7_objectS0___ZL35PyvtkHexahedron_InterpolationDerivsP7_objectS0___ZL36PyvtkHexahedron_InterpolateFunctionsP7_objectS0___ZL33PyvtkHexahedron_InterpolateDerivsP7_objectS0___ZL28PyvtkHexahedron_GetEdgeArrayP7_objectS0___ZL28PyvtkHexahedron_GetFaceArrayP7_objectS0___ZL42PyvtkHierarchicalBoxDataIterator_StaticNewv__ZL41PyvtkHierarchicalBoxDataIterator_IsTypeOfP7_objectS0___ZL36PyvtkHierarchicalBoxDataIterator_IsAP7_objectS0___ZL45PyvtkHierarchicalBoxDataIterator_SafeDownCastP7_objectS0___ZL44PyvtkHierarchicalBoxDataIterator_NewInstanceP7_objectS0___ZL37PyvtkHierarchicalBoxDataSet_StaticNewv__ZL36PyvtkHierarchicalBoxDataSet_IsTypeOfP7_objectS0___ZL31PyvtkHierarchicalBoxDataSet_IsAP7_objectS0___ZL40PyvtkHierarchicalBoxDataSet_SafeDownCastP7_objectS0___ZL39PyvtkHierarchicalBoxDataSet_NewInstanceP7_objectS0___ZL39PyvtkHierarchicalBoxDataSet_NewIteratorP7_objectS0___ZL45PyvtkHierarchicalBoxDataSet_GetDataObjectTypeP7_objectS0___ZL35PyvtkHierarchicalBoxDataSet_GetDataP7_objectS0___ZN17vtkOverlappingAMR8IsTypeOfEPKc__ZL38PyvtkHierarchicalBoxDataSet_GetData_s2P7_objectS0___ZL38PyvtkHierarchicalBoxDataSet_GetData_s1P7_objectS0___ZL23PyvtkHyperTree_IsTypeOfP7_objectS0___ZL18PyvtkHyperTree_IsAP7_objectS0___ZL27PyvtkHyperTree_SafeDownCastP7_objectS0___ZL26PyvtkHyperTree_NewInstanceP7_objectS0___ZL25PyvtkHyperTree_InitializeP7_objectS0___ZL32PyvtkHyperTree_GetNumberOfLevelsP7_objectS0___ZL34PyvtkHyperTree_GetNumberOfVerticesP7_objectS0___ZL31PyvtkHyperTree_GetNumberOfNodesP7_objectS0___ZL32PyvtkHyperTree_GetNumberOfLeavesP7_objectS0___ZL30PyvtkHyperTree_GetBranchFactorP7_objectS0___ZL27PyvtkHyperTree_GetDimensionP7_objectS0___ZL34PyvtkHyperTree_GetNumberOfChildrenP7_objectS0___ZL23PyvtkHyperTree_SetScaleP7_objectS0___ZL23PyvtkHyperTree_GetScaleP7_objectS0___ZL29PyvtkHyperTree_CreateInstanceP7_objectS0___ZL30PyvtkHyperTree_FindParentIndexP7_objectS0___ZL34PyvtkHyperTree_FindChildParametersP7_objectS0___ZL24PyvtkHyperTree_NewCursorP7_objectS0___ZL28PyvtkHyperTree_SubdivideLeafP7_objectS0___ZL34PyvtkHyperTree_GetActualMemorySizeP7_objectS0___ZL34PyvtkHyperTree_SetGlobalIndexStartP7_objectS0___ZL38PyvtkHyperTree_SetGlobalIndexFromLocalP7_objectS0___ZL38PyvtkHyperTree_GetGlobalIndexFromLocalP7_objectS0___ZL26PyvtkHyperTree_GetScale_s1P7_objectS0___ZL26PyvtkHyperTree_GetScale_s2P7_objectS0___ZL29PyvtkHyperTreeCursor_IsTypeOfP7_objectS0___ZL24PyvtkHyperTreeCursor_IsAP7_objectS0___ZL33PyvtkHyperTreeCursor_SafeDownCastP7_objectS0___ZL32PyvtkHyperTreeCursor_NewInstanceP7_objectS0___ZL28PyvtkHyperTreeCursor_SetTreeP7_objectS0___ZL28PyvtkHyperTreeCursor_GetTreeP7_objectS0___ZL32PyvtkHyperTreeCursor_GetVertexIdP7_objectS0___ZL27PyvtkHyperTreeCursor_IsLeafP7_objectS0___ZL27PyvtkHyperTreeCursor_IsRootP7_objectS0___ZL29PyvtkHyperTreeCursor_GetLevelP7_objectS0___ZL34PyvtkHyperTreeCursor_GetChildIndexP7_objectS0___ZL27PyvtkHyperTreeCursor_ToRootP7_objectS0___ZL29PyvtkHyperTreeCursor_ToParentP7_objectS0___ZL28PyvtkHyperTreeCursor_ToChildP7_objectS0___ZL33PyvtkHyperTreeCursor_ToSameVertexP7_objectS0___ZL28PyvtkHyperTreeCursor_IsEqualP7_objectS0___ZL26PyvtkHyperTreeCursor_CloneP7_objectS0___ZL29PyvtkHyperTreeCursor_SameTreeP7_objectS0___ZL40PyvtkHyperTreeCursor_GetNumberOfChildrenP7_objectS0___ZL33PyvtkHyperTreeCursor_GetDimensionP7_objectS0___ZL28PyvtkHyperTreeGrid_StaticNewv__ZL25PyvtkHyperTreeGrid_LEVELSP7_objectS0___ZL28PyvtkHyperTreeGrid_DIMENSIONP7_objectS0___ZL30PyvtkHyperTreeGrid_ORIENTATIONP7_objectS0___ZL24PyvtkHyperTreeGrid_SIZESP7_objectS0___ZL27PyvtkHyperTreeGrid_IsTypeOfP7_objectS0___ZL22PyvtkHyperTreeGrid_IsAP7_objectS0___ZL31PyvtkHyperTreeGrid_SafeDownCastP7_objectS0___ZL30PyvtkHyperTreeGrid_NewInstanceP7_objectS0___ZL36PyvtkHyperTreeGrid_GetDataObjectTypeP7_objectS0___ZL32PyvtkHyperTreeGrid_CopyStructureP7_objectS0___ZL30PyvtkHyperTreeGrid_SetGridSizeP7_objectS0___ZL30PyvtkHyperTreeGrid_GetGridSizeP7_objectS0___ZL32PyvtkHyperTreeGrid_SetGridExtentP7_objectS0___ZL44PyvtkHyperTreeGrid_SetTransposedRootIndexingP7_objectS0___ZL44PyvtkHyperTreeGrid_GetTransposedRootIndexingP7_objectS0___ZL39PyvtkHyperTreeGrid_SetIndexingModeToKJIP7_objectS0___ZL39PyvtkHyperTreeGrid_SetIndexingModeToIJKP7_objectS0___ZL31PyvtkHyperTreeGrid_SetDimensionP7_objectS0___ZL31PyvtkHyperTreeGrid_GetDimensionP7_objectS0___ZL33PyvtkHyperTreeGrid_SetOrientationP7_objectS0___ZL33PyvtkHyperTreeGrid_GetOrientationP7_objectS0___ZL34PyvtkHyperTreeGrid_SetBranchFactorP7_objectS0___ZL34PyvtkHyperTreeGrid_GetBranchFactorP7_objectS0___ZL35PyvtkHyperTreeGrid_GetNumberOfTreesP7_objectS0___ZL38PyvtkHyperTreeGrid_GetNumberOfVerticesP7_objectS0___ZL36PyvtkHyperTreeGrid_GetNumberOfLeavesP7_objectS0___ZL35PyvtkHyperTreeGrid_GetNumberOfCellsP7_objectS0___ZL36PyvtkHyperTreeGrid_GetNumberOfPointsP7_objectS0___ZL36PyvtkHyperTreeGrid_GetNumberOfLevelsP7_objectS0___ZL34PyvtkHyperTreeGrid_SetXCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_GetXCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_SetYCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_GetYCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_SetZCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_GetZCoordinatesP7_objectS0___ZL34PyvtkHyperTreeGrid_SetMaterialMaskP7_objectS0___ZL34PyvtkHyperTreeGrid_GetMaterialMaskP7_objectS0___ZL34PyvtkHyperTreeGrid_HasMaterialMaskP7_objectS0___ZL39PyvtkHyperTreeGrid_SetMaterialMaskIndexP7_objectS0___ZL39PyvtkHyperTreeGrid_GetMaterialMaskIndexP7_objectS0___ZL34PyvtkHyperTreeGrid_SetHasInterfaceP7_objectS0___ZL34PyvtkHyperTreeGrid_GetHasInterfaceP7_objectS0___ZL33PyvtkHyperTreeGrid_HasInterfaceOnP7_objectS0___ZL34PyvtkHyperTreeGrid_HasInterfaceOffP7_objectS0___ZL42PyvtkHyperTreeGrid_SetInterfaceNormalsNameP7_objectS0___ZL42PyvtkHyperTreeGrid_GetInterfaceNormalsNameP7_objectS0___ZL45PyvtkHyperTreeGrid_SetInterfaceInterceptsNameP7_objectS0___ZL45PyvtkHyperTreeGrid_GetInterfaceInterceptsNameP7_objectS0___ZL32PyvtkHyperTreeGrid_GenerateTreesP7_objectS0___ZL28PyvtkHyperTreeGrid_NewCursorP7_objectS0___ZL32PyvtkHyperTreeGrid_NewGridCursorP7_objectS0___ZL37PyvtkHyperTreeGrid_NewGeometricCursorP7_objectS0___ZL43PyvtkHyperTreeGrid_NewVonNeumannSuperCursorP7_objectS0___ZL38PyvtkHyperTreeGrid_NewMooreSuperCursorP7_objectS0___ZL32PyvtkHyperTreeGrid_SubdivideLeafP7_objectS0___ZL27PyvtkHyperTreeGrid_GetPointP7_objectS0___ZL26PyvtkHyperTreeGrid_GetCellP7_objectS0___ZL30PyvtkHyperTreeGrid_GetCellTypeP7_objectS0___ZL32PyvtkHyperTreeGrid_GetCellPointsP7_objectS0___ZL32PyvtkHyperTreeGrid_GetPointCellsP7_objectS0___ZL35PyvtkHyperTreeGrid_GetCellNeighborsP7_objectS0___ZL28PyvtkHyperTreeGrid_FindPointP7_objectS0___ZL27PyvtkHyperTreeGrid_FindCellP7_objectS0___ZL29PyvtkHyperTreeGrid_InitializeP7_objectS0___ZL26PyvtkHyperTreeGrid_GetTreeP7_objectS0___ZL26PyvtkHyperTreeGrid_SetTreeP7_objectS0___ZL33PyvtkHyperTreeGrid_GetMaxCellSizeP7_objectS0___ZL30PyvtkHyperTreeGrid_ShallowCopyP7_objectS0___ZL27PyvtkHyperTreeGrid_DeepCopyP7_objectS0___ZL32PyvtkHyperTreeGrid_GetExtentTypeP7_objectS0___ZL38PyvtkHyperTreeGrid_GetActualMemorySizeP7_objectS0___ZL38PyvtkHyperTreeGrid_GetNumberOfChildrenP7_objectS0___ZL56PyvtkHyperTreeGrid_RecursivelyInitializePureMaterialMaskP7_objectS0___ZL38PyvtkHyperTreeGrid_GetPureMaterialMaskP7_objectS0___ZL31PyvtkHyperTreeGrid_GetChildMaskP7_objectS0___ZL51PyvtkHyperTreeGrid_GetLevelZeroCoordinatesFromIndexP7_objectS0___ZL51PyvtkHyperTreeGrid_GetIndexFromLevelZeroCoordinatesP7_objectS0___ZL43PyvtkHyperTreeGrid_GetShiftedLevelZeroIndexP7_objectS0___ZL26PyvtkHyperTreeGrid_GetDataP7_objectS0___ZL29PyvtkHyperTreeGrid_GetData_s2P7_objectS0___ZL29PyvtkHyperTreeGrid_GetData_s1P7_objectS0___ZL34PyvtkHyperTreeGridCursor_StaticNewv__ZL33PyvtkHyperTreeGridCursor_IsTypeOfP7_objectS0___ZL28PyvtkHyperTreeGridCursor_IsAP7_objectS0___ZL37PyvtkHyperTreeGridCursor_SafeDownCastP7_objectS0___ZL36PyvtkHyperTreeGridCursor_NewInstanceP7_objectS0___ZL30PyvtkHyperTreeGridCursor_CloneP7_objectS0___ZL35PyvtkHyperTreeGridCursor_InitializeP7_objectS0___ZL32PyvtkHyperTreeGridCursor_SetGridP7_objectS0___ZL32PyvtkHyperTreeGridCursor_GetGridP7_objectS0___ZL32PyvtkHyperTreeGridCursor_SetTreeP7_objectS0___ZL32PyvtkHyperTreeGridCursor_GetTreeP7_objectS0___ZL36PyvtkHyperTreeGridCursor_GetVertexIdP7_objectS0___ZL43PyvtkHyperTreeGridCursor_GetGlobalNodeIndexP7_objectS0___ZL31PyvtkHyperTreeGridCursor_IsLeafP7_objectS0___ZL31PyvtkHyperTreeGridCursor_IsRootP7_objectS0___ZL33PyvtkHyperTreeGridCursor_GetLevelP7_objectS0___ZL38PyvtkHyperTreeGridCursor_GetChildIndexP7_objectS0___ZL31PyvtkHyperTreeGridCursor_ToRootP7_objectS0___ZL33PyvtkHyperTreeGridCursor_ToParentP7_objectS0___ZL32PyvtkHyperTreeGridCursor_ToChildP7_objectS0___ZL37PyvtkHyperTreeGridCursor_ToSameVertexP7_objectS0___ZL32PyvtkHyperTreeGridCursor_IsEqualP7_objectS0___ZL33PyvtkHyperTreeGridCursor_SameTreeP7_objectS0___ZL44PyvtkHyperTreeGridCursor_GetNumberOfChildrenP7_objectS0___ZL37PyvtkHyperTreeGridCursor_GetDimensionP7_objectS0___ZL34PyvtkHyperTreeGridCursor_GetOriginP7_objectS0___ZL32PyvtkHyperTreeGridCursor_GetSizeP7_objectS0___ZL34PyvtkHyperTreeGridCursor_GetBoundsP7_objectS0___ZL33PyvtkHyperTreeGridCursor_GetPointP7_objectS0___ZL43PyvtkHyperTreeGridCursor_GetNumberOfCursorsP7_objectS0___ZL34PyvtkHyperTreeGridCursor_GetCursorP7_objectS0___ZL41PyvtkHyperTreeGridCursor_GetCornerCursorsP7_objectS0___ZL24PyvtkImageData_StaticNewv__ZL23PyvtkImageData_IsTypeOfP7_objectS0___ZL18PyvtkImageData_IsAP7_objectS0___ZL27PyvtkImageData_SafeDownCastP7_objectS0___ZL26PyvtkImageData_NewInstanceP7_objectS0___ZL28PyvtkImageData_CopyStructureP7_objectS0___ZL32PyvtkImageData_GetDataObjectTypeP7_objectS0___ZL31PyvtkImageData_GetNumberOfCellsP7_objectS0___ZL32PyvtkImageData_GetNumberOfPointsP7_objectS0___ZL23PyvtkImageData_GetPointP7_objectS0___ZL22PyvtkImageData_GetCellP7_objectS0___ZL28PyvtkImageData_GetCellBoundsP7_objectS0___ZL24PyvtkImageData_FindPointP7_objectS0___ZL23PyvtkImageData_FindCellP7_objectS0___ZL29PyvtkImageData_FindAndGetCellP7_objectS0___ZL26PyvtkImageData_GetCellTypeP7_objectS0___ZL28PyvtkImageData_GetCellPointsP7_objectS0___ZL28PyvtkImageData_GetPointCellsP7_objectS0___ZL28PyvtkImageData_ComputeBoundsP7_objectS0___ZL29PyvtkImageData_GetMaxCellSizeP7_objectS0___ZL25PyvtkImageData_InitializeP7_objectS0___ZL28PyvtkImageData_SetDimensionsP7_objectS0___ZL28PyvtkImageData_GetDimensionsP7_objectS0___ZL43PyvtkImageData_ComputeStructuredCoordinatesP7_objectS0___ZL31PyvtkImageData_GetVoxelGradientP7_objectS0___ZL31PyvtkImageData_GetPointGradientP7_objectS0___ZL31PyvtkImageData_GetDataDimensionP7_objectS0___ZL29PyvtkImageData_ComputePointIdP7_objectS0___ZL28PyvtkImageData_ComputeCellIdP7_objectS0___ZL34PyvtkImageData_SetAxisUpdateExtentP7_objectS0___ZL34PyvtkImageData_GetAxisUpdateExtentP7_objectS0___ZL24PyvtkImageData_SetExtentP7_objectS0___ZL24PyvtkImageData_GetExtentP7_objectS0___ZL31PyvtkImageData_GetScalarTypeMinP7_objectS0___ZL31PyvtkImageData_GetScalarTypeMaxP7_objectS0___ZL28PyvtkImageData_GetScalarSizeP7_objectS0___ZL28PyvtkImageData_GetIncrementsP7_objectS0___ZL38PyvtkImageData_GetContinuousIncrementsP7_objectS0___ZL40PyvtkImageData_GetScalarPointerForExtentP7_objectS0___ZL31PyvtkImageData_GetScalarPointerP7_objectS0___ZL40PyvtkImageData_GetScalarComponentAsFloatP7_objectS0___ZL42PyvtkImageData_SetScalarComponentFromFloatP7_objectS0___ZL41PyvtkImageData_GetScalarComponentAsDoubleP7_objectS0___ZL43PyvtkImageData_SetScalarComponentFromDoubleP7_objectS0___ZL30PyvtkImageData_AllocateScalarsP7_objectS0___ZL30PyvtkImageData_CopyAndCastFromP7_objectS0___ZL19PyvtkImageData_CropP7_objectS0___ZL34PyvtkImageData_GetActualMemorySizeP7_objectS0___ZL25PyvtkImageData_SetSpacingP7_objectS0___ZL25PyvtkImageData_GetSpacingP7_objectS0___ZL24PyvtkImageData_SetOriginP7_objectS0___ZL24PyvtkImageData_GetOriginP7_objectS0___ZL28PyvtkImageData_SetScalarTypeP7_objectS0___ZL28PyvtkImageData_GetScalarTypeP7_objectS0___ZL28PyvtkImageData_HasScalarTypeP7_objectS0___ZL36PyvtkImageData_GetScalarTypeAsStringP7_objectS0___ZL42PyvtkImageData_SetNumberOfScalarComponentsP7_objectS0___ZL42PyvtkImageData_GetNumberOfScalarComponentsP7_objectS0___ZL42PyvtkImageData_HasNumberOfScalarComponentsP7_objectS0___ZL42PyvtkImageData_CopyInformationFromPipelineP7_objectS0___ZL40PyvtkImageData_CopyInformationToPipelineP7_objectS0___ZL32PyvtkImageData_PrepareForNewDataP7_objectS0___ZL26PyvtkImageData_ShallowCopyP7_objectS0___ZL23PyvtkImageData_DeepCopyP7_objectS0___ZL39PyvtkImageData_GetArrayPointerForExtentP7_objectS0___ZL30PyvtkImageData_GetArrayPointerP7_objectS0___ZL33PyvtkImageData_GetArrayIncrementsP7_objectS0___ZL36PyvtkImageData_ComputeInternalExtentP7_objectS0___ZL28PyvtkImageData_GetExtentTypeP7_objectS0___ZL22PyvtkImageData_GetDataP7_objectS0___ZL31PyvtkImageData_GetIncrements_s3P7_objectS0___ZL31PyvtkImageData_GetIncrements_s4P7_objectS0___ZL31PyvtkImageData_GetScalarType_s1P7_objectS0___ZN12vtkImageData21GetScalarTypeAsStringEv__ZL45PyvtkImageData_GetNumberOfScalarComponents_s1P7_objectS0___ZL25PyvtkImageData_GetData_s2P7_objectS0___ZL25PyvtkImageData_GetData_s1P7_objectS0___ZL30PyvtkImplicitBoolean_StaticNewv__ZL29PyvtkImplicitBoolean_IsTypeOfP7_objectS0___ZL24PyvtkImplicitBoolean_IsAP7_objectS0___ZL33PyvtkImplicitBoolean_SafeDownCastP7_objectS0___ZL32PyvtkImplicitBoolean_NewInstanceP7_objectS0___ZL37PyvtkImplicitBoolean_EvaluateFunctionP7_objectS0___ZL37PyvtkImplicitBoolean_EvaluateGradientP7_objectS0___ZL29PyvtkImplicitBoolean_GetMTimeP7_objectS0___ZL32PyvtkImplicitBoolean_AddFunctionP7_objectS0___ZL35PyvtkImplicitBoolean_RemoveFunctionP7_objectS0___ZL32PyvtkImplicitBoolean_GetFunctionP7_objectS0___ZL37PyvtkImplicitBoolean_SetOperationTypeP7_objectS0___ZL45PyvtkImplicitBoolean_GetOperationTypeMinValueP7_objectS0___ZL45PyvtkImplicitBoolean_GetOperationTypeMaxValueP7_objectS0___ZL37PyvtkImplicitBoolean_GetOperationTypeP7_objectS0___ZL44PyvtkImplicitBoolean_SetOperationTypeToUnionP7_objectS0___ZL51PyvtkImplicitBoolean_SetOperationTypeToIntersectionP7_objectS0___ZL49PyvtkImplicitBoolean_SetOperationTypeToDifferenceP7_objectS0___ZL56PyvtkImplicitBoolean_SetOperationTypeToUnionOfMagnitudesP7_objectS0___ZL45PyvtkImplicitBoolean_GetOperationTypeAsStringP7_objectS0___ZL30PyvtkImplicitDataSet_StaticNewv__ZL29PyvtkImplicitDataSet_IsTypeOfP7_objectS0___ZL24PyvtkImplicitDataSet_IsAP7_objectS0___ZL33PyvtkImplicitDataSet_SafeDownCastP7_objectS0___ZL32PyvtkImplicitDataSet_NewInstanceP7_objectS0___ZL29PyvtkImplicitDataSet_GetMTimeP7_objectS0___ZL37PyvtkImplicitDataSet_EvaluateFunctionP7_objectS0___ZL37PyvtkImplicitDataSet_EvaluateGradientP7_objectS0___ZL31PyvtkImplicitDataSet_SetDataSetP7_objectS0___ZL31PyvtkImplicitDataSet_GetDataSetP7_objectS0___ZL32PyvtkImplicitDataSet_SetOutValueP7_objectS0___ZL32PyvtkImplicitDataSet_GetOutValueP7_objectS0___ZL35PyvtkImplicitDataSet_SetOutGradientP7_objectS0___ZL35PyvtkImplicitDataSet_GetOutGradientP7_objectS0___ZL41PyvtkImplicitFunctionCollection_StaticNewv__ZL40PyvtkImplicitFunctionCollection_IsTypeOfP7_objectS0___ZL35PyvtkImplicitFunctionCollection_IsAP7_objectS0___ZL44PyvtkImplicitFunctionCollection_SafeDownCastP7_objectS0___ZL43PyvtkImplicitFunctionCollection_NewInstanceP7_objectS0___ZL39PyvtkImplicitFunctionCollection_AddItemP7_objectS0___ZL43PyvtkImplicitFunctionCollection_GetNextItemP7_objectS0___ZL30PyvtkImplicitFunction_IsTypeOfP7_objectS0___ZL25PyvtkImplicitFunction_IsAP7_objectS0___ZL34PyvtkImplicitFunction_SafeDownCastP7_objectS0___ZL33PyvtkImplicitFunction_NewInstanceP7_objectS0___ZL30PyvtkImplicitFunction_GetMTimeP7_objectS0___ZL35PyvtkImplicitFunction_FunctionValueP7_objectS0___ZL38PyvtkImplicitFunction_FunctionGradientP7_objectS0___ZL34PyvtkImplicitFunction_SetTransformP7_objectS0___ZL34PyvtkImplicitFunction_GetTransformP7_objectS0___ZL38PyvtkImplicitFunction_EvaluateFunctionP7_objectS0___ZL38PyvtkImplicitFunction_EvaluateGradientP7_objectS0___ZL37PyvtkImplicitFunction_SetTransform_s1P7_objectS0___ZL37PyvtkImplicitFunction_SetTransform_s2P7_objectS0___ZL27PyvtkImplicitHalo_StaticNewv__ZL26PyvtkImplicitHalo_IsTypeOfP7_objectS0___ZL21PyvtkImplicitHalo_IsAP7_objectS0___ZL30PyvtkImplicitHalo_SafeDownCastP7_objectS0___ZL29PyvtkImplicitHalo_NewInstanceP7_objectS0___ZL34PyvtkImplicitHalo_EvaluateFunctionP7_objectS0___ZL34PyvtkImplicitHalo_EvaluateGradientP7_objectS0___ZL27PyvtkImplicitHalo_SetRadiusP7_objectS0___ZL27PyvtkImplicitHalo_GetRadiusP7_objectS0___ZL27PyvtkImplicitHalo_SetCenterP7_objectS0___ZL27PyvtkImplicitHalo_GetCenterP7_objectS0___ZL28PyvtkImplicitHalo_SetFadeOutP7_objectS0___ZL28PyvtkImplicitHalo_GetFadeOutP7_objectS0___ZL36PyvtkImplicitSelectionLoop_StaticNewv__ZL35PyvtkImplicitSelectionLoop_IsTypeOfP7_objectS0___ZL30PyvtkImplicitSelectionLoop_IsAP7_objectS0___ZL39PyvtkImplicitSelectionLoop_SafeDownCastP7_objectS0___ZL38PyvtkImplicitSelectionLoop_NewInstanceP7_objectS0___ZL43PyvtkImplicitSelectionLoop_EvaluateFunctionP7_objectS0___ZL43PyvtkImplicitSelectionLoop_EvaluateGradientP7_objectS0___ZL34PyvtkImplicitSelectionLoop_SetLoopP7_objectS0___ZL34PyvtkImplicitSelectionLoop_GetLoopP7_objectS0___ZL55PyvtkImplicitSelectionLoop_SetAutomaticNormalGenerationP7_objectS0___ZL55PyvtkImplicitSelectionLoop_GetAutomaticNormalGenerationP7_objectS0___ZL54PyvtkImplicitSelectionLoop_AutomaticNormalGenerationOnP7_objectS0___ZL55PyvtkImplicitSelectionLoop_AutomaticNormalGenerationOffP7_objectS0___ZL36PyvtkImplicitSelectionLoop_SetNormalP7_objectS0___ZL36PyvtkImplicitSelectionLoop_GetNormalP7_objectS0___ZL35PyvtkImplicitSelectionLoop_GetMTimeP7_objectS0___ZL26PyvtkImplicitSum_StaticNewv__ZL25PyvtkImplicitSum_IsTypeOfP7_objectS0___ZL20PyvtkImplicitSum_IsAP7_objectS0___ZL29PyvtkImplicitSum_SafeDownCastP7_objectS0___ZL28PyvtkImplicitSum_NewInstanceP7_objectS0___ZL33PyvtkImplicitSum_EvaluateFunctionP7_objectS0___ZL33PyvtkImplicitSum_EvaluateGradientP7_objectS0___ZL25PyvtkImplicitSum_GetMTimeP7_objectS0___ZL28PyvtkImplicitSum_AddFunctionP7_objectS0___ZL35PyvtkImplicitSum_RemoveAllFunctionsP7_objectS0___ZL34PyvtkImplicitSum_SetFunctionWeightP7_objectS0___ZL37PyvtkImplicitSum_SetNormalizeByWeightP7_objectS0___ZL37PyvtkImplicitSum_GetNormalizeByWeightP7_objectS0___ZL36PyvtkImplicitSum_NormalizeByWeightOnP7_objectS0___ZL37PyvtkImplicitSum_NormalizeByWeightOffP7_objectS0___ZL29PyvtkImplicitVolume_StaticNewv__ZL28PyvtkImplicitVolume_IsTypeOfP7_objectS0___ZL23PyvtkImplicitVolume_IsAP7_objectS0___ZL32PyvtkImplicitVolume_SafeDownCastP7_objectS0___ZL31PyvtkImplicitVolume_NewInstanceP7_objectS0___ZL28PyvtkImplicitVolume_GetMTimeP7_objectS0___ZL36PyvtkImplicitVolume_EvaluateFunctionP7_objectS0___ZL36PyvtkImplicitVolume_EvaluateGradientP7_objectS0___ZL29PyvtkImplicitVolume_SetVolumeP7_objectS0___ZL29PyvtkImplicitVolume_GetVolumeP7_objectS0___ZL31PyvtkImplicitVolume_SetOutValueP7_objectS0___ZL31PyvtkImplicitVolume_GetOutValueP7_objectS0___ZL34PyvtkImplicitVolume_SetOutGradientP7_objectS0___ZL34PyvtkImplicitVolume_GetOutGradientP7_objectS0___ZL37PyvtkImplicitWindowFunction_StaticNewv__ZL36PyvtkImplicitWindowFunction_IsTypeOfP7_objectS0___ZL31PyvtkImplicitWindowFunction_IsAP7_objectS0___ZL40PyvtkImplicitWindowFunction_SafeDownCastP7_objectS0___ZL39PyvtkImplicitWindowFunction_NewInstanceP7_objectS0___ZL44PyvtkImplicitWindowFunction_EvaluateFunctionP7_objectS0___ZL44PyvtkImplicitWindowFunction_EvaluateGradientP7_objectS0___ZL47PyvtkImplicitWindowFunction_SetImplicitFunctionP7_objectS0___ZL47PyvtkImplicitWindowFunction_GetImplicitFunctionP7_objectS0___ZL42PyvtkImplicitWindowFunction_SetWindowRangeP7_objectS0___ZL42PyvtkImplicitWindowFunction_GetWindowRangeP7_objectS0___ZL43PyvtkImplicitWindowFunction_SetWindowValuesP7_objectS0___ZL43PyvtkImplicitWindowFunction_GetWindowValuesP7_objectS0___ZL36PyvtkImplicitWindowFunction_GetMTimeP7_objectS0___ZL36PyvtkIncrementalOctreeNode_StaticNewv__ZL35PyvtkIncrementalOctreeNode_IsTypeOfP7_objectS0___ZL30PyvtkIncrementalOctreeNode_IsAP7_objectS0___ZL39PyvtkIncrementalOctreeNode_SafeDownCastP7_objectS0___ZL38PyvtkIncrementalOctreeNode_NewInstanceP7_objectS0___ZL44PyvtkIncrementalOctreeNode_GetNumberOfPointsP7_objectS0___ZL40PyvtkIncrementalOctreeNode_GetPointIdSetP7_objectS0___ZL43PyvtkIncrementalOctreeNode_DeleteChildNodesP7_objectS0___ZL36PyvtkIncrementalOctreeNode_SetBoundsP7_objectS0___ZL36PyvtkIncrementalOctreeNode_GetBoundsP7_objectS0___ZL39PyvtkIncrementalOctreeNode_GetMinBoundsP7_objectS0___ZL39PyvtkIncrementalOctreeNode_GetMaxBoundsP7_objectS0___ZL43PyvtkIncrementalOctreeNode_GetMinDataBoundsP7_objectS0___ZL43PyvtkIncrementalOctreeNode_GetMaxDataBoundsP7_objectS0___ZL33PyvtkIncrementalOctreeNode_IsLeafP7_objectS0___ZL40PyvtkIncrementalOctreeNode_GetChildIndexP7_objectS0___ZL35PyvtkIncrementalOctreeNode_GetChildP7_objectS0___ZL40PyvtkIncrementalOctreeNode_ContainsPointP7_objectS0___ZL46PyvtkIncrementalOctreeNode_ContainsPointByDataP7_objectS0___ZL38PyvtkIncrementalOctreeNode_InsertPointP7_objectS0___ZL54PyvtkIncrementalOctreeNode_GetDistance2ToInnerBoundaryP7_objectS0___ZL49PyvtkIncrementalOctreeNode_GetDistance2ToBoundaryP7_objectS0___ZL55PyvtkIncrementalOctreeNode_ExportAllPointIdsByInsertionP7_objectS0___ZL55PyvtkIncrementalOctreeNode_ExportAllPointIdsByDirectSetP7_objectS0___ZL44PyvtkIncrementalOctreePointLocator_StaticNewv__ZL43PyvtkIncrementalOctreePointLocator_IsTypeOfP7_objectS0___ZL38PyvtkIncrementalOctreePointLocator_IsAP7_objectS0___ZL47PyvtkIncrementalOctreePointLocator_SafeDownCastP7_objectS0___ZL46PyvtkIncrementalOctreePointLocator_NewInstanceP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_SetMaxPointsPerLeafP7_objectS0___ZL62PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafMinValueP7_objectS0___ZL62PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafMaxValueP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_SetBuildCubicOctreeP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_GetBuildCubicOctreeP7_objectS0___ZL53PyvtkIncrementalOctreePointLocator_BuildCubicOctreeOnP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_BuildCubicOctreeOffP7_objectS0___ZL51PyvtkIncrementalOctreePointLocator_GetLocatorPointsP7_objectS0___ZL45PyvtkIncrementalOctreePointLocator_InitializeP7_objectS0___ZL54PyvtkIncrementalOctreePointLocator_FreeSearchStructureP7_objectS0___ZL44PyvtkIncrementalOctreePointLocator_GetBoundsP7_objectS0___ZL52PyvtkIncrementalOctreePointLocator_GetNumberOfPointsP7_objectS0___ZL59PyvtkIncrementalOctreePointLocator_FindClosestInsertedPointP7_objectS0___ZL57PyvtkIncrementalOctreePointLocator_GenerateRepresentationP7_objectS0___ZL47PyvtkIncrementalOctreePointLocator_BuildLocatorP7_objectS0___ZL51PyvtkIncrementalOctreePointLocator_FindClosestPointP7_objectS0___ZL63PyvtkIncrementalOctreePointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL70PyvtkIncrementalOctreePointLocator_FindClosestPointWithinSquaredRadiusP7_objectS0___ZL57PyvtkIncrementalOctreePointLocator_FindPointsWithinRadiusP7_objectS0___ZL64PyvtkIncrementalOctreePointLocator_FindPointsWithinSquaredRadiusP7_objectS0___ZL53PyvtkIncrementalOctreePointLocator_FindClosestNPointsP7_objectS0___ZL53PyvtkIncrementalOctreePointLocator_InitPointInsertionP7_objectS0___ZL50PyvtkIncrementalOctreePointLocator_IsInsertedPointP7_objectS0___ZL52PyvtkIncrementalOctreePointLocator_InsertUniquePointP7_objectS0___ZL46PyvtkIncrementalOctreePointLocator_InsertPointP7_objectS0___ZL50PyvtkIncrementalOctreePointLocator_InsertNextPointP7_objectS0___ZL61PyvtkIncrementalOctreePointLocator_InsertPointWithoutCheckingP7_objectS0___ZN32vtkIncrementalOctreePointLocator8IsTypeOfEPKc__ZL37PyvtkIncrementalPointLocator_IsTypeOfP7_objectS0___ZL32PyvtkIncrementalPointLocator_IsAP7_objectS0___ZL41PyvtkIncrementalPointLocator_SafeDownCastP7_objectS0___ZL40PyvtkIncrementalPointLocator_NewInstanceP7_objectS0___ZL53PyvtkIncrementalPointLocator_FindClosestInsertedPointP7_objectS0___ZL47PyvtkIncrementalPointLocator_InitPointInsertionP7_objectS0___ZL44PyvtkIncrementalPointLocator_IsInsertedPointP7_objectS0___ZL46PyvtkIncrementalPointLocator_InsertUniquePointP7_objectS0___ZL40PyvtkIncrementalPointLocator_InsertPointP7_objectS0___ZL44PyvtkIncrementalPointLocator_InsertNextPointP7_objectS0___ZL29PyvtkInEdgeIterator_StaticNewv__ZL28PyvtkInEdgeIterator_IsTypeOfP7_objectS0___ZL23PyvtkInEdgeIterator_IsAP7_objectS0___ZL32PyvtkInEdgeIterator_SafeDownCastP7_objectS0___ZL31PyvtkInEdgeIterator_NewInstanceP7_objectS0___ZL30PyvtkInEdgeIterator_InitializeP7_objectS0___ZL28PyvtkInEdgeIterator_GetGraphP7_objectS0___ZL29PyvtkInEdgeIterator_GetVertexP7_objectS0___ZL24PyvtkInEdgeIterator_NextP7_objectS0___ZL33PyvtkInEdgeIterator_NextGraphEdgeP7_objectS0___ZL27PyvtkInEdgeIterator_HasNextP7_objectS0___ZL60PyvtkInformationQuadratureSchemeDefinitionVectorKey_IsTypeOfP7_objectS0___ZL55PyvtkInformationQuadratureSchemeDefinitionVectorKey_IsAP7_objectS0___ZL64PyvtkInformationQuadratureSchemeDefinitionVectorKey_SafeDownCastP7_objectS0___ZL63PyvtkInformationQuadratureSchemeDefinitionVectorKey_NewInstanceP7_objectS0___ZL57PyvtkInformationQuadratureSchemeDefinitionVectorKey_ClearP7_objectS0___ZL58PyvtkInformationQuadratureSchemeDefinitionVectorKey_ResizeP7_objectS0___ZL56PyvtkInformationQuadratureSchemeDefinitionVectorKey_SizeP7_objectS0___ZL58PyvtkInformationQuadratureSchemeDefinitionVectorKey_LengthP7_objectS0___ZL58PyvtkInformationQuadratureSchemeDefinitionVectorKey_AppendP7_objectS0___ZL55PyvtkInformationQuadratureSchemeDefinitionVectorKey_SetP7_objectS0___ZL55PyvtkInformationQuadratureSchemeDefinitionVectorKey_GetP7_objectS0___ZL63PyvtkInformationQuadratureSchemeDefinitionVectorKey_ShallowCopyP7_objectS0___ZL60PyvtkInformationQuadratureSchemeDefinitionVectorKey_DeepCopyP7_objectS0___ZL61PyvtkInformationQuadratureSchemeDefinitionVectorKey_SaveStateP7_objectS0___ZL64PyvtkInformationQuadratureSchemeDefinitionVectorKey_RestoreStateP7_objectS0___GLOBAL__sub_I_vtkInformationQuadratureSchemeDefinitionVectorKeyPython.cxx__ZL45PyvtkIterativeClosestPointTransform_StaticNewv__ZL44PyvtkIterativeClosestPointTransform_IsTypeOfP7_objectS0___ZL39PyvtkIterativeClosestPointTransform_IsAP7_objectS0___ZL48PyvtkIterativeClosestPointTransform_SafeDownCastP7_objectS0___ZL47PyvtkIterativeClosestPointTransform_NewInstanceP7_objectS0___ZL45PyvtkIterativeClosestPointTransform_SetSourceP7_objectS0___ZL45PyvtkIterativeClosestPointTransform_SetTargetP7_objectS0___ZL45PyvtkIterativeClosestPointTransform_GetSourceP7_objectS0___ZL45PyvtkIterativeClosestPointTransform_GetTargetP7_objectS0___ZL46PyvtkIterativeClosestPointTransform_SetLocatorP7_objectS0___ZL46PyvtkIterativeClosestPointTransform_GetLocatorP7_objectS0___ZL64PyvtkIterativeClosestPointTransform_SetMaximumNumberOfIterationsP7_objectS0___ZL64PyvtkIterativeClosestPointTransform_GetMaximumNumberOfIterationsP7_objectS0___ZL57PyvtkIterativeClosestPointTransform_GetNumberOfIterationsP7_objectS0___ZL56PyvtkIterativeClosestPointTransform_SetCheckMeanDistanceP7_objectS0___ZL56PyvtkIterativeClosestPointTransform_GetCheckMeanDistanceP7_objectS0___ZL55PyvtkIterativeClosestPointTransform_CheckMeanDistanceOnP7_objectS0___ZL56PyvtkIterativeClosestPointTransform_CheckMeanDistanceOffP7_objectS0___ZL55PyvtkIterativeClosestPointTransform_SetMeanDistanceModeP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_GetMeanDistanceModeMinValueP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_GetMeanDistanceModeMaxValueP7_objectS0___ZL55PyvtkIterativeClosestPointTransform_GetMeanDistanceModeP7_objectS0___ZL60PyvtkIterativeClosestPointTransform_SetMeanDistanceModeToRMSP7_objectS0___ZL70PyvtkIterativeClosestPointTransform_SetMeanDistanceModeToAbsoluteValueP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_GetMeanDistanceModeAsStringP7_objectS0___ZL58PyvtkIterativeClosestPointTransform_SetMaximumMeanDistanceP7_objectS0___ZL58PyvtkIterativeClosestPointTransform_GetMaximumMeanDistanceP7_objectS0___ZL51PyvtkIterativeClosestPointTransform_GetMeanDistanceP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_SetMaximumNumberOfLandmarksP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_GetMaximumNumberOfLandmarksP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_SetStartByMatchingCentroidsP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_GetStartByMatchingCentroidsP7_objectS0___ZL62PyvtkIterativeClosestPointTransform_StartByMatchingCentroidsOnP7_objectS0___ZL63PyvtkIterativeClosestPointTransform_StartByMatchingCentroidsOffP7_objectS0___ZL56PyvtkIterativeClosestPointTransform_GetLandmarkTransformP7_objectS0___ZL43PyvtkIterativeClosestPointTransform_InverseP7_objectS0___ZL49PyvtkIterativeClosestPointTransform_MakeTransformP7_objectS0___ZN33vtkIterativeClosestPointTransform8IsTypeOfEPKc__ZL21PyvtkKdNode_StaticNewv__ZL20PyvtkKdNode_IsTypeOfP7_objectS0___ZL15PyvtkKdNode_IsAP7_objectS0___ZL24PyvtkKdNode_SafeDownCastP7_objectS0___ZL23PyvtkKdNode_NewInstanceP7_objectS0___ZL18PyvtkKdNode_SetDimP7_objectS0___ZL18PyvtkKdNode_GetDimP7_objectS0___ZL31PyvtkKdNode_GetDivisionPositionP7_objectS0___ZL29PyvtkKdNode_SetNumberOfPointsP7_objectS0___ZL29PyvtkKdNode_GetNumberOfPointsP7_objectS0___ZL21PyvtkKdNode_SetBoundsP7_objectS0___ZL21PyvtkKdNode_GetBoundsP7_objectS0___ZL25PyvtkKdNode_SetDataBoundsP7_objectS0___ZL25PyvtkKdNode_GetDataBoundsP7_objectS0___ZL24PyvtkKdNode_GetMinBoundsP7_objectS0___ZL24PyvtkKdNode_GetMaxBoundsP7_objectS0___ZL24PyvtkKdNode_SetMinBoundsP7_objectS0___ZL24PyvtkKdNode_SetMaxBoundsP7_objectS0___ZL28PyvtkKdNode_GetMinDataBoundsP7_objectS0___ZL28PyvtkKdNode_GetMaxDataBoundsP7_objectS0___ZL28PyvtkKdNode_SetMinDataBoundsP7_objectS0___ZL28PyvtkKdNode_SetMaxDataBoundsP7_objectS0___ZL17PyvtkKdNode_SetIDP7_objectS0___ZL17PyvtkKdNode_GetIDP7_objectS0___ZL20PyvtkKdNode_GetMinIDP7_objectS0___ZL20PyvtkKdNode_GetMaxIDP7_objectS0___ZL20PyvtkKdNode_SetMinIDP7_objectS0___ZL20PyvtkKdNode_SetMaxIDP7_objectS0___ZL25PyvtkKdNode_AddChildNodesP7_objectS0___ZL28PyvtkKdNode_DeleteChildNodesP7_objectS0___ZL19PyvtkKdNode_GetLeftP7_objectS0___ZL19PyvtkKdNode_SetLeftP7_objectS0___ZL20PyvtkKdNode_GetRightP7_objectS0___ZL20PyvtkKdNode_SetRightP7_objectS0___ZL17PyvtkKdNode_GetUpP7_objectS0___ZL17PyvtkKdNode_SetUpP7_objectS0___ZL25PyvtkKdNode_IntersectsBoxP7_objectS0___ZL29PyvtkKdNode_IntersectsSphere2P7_objectS0___ZL28PyvtkKdNode_IntersectsRegionP7_objectS0___ZL26PyvtkKdNode_IntersectsCellP7_objectS0___ZL23PyvtkKdNode_ContainsBoxP7_objectS0___ZL25PyvtkKdNode_ContainsPointP7_objectS0___ZL34PyvtkKdNode_GetDistance2ToBoundaryP7_objectS0___ZL39PyvtkKdNode_GetDistance2ToInnerBoundaryP7_objectS0___ZL21PyvtkKdNode_PrintNodeP7_objectS0___ZL28PyvtkKdNode_PrintVerboseNodeP7_objectS0___ZL21PyvtkKdTree_StaticNewv__ZL20PyvtkKdTree_IsTypeOfP7_objectS0___ZL15PyvtkKdTree_IsAP7_objectS0___ZL24PyvtkKdTree_SafeDownCastP7_objectS0___ZL23PyvtkKdTree_NewInstanceP7_objectS0___ZL20PyvtkKdTree_TimingOnP7_objectS0___ZL21PyvtkKdTree_TimingOffP7_objectS0___ZL21PyvtkKdTree_SetTimingP7_objectS0___ZL21PyvtkKdTree_GetTimingP7_objectS0___ZL23PyvtkKdTree_SetMinCellsP7_objectS0___ZL23PyvtkKdTree_GetMinCellsP7_objectS0___ZL36PyvtkKdTree_GetNumberOfRegionsOrLessP7_objectS0___ZL36PyvtkKdTree_SetNumberOfRegionsOrLessP7_objectS0___ZL36PyvtkKdTree_GetNumberOfRegionsOrMoreP7_objectS0___ZL36PyvtkKdTree_SetNumberOfRegionsOrMoreP7_objectS0___ZL26PyvtkKdTree_GetFudgeFactorP7_objectS0___ZL26PyvtkKdTree_SetFudgeFactorP7_objectS0___ZL19PyvtkKdTree_GetCutsP7_objectS0___ZL19PyvtkKdTree_SetCutsP7_objectS0___ZL29PyvtkKdTree_OmitXPartitioningP7_objectS0___ZL29PyvtkKdTree_OmitYPartitioningP7_objectS0___ZL29PyvtkKdTree_OmitZPartitioningP7_objectS0___ZL30PyvtkKdTree_OmitXYPartitioningP7_objectS0___ZL30PyvtkKdTree_OmitYZPartitioningP7_objectS0___ZL30PyvtkKdTree_OmitZXPartitioningP7_objectS0___ZL30PyvtkKdTree_OmitNoPartitioningP7_objectS0___ZL22PyvtkKdTree_SetDataSetP7_objectS0___ZL22PyvtkKdTree_AddDataSetP7_objectS0___ZL25PyvtkKdTree_RemoveDataSetP7_objectS0___ZL29PyvtkKdTree_RemoveAllDataSetsP7_objectS0___ZL31PyvtkKdTree_GetNumberOfDataSetsP7_objectS0___ZL22PyvtkKdTree_GetDataSetP7_objectS0___ZL23PyvtkKdTree_GetDataSetsP7_objectS0___ZL27PyvtkKdTree_GetDataSetIndexP7_objectS0___ZL21PyvtkKdTree_GetBoundsP7_objectS0___ZL24PyvtkKdTree_SetNewBoundsP7_objectS0___ZL30PyvtkKdTree_GetNumberOfRegionsP7_objectS0___ZL27PyvtkKdTree_GetRegionBoundsP7_objectS0___ZL31PyvtkKdTree_GetRegionDataBoundsP7_objectS0___ZL21PyvtkKdTree_PrintTreeP7_objectS0___ZL28PyvtkKdTree_PrintVerboseTreeP7_objectS0___ZL23PyvtkKdTree_PrintRegionP7_objectS0___ZL27PyvtkKdTree_CreateCellListsP7_objectS0___ZL41PyvtkKdTree_SetIncludeRegionBoundaryCellsP7_objectS0___ZL41PyvtkKdTree_GetIncludeRegionBoundaryCellsP7_objectS0___ZL40PyvtkKdTree_IncludeRegionBoundaryCellsOnP7_objectS0___ZL41PyvtkKdTree_IncludeRegionBoundaryCellsOffP7_objectS0___ZL27PyvtkKdTree_DeleteCellListsP7_objectS0___ZL23PyvtkKdTree_GetCellListP7_objectS0___ZL31PyvtkKdTree_GetBoundaryCellListP7_objectS0___ZL24PyvtkKdTree_GetCellListsP7_objectS0___ZL35PyvtkKdTree_GetRegionContainingCellP7_objectS0___ZL38PyvtkKdTree_AllGetRegionContainingCellP7_objectS0___ZL36PyvtkKdTree_GetRegionContainingPointP7_objectS0___ZL24PyvtkKdTree_BuildLocatorP7_objectS0___ZL42PyvtkKdTree_ViewOrderAllRegionsInDirectionP7_objectS0___ZL39PyvtkKdTree_ViewOrderRegionsInDirectionP7_objectS0___ZL43PyvtkKdTree_ViewOrderAllRegionsFromPositionP7_objectS0___ZL40PyvtkKdTree_ViewOrderRegionsFromPositionP7_objectS0___ZL34PyvtkKdTree_BuildLocatorFromPointsP7_objectS0___ZL38PyvtkKdTree_BuildMapForDuplicatePointsP7_objectS0___ZL21PyvtkKdTree_FindPointP7_objectS0___ZL28PyvtkKdTree_FindClosestPointP7_objectS0___ZL40PyvtkKdTree_FindClosestPointWithinRadiusP7_objectS0___ZL36PyvtkKdTree_FindClosestPointInRegionP7_objectS0___ZL34PyvtkKdTree_FindPointsWithinRadiusP7_objectS0___ZL30PyvtkKdTree_FindClosestNPointsP7_objectS0___ZL29PyvtkKdTree_GetPointsInRegionP7_objectS0___ZL31PyvtkKdTree_FreeSearchStructureP7_objectS0___ZL34PyvtkKdTree_GenerateRepresentationP7_objectS0___ZL51PyvtkKdTree_GenerateRepresentationUsingDataBoundsOnP7_objectS0___ZL52PyvtkKdTree_GenerateRepresentationUsingDataBoundsOffP7_objectS0___ZL52PyvtkKdTree_SetGenerateRepresentationUsingDataBoundsP7_objectS0___ZL52PyvtkKdTree_GetGenerateRepresentationUsingDataBoundsP7_objectS0___ZL23PyvtkKdTree_NewGeometryP7_objectS0___ZL30PyvtkKdTree_InvalidateGeometryP7_objectS0___ZL20PyvtkKdTree_CopyTreeP7_objectS0___ZL28PyvtkKdTree_FindPointsInAreaP7_objectS0___ZL28PyvtkKdTree_RemoveDataSet_s1P7_objectS0___ZL28PyvtkKdTree_RemoveDataSet_s2P7_objectS0___ZL30PyvtkKdTree_CreateCellLists_s1P7_objectS0___ZL30PyvtkKdTree_CreateCellLists_s2P7_objectS0___ZL27PyvtkKdTree_GetCellLists_s1P7_objectS0___ZL27PyvtkKdTree_GetCellLists_s2P7_objectS0___ZL38PyvtkKdTree_GetRegionContainingCell_s1P7_objectS0___ZL38PyvtkKdTree_GetRegionContainingCell_s2P7_objectS0___ZL37PyvtkKdTree_BuildLocatorFromPoints_s1P7_objectS0___ZL37PyvtkKdTree_BuildLocatorFromPoints_s2P7_objectS0___ZL33PyvtkKdTreePointLocator_StaticNewv__ZL32PyvtkKdTreePointLocator_IsTypeOfP7_objectS0___ZL27PyvtkKdTreePointLocator_IsAP7_objectS0___ZL36PyvtkKdTreePointLocator_SafeDownCastP7_objectS0___ZL35PyvtkKdTreePointLocator_NewInstanceP7_objectS0___ZL40PyvtkKdTreePointLocator_FindClosestPointP7_objectS0___ZL52PyvtkKdTreePointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL42PyvtkKdTreePointLocator_FindClosestNPointsP7_objectS0___ZL46PyvtkKdTreePointLocator_FindPointsWithinRadiusP7_objectS0___ZL43PyvtkKdTreePointLocator_FreeSearchStructureP7_objectS0___ZL36PyvtkKdTreePointLocator_BuildLocatorP7_objectS0___ZL46PyvtkKdTreePointLocator_GenerateRepresentationP7_objectS0___ZL28PyvtkLagrangeCurve_StaticNewv__ZL27PyvtkLagrangeCurve_IsTypeOfP7_objectS0___ZL22PyvtkLagrangeCurve_IsAP7_objectS0___ZL31PyvtkLagrangeCurve_SafeDownCastP7_objectS0___ZL30PyvtkLagrangeCurve_NewInstanceP7_objectS0___ZL30PyvtkLagrangeCurve_GetCellTypeP7_objectS0___ZL35PyvtkLagrangeCurve_GetCellDimensionP7_objectS0___ZL41PyvtkLagrangeCurve_RequiresInitializationP7_objectS0___ZL35PyvtkLagrangeCurve_GetNumberOfEdgesP7_objectS0___ZL35PyvtkLagrangeCurve_GetNumberOfFacesP7_objectS0___ZL26PyvtkLagrangeCurve_GetEdgeP7_objectS0___ZL26PyvtkLagrangeCurve_GetFaceP7_objectS0___ZL29PyvtkLagrangeCurve_InitializeP7_objectS0___ZL31PyvtkLagrangeCurve_CellBoundaryP7_objectS0___ZL35PyvtkLagrangeCurve_EvaluatePositionP7_objectS0___ZL35PyvtkLagrangeCurve_EvaluateLocationP7_objectS0___ZL26PyvtkLagrangeCurve_ContourP7_objectS0___ZL23PyvtkLagrangeCurve_ClipP7_objectS0___ZL36PyvtkLagrangeCurve_IntersectWithLineP7_objectS0___ZL30PyvtkLagrangeCurve_TriangulateP7_objectS0___ZL30PyvtkLagrangeCurve_DerivativesP7_objectS0___ZL38PyvtkLagrangeCurve_GetParametricCoordsP7_objectS0___ZL38PyvtkLagrangeCurve_GetParametricCenterP7_objectS0___ZL40PyvtkLagrangeCurve_GetParametricDistanceP7_objectS0___ZL27PyvtkLagrangeCurve_GetOrderP7_objectS0___ZL39PyvtkLagrangeCurve_InterpolateFunctionsP7_objectS0___ZL36PyvtkLagrangeCurve_InterpolateDerivsP7_objectS0___ZL43PyvtkLagrangeCurve_SubCellCoordinatesFromIdP7_objectS0___ZL36PyvtkLagrangeCurve_PointIndexFromIJKP7_objectS0___ZL46PyvtkLagrangeCurve_TransformApproxToCellParamsP7_objectS0___ZL46PyvtkLagrangeCurve_SubCellCoordinatesFromId_s1P7_objectS0___ZL46PyvtkLagrangeCurve_SubCellCoordinatesFromId_s2P7_objectS0___ZL33PyvtkLagrangeHexahedron_StaticNewv__ZL32PyvtkLagrangeHexahedron_IsTypeOfP7_objectS0___ZL27PyvtkLagrangeHexahedron_IsAP7_objectS0___ZL36PyvtkLagrangeHexahedron_SafeDownCastP7_objectS0___ZL35PyvtkLagrangeHexahedron_NewInstanceP7_objectS0___ZL35PyvtkLagrangeHexahedron_GetCellTypeP7_objectS0___ZL40PyvtkLagrangeHexahedron_GetCellDimensionP7_objectS0___ZL46PyvtkLagrangeHexahedron_RequiresInitializationP7_objectS0___ZL40PyvtkLagrangeHexahedron_GetNumberOfEdgesP7_objectS0___ZL40PyvtkLagrangeHexahedron_GetNumberOfFacesP7_objectS0___ZL31PyvtkLagrangeHexahedron_GetEdgeP7_objectS0___ZL31PyvtkLagrangeHexahedron_GetFaceP7_objectS0___ZL34PyvtkLagrangeHexahedron_InitializeP7_objectS0___ZL36PyvtkLagrangeHexahedron_CellBoundaryP7_objectS0___ZL40PyvtkLagrangeHexahedron_EvaluatePositionP7_objectS0___ZL40PyvtkLagrangeHexahedron_EvaluateLocationP7_objectS0___ZL31PyvtkLagrangeHexahedron_ContourP7_objectS0___ZL28PyvtkLagrangeHexahedron_ClipP7_objectS0___ZL41PyvtkLagrangeHexahedron_IntersectWithLineP7_objectS0___ZL35PyvtkLagrangeHexahedron_TriangulateP7_objectS0___ZL35PyvtkLagrangeHexahedron_DerivativesP7_objectS0___ZL43PyvtkLagrangeHexahedron_GetParametricCoordsP7_objectS0___ZL43PyvtkLagrangeHexahedron_GetParametricCenterP7_objectS0___ZL45PyvtkLagrangeHexahedron_GetParametricDistanceP7_objectS0___ZL32PyvtkLagrangeHexahedron_GetOrderP7_objectS0___ZL44PyvtkLagrangeHexahedron_InterpolateFunctionsP7_objectS0___ZL41PyvtkLagrangeHexahedron_InterpolateDerivsP7_objectS0___ZL48PyvtkLagrangeHexahedron_SubCellCoordinatesFromIdP7_objectS0___ZL41PyvtkLagrangeHexahedron_PointIndexFromIJKP7_objectS0___ZL51PyvtkLagrangeHexahedron_TransformApproxToCellParamsP7_objectS0___ZL49PyvtkLagrangeHexahedron_TransformFaceToCellParamsP7_objectS0___ZL44PyvtkLagrangeHexahedron_PointIndexFromIJK_s1P7_objectS0___ZL36PyvtkLagrangeInterpolation_StaticNewv__ZL35PyvtkLagrangeInterpolation_IsTypeOfP7_objectS0___ZL30PyvtkLagrangeInterpolation_IsAP7_objectS0___ZL39PyvtkLagrangeInterpolation_SafeDownCastP7_objectS0___ZL38PyvtkLagrangeInterpolation_NewInstanceP7_objectS0___ZL49PyvtkLagrangeInterpolation_EvaluateShapeFunctionsP7_objectS0___ZL51PyvtkLagrangeInterpolation_EvaluateShapeAndGradientP7_objectS0___ZL48PyvtkLagrangeInterpolation_Tensor1ShapeFunctionsP7_objectS0___ZL50PyvtkLagrangeInterpolation_Tensor1ShapeDerivativesP7_objectS0___ZL48PyvtkLagrangeInterpolation_Tensor2ShapeFunctionsP7_objectS0___ZL50PyvtkLagrangeInterpolation_Tensor2ShapeDerivativesP7_objectS0___ZL48PyvtkLagrangeInterpolation_Tensor3ShapeFunctionsP7_objectS0___ZL50PyvtkLagrangeInterpolation_Tensor3ShapeDerivativesP7_objectS0___ZL52PyvtkLagrangeInterpolation_Tensor3EvaluateDerivativeP7_objectS0___ZL46PyvtkLagrangeInterpolation_WedgeShapeFunctionsP7_objectS0___ZL48PyvtkLagrangeInterpolation_WedgeShapeDerivativesP7_objectS0___ZL40PyvtkLagrangeInterpolation_WedgeEvaluateP7_objectS0___ZL50PyvtkLagrangeInterpolation_WedgeEvaluateDerivativeP7_objectS0___ZL54PyvtkLagrangeInterpolation_GetParametricHexCoordinatesP7_objectS0___ZL57PyvtkLagrangeInterpolation_GetPointIndicesBoundingHexEdgeP7_objectS0___ZL55PyvtkLagrangeInterpolation_GetVaryingParameterOfHexEdgeP7_objectS0___ZL54PyvtkLagrangeInterpolation_GetFixedParametersOfHexEdgeP7_objectS0___ZL57PyvtkLagrangeInterpolation_GetPointIndicesBoundingHexFaceP7_objectS0___ZL56PyvtkLagrangeInterpolation_GetEdgeIndicesBoundingHexFaceP7_objectS0___ZL56PyvtkLagrangeInterpolation_GetVaryingParametersOfHexFaceP7_objectS0___ZL53PyvtkLagrangeInterpolation_GetFixedParameterOfHexFaceP7_objectS0___ZL56PyvtkLagrangeInterpolation_GetParametricWedgeCoordinatesP7_objectS0___ZL59PyvtkLagrangeInterpolation_GetPointIndicesBoundingWedgeEdgeP7_objectS0___ZL57PyvtkLagrangeInterpolation_GetVaryingParameterOfWedgeEdgeP7_objectS0___ZL56PyvtkLagrangeInterpolation_GetFixedParametersOfWedgeEdgeP7_objectS0___ZL59PyvtkLagrangeInterpolation_GetPointIndicesBoundingWedgeFaceP7_objectS0___ZL58PyvtkLagrangeInterpolation_GetEdgeIndicesBoundingWedgeFaceP7_objectS0___ZL58PyvtkLagrangeInterpolation_GetVaryingParametersOfWedgeFaceP7_objectS0___ZL55PyvtkLagrangeInterpolation_GetFixedParameterOfWedgeFaceP7_objectS0___ZL36PyvtkLagrangeQuadrilateral_StaticNewv__ZL35PyvtkLagrangeQuadrilateral_IsTypeOfP7_objectS0___ZL30PyvtkLagrangeQuadrilateral_IsAP7_objectS0___ZL39PyvtkLagrangeQuadrilateral_SafeDownCastP7_objectS0___ZL38PyvtkLagrangeQuadrilateral_NewInstanceP7_objectS0___ZL38PyvtkLagrangeQuadrilateral_GetCellTypeP7_objectS0___ZL43PyvtkLagrangeQuadrilateral_GetCellDimensionP7_objectS0___ZL49PyvtkLagrangeQuadrilateral_RequiresInitializationP7_objectS0___ZL43PyvtkLagrangeQuadrilateral_GetNumberOfEdgesP7_objectS0___ZL43PyvtkLagrangeQuadrilateral_GetNumberOfFacesP7_objectS0___ZL34PyvtkLagrangeQuadrilateral_GetEdgeP7_objectS0___ZL34PyvtkLagrangeQuadrilateral_GetFaceP7_objectS0___ZL37PyvtkLagrangeQuadrilateral_InitializeP7_objectS0___ZL39PyvtkLagrangeQuadrilateral_CellBoundaryP7_objectS0___ZL43PyvtkLagrangeQuadrilateral_EvaluatePositionP7_objectS0___ZL43PyvtkLagrangeQuadrilateral_EvaluateLocationP7_objectS0___ZL34PyvtkLagrangeQuadrilateral_ContourP7_objectS0___ZL31PyvtkLagrangeQuadrilateral_ClipP7_objectS0___ZL44PyvtkLagrangeQuadrilateral_IntersectWithLineP7_objectS0___ZL38PyvtkLagrangeQuadrilateral_TriangulateP7_objectS0___ZL38PyvtkLagrangeQuadrilateral_DerivativesP7_objectS0___ZL46PyvtkLagrangeQuadrilateral_GetParametricCoordsP7_objectS0___ZL46PyvtkLagrangeQuadrilateral_GetParametricCenterP7_objectS0___ZL48PyvtkLagrangeQuadrilateral_GetParametricDistanceP7_objectS0___ZL35PyvtkLagrangeQuadrilateral_GetOrderP7_objectS0___ZL47PyvtkLagrangeQuadrilateral_InterpolateFunctionsP7_objectS0___ZL44PyvtkLagrangeQuadrilateral_InterpolateDerivsP7_objectS0___ZL51PyvtkLagrangeQuadrilateral_SubCellCoordinatesFromIdP7_objectS0___ZL44PyvtkLagrangeQuadrilateral_PointIndexFromIJKP7_objectS0___ZL54PyvtkLagrangeQuadrilateral_TransformApproxToCellParamsP7_objectS0___ZL47PyvtkLagrangeQuadrilateral_PointIndexFromIJK_s1P7_objectS0___ZL47PyvtkLagrangeQuadrilateral_PointIndexFromIJK_s2P7_objectS0___ZL28PyvtkLagrangeTetra_StaticNewv__ZL27PyvtkLagrangeTetra_IsTypeOfP7_objectS0___ZL22PyvtkLagrangeTetra_IsAP7_objectS0___ZL31PyvtkLagrangeTetra_SafeDownCastP7_objectS0___ZL30PyvtkLagrangeTetra_NewInstanceP7_objectS0___ZL30PyvtkLagrangeTetra_GetCellTypeP7_objectS0___ZL35PyvtkLagrangeTetra_GetCellDimensionP7_objectS0___ZL41PyvtkLagrangeTetra_RequiresInitializationP7_objectS0___ZL35PyvtkLagrangeTetra_GetNumberOfEdgesP7_objectS0___ZL35PyvtkLagrangeTetra_GetNumberOfFacesP7_objectS0___ZL26PyvtkLagrangeTetra_GetEdgeP7_objectS0___ZL26PyvtkLagrangeTetra_GetFaceP7_objectS0___ZL29PyvtkLagrangeTetra_InitializeP7_objectS0___ZL31PyvtkLagrangeTetra_MaximumOrderP7_objectS0___ZL40PyvtkLagrangeTetra_MaximumNumberOfPointsP7_objectS0___ZL31PyvtkLagrangeTetra_CellBoundaryP7_objectS0___ZL35PyvtkLagrangeTetra_EvaluatePositionP7_objectS0___ZL35PyvtkLagrangeTetra_EvaluateLocationP7_objectS0___ZL26PyvtkLagrangeTetra_ContourP7_objectS0___ZL23PyvtkLagrangeTetra_ClipP7_objectS0___ZL36PyvtkLagrangeTetra_IntersectWithLineP7_objectS0___ZL30PyvtkLagrangeTetra_TriangulateP7_objectS0___ZL30PyvtkLagrangeTetra_DerivativesP7_objectS0___ZL38PyvtkLagrangeTetra_GetParametricCoordsP7_objectS0___ZL38PyvtkLagrangeTetra_GetParametricCenterP7_objectS0___ZL40PyvtkLagrangeTetra_GetParametricDistanceP7_objectS0___ZL39PyvtkLagrangeTetra_InterpolateFunctionsP7_objectS0___ZL36PyvtkLagrangeTetra_InterpolateDerivsP7_objectS0___ZL27PyvtkLagrangeTetra_GetOrderP7_objectS0___ZL31PyvtkLagrangeTetra_ComputeOrderP7_objectS0___ZL37PyvtkLagrangeTetra_ToBarycentricIndexP7_objectS0___ZL26PyvtkLagrangeTetra_ToIndexP7_objectS0___ZL35PyvtkLagrangeTetra_BarycentricIndexP7_objectS0___ZL24PyvtkLagrangeTetra_IndexP7_objectS0___ZL31PyvtkLagrangeTriangle_StaticNewv__ZL30PyvtkLagrangeTriangle_IsTypeOfP7_objectS0___ZL25PyvtkLagrangeTriangle_IsAP7_objectS0___ZL34PyvtkLagrangeTriangle_SafeDownCastP7_objectS0___ZL33PyvtkLagrangeTriangle_NewInstanceP7_objectS0___ZL33PyvtkLagrangeTriangle_GetCellTypeP7_objectS0___ZL38PyvtkLagrangeTriangle_GetCellDimensionP7_objectS0___ZL44PyvtkLagrangeTriangle_RequiresInitializationP7_objectS0___ZL38PyvtkLagrangeTriangle_GetNumberOfEdgesP7_objectS0___ZL38PyvtkLagrangeTriangle_GetNumberOfFacesP7_objectS0___ZL29PyvtkLagrangeTriangle_GetEdgeP7_objectS0___ZL29PyvtkLagrangeTriangle_GetFaceP7_objectS0___ZL32PyvtkLagrangeTriangle_InitializeP7_objectS0___ZL34PyvtkLagrangeTriangle_MaximumOrderP7_objectS0___ZL43PyvtkLagrangeTriangle_MaximumNumberOfPointsP7_objectS0___ZL34PyvtkLagrangeTriangle_CellBoundaryP7_objectS0___ZL38PyvtkLagrangeTriangle_EvaluatePositionP7_objectS0___ZL38PyvtkLagrangeTriangle_EvaluateLocationP7_objectS0___ZL29PyvtkLagrangeTriangle_ContourP7_objectS0___ZL26PyvtkLagrangeTriangle_ClipP7_objectS0___ZL39PyvtkLagrangeTriangle_IntersectWithLineP7_objectS0___ZL33PyvtkLagrangeTriangle_TriangulateP7_objectS0___ZL33PyvtkLagrangeTriangle_DerivativesP7_objectS0___ZL41PyvtkLagrangeTriangle_GetParametricCoordsP7_objectS0___ZL45PyvtkLagrangeTriangle_ComputeParametricCoordsP7_objectS0___ZL41PyvtkLagrangeTriangle_GetParametricCenterP7_objectS0___ZL43PyvtkLagrangeTriangle_GetParametricDistanceP7_objectS0___ZL42PyvtkLagrangeTriangle_InterpolateFunctionsP7_objectS0___ZL39PyvtkLagrangeTriangle_InterpolateDerivsP7_objectS0___ZL30PyvtkLagrangeTriangle_GetOrderP7_objectS0___ZL34PyvtkLagrangeTriangle_ComputeOrderP7_objectS0___ZL40PyvtkLagrangeTriangle_ToBarycentricIndexP7_objectS0___ZL29PyvtkLagrangeTriangle_ToIndexP7_objectS0___ZL38PyvtkLagrangeTriangle_BarycentricIndexP7_objectS0___ZL27PyvtkLagrangeTriangle_IndexP7_objectS0___ZL25PyvtkLagrangeTriangle_etaP7_objectS0___ZL27PyvtkLagrangeTriangle_d_etaP7_objectS0___ZL28PyvtkLagrangeWedge_StaticNewv__ZL27PyvtkLagrangeWedge_IsTypeOfP7_objectS0___ZL22PyvtkLagrangeWedge_IsAP7_objectS0___ZL31PyvtkLagrangeWedge_SafeDownCastP7_objectS0___ZL30PyvtkLagrangeWedge_NewInstanceP7_objectS0___ZL30PyvtkLagrangeWedge_GetCellTypeP7_objectS0___ZL35PyvtkLagrangeWedge_GetCellDimensionP7_objectS0___ZL41PyvtkLagrangeWedge_RequiresInitializationP7_objectS0___ZL35PyvtkLagrangeWedge_GetNumberOfEdgesP7_objectS0___ZL35PyvtkLagrangeWedge_GetNumberOfFacesP7_objectS0___ZL26PyvtkLagrangeWedge_GetEdgeP7_objectS0___ZL26PyvtkLagrangeWedge_GetFaceP7_objectS0___ZL29PyvtkLagrangeWedge_InitializeP7_objectS0___ZL31PyvtkLagrangeWedge_CellBoundaryP7_objectS0___ZL35PyvtkLagrangeWedge_EvaluatePositionP7_objectS0___ZL35PyvtkLagrangeWedge_EvaluateLocationP7_objectS0___ZL26PyvtkLagrangeWedge_ContourP7_objectS0___ZL23PyvtkLagrangeWedge_ClipP7_objectS0___ZL36PyvtkLagrangeWedge_IntersectWithLineP7_objectS0___ZL30PyvtkLagrangeWedge_TriangulateP7_objectS0___ZL30PyvtkLagrangeWedge_DerivativesP7_objectS0___ZL38PyvtkLagrangeWedge_GetParametricCoordsP7_objectS0___ZL38PyvtkLagrangeWedge_GetParametricCenterP7_objectS0___ZL40PyvtkLagrangeWedge_GetParametricDistanceP7_objectS0___ZL27PyvtkLagrangeWedge_GetOrderP7_objectS0___ZL39PyvtkLagrangeWedge_InterpolateFunctionsP7_objectS0___ZL36PyvtkLagrangeWedge_InterpolateDerivsP7_objectS0___ZL43PyvtkLagrangeWedge_SubCellCoordinatesFromIdP7_objectS0___ZL36PyvtkLagrangeWedge_PointIndexFromIJKP7_objectS0___ZL46PyvtkLagrangeWedge_TransformApproxToCellParamsP7_objectS0___ZL44PyvtkLagrangeWedge_TransformFaceToCellParamsP7_objectS0___ZL49PyvtkLagrangeWedge_GetNumberOfApproximatingWedgesP7_objectS0___ZL39PyvtkLagrangeWedge_PointIndexFromIJK_s1P7_objectS0___ZL52PyvtkLagrangeWedge_GetNumberOfApproximatingWedges_s1P7_objectS0___ZL19PyvtkLine_StaticNewv__ZL18PyvtkLine_IsTypeOfP7_objectS0___ZL13PyvtkLine_IsAP7_objectS0___ZL22PyvtkLine_SafeDownCastP7_objectS0___ZL21PyvtkLine_NewInstanceP7_objectS0___ZL21PyvtkLine_GetCellTypeP7_objectS0___ZL26PyvtkLine_GetCellDimensionP7_objectS0___ZL26PyvtkLine_GetNumberOfEdgesP7_objectS0___ZL26PyvtkLine_GetNumberOfFacesP7_objectS0___ZL17PyvtkLine_GetEdgeP7_objectS0___ZL17PyvtkLine_GetFaceP7_objectS0___ZL22PyvtkLine_CellBoundaryP7_objectS0___ZL17PyvtkLine_ContourP7_objectS0___ZL26PyvtkLine_EvaluatePositionP7_objectS0___ZL26PyvtkLine_EvaluateLocationP7_objectS0___ZL21PyvtkLine_TriangulateP7_objectS0___ZL21PyvtkLine_DerivativesP7_objectS0___ZL29PyvtkLine_GetParametricCoordsP7_objectS0___ZL14PyvtkLine_ClipP7_objectS0___ZL29PyvtkLine_GetParametricCenterP7_objectS0___ZL27PyvtkLine_IntersectWithLineP7_objectS0___ZL22PyvtkLine_IntersectionP7_objectS0___ZL24PyvtkLine_Intersection3DP7_objectS0___ZL24PyvtkLine_DistanceToLineP7_objectS0___ZL30PyvtkLine_DistanceBetweenLinesP7_objectS0___ZL37PyvtkLine_DistanceBetweenLineSegmentsP7_objectS0___ZL32PyvtkLine_InterpolationFunctionsP7_objectS0___ZL29PyvtkLine_InterpolationDerivsP7_objectS0___ZL30PyvtkLine_InterpolateFunctionsP7_objectS0___ZL27PyvtkLine_InterpolateDerivsP7_objectS0___ZL21PyvtkLocator_IsTypeOfP7_objectS0___ZL16PyvtkLocator_IsAP7_objectS0___ZL25PyvtkLocator_SafeDownCastP7_objectS0___ZL24PyvtkLocator_NewInstanceP7_objectS0___ZL23PyvtkLocator_SetDataSetP7_objectS0___ZL23PyvtkLocator_GetDataSetP7_objectS0___ZL24PyvtkLocator_SetMaxLevelP7_objectS0___ZL32PyvtkLocator_GetMaxLevelMinValueP7_objectS0___ZL32PyvtkLocator_GetMaxLevelMaxValueP7_objectS0___ZL24PyvtkLocator_GetMaxLevelP7_objectS0___ZL21PyvtkLocator_GetLevelP7_objectS0___ZL25PyvtkLocator_SetAutomaticP7_objectS0___ZL25PyvtkLocator_GetAutomaticP7_objectS0___ZL24PyvtkLocator_AutomaticOnP7_objectS0___ZL25PyvtkLocator_AutomaticOffP7_objectS0___ZL25PyvtkLocator_SetToleranceP7_objectS0___ZL33PyvtkLocator_GetToleranceMinValueP7_objectS0___ZL33PyvtkLocator_GetToleranceMaxValueP7_objectS0___ZL25PyvtkLocator_GetToleranceP7_objectS0___ZL19PyvtkLocator_UpdateP7_objectS0___ZL23PyvtkLocator_InitializeP7_objectS0___ZL25PyvtkLocator_BuildLocatorP7_objectS0___ZL32PyvtkLocator_FreeSearchStructureP7_objectS0___ZL35PyvtkLocator_GenerateRepresentationP7_objectS0___ZL25PyvtkLocator_GetBuildTimeP7_objectS0___GLOBAL__sub_I_vtkMappedUnstructuredGridPython.cxx__GLOBAL__sub_I_vtkMappedUnstructuredGridCellIteratorPython.cxx__ZL35PyvtkMarchingSquaresLineCases_CCopyPKv__ZL36PyvtkMarchingSquaresLineCases_DeleteP7_object__ZL34PyvtkMarchingSquaresLineCases_HashP7_object__ZL33PyvtkMarchingSquaresLineCases_NewP11_typeobjectP7_objectS2___ZL60PyvtkMarchingSquaresLineCases_vtkMarchingSquaresLineCases_s2P7_objectS0___ZL37PyvtkMarchingCubesTriangleCases_CCopyPKv__ZL38PyvtkMarchingCubesTriangleCases_DeleteP7_object__ZL36PyvtkMarchingCubesTriangleCases_HashP7_object__ZL35PyvtkMarchingCubesTriangleCases_NewP11_typeobjectP7_objectS2___ZL64PyvtkMarchingCubesTriangleCases_vtkMarchingCubesTriangleCases_s2P7_objectS0___ZL47PyvtkMeanValueCoordinatesInterpolator_StaticNewv__ZL46PyvtkMeanValueCoordinatesInterpolator_IsTypeOfP7_objectS0___ZL41PyvtkMeanValueCoordinatesInterpolator_IsAP7_objectS0___ZL50PyvtkMeanValueCoordinatesInterpolator_SafeDownCastP7_objectS0___ZL49PyvtkMeanValueCoordinatesInterpolator_NewInstanceP7_objectS0___ZL65PyvtkMeanValueCoordinatesInterpolator_ComputeInterpolationWeightsP7_objectS0___ZL68PyvtkMeanValueCoordinatesInterpolator_ComputeInterpolationWeights_s1P7_objectS0___ZL68PyvtkMeanValueCoordinatesInterpolator_ComputeInterpolationWeights_s2P7_objectS0___ZL26PyvtkMergePoints_StaticNewv__ZL25PyvtkMergePoints_IsTypeOfP7_objectS0___ZL20PyvtkMergePoints_IsAP7_objectS0___ZL29PyvtkMergePoints_SafeDownCastP7_objectS0___ZL28PyvtkMergePoints_NewInstanceP7_objectS0___ZL32PyvtkMergePoints_IsInsertedPointP7_objectS0___ZL34PyvtkMergePoints_InsertUniquePointP7_objectS0___ZN15vtkPointLocator8IsTypeOfEPKc__ZL32PyvtkMultiBlockDataSet_StaticNewv__ZL31PyvtkMultiBlockDataSet_IsTypeOfP7_objectS0___ZL26PyvtkMultiBlockDataSet_IsAP7_objectS0___ZL35PyvtkMultiBlockDataSet_SafeDownCastP7_objectS0___ZL34PyvtkMultiBlockDataSet_NewInstanceP7_objectS0___ZL40PyvtkMultiBlockDataSet_GetDataObjectTypeP7_objectS0___ZL40PyvtkMultiBlockDataSet_SetNumberOfBlocksP7_objectS0___ZL40PyvtkMultiBlockDataSet_GetNumberOfBlocksP7_objectS0___ZL31PyvtkMultiBlockDataSet_GetBlockP7_objectS0___ZL31PyvtkMultiBlockDataSet_SetBlockP7_objectS0___ZL34PyvtkMultiBlockDataSet_RemoveBlockP7_objectS0___ZL34PyvtkMultiBlockDataSet_HasMetaDataP7_objectS0___ZL34PyvtkMultiBlockDataSet_GetMetaDataP7_objectS0___ZL30PyvtkMultiBlockDataSet_GetDataP7_objectS0___ZN20vtkMultiBlockDataSet8IsTypeOfEPKc__ZL37PyvtkMultiBlockDataSet_HasMetaData_s1P7_objectS0___ZL37PyvtkMultiBlockDataSet_HasMetaData_s2P7_objectS0___ZL37PyvtkMultiBlockDataSet_GetMetaData_s1P7_objectS0___ZL37PyvtkMultiBlockDataSet_GetMetaData_s2P7_objectS0___ZL33PyvtkMultiBlockDataSet_GetData_s2P7_objectS0___ZL33PyvtkMultiBlockDataSet_GetData_s1P7_objectS0___ZL32PyvtkMultiPieceDataSet_StaticNewv__ZL31PyvtkMultiPieceDataSet_IsTypeOfP7_objectS0___ZL26PyvtkMultiPieceDataSet_IsAP7_objectS0___ZL35PyvtkMultiPieceDataSet_SafeDownCastP7_objectS0___ZL34PyvtkMultiPieceDataSet_NewInstanceP7_objectS0___ZL40PyvtkMultiPieceDataSet_GetDataObjectTypeP7_objectS0___ZL40PyvtkMultiPieceDataSet_SetNumberOfPiecesP7_objectS0___ZL40PyvtkMultiPieceDataSet_GetNumberOfPiecesP7_objectS0___ZL31PyvtkMultiPieceDataSet_GetPieceP7_objectS0___ZL43PyvtkMultiPieceDataSet_GetPieceAsDataObjectP7_objectS0___ZL31PyvtkMultiPieceDataSet_SetPieceP7_objectS0___ZL34PyvtkMultiPieceDataSet_HasMetaDataP7_objectS0___ZL34PyvtkMultiPieceDataSet_GetMetaDataP7_objectS0___ZL30PyvtkMultiPieceDataSet_GetDataP7_objectS0___ZN20vtkMultiPieceDataSet8IsTypeOfEPKc__ZL37PyvtkMultiPieceDataSet_HasMetaData_s1P7_objectS0___ZL37PyvtkMultiPieceDataSet_HasMetaData_s2P7_objectS0___ZL37PyvtkMultiPieceDataSet_GetMetaData_s1P7_objectS0___ZL37PyvtkMultiPieceDataSet_GetMetaData_s2P7_objectS0___ZL33PyvtkMultiPieceDataSet_GetData_s2P7_objectS0___ZL33PyvtkMultiPieceDataSet_GetData_s1P7_objectS0___ZL35PyvtkMutableDirectedGraph_StaticNewv__ZL34PyvtkMutableDirectedGraph_IsTypeOfP7_objectS0___ZL29PyvtkMutableDirectedGraph_IsAP7_objectS0___ZL38PyvtkMutableDirectedGraph_SafeDownCastP7_objectS0___ZL37PyvtkMutableDirectedGraph_NewInstanceP7_objectS0___ZL45PyvtkMutableDirectedGraph_SetNumberOfVerticesP7_objectS0___ZL35PyvtkMutableDirectedGraph_AddVertexP7_objectS0___ZL33PyvtkMutableDirectedGraph_AddEdgeP7_objectS0___ZL39PyvtkMutableDirectedGraph_LazyAddVertexP7_objectS0___ZL37PyvtkMutableDirectedGraph_LazyAddEdgeP7_objectS0___ZL38PyvtkMutableDirectedGraph_AddGraphEdgeP7_objectS0___ZL34PyvtkMutableDirectedGraph_AddChildP7_objectS0___ZL38PyvtkMutableDirectedGraph_RemoveVertexP7_objectS0___ZL36PyvtkMutableDirectedGraph_RemoveEdgeP7_objectS0___ZL40PyvtkMutableDirectedGraph_RemoveVerticesP7_objectS0___ZL37PyvtkMutableDirectedGraph_RemoveEdgesP7_objectS0___ZN23vtkMutableDirectedGraph8IsTypeOfEPKc__ZL38PyvtkMutableDirectedGraph_AddVertex_s2P7_objectS0___ZL38PyvtkMutableDirectedGraph_AddVertex_s3P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s1P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s2P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s3P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s4P7_objectS0___ZL36PyvtkMutableDirectedGraph_AddEdge_s5P7_objectS0___ZL42PyvtkMutableDirectedGraph_LazyAddVertex_s2P7_objectS0___ZL42PyvtkMutableDirectedGraph_LazyAddVertex_s3P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s1P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s2P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s3P7_objectS0___ZL40PyvtkMutableDirectedGraph_LazyAddEdge_s4P7_objectS0___ZL37PyvtkMutableUndirectedGraph_StaticNewv__ZL36PyvtkMutableUndirectedGraph_IsTypeOfP7_objectS0___ZL31PyvtkMutableUndirectedGraph_IsAP7_objectS0___ZL40PyvtkMutableUndirectedGraph_SafeDownCastP7_objectS0___ZL39PyvtkMutableUndirectedGraph_NewInstanceP7_objectS0___ZL47PyvtkMutableUndirectedGraph_SetNumberOfVerticesP7_objectS0___ZL37PyvtkMutableUndirectedGraph_AddVertexP7_objectS0___ZL35PyvtkMutableUndirectedGraph_AddEdgeP7_objectS0___ZL41PyvtkMutableUndirectedGraph_LazyAddVertexP7_objectS0___ZL39PyvtkMutableUndirectedGraph_LazyAddEdgeP7_objectS0___ZL40PyvtkMutableUndirectedGraph_AddGraphEdgeP7_objectS0___ZL40PyvtkMutableUndirectedGraph_RemoveVertexP7_objectS0___ZL38PyvtkMutableUndirectedGraph_RemoveEdgeP7_objectS0___ZL42PyvtkMutableUndirectedGraph_RemoveVerticesP7_objectS0___ZL39PyvtkMutableUndirectedGraph_RemoveEdgesP7_objectS0___ZN25vtkMutableUndirectedGraph8IsTypeOfEPKc__ZL40PyvtkMutableUndirectedGraph_AddVertex_s2P7_objectS0___ZL40PyvtkMutableUndirectedGraph_AddVertex_s3P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s1P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s2P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s3P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s4P7_objectS0___ZL38PyvtkMutableUndirectedGraph_AddEdge_s5P7_objectS0___ZL44PyvtkMutableUndirectedGraph_LazyAddVertex_s2P7_objectS0___ZL44PyvtkMutableUndirectedGraph_LazyAddVertex_s3P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s1P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s2P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s3P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s4P7_objectS0___ZL42PyvtkMutableUndirectedGraph_LazyAddEdge_s5P7_objectS0___ZL27PyvtkNonLinearCell_IsTypeOfP7_objectS0___ZL22PyvtkNonLinearCell_IsAP7_objectS0___ZL31PyvtkNonLinearCell_SafeDownCastP7_objectS0___ZL30PyvtkNonLinearCell_NewInstanceP7_objectS0___ZL27PyvtkNonLinearCell_IsLinearP7_objectS0___ZL37PyvtkNonMergingPointLocator_StaticNewv__ZL36PyvtkNonMergingPointLocator_IsTypeOfP7_objectS0___ZL31PyvtkNonMergingPointLocator_IsAP7_objectS0___ZL40PyvtkNonMergingPointLocator_SafeDownCastP7_objectS0___ZL39PyvtkNonMergingPointLocator_NewInstanceP7_objectS0___ZL43PyvtkNonMergingPointLocator_IsInsertedPointP7_objectS0___ZL45PyvtkNonMergingPointLocator_InsertUniquePointP7_objectS0___ZL33PyvtkOctreePointLocator_StaticNewv__ZL32PyvtkOctreePointLocator_IsTypeOfP7_objectS0___ZL27PyvtkOctreePointLocator_IsAP7_objectS0___ZL36PyvtkOctreePointLocator_SafeDownCastP7_objectS0___ZL35PyvtkOctreePointLocator_NewInstanceP7_objectS0___ZL49PyvtkOctreePointLocator_SetMaximumPointsPerRegionP7_objectS0___ZL49PyvtkOctreePointLocator_GetMaximumPointsPerRegionP7_objectS0___ZL45PyvtkOctreePointLocator_SetCreateCubicOctantsP7_objectS0___ZL45PyvtkOctreePointLocator_GetCreateCubicOctantsP7_objectS0___ZL38PyvtkOctreePointLocator_GetFudgeFactorP7_objectS0___ZL38PyvtkOctreePointLocator_SetFudgeFactorP7_objectS0___ZL33PyvtkOctreePointLocator_GetBoundsP7_objectS0___ZL44PyvtkOctreePointLocator_GetNumberOfLeafNodesP7_objectS0___ZL39PyvtkOctreePointLocator_GetRegionBoundsP7_objectS0___ZL43PyvtkOctreePointLocator_GetRegionDataBoundsP7_objectS0___ZL48PyvtkOctreePointLocator_GetRegionContainingPointP7_objectS0___ZL36PyvtkOctreePointLocator_BuildLocatorP7_objectS0___ZL40PyvtkOctreePointLocator_FindClosestPointP7_objectS0___ZL52PyvtkOctreePointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL48PyvtkOctreePointLocator_FindClosestPointInRegionP7_objectS0___ZL46PyvtkOctreePointLocator_FindPointsWithinRadiusP7_objectS0___ZL42PyvtkOctreePointLocator_FindClosestNPointsP7_objectS0___ZL41PyvtkOctreePointLocator_GetPointsInRegionP7_objectS0___ZL43PyvtkOctreePointLocator_FreeSearchStructureP7_objectS0___ZL46PyvtkOctreePointLocator_GenerateRepresentationP7_objectS0___ZL40PyvtkOctreePointLocator_FindPointsInAreaP7_objectS0___ZL37PyvtkOctreePointLocatorNode_StaticNewv__ZL36PyvtkOctreePointLocatorNode_IsTypeOfP7_objectS0___ZL31PyvtkOctreePointLocatorNode_IsAP7_objectS0___ZL40PyvtkOctreePointLocatorNode_SafeDownCastP7_objectS0___ZL39PyvtkOctreePointLocatorNode_NewInstanceP7_objectS0___ZL45PyvtkOctreePointLocatorNode_SetNumberOfPointsP7_objectS0___ZL45PyvtkOctreePointLocatorNode_GetNumberOfPointsP7_objectS0___ZL37PyvtkOctreePointLocatorNode_SetBoundsP7_objectS0___ZL37PyvtkOctreePointLocatorNode_GetBoundsP7_objectS0___ZL41PyvtkOctreePointLocatorNode_SetDataBoundsP7_objectS0___ZL41PyvtkOctreePointLocatorNode_GetDataBoundsP7_objectS0___ZL40PyvtkOctreePointLocatorNode_GetMinBoundsP7_objectS0___ZL40PyvtkOctreePointLocatorNode_GetMaxBoundsP7_objectS0___ZL40PyvtkOctreePointLocatorNode_SetMinBoundsP7_objectS0___ZL40PyvtkOctreePointLocatorNode_SetMaxBoundsP7_objectS0___ZL44PyvtkOctreePointLocatorNode_GetMinDataBoundsP7_objectS0___ZL44PyvtkOctreePointLocatorNode_GetMaxDataBoundsP7_objectS0___ZL44PyvtkOctreePointLocatorNode_SetMinDataBoundsP7_objectS0___ZL44PyvtkOctreePointLocatorNode_SetMaxDataBoundsP7_objectS0___ZL33PyvtkOctreePointLocatorNode_GetIDP7_objectS0___ZL36PyvtkOctreePointLocatorNode_GetMinIDP7_objectS0___ZL44PyvtkOctreePointLocatorNode_CreateChildNodesP7_objectS0___ZL44PyvtkOctreePointLocatorNode_DeleteChildNodesP7_objectS0___ZL36PyvtkOctreePointLocatorNode_GetChildP7_objectS0___ZL44PyvtkOctreePointLocatorNode_IntersectsRegionP7_objectS0___ZL41PyvtkOctreePointLocatorNode_ContainsPointP7_objectS0___ZL50PyvtkOctreePointLocatorNode_GetDistance2ToBoundaryP7_objectS0___ZL55PyvtkOctreePointLocatorNode_GetDistance2ToInnerBoundaryP7_objectS0___ZL45PyvtkOctreePointLocatorNode_GetSubOctantIndexP7_objectS0___ZL56PyvtkOctreePointLocatorNode_ComputeOctreeNodeInformationP7_objectS0___ZL34PyvtkOrderedTriangulator_StaticNewv__ZL33PyvtkOrderedTriangulator_IsTypeOfP7_objectS0___ZL28PyvtkOrderedTriangulator_IsAP7_objectS0___ZL37PyvtkOrderedTriangulator_SafeDownCastP7_objectS0___ZL36PyvtkOrderedTriangulator_NewInstanceP7_objectS0___ZL42PyvtkOrderedTriangulator_InitTriangulationP7_objectS0___ZL36PyvtkOrderedTriangulator_InsertPointP7_objectS0___ZL36PyvtkOrderedTriangulator_TriangulateP7_objectS0___ZL44PyvtkOrderedTriangulator_TemplateTriangulateP7_objectS0___ZL40PyvtkOrderedTriangulator_UpdatePointTypeP7_objectS0___ZL41PyvtkOrderedTriangulator_GetPointPositionP7_objectS0___ZL41PyvtkOrderedTriangulator_GetPointLocationP7_objectS0___ZL35PyvtkOrderedTriangulator_GetPointIdP7_objectS0___ZL42PyvtkOrderedTriangulator_GetNumberOfPointsP7_objectS0___ZL40PyvtkOrderedTriangulator_SetUseTemplatesP7_objectS0___ZL40PyvtkOrderedTriangulator_GetUseTemplatesP7_objectS0___ZL39PyvtkOrderedTriangulator_UseTemplatesOnP7_objectS0___ZL40PyvtkOrderedTriangulator_UseTemplatesOffP7_objectS0___ZL37PyvtkOrderedTriangulator_SetPreSortedP7_objectS0___ZL37PyvtkOrderedTriangulator_GetPreSortedP7_objectS0___ZL36PyvtkOrderedTriangulator_PreSortedOnP7_objectS0___ZL37PyvtkOrderedTriangulator_PreSortedOffP7_objectS0___ZL41PyvtkOrderedTriangulator_SetUseTwoSortIdsP7_objectS0___ZL41PyvtkOrderedTriangulator_GetUseTwoSortIdsP7_objectS0___ZL40PyvtkOrderedTriangulator_UseTwoSortIdsOnP7_objectS0___ZL41PyvtkOrderedTriangulator_UseTwoSortIdsOffP7_objectS0___ZL34PyvtkOrderedTriangulator_GetTetrasP7_objectS0___ZL34PyvtkOrderedTriangulator_AddTetrasP7_objectS0___ZL37PyvtkOrderedTriangulator_AddTrianglesP7_objectS0___ZL43PyvtkOrderedTriangulator_InitTetraTraversalP7_objectS0___ZL37PyvtkOrderedTriangulator_GetNextTetraP7_objectS0___ZL37PyvtkOrderedTriangulator_AddTetras_s1P7_objectS0___ZL37PyvtkOrderedTriangulator_AddTetras_s2P7_objectS0___ZL30PyvtkOutEdgeIterator_StaticNewv__ZL29PyvtkOutEdgeIterator_IsTypeOfP7_objectS0___ZL24PyvtkOutEdgeIterator_IsAP7_objectS0___ZL33PyvtkOutEdgeIterator_SafeDownCastP7_objectS0___ZL32PyvtkOutEdgeIterator_NewInstanceP7_objectS0___ZL31PyvtkOutEdgeIterator_InitializeP7_objectS0___ZL29PyvtkOutEdgeIterator_GetGraphP7_objectS0___ZL30PyvtkOutEdgeIterator_GetVertexP7_objectS0___ZL25PyvtkOutEdgeIterator_NextP7_objectS0___ZL34PyvtkOutEdgeIterator_NextGraphEdgeP7_objectS0___ZL28PyvtkOutEdgeIterator_HasNextP7_objectS0___ZL19PyvtkPath_StaticNewv__ZL18PyvtkPath_IsTypeOfP7_objectS0___ZL13PyvtkPath_IsAP7_objectS0___ZL22PyvtkPath_SafeDownCastP7_objectS0___ZL21PyvtkPath_NewInstanceP7_objectS0___ZL27PyvtkPath_GetDataObjectTypeP7_objectS0___ZL25PyvtkPath_InsertNextPointP7_objectS0___ZL18PyvtkPath_SetCodesP7_objectS0___ZL18PyvtkPath_GetCodesP7_objectS0___ZL26PyvtkPath_GetNumberOfCellsP7_objectS0___ZL17PyvtkPath_GetCellP7_objectS0___ZL21PyvtkPath_GetCellTypeP7_objectS0___ZL23PyvtkPath_GetCellPointsP7_objectS0___ZL23PyvtkPath_GetPointCellsP7_objectS0___ZL24PyvtkPath_GetMaxCellSizeP7_objectS0___ZL18PyvtkPath_AllocateP7_objectS0___ZL15PyvtkPath_ResetP7_objectS0___ZL17PyvtkPath_GetDataP7_objectS0___ZN7vtkPath8IsTypeOfEPKc__ZL20PyvtkPath_GetData_s2P7_objectS0___ZL20PyvtkPath_GetData_s1P7_objectS0___ZL30PyvtkPentagonalPrism_StaticNewv__ZL29PyvtkPentagonalPrism_IsTypeOfP7_objectS0___ZL24PyvtkPentagonalPrism_IsAP7_objectS0___ZL33PyvtkPentagonalPrism_SafeDownCastP7_objectS0___ZL32PyvtkPentagonalPrism_NewInstanceP7_objectS0___ZL34PyvtkPentagonalPrism_GetEdgePointsP7_objectS0___ZL34PyvtkPentagonalPrism_GetFacePointsP7_objectS0___ZL32PyvtkPentagonalPrism_GetCellTypeP7_objectS0___ZL37PyvtkPentagonalPrism_GetCellDimensionP7_objectS0___ZL37PyvtkPentagonalPrism_GetNumberOfEdgesP7_objectS0___ZL37PyvtkPentagonalPrism_GetNumberOfFacesP7_objectS0___ZL28PyvtkPentagonalPrism_GetEdgeP7_objectS0___ZL28PyvtkPentagonalPrism_GetFaceP7_objectS0___ZL33PyvtkPentagonalPrism_CellBoundaryP7_objectS0___ZL37PyvtkPentagonalPrism_EvaluatePositionP7_objectS0___ZL37PyvtkPentagonalPrism_EvaluateLocationP7_objectS0___ZL38PyvtkPentagonalPrism_IntersectWithLineP7_objectS0___ZL32PyvtkPentagonalPrism_TriangulateP7_objectS0___ZL32PyvtkPentagonalPrism_DerivativesP7_objectS0___ZL40PyvtkPentagonalPrism_GetParametricCoordsP7_objectS0___ZL40PyvtkPentagonalPrism_GetParametricCenterP7_objectS0___ZL43PyvtkPentagonalPrism_InterpolationFunctionsP7_objectS0___ZL40PyvtkPentagonalPrism_InterpolationDerivsP7_objectS0___ZL41PyvtkPentagonalPrism_InterpolateFunctionsP7_objectS0___ZL38PyvtkPentagonalPrism_InterpolateDerivsP7_objectS0___ZL33PyvtkPentagonalPrism_GetEdgeArrayP7_objectS0___ZL33PyvtkPentagonalPrism_GetFaceArrayP7_objectS0___ZL26PyvtkPerlinNoise_StaticNewv__ZL25PyvtkPerlinNoise_IsTypeOfP7_objectS0___ZL20PyvtkPerlinNoise_IsAP7_objectS0___ZL29PyvtkPerlinNoise_SafeDownCastP7_objectS0___ZL28PyvtkPerlinNoise_NewInstanceP7_objectS0___ZL33PyvtkPerlinNoise_EvaluateFunctionP7_objectS0___ZL33PyvtkPerlinNoise_EvaluateGradientP7_objectS0___ZL29PyvtkPerlinNoise_SetFrequencyP7_objectS0___ZL29PyvtkPerlinNoise_GetFrequencyP7_objectS0___ZL25PyvtkPerlinNoise_SetPhaseP7_objectS0___ZL25PyvtkPerlinNoise_GetPhaseP7_objectS0___ZL29PyvtkPerlinNoise_SetAmplitudeP7_objectS0___ZL29PyvtkPerlinNoise_GetAmplitudeP7_objectS0___ZL32PyvtkPiecewiseFunction_StaticNewv__ZL31PyvtkPiecewiseFunction_IsTypeOfP7_objectS0___ZL26PyvtkPiecewiseFunction_IsAP7_objectS0___ZL35PyvtkPiecewiseFunction_SafeDownCastP7_objectS0___ZL34PyvtkPiecewiseFunction_NewInstanceP7_objectS0___ZL31PyvtkPiecewiseFunction_DeepCopyP7_objectS0___ZL34PyvtkPiecewiseFunction_ShallowCopyP7_objectS0___ZL40PyvtkPiecewiseFunction_GetDataObjectTypeP7_objectS0___ZL30PyvtkPiecewiseFunction_GetSizeP7_objectS0___ZL31PyvtkPiecewiseFunction_AddPointP7_objectS0___ZL34PyvtkPiecewiseFunction_RemovePointP7_objectS0___ZL38PyvtkPiecewiseFunction_RemoveAllPointsP7_objectS0___ZL33PyvtkPiecewiseFunction_AddSegmentP7_objectS0___ZL31PyvtkPiecewiseFunction_GetValueP7_objectS0___ZL35PyvtkPiecewiseFunction_GetNodeValueP7_objectS0___ZL35PyvtkPiecewiseFunction_SetNodeValueP7_objectS0___ZL37PyvtkPiecewiseFunction_GetDataPointerP7_objectS0___ZL42PyvtkPiecewiseFunction_FillFromDataPointerP7_objectS0___ZL31PyvtkPiecewiseFunction_GetRangeP7_objectS0___ZL34PyvtkPiecewiseFunction_AdjustRangeP7_objectS0___ZL31PyvtkPiecewiseFunction_GetTableP7_objectS0___ZL45PyvtkPiecewiseFunction_BuildFunctionFromTableP7_objectS0___ZL34PyvtkPiecewiseFunction_SetClampingP7_objectS0___ZL34PyvtkPiecewiseFunction_GetClampingP7_objectS0___ZL33PyvtkPiecewiseFunction_ClampingOnP7_objectS0___ZL34PyvtkPiecewiseFunction_ClampingOffP7_objectS0___ZL37PyvtkPiecewiseFunction_SetUseLogScaleP7_objectS0___ZL37PyvtkPiecewiseFunction_GetUseLogScaleP7_objectS0___ZL36PyvtkPiecewiseFunction_UseLogScaleOnP7_objectS0___ZL37PyvtkPiecewiseFunction_UseLogScaleOffP7_objectS0___ZL30PyvtkPiecewiseFunction_GetTypeP7_objectS0___ZL43PyvtkPiecewiseFunction_GetFirstNonZeroValueP7_objectS0___ZL33PyvtkPiecewiseFunction_InitializeP7_objectS0___ZL30PyvtkPiecewiseFunction_GetDataP7_objectS0___ZL47PyvtkPiecewiseFunction_SetAllowDuplicateScalarsP7_objectS0___ZL47PyvtkPiecewiseFunction_GetAllowDuplicateScalarsP7_objectS0___ZL46PyvtkPiecewiseFunction_AllowDuplicateScalarsOnP7_objectS0___ZL47PyvtkPiecewiseFunction_AllowDuplicateScalarsOffP7_objectS0___ZL49PyvtkPiecewiseFunction_EstimateMinNumberOfSamplesP7_objectS0___ZL33PyvtkPiecewiseFunction_GetData_s2P7_objectS0___ZL33PyvtkPiecewiseFunction_GetData_s1P7_objectS0___ZL20PyvtkPixel_StaticNewv__ZL19PyvtkPixel_IsTypeOfP7_objectS0___ZL14PyvtkPixel_IsAP7_objectS0___ZL23PyvtkPixel_SafeDownCastP7_objectS0___ZL22PyvtkPixel_NewInstanceP7_objectS0___ZL22PyvtkPixel_GetCellTypeP7_objectS0___ZL27PyvtkPixel_GetCellDimensionP7_objectS0___ZL27PyvtkPixel_GetNumberOfEdgesP7_objectS0___ZL27PyvtkPixel_GetNumberOfFacesP7_objectS0___ZL18PyvtkPixel_GetEdgeP7_objectS0___ZL18PyvtkPixel_GetFaceP7_objectS0___ZL23PyvtkPixel_CellBoundaryP7_objectS0___ZL18PyvtkPixel_ContourP7_objectS0___ZL15PyvtkPixel_ClipP7_objectS0___ZL27PyvtkPixel_EvaluatePositionP7_objectS0___ZL27PyvtkPixel_EvaluateLocationP7_objectS0___ZL30PyvtkPixel_GetParametricCenterP7_objectS0___ZL28PyvtkPixel_IntersectWithLineP7_objectS0___ZL22PyvtkPixel_TriangulateP7_objectS0___ZL22PyvtkPixel_DerivativesP7_objectS0___ZL30PyvtkPixel_GetParametricCoordsP7_objectS0___ZL33PyvtkPixel_InterpolationFunctionsP7_objectS0___ZL30PyvtkPixel_InterpolationDerivsP7_objectS0___ZL31PyvtkPixel_InterpolateFunctionsP7_objectS0___ZL28PyvtkPixel_InterpolateDerivsP7_objectS0___ZL22PyvtkPixelExtent_CCopyPKv__ZL23PyvtkPixelExtent_DeleteP7_object__ZL21PyvtkPixelExtent_HashP7_object__ZL23PyvtkPixelExtent_StringP7_object__ZL28PyvtkPixelExtent_RichCompareP7_objectS0_i__ZL20PyvtkPixelExtent_NewP11_typeobjectP7_objectS2___ZL34PyvtkPixelExtent_vtkPixelExtent_s2P7_objectS0___ZL24PyvtkPixelExtent_SetDataP7_objectS0___ZL22PyvtkPixelExtent_ClearP7_objectS0___ZL24PyvtkPixelExtent_GetDataP7_objectS0___ZL25PyvtkPixelExtent_GetDataUP7_objectS0___ZL30PyvtkPixelExtent_GetStartIndexP7_objectS0___ZL28PyvtkPixelExtent_GetEndIndexP7_objectS0___ZL22PyvtkPixelExtent_EmptyP7_objectS0___ZL25PyvtkPixelExtent_ContainsP7_objectS0___ZL25PyvtkPixelExtent_DisjointP7_objectS0___ZL21PyvtkPixelExtent_SizeP7_objectS0___ZL21PyvtkPixelExtent_GrowP7_objectS0___ZL24PyvtkPixelExtent_GrowLowP7_objectS0___ZL25PyvtkPixelExtent_GrowHighP7_objectS0___ZL23PyvtkPixelExtent_ShrinkP7_objectS0___ZL22PyvtkPixelExtent_ShiftP7_objectS0___ZL22PyvtkPixelExtent_SplitP7_objectS0___ZL27PyvtkPixelExtent_CellToNodeP7_objectS0___ZL27PyvtkPixelExtent_NodeToCellP7_objectS0___ZL24PyvtkPixelExtent_Grow_s2P7_objectS0___ZL24PyvtkPixelExtent_Grow_s3P7_objectS0___ZL26PyvtkPixelExtent_Shrink_s2P7_objectS0___ZL26PyvtkPixelExtent_Shrink_s4P7_objectS0___ZL25PyvtkPixelExtent_Shift_s2P7_objectS0___ZL25PyvtkPixelExtent_Shift_s3P7_objectS0___ZL25PyvtkPixelExtent_Shift_s4P7_objectS0___ZL25PyvtkPixelExtent_Shift_s5P7_objectS0___ZL25PyvtkPixelExtent_Shift_s6P7_objectS0___ZL24PyvtkPixelTransfer_CCopyPKv__ZL25PyvtkPixelTransfer_DeleteP7_object__ZL23PyvtkPixelTransfer_HashP7_object__ZL22PyvtkPixelTransfer_NewP11_typeobjectP7_objectS2___ZL38PyvtkPixelTransfer_vtkPixelTransfer_s2P7_objectS0___ZL23PyvtkPixelTransfer_BlitP7_objectS0___ZL30PyvtkPlaneCollection_StaticNewv__ZL29PyvtkPlaneCollection_IsTypeOfP7_objectS0___ZL24PyvtkPlaneCollection_IsAP7_objectS0___ZL33PyvtkPlaneCollection_SafeDownCastP7_objectS0___ZL32PyvtkPlaneCollection_NewInstanceP7_objectS0___ZL28PyvtkPlaneCollection_AddItemP7_objectS0___ZL32PyvtkPlaneCollection_GetNextItemP7_objectS0___ZL28PyvtkPlaneCollection_GetItemP7_objectS0___ZL20PyvtkPlane_StaticNewv__ZL19PyvtkPlane_IsTypeOfP7_objectS0___ZL14PyvtkPlane_IsAP7_objectS0___ZL23PyvtkPlane_SafeDownCastP7_objectS0___ZL22PyvtkPlane_NewInstanceP7_objectS0___ZL27PyvtkPlane_EvaluateFunctionP7_objectS0___ZL27PyvtkPlane_EvaluateGradientP7_objectS0___ZL20PyvtkPlane_SetNormalP7_objectS0___ZL20PyvtkPlane_GetNormalP7_objectS0___ZL20PyvtkPlane_SetOriginP7_objectS0___ZL20PyvtkPlane_GetOriginP7_objectS0___ZL15PyvtkPlane_PushP7_objectS0___ZL23PyvtkPlane_ProjectPointP7_objectS0___ZL24PyvtkPlane_ProjectVectorP7_objectS0___ZL34PyvtkPlane_GeneralizedProjectPointP7_objectS0___ZL19PyvtkPlane_EvaluateP7_objectS0___ZL26PyvtkPlane_DistanceToPlaneP7_objectS0___ZL28PyvtkPlane_IntersectWithLineP7_objectS0___ZL21PyvtkPlanes_StaticNewv__ZL20PyvtkPlanes_IsTypeOfP7_objectS0___ZL15PyvtkPlanes_IsAP7_objectS0___ZL24PyvtkPlanes_SafeDownCastP7_objectS0___ZL23PyvtkPlanes_NewInstanceP7_objectS0___ZL28PyvtkPlanes_EvaluateFunctionP7_objectS0___ZL28PyvtkPlanes_EvaluateGradientP7_objectS0___ZL21PyvtkPlanes_SetPointsP7_objectS0___ZL21PyvtkPlanes_GetPointsP7_objectS0___ZL22PyvtkPlanes_SetNormalsP7_objectS0___ZL22PyvtkPlanes_GetNormalsP7_objectS0___ZL28PyvtkPlanes_SetFrustumPlanesP7_objectS0___ZL21PyvtkPlanes_SetBoundsP7_objectS0___ZL29PyvtkPlanes_GetNumberOfPlanesP7_objectS0___ZL20PyvtkPlanes_GetPlaneP7_objectS0___ZL33PyvtkPlanesIntersection_StaticNewv__ZL32PyvtkPlanesIntersection_IsTypeOfP7_objectS0___ZL27PyvtkPlanesIntersection_IsAP7_objectS0___ZL36PyvtkPlanesIntersection_SafeDownCastP7_objectS0___ZL35PyvtkPlanesIntersection_NewInstanceP7_objectS0___ZL41PyvtkPlanesIntersection_SetRegionVerticesP7_objectS0___ZL49PyvtkPlanesIntersection_GetNumberOfRegionVerticesP7_objectS0___ZL44PyvtkPlanesIntersection_GetNumRegionVerticesP7_objectS0___ZL41PyvtkPlanesIntersection_GetRegionVerticesP7_objectS0___ZL40PyvtkPlanesIntersection_IntersectsRegionP7_objectS0___ZL45PyvtkPlanesIntersection_PolygonIntersectsBBoxP7_objectS0___ZL37PyvtkPlanesIntersection_Convert3DCellP7_objectS0___ZL24PyvtkPointData_StaticNewv__ZL23PyvtkPointData_IsTypeOfP7_objectS0___ZL18PyvtkPointData_IsAP7_objectS0___ZL27PyvtkPointData_SafeDownCastP7_objectS0___ZL26PyvtkPointData_NewInstanceP7_objectS0___ZL24PyvtkPointData_NullPointP7_objectS0___ZL27PyvtkPointLocator_StaticNewv__ZL26PyvtkPointLocator_IsTypeOfP7_objectS0___ZL21PyvtkPointLocator_IsAP7_objectS0___ZL30PyvtkPointLocator_SafeDownCastP7_objectS0___ZL29PyvtkPointLocator_NewInstanceP7_objectS0___ZL30PyvtkPointLocator_SetDivisionsP7_objectS0___ZL30PyvtkPointLocator_GetDivisionsP7_objectS0___ZL44PyvtkPointLocator_SetNumberOfPointsPerBucketP7_objectS0___ZL52PyvtkPointLocator_GetNumberOfPointsPerBucketMinValueP7_objectS0___ZL52PyvtkPointLocator_GetNumberOfPointsPerBucketMaxValueP7_objectS0___ZL44PyvtkPointLocator_GetNumberOfPointsPerBucketP7_objectS0___ZL34PyvtkPointLocator_FindClosestPointP7_objectS0___ZL46PyvtkPointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL36PyvtkPointLocator_InitPointInsertionP7_objectS0___ZL29PyvtkPointLocator_InsertPointP7_objectS0___ZL33PyvtkPointLocator_InsertNextPointP7_objectS0___ZL33PyvtkPointLocator_IsInsertedPointP7_objectS0___ZL35PyvtkPointLocator_InsertUniquePointP7_objectS0___ZL42PyvtkPointLocator_FindClosestInsertedPointP7_objectS0___ZL36PyvtkPointLocator_FindClosestNPointsP7_objectS0___ZL39PyvtkPointLocator_FindDistributedPointsP7_objectS0___ZL40PyvtkPointLocator_FindPointsWithinRadiusP7_objectS0___ZL35PyvtkPointLocator_GetPointsInBucketP7_objectS0___ZL27PyvtkPointLocator_GetPointsP7_objectS0___ZL28PyvtkPointLocator_InitializeP7_objectS0___ZL37PyvtkPointLocator_FreeSearchStructureP7_objectS0___ZL30PyvtkPointLocator_BuildLocatorP7_objectS0___ZL40PyvtkPointLocator_GenerateRepresentationP7_objectS0___ZL22PyvtkPointSet_IsTypeOfP7_objectS0___ZL17PyvtkPointSet_IsAP7_objectS0___ZL26PyvtkPointSet_SafeDownCastP7_objectS0___ZL25PyvtkPointSet_NewInstanceP7_objectS0___ZL24PyvtkPointSet_InitializeP7_objectS0___ZL27PyvtkPointSet_CopyStructureP7_objectS0___ZL31PyvtkPointSet_GetNumberOfPointsP7_objectS0___ZL22PyvtkPointSet_GetPointP7_objectS0___ZL23PyvtkPointSet_FindPointP7_objectS0___ZL22PyvtkPointSet_FindCellP7_objectS0___ZL29PyvtkPointSet_NewCellIteratorP7_objectS0___ZL22PyvtkPointSet_GetMTimeP7_objectS0___ZL27PyvtkPointSet_ComputeBoundsP7_objectS0___ZL21PyvtkPointSet_SqueezeP7_objectS0___ZL23PyvtkPointSet_SetPointsP7_objectS0___ZL23PyvtkPointSet_GetPointsP7_objectS0___ZL33PyvtkPointSet_GetActualMemorySizeP7_objectS0___ZL25PyvtkPointSet_ShallowCopyP7_objectS0___ZL22PyvtkPointSet_DeepCopyP7_objectS0___ZL21PyvtkPointSet_GetDataP7_objectS0___ZL24PyvtkPointSet_GetData_s2P7_objectS0___ZL24PyvtkPointSet_GetData_s1P7_objectS0___ZL35PyvtkPointSetCellIterator_StaticNewv__ZL34PyvtkPointSetCellIterator_IsTypeOfP7_objectS0___ZL29PyvtkPointSetCellIterator_IsAP7_objectS0___ZL38PyvtkPointSetCellIterator_SafeDownCastP7_objectS0___ZL37PyvtkPointSetCellIterator_NewInstanceP7_objectS0___ZL45PyvtkPointSetCellIterator_IsDoneWithTraversalP7_objectS0___ZL35PyvtkPointSetCellIterator_GetCellIdP7_objectS0___ZL34PyvtkPointsProjectedHull_StaticNewv__ZL33PyvtkPointsProjectedHull_IsTypeOfP7_objectS0___ZL28PyvtkPointsProjectedHull_IsAP7_objectS0___ZL37PyvtkPointsProjectedHull_SafeDownCastP7_objectS0___ZL36PyvtkPointsProjectedHull_NewInstanceP7_objectS0___ZL47PyvtkPointsProjectedHull_RectangleIntersectionXP7_objectS0___ZL47PyvtkPointsProjectedHull_RectangleIntersectionYP7_objectS0___ZL47PyvtkPointsProjectedHull_RectangleIntersectionZP7_objectS0___ZL36PyvtkPointsProjectedHull_GetCCWHullXP7_objectS0___ZL36PyvtkPointsProjectedHull_GetCCWHullYP7_objectS0___ZL36PyvtkPointsProjectedHull_GetCCWHullZP7_objectS0___ZL40PyvtkPointsProjectedHull_GetSizeCCWHullXP7_objectS0___ZL40PyvtkPointsProjectedHull_GetSizeCCWHullYP7_objectS0___ZL40PyvtkPointsProjectedHull_GetSizeCCWHullZP7_objectS0___ZL35PyvtkPointsProjectedHull_InitializeP7_objectS0___ZL30PyvtkPointsProjectedHull_ResetP7_objectS0___ZL31PyvtkPointsProjectedHull_UpdateP7_objectS0___ZL33PyvtkPolyDataCollection_StaticNewv__ZL32PyvtkPolyDataCollection_IsTypeOfP7_objectS0___ZL27PyvtkPolyDataCollection_IsAP7_objectS0___ZL36PyvtkPolyDataCollection_SafeDownCastP7_objectS0___ZL35PyvtkPolyDataCollection_NewInstanceP7_objectS0___ZL31PyvtkPolyDataCollection_AddItemP7_objectS0___ZL35PyvtkPolyDataCollection_GetNextItemP7_objectS0___GLOBAL__sub_I_vtkPolyDataCollectionPython.cxx__ZL23PyvtkPolyData_StaticNewv__ZL22PyvtkPolyData_IsTypeOfP7_objectS0___ZL17PyvtkPolyData_IsAP7_objectS0___ZL26PyvtkPolyData_SafeDownCastP7_objectS0___ZL25PyvtkPolyData_NewInstanceP7_objectS0___ZL31PyvtkPolyData_GetDataObjectTypeP7_objectS0___ZL27PyvtkPolyData_CopyStructureP7_objectS0___ZL30PyvtkPolyData_GetNumberOfCellsP7_objectS0___ZL21PyvtkPolyData_GetCellP7_objectS0___ZL25PyvtkPolyData_GetCellTypeP7_objectS0___ZL27PyvtkPolyData_GetCellBoundsP7_objectS0___ZL30PyvtkPolyData_GetCellNeighborsP7_objectS0___ZL23PyvtkPolyData_CopyCellsP7_objectS0___ZL27PyvtkPolyData_GetCellPointsP7_objectS0___ZL27PyvtkPolyData_GetPointCellsP7_objectS0___ZL27PyvtkPolyData_ComputeBoundsP7_objectS0___ZL21PyvtkPolyData_SqueezeP7_objectS0___ZL28PyvtkPolyData_GetMaxCellSizeP7_objectS0___ZL22PyvtkPolyData_SetVertsP7_objectS0___ZL22PyvtkPolyData_GetVertsP7_objectS0___ZL22PyvtkPolyData_SetLinesP7_objectS0___ZL22PyvtkPolyData_GetLinesP7_objectS0___ZL22PyvtkPolyData_SetPolysP7_objectS0___ZL22PyvtkPolyData_GetPolysP7_objectS0___ZL23PyvtkPolyData_SetStripsP7_objectS0___ZL23PyvtkPolyData_GetStripsP7_objectS0___ZL30PyvtkPolyData_GetNumberOfVertsP7_objectS0___ZL30PyvtkPolyData_GetNumberOfLinesP7_objectS0___ZL30PyvtkPolyData_GetNumberOfPolysP7_objectS0___ZL31PyvtkPolyData_GetNumberOfStripsP7_objectS0___ZL22PyvtkPolyData_AllocateP7_objectS0___ZL28PyvtkPolyData_InsertNextCellP7_objectS0___ZL19PyvtkPolyData_ResetP7_objectS0___ZL24PyvtkPolyData_BuildCellsP7_objectS0___ZL30PyvtkPolyData_NeedToBuildCellsP7_objectS0___ZL24PyvtkPolyData_BuildLinksP7_objectS0___ZL25PyvtkPolyData_DeleteCellsP7_objectS0___ZL25PyvtkPolyData_DeleteLinksP7_objectS0___ZL34PyvtkPolyData_GetCellEdgeNeighborsP7_objectS0___ZL24PyvtkPolyData_IsTriangleP7_objectS0___ZL20PyvtkPolyData_IsEdgeP7_objectS0___ZL31PyvtkPolyData_IsPointUsedByCellP7_objectS0___ZL25PyvtkPolyData_ReplaceCellP7_objectS0___ZL30PyvtkPolyData_ReplaceCellPointP7_objectS0___ZL25PyvtkPolyData_ReverseCellP7_objectS0___ZL25PyvtkPolyData_DeletePointP7_objectS0___ZL24PyvtkPolyData_DeleteCellP7_objectS0___ZL32PyvtkPolyData_RemoveDeletedCellsP7_objectS0___ZL35PyvtkPolyData_InsertNextLinkedPointP7_objectS0___ZL34PyvtkPolyData_InsertNextLinkedCellP7_objectS0___ZL31PyvtkPolyData_ReplaceLinkedCellP7_objectS0___ZL33PyvtkPolyData_RemoveCellReferenceP7_objectS0___ZL30PyvtkPolyData_AddCellReferenceP7_objectS0___ZL35PyvtkPolyData_RemoveReferenceToCellP7_objectS0___ZL32PyvtkPolyData_AddReferenceToCellP7_objectS0___ZL28PyvtkPolyData_ResizeCellListP7_objectS0___ZL24PyvtkPolyData_InitializeP7_objectS0___ZL22PyvtkPolyData_GetPieceP7_objectS0___ZL31PyvtkPolyData_GetNumberOfPiecesP7_objectS0___ZL27PyvtkPolyData_GetGhostLevelP7_objectS0___ZL33PyvtkPolyData_GetActualMemorySizeP7_objectS0___ZL25PyvtkPolyData_ShallowCopyP7_objectS0___ZL22PyvtkPolyData_DeepCopyP7_objectS0___ZL30PyvtkPolyData_RemoveGhostCellsP7_objectS0___ZL21PyvtkPolyData_GetDataP7_objectS0___ZL41PyvtkPolyData_GetScalarFieldCriticalIndexP7_objectS0___ZL26PyvtkPolyData_GetMeshMTimeP7_objectS0___ZN11vtkPolyData8IsTypeOfEPKc__ZL24PyvtkPolyData_GetCell_s2P7_objectS0___ZL24PyvtkPolyData_GetCell_s3P7_objectS0___ZL25PyvtkPolyData_Allocate_s1P7_objectS0___ZL25PyvtkPolyData_Allocate_s2P7_objectS0___ZN11vtkPolyData10IsTriangleEiii__ZL24PyvtkPolyData_GetData_s2P7_objectS0___ZL24PyvtkPolyData_GetData_s1P7_objectS0___ZL44PyvtkPolyData_GetScalarFieldCriticalIndex_s1P7_objectS0___ZL44PyvtkPolyData_GetScalarFieldCriticalIndex_s2P7_objectS0___ZL44PyvtkPolyData_GetScalarFieldCriticalIndex_s3P7_objectS0___GLOBAL__sub_I_vtkPolyDataPython.cxx__ZL22PyvtkPolygon_StaticNewv__ZL21PyvtkPolygon_IsTypeOfP7_objectS0___ZL16PyvtkPolygon_IsAP7_objectS0___ZL25PyvtkPolygon_SafeDownCastP7_objectS0___ZL24PyvtkPolygon_NewInstanceP7_objectS0___ZL24PyvtkPolygon_GetCellTypeP7_objectS0___ZL29PyvtkPolygon_GetCellDimensionP7_objectS0___ZL29PyvtkPolygon_GetNumberOfEdgesP7_objectS0___ZL29PyvtkPolygon_GetNumberOfFacesP7_objectS0___ZL20PyvtkPolygon_GetEdgeP7_objectS0___ZL20PyvtkPolygon_GetFaceP7_objectS0___ZL25PyvtkPolygon_CellBoundaryP7_objectS0___ZL20PyvtkPolygon_ContourP7_objectS0___ZL17PyvtkPolygon_ClipP7_objectS0___ZL29PyvtkPolygon_EvaluatePositionP7_objectS0___ZL29PyvtkPolygon_EvaluateLocationP7_objectS0___ZL30PyvtkPolygon_IntersectWithLineP7_objectS0___ZL24PyvtkPolygon_TriangulateP7_objectS0___ZL24PyvtkPolygon_DerivativesP7_objectS0___ZL26PyvtkPolygon_IsPrimaryCellP7_objectS0___ZL24PyvtkPolygon_ComputeAreaP7_objectS0___ZL33PyvtkPolygon_InterpolateFunctionsP7_objectS0___ZL26PyvtkPolygon_ComputeNormalP7_objectS0___ZL21PyvtkPolygon_IsConvexP7_objectS0___ZL28PyvtkPolygon_ComputeCentroidP7_objectS0___ZL32PyvtkPolygon_ParameterizePolygonP7_objectS0___ZL27PyvtkPolygon_PointInPolygonP7_objectS0___ZL37PyvtkPolygon_NonDegenerateTriangulateP7_objectS0___ZL31PyvtkPolygon_BoundedTriangulateP7_objectS0___ZL30PyvtkPolygon_DistanceToPolygonP7_objectS0___ZL40PyvtkPolygon_IntersectPolygonWithPolygonP7_objectS0___ZL35PyvtkPolygon_IntersectConvex2DCellsP7_objectS0___ZL35PyvtkPolygon_GetUseMVCInterpolationP7_objectS0___ZL35PyvtkPolygon_SetUseMVCInterpolationP7_objectS0___ZL29PyvtkPolygon_ComputeNormal_s3P7_objectS0___ZL29PyvtkPolygon_ComputeNormal_s4P7_objectS0___ZL25PyvtkPolyhedron_StaticNewv__ZL24PyvtkPolyhedron_IsTypeOfP7_objectS0___ZL19PyvtkPolyhedron_IsAP7_objectS0___ZL28PyvtkPolyhedron_SafeDownCastP7_objectS0___ZL27PyvtkPolyhedron_NewInstanceP7_objectS0___ZL29PyvtkPolyhedron_GetEdgePointsP7_objectS0___ZL29PyvtkPolyhedron_GetFacePointsP7_objectS0___ZL35PyvtkPolyhedron_GetParametricCoordsP7_objectS0___ZL27PyvtkPolyhedron_GetCellTypeP7_objectS0___ZL38PyvtkPolyhedron_RequiresInitializationP7_objectS0___ZL26PyvtkPolyhedron_InitializeP7_objectS0___ZL32PyvtkPolyhedron_GetNumberOfEdgesP7_objectS0___ZL23PyvtkPolyhedron_GetEdgeP7_objectS0___ZL32PyvtkPolyhedron_GetNumberOfFacesP7_objectS0___ZL23PyvtkPolyhedron_GetFaceP7_objectS0___ZL23PyvtkPolyhedron_ContourP7_objectS0___ZL20PyvtkPolyhedron_ClipP7_objectS0___ZL32PyvtkPolyhedron_EvaluatePositionP7_objectS0___ZL32PyvtkPolyhedron_EvaluateLocationP7_objectS0___ZL33PyvtkPolyhedron_IntersectWithLineP7_objectS0___ZL27PyvtkPolyhedron_TriangulateP7_objectS0___ZL27PyvtkPolyhedron_DerivativesP7_objectS0___ZL28PyvtkPolyhedron_CellBoundaryP7_objectS0___ZL35PyvtkPolyhedron_GetParametricCenterP7_objectS0___ZL29PyvtkPolyhedron_IsPrimaryCellP7_objectS0___ZL36PyvtkPolyhedron_InterpolateFunctionsP7_objectS0___ZL33PyvtkPolyhedron_InterpolateDerivsP7_objectS0___ZL50PyvtkPolyhedron_RequiresExplicitFaceRepresentationP7_objectS0___ZL24PyvtkPolyhedron_SetFacesP7_objectS0___ZL24PyvtkPolyhedron_GetFacesP7_objectS0___ZL24PyvtkPolyhedron_IsInsideP7_objectS0___ZL24PyvtkPolyhedron_IsConvexP7_objectS0___ZL27PyvtkPolyhedron_GetPolyDataP7_objectS0___ZL23PyvtkPolyLine_StaticNewv__ZL22PyvtkPolyLine_IsTypeOfP7_objectS0___ZL17PyvtkPolyLine_IsAP7_objectS0___ZL26PyvtkPolyLine_SafeDownCastP7_objectS0___ZL25PyvtkPolyLine_NewInstanceP7_objectS0___ZL36PyvtkPolyLine_GenerateSlidingNormalsP7_objectS0___ZL25PyvtkPolyLine_GetCellTypeP7_objectS0___ZL30PyvtkPolyLine_GetCellDimensionP7_objectS0___ZL30PyvtkPolyLine_GetNumberOfEdgesP7_objectS0___ZL30PyvtkPolyLine_GetNumberOfFacesP7_objectS0___ZL21PyvtkPolyLine_GetEdgeP7_objectS0___ZL21PyvtkPolyLine_GetFaceP7_objectS0___ZL26PyvtkPolyLine_CellBoundaryP7_objectS0___ZL21PyvtkPolyLine_ContourP7_objectS0___ZL18PyvtkPolyLine_ClipP7_objectS0___ZL30PyvtkPolyLine_EvaluatePositionP7_objectS0___ZL30PyvtkPolyLine_EvaluateLocationP7_objectS0___ZL31PyvtkPolyLine_IntersectWithLineP7_objectS0___ZL25PyvtkPolyLine_TriangulateP7_objectS0___ZL25PyvtkPolyLine_DerivativesP7_objectS0___ZL27PyvtkPolyLine_IsPrimaryCellP7_objectS0___ZL33PyvtkPolyLine_GetParametricCenterP7_objectS0___ZL24PyvtkPolyPlane_StaticNewv__ZL23PyvtkPolyPlane_IsTypeOfP7_objectS0___ZL18PyvtkPolyPlane_IsAP7_objectS0___ZL27PyvtkPolyPlane_SafeDownCastP7_objectS0___ZL26PyvtkPolyPlane_NewInstanceP7_objectS0___ZL31PyvtkPolyPlane_EvaluateFunctionP7_objectS0___ZL31PyvtkPolyPlane_EvaluateGradientP7_objectS0___ZL26PyvtkPolyPlane_SetPolyLineP7_objectS0___ZL26PyvtkPolyPlane_GetPolyLineP7_objectS0___ZL23PyvtkPolyPlane_GetMTimeP7_objectS0___ZL25PyvtkPolyVertex_StaticNewv__ZL24PyvtkPolyVertex_IsTypeOfP7_objectS0___ZL19PyvtkPolyVertex_IsAP7_objectS0___ZL28PyvtkPolyVertex_SafeDownCastP7_objectS0___ZL27PyvtkPolyVertex_NewInstanceP7_objectS0___ZL27PyvtkPolyVertex_GetCellTypeP7_objectS0___ZL32PyvtkPolyVertex_GetCellDimensionP7_objectS0___ZL32PyvtkPolyVertex_GetNumberOfEdgesP7_objectS0___ZL32PyvtkPolyVertex_GetNumberOfFacesP7_objectS0___ZL23PyvtkPolyVertex_GetEdgeP7_objectS0___ZL23PyvtkPolyVertex_GetFaceP7_objectS0___ZL28PyvtkPolyVertex_CellBoundaryP7_objectS0___ZL23PyvtkPolyVertex_ContourP7_objectS0___ZL20PyvtkPolyVertex_ClipP7_objectS0___ZL32PyvtkPolyVertex_EvaluatePositionP7_objectS0___ZL32PyvtkPolyVertex_EvaluateLocationP7_objectS0___ZL33PyvtkPolyVertex_IntersectWithLineP7_objectS0___ZL27PyvtkPolyVertex_TriangulateP7_objectS0___ZL27PyvtkPolyVertex_DerivativesP7_objectS0___ZL29PyvtkPolyVertex_IsPrimaryCellP7_objectS0___ZL35PyvtkPolyVertex_GetParametricCenterP7_objectS0___ZL22PyvtkPyramid_StaticNewv__ZL21PyvtkPyramid_IsTypeOfP7_objectS0___ZL16PyvtkPyramid_IsAP7_objectS0___ZL25PyvtkPyramid_SafeDownCastP7_objectS0___ZL24PyvtkPyramid_NewInstanceP7_objectS0___ZL26PyvtkPyramid_GetEdgePointsP7_objectS0___ZL26PyvtkPyramid_GetFacePointsP7_objectS0___ZL24PyvtkPyramid_GetCellTypeP7_objectS0___ZL29PyvtkPyramid_GetCellDimensionP7_objectS0___ZL29PyvtkPyramid_GetNumberOfEdgesP7_objectS0___ZL29PyvtkPyramid_GetNumberOfFacesP7_objectS0___ZL20PyvtkPyramid_GetEdgeP7_objectS0___ZL20PyvtkPyramid_GetFaceP7_objectS0___ZL25PyvtkPyramid_CellBoundaryP7_objectS0___ZL20PyvtkPyramid_ContourP7_objectS0___ZL29PyvtkPyramid_EvaluatePositionP7_objectS0___ZL29PyvtkPyramid_EvaluateLocationP7_objectS0___ZL30PyvtkPyramid_IntersectWithLineP7_objectS0___ZL24PyvtkPyramid_TriangulateP7_objectS0___ZL24PyvtkPyramid_DerivativesP7_objectS0___ZL32PyvtkPyramid_GetParametricCoordsP7_objectS0___ZL32PyvtkPyramid_GetParametricCenterP7_objectS0___ZL35PyvtkPyramid_InterpolationFunctionsP7_objectS0___ZL32PyvtkPyramid_InterpolationDerivsP7_objectS0___ZL33PyvtkPyramid_InterpolateFunctionsP7_objectS0___ZL30PyvtkPyramid_InterpolateDerivsP7_objectS0___ZL25PyvtkPyramid_GetEdgeArrayP7_objectS0___ZL25PyvtkPyramid_GetFaceArrayP7_objectS0___ZL19PyvtkQuad_StaticNewv__ZL18PyvtkQuad_IsTypeOfP7_objectS0___ZL13PyvtkQuad_IsAP7_objectS0___ZL22PyvtkQuad_SafeDownCastP7_objectS0___ZL21PyvtkQuad_NewInstanceP7_objectS0___ZL21PyvtkQuad_GetCellTypeP7_objectS0___ZL26PyvtkQuad_GetCellDimensionP7_objectS0___ZL26PyvtkQuad_GetNumberOfEdgesP7_objectS0___ZL26PyvtkQuad_GetNumberOfFacesP7_objectS0___ZL17PyvtkQuad_GetEdgeP7_objectS0___ZL17PyvtkQuad_GetFaceP7_objectS0___ZL22PyvtkQuad_CellBoundaryP7_objectS0___ZL17PyvtkQuad_ContourP7_objectS0___ZL26PyvtkQuad_EvaluatePositionP7_objectS0___ZL26PyvtkQuad_EvaluateLocationP7_objectS0___ZL27PyvtkQuad_IntersectWithLineP7_objectS0___ZL21PyvtkQuad_TriangulateP7_objectS0___ZL21PyvtkQuad_DerivativesP7_objectS0___ZL29PyvtkQuad_GetParametricCoordsP7_objectS0___ZL29PyvtkQuad_GetParametricCenterP7_objectS0___ZL14PyvtkQuad_ClipP7_objectS0___ZL32PyvtkQuad_InterpolationFunctionsP7_objectS0___ZL29PyvtkQuad_InterpolationDerivsP7_objectS0___ZL30PyvtkQuad_InterpolateFunctionsP7_objectS0___ZL27PyvtkQuad_InterpolateDerivsP7_objectS0___ZL22PyvtkQuad_GetEdgeArrayP7_objectS0___ZL28PyvtkQuadraticEdge_StaticNewv__ZL27PyvtkQuadraticEdge_IsTypeOfP7_objectS0___ZL22PyvtkQuadraticEdge_IsAP7_objectS0___ZL31PyvtkQuadraticEdge_SafeDownCastP7_objectS0___ZL30PyvtkQuadraticEdge_NewInstanceP7_objectS0___ZL30PyvtkQuadraticEdge_GetCellTypeP7_objectS0___ZL35PyvtkQuadraticEdge_GetCellDimensionP7_objectS0___ZL35PyvtkQuadraticEdge_GetNumberOfEdgesP7_objectS0___ZL35PyvtkQuadraticEdge_GetNumberOfFacesP7_objectS0___ZL26PyvtkQuadraticEdge_GetEdgeP7_objectS0___ZL26PyvtkQuadraticEdge_GetFaceP7_objectS0___ZL31PyvtkQuadraticEdge_CellBoundaryP7_objectS0___ZL26PyvtkQuadraticEdge_ContourP7_objectS0___ZL35PyvtkQuadraticEdge_EvaluatePositionP7_objectS0___ZL35PyvtkQuadraticEdge_EvaluateLocationP7_objectS0___ZL30PyvtkQuadraticEdge_TriangulateP7_objectS0___ZL30PyvtkQuadraticEdge_DerivativesP7_objectS0___ZL38PyvtkQuadraticEdge_GetParametricCoordsP7_objectS0___ZL23PyvtkQuadraticEdge_ClipP7_objectS0___ZL36PyvtkQuadraticEdge_IntersectWithLineP7_objectS0___ZL38PyvtkQuadraticEdge_GetParametricCenterP7_objectS0___ZL41PyvtkQuadraticEdge_InterpolationFunctionsP7_objectS0___ZL38PyvtkQuadraticEdge_InterpolationDerivsP7_objectS0___ZL39PyvtkQuadraticEdge_InterpolateFunctionsP7_objectS0___ZL36PyvtkQuadraticEdge_InterpolateDerivsP7_objectS0___ZL34PyvtkQuadraticHexahedron_StaticNewv__ZL33PyvtkQuadraticHexahedron_IsTypeOfP7_objectS0___ZL28PyvtkQuadraticHexahedron_IsAP7_objectS0___ZL37PyvtkQuadraticHexahedron_SafeDownCastP7_objectS0___ZL36PyvtkQuadraticHexahedron_NewInstanceP7_objectS0___ZL36PyvtkQuadraticHexahedron_GetCellTypeP7_objectS0___ZL41PyvtkQuadraticHexahedron_GetCellDimensionP7_objectS0___ZL41PyvtkQuadraticHexahedron_GetNumberOfEdgesP7_objectS0___ZL41PyvtkQuadraticHexahedron_GetNumberOfFacesP7_objectS0___ZL32PyvtkQuadraticHexahedron_GetEdgeP7_objectS0___ZL32PyvtkQuadraticHexahedron_GetFaceP7_objectS0___ZL37PyvtkQuadraticHexahedron_CellBoundaryP7_objectS0___ZL32PyvtkQuadraticHexahedron_ContourP7_objectS0___ZL41PyvtkQuadraticHexahedron_EvaluatePositionP7_objectS0___ZL41PyvtkQuadraticHexahedron_EvaluateLocationP7_objectS0___ZL36PyvtkQuadraticHexahedron_TriangulateP7_objectS0___ZL36PyvtkQuadraticHexahedron_DerivativesP7_objectS0___ZL44PyvtkQuadraticHexahedron_GetParametricCoordsP7_objectS0___ZL29PyvtkQuadraticHexahedron_ClipP7_objectS0___ZL42PyvtkQuadraticHexahedron_IntersectWithLineP7_objectS0___ZL47PyvtkQuadraticHexahedron_InterpolationFunctionsP7_objectS0___ZL44PyvtkQuadraticHexahedron_InterpolationDerivsP7_objectS0___ZL45PyvtkQuadraticHexahedron_InterpolateFunctionsP7_objectS0___ZL42PyvtkQuadraticHexahedron_InterpolateDerivsP7_objectS0___ZL37PyvtkQuadraticHexahedron_GetEdgeArrayP7_objectS0___ZL37PyvtkQuadraticHexahedron_GetFaceArrayP7_objectS0___ZL34PyvtkQuadraticLinearQuad_StaticNewv__ZL33PyvtkQuadraticLinearQuad_IsTypeOfP7_objectS0___ZL28PyvtkQuadraticLinearQuad_IsAP7_objectS0___ZL37PyvtkQuadraticLinearQuad_SafeDownCastP7_objectS0___ZL36PyvtkQuadraticLinearQuad_NewInstanceP7_objectS0___ZL36PyvtkQuadraticLinearQuad_GetCellTypeP7_objectS0___ZL41PyvtkQuadraticLinearQuad_GetCellDimensionP7_objectS0___ZL41PyvtkQuadraticLinearQuad_GetNumberOfEdgesP7_objectS0___ZL41PyvtkQuadraticLinearQuad_GetNumberOfFacesP7_objectS0___ZL32PyvtkQuadraticLinearQuad_GetEdgeP7_objectS0___ZL32PyvtkQuadraticLinearQuad_GetFaceP7_objectS0___ZL37PyvtkQuadraticLinearQuad_CellBoundaryP7_objectS0___ZL32PyvtkQuadraticLinearQuad_ContourP7_objectS0___ZL41PyvtkQuadraticLinearQuad_EvaluatePositionP7_objectS0___ZL41PyvtkQuadraticLinearQuad_EvaluateLocationP7_objectS0___ZL36PyvtkQuadraticLinearQuad_TriangulateP7_objectS0___ZL36PyvtkQuadraticLinearQuad_DerivativesP7_objectS0___ZL44PyvtkQuadraticLinearQuad_GetParametricCoordsP7_objectS0___ZL29PyvtkQuadraticLinearQuad_ClipP7_objectS0___ZL42PyvtkQuadraticLinearQuad_IntersectWithLineP7_objectS0___ZL44PyvtkQuadraticLinearQuad_GetParametricCenterP7_objectS0___ZL47PyvtkQuadraticLinearQuad_InterpolationFunctionsP7_objectS0___ZL44PyvtkQuadraticLinearQuad_InterpolationDerivsP7_objectS0___ZL45PyvtkQuadraticLinearQuad_InterpolateFunctionsP7_objectS0___ZL42PyvtkQuadraticLinearQuad_InterpolateDerivsP7_objectS0___ZL37PyvtkQuadraticLinearQuad_GetEdgeArrayP7_objectS0___ZL35PyvtkQuadraticLinearWedge_StaticNewv__ZL34PyvtkQuadraticLinearWedge_IsTypeOfP7_objectS0___ZL29PyvtkQuadraticLinearWedge_IsAP7_objectS0___ZL38PyvtkQuadraticLinearWedge_SafeDownCastP7_objectS0___ZL37PyvtkQuadraticLinearWedge_NewInstanceP7_objectS0___ZL37PyvtkQuadraticLinearWedge_GetCellTypeP7_objectS0___ZL42PyvtkQuadraticLinearWedge_GetCellDimensionP7_objectS0___ZL42PyvtkQuadraticLinearWedge_GetNumberOfEdgesP7_objectS0___ZL42PyvtkQuadraticLinearWedge_GetNumberOfFacesP7_objectS0___ZL33PyvtkQuadraticLinearWedge_GetEdgeP7_objectS0___ZL33PyvtkQuadraticLinearWedge_GetFaceP7_objectS0___ZL38PyvtkQuadraticLinearWedge_CellBoundaryP7_objectS0___ZL33PyvtkQuadraticLinearWedge_ContourP7_objectS0___ZL42PyvtkQuadraticLinearWedge_EvaluatePositionP7_objectS0___ZL42PyvtkQuadraticLinearWedge_EvaluateLocationP7_objectS0___ZL37PyvtkQuadraticLinearWedge_TriangulateP7_objectS0___ZL37PyvtkQuadraticLinearWedge_DerivativesP7_objectS0___ZL45PyvtkQuadraticLinearWedge_GetParametricCoordsP7_objectS0___ZL30PyvtkQuadraticLinearWedge_ClipP7_objectS0___ZL43PyvtkQuadraticLinearWedge_IntersectWithLineP7_objectS0___ZL45PyvtkQuadraticLinearWedge_GetParametricCenterP7_objectS0___ZL48PyvtkQuadraticLinearWedge_InterpolationFunctionsP7_objectS0___ZL45PyvtkQuadraticLinearWedge_InterpolationDerivsP7_objectS0___ZL46PyvtkQuadraticLinearWedge_InterpolateFunctionsP7_objectS0___ZL43PyvtkQuadraticLinearWedge_InterpolateDerivsP7_objectS0___ZL38PyvtkQuadraticLinearWedge_GetEdgeArrayP7_objectS0___ZL38PyvtkQuadraticLinearWedge_GetFaceArrayP7_objectS0___ZL31PyvtkQuadraticPolygon_StaticNewv__ZL30PyvtkQuadraticPolygon_IsTypeOfP7_objectS0___ZL25PyvtkQuadraticPolygon_IsAP7_objectS0___ZL34PyvtkQuadraticPolygon_SafeDownCastP7_objectS0___ZL33PyvtkQuadraticPolygon_NewInstanceP7_objectS0___ZL33PyvtkQuadraticPolygon_GetCellTypeP7_objectS0___ZL38PyvtkQuadraticPolygon_GetCellDimensionP7_objectS0___ZL38PyvtkQuadraticPolygon_GetNumberOfEdgesP7_objectS0___ZL38PyvtkQuadraticPolygon_GetNumberOfFacesP7_objectS0___ZL29PyvtkQuadraticPolygon_GetEdgeP7_objectS0___ZL29PyvtkQuadraticPolygon_GetFaceP7_objectS0___ZL35PyvtkQuadraticPolygon_IsPrimaryCellP7_objectS0___ZL34PyvtkQuadraticPolygon_CellBoundaryP7_objectS0___ZL29PyvtkQuadraticPolygon_ContourP7_objectS0___ZL26PyvtkQuadraticPolygon_ClipP7_objectS0___ZL38PyvtkQuadraticPolygon_EvaluatePositionP7_objectS0___ZL38PyvtkQuadraticPolygon_EvaluateLocationP7_objectS0___ZL39PyvtkQuadraticPolygon_IntersectWithLineP7_objectS0___ZL42PyvtkQuadraticPolygon_InterpolateFunctionsP7_objectS0___ZL37PyvtkQuadraticPolygon_ComputeCentroidP7_objectS0___ZL41PyvtkQuadraticPolygon_ParameterizePolygonP7_objectS0___ZL36PyvtkQuadraticPolygon_PointInPolygonP7_objectS0___ZL33PyvtkQuadraticPolygon_TriangulateP7_objectS0___ZL46PyvtkQuadraticPolygon_NonDegenerateTriangulateP7_objectS0___ZL39PyvtkQuadraticPolygon_DistanceToPolygonP7_objectS0___ZL49PyvtkQuadraticPolygon_IntersectPolygonWithPolygonP7_objectS0___ZL44PyvtkQuadraticPolygon_IntersectConvex2DCellsP7_objectS0___ZL33PyvtkQuadraticPolygon_DerivativesP7_objectS0___ZL44PyvtkQuadraticPolygon_GetUseMVCInterpolationP7_objectS0___ZL44PyvtkQuadraticPolygon_SetUseMVCInterpolationP7_objectS0___ZL31PyvtkQuadraticPyramid_StaticNewv__ZL30PyvtkQuadraticPyramid_IsTypeOfP7_objectS0___ZL25PyvtkQuadraticPyramid_IsAP7_objectS0___ZL34PyvtkQuadraticPyramid_SafeDownCastP7_objectS0___ZL33PyvtkQuadraticPyramid_NewInstanceP7_objectS0___ZL33PyvtkQuadraticPyramid_GetCellTypeP7_objectS0___ZL38PyvtkQuadraticPyramid_GetCellDimensionP7_objectS0___ZL38PyvtkQuadraticPyramid_GetNumberOfEdgesP7_objectS0___ZL38PyvtkQuadraticPyramid_GetNumberOfFacesP7_objectS0___ZL29PyvtkQuadraticPyramid_GetEdgeP7_objectS0___ZL29PyvtkQuadraticPyramid_GetFaceP7_objectS0___ZL34PyvtkQuadraticPyramid_CellBoundaryP7_objectS0___ZL29PyvtkQuadraticPyramid_ContourP7_objectS0___ZL38PyvtkQuadraticPyramid_EvaluatePositionP7_objectS0___ZL38PyvtkQuadraticPyramid_EvaluateLocationP7_objectS0___ZL33PyvtkQuadraticPyramid_TriangulateP7_objectS0___ZL33PyvtkQuadraticPyramid_DerivativesP7_objectS0___ZL41PyvtkQuadraticPyramid_GetParametricCoordsP7_objectS0___ZL26PyvtkQuadraticPyramid_ClipP7_objectS0___ZL39PyvtkQuadraticPyramid_IntersectWithLineP7_objectS0___ZL41PyvtkQuadraticPyramid_GetParametricCenterP7_objectS0___ZL44PyvtkQuadraticPyramid_InterpolationFunctionsP7_objectS0___ZL41PyvtkQuadraticPyramid_InterpolationDerivsP7_objectS0___ZL42PyvtkQuadraticPyramid_InterpolateFunctionsP7_objectS0___ZL39PyvtkQuadraticPyramid_InterpolateDerivsP7_objectS0___ZL34PyvtkQuadraticPyramid_GetEdgeArrayP7_objectS0___ZL34PyvtkQuadraticPyramid_GetFaceArrayP7_objectS0___ZL28PyvtkQuadraticQuad_StaticNewv__ZL27PyvtkQuadraticQuad_IsTypeOfP7_objectS0___ZL22PyvtkQuadraticQuad_IsAP7_objectS0___ZL31PyvtkQuadraticQuad_SafeDownCastP7_objectS0___ZL30PyvtkQuadraticQuad_NewInstanceP7_objectS0___ZL30PyvtkQuadraticQuad_GetCellTypeP7_objectS0___ZL35PyvtkQuadraticQuad_GetCellDimensionP7_objectS0___ZL35PyvtkQuadraticQuad_GetNumberOfEdgesP7_objectS0___ZL35PyvtkQuadraticQuad_GetNumberOfFacesP7_objectS0___ZL26PyvtkQuadraticQuad_GetEdgeP7_objectS0___ZL26PyvtkQuadraticQuad_GetFaceP7_objectS0___ZL31PyvtkQuadraticQuad_CellBoundaryP7_objectS0___ZL26PyvtkQuadraticQuad_ContourP7_objectS0___ZL35PyvtkQuadraticQuad_EvaluatePositionP7_objectS0___ZL35PyvtkQuadraticQuad_EvaluateLocationP7_objectS0___ZL30PyvtkQuadraticQuad_TriangulateP7_objectS0___ZL30PyvtkQuadraticQuad_DerivativesP7_objectS0___ZL38PyvtkQuadraticQuad_GetParametricCoordsP7_objectS0___ZL23PyvtkQuadraticQuad_ClipP7_objectS0___ZL36PyvtkQuadraticQuad_IntersectWithLineP7_objectS0___ZL38PyvtkQuadraticQuad_GetParametricCenterP7_objectS0___ZL41PyvtkQuadraticQuad_InterpolationFunctionsP7_objectS0___ZL38PyvtkQuadraticQuad_InterpolationDerivsP7_objectS0___ZL39PyvtkQuadraticQuad_InterpolateFunctionsP7_objectS0___ZL36PyvtkQuadraticQuad_InterpolateDerivsP7_objectS0___ZL29PyvtkQuadraticTetra_StaticNewv__ZL28PyvtkQuadraticTetra_IsTypeOfP7_objectS0___ZL23PyvtkQuadraticTetra_IsAP7_objectS0___ZL32PyvtkQuadraticTetra_SafeDownCastP7_objectS0___ZL31PyvtkQuadraticTetra_NewInstanceP7_objectS0___ZL31PyvtkQuadraticTetra_GetCellTypeP7_objectS0___ZL36PyvtkQuadraticTetra_GetCellDimensionP7_objectS0___ZL36PyvtkQuadraticTetra_GetNumberOfEdgesP7_objectS0___ZL36PyvtkQuadraticTetra_GetNumberOfFacesP7_objectS0___ZL27PyvtkQuadraticTetra_GetEdgeP7_objectS0___ZL27PyvtkQuadraticTetra_GetFaceP7_objectS0___ZL32PyvtkQuadraticTetra_CellBoundaryP7_objectS0___ZL27PyvtkQuadraticTetra_ContourP7_objectS0___ZL36PyvtkQuadraticTetra_EvaluatePositionP7_objectS0___ZL36PyvtkQuadraticTetra_EvaluateLocationP7_objectS0___ZL31PyvtkQuadraticTetra_TriangulateP7_objectS0___ZL31PyvtkQuadraticTetra_DerivativesP7_objectS0___ZL39PyvtkQuadraticTetra_GetParametricCoordsP7_objectS0___ZL24PyvtkQuadraticTetra_ClipP7_objectS0___ZL37PyvtkQuadraticTetra_IntersectWithLineP7_objectS0___ZL39PyvtkQuadraticTetra_GetParametricCenterP7_objectS0___ZL41PyvtkQuadraticTetra_GetParametricDistanceP7_objectS0___ZL42PyvtkQuadraticTetra_InterpolationFunctionsP7_objectS0___ZL39PyvtkQuadraticTetra_InterpolationDerivsP7_objectS0___ZL40PyvtkQuadraticTetra_InterpolateFunctionsP7_objectS0___ZL37PyvtkQuadraticTetra_InterpolateDerivsP7_objectS0___ZL32PyvtkQuadraticTetra_GetEdgeArrayP7_objectS0___ZL32PyvtkQuadraticTetra_GetFaceArrayP7_objectS0___ZL32PyvtkQuadraticTriangle_StaticNewv__ZL31PyvtkQuadraticTriangle_IsTypeOfP7_objectS0___ZL26PyvtkQuadraticTriangle_IsAP7_objectS0___ZL35PyvtkQuadraticTriangle_SafeDownCastP7_objectS0___ZL34PyvtkQuadraticTriangle_NewInstanceP7_objectS0___ZL34PyvtkQuadraticTriangle_GetCellTypeP7_objectS0___ZL39PyvtkQuadraticTriangle_GetCellDimensionP7_objectS0___ZL39PyvtkQuadraticTriangle_GetNumberOfEdgesP7_objectS0___ZL39PyvtkQuadraticTriangle_GetNumberOfFacesP7_objectS0___ZL30PyvtkQuadraticTriangle_GetEdgeP7_objectS0___ZL30PyvtkQuadraticTriangle_GetFaceP7_objectS0___ZL35PyvtkQuadraticTriangle_CellBoundaryP7_objectS0___ZL30PyvtkQuadraticTriangle_ContourP7_objectS0___ZL39PyvtkQuadraticTriangle_EvaluatePositionP7_objectS0___ZL39PyvtkQuadraticTriangle_EvaluateLocationP7_objectS0___ZL34PyvtkQuadraticTriangle_TriangulateP7_objectS0___ZL34PyvtkQuadraticTriangle_DerivativesP7_objectS0___ZL42PyvtkQuadraticTriangle_GetParametricCoordsP7_objectS0___ZL27PyvtkQuadraticTriangle_ClipP7_objectS0___ZL40PyvtkQuadraticTriangle_IntersectWithLineP7_objectS0___ZL42PyvtkQuadraticTriangle_GetParametricCenterP7_objectS0___ZL44PyvtkQuadraticTriangle_GetParametricDistanceP7_objectS0___ZL45PyvtkQuadraticTriangle_InterpolationFunctionsP7_objectS0___ZL42PyvtkQuadraticTriangle_InterpolationDerivsP7_objectS0___ZL43PyvtkQuadraticTriangle_InterpolateFunctionsP7_objectS0___ZL40PyvtkQuadraticTriangle_InterpolateDerivsP7_objectS0___ZL29PyvtkQuadraticWedge_StaticNewv__ZL28PyvtkQuadraticWedge_IsTypeOfP7_objectS0___ZL23PyvtkQuadraticWedge_IsAP7_objectS0___ZL32PyvtkQuadraticWedge_SafeDownCastP7_objectS0___ZL31PyvtkQuadraticWedge_NewInstanceP7_objectS0___ZL31PyvtkQuadraticWedge_GetCellTypeP7_objectS0___ZL36PyvtkQuadraticWedge_GetCellDimensionP7_objectS0___ZL36PyvtkQuadraticWedge_GetNumberOfEdgesP7_objectS0___ZL36PyvtkQuadraticWedge_GetNumberOfFacesP7_objectS0___ZL27PyvtkQuadraticWedge_GetEdgeP7_objectS0___ZL27PyvtkQuadraticWedge_GetFaceP7_objectS0___ZL32PyvtkQuadraticWedge_CellBoundaryP7_objectS0___ZL27PyvtkQuadraticWedge_ContourP7_objectS0___ZL36PyvtkQuadraticWedge_EvaluatePositionP7_objectS0___ZL36PyvtkQuadraticWedge_EvaluateLocationP7_objectS0___ZL31PyvtkQuadraticWedge_TriangulateP7_objectS0___ZL31PyvtkQuadraticWedge_DerivativesP7_objectS0___ZL39PyvtkQuadraticWedge_GetParametricCoordsP7_objectS0___ZL24PyvtkQuadraticWedge_ClipP7_objectS0___ZL37PyvtkQuadraticWedge_IntersectWithLineP7_objectS0___ZL39PyvtkQuadraticWedge_GetParametricCenterP7_objectS0___ZL42PyvtkQuadraticWedge_InterpolationFunctionsP7_objectS0___ZL39PyvtkQuadraticWedge_InterpolationDerivsP7_objectS0___ZL40PyvtkQuadraticWedge_InterpolateFunctionsP7_objectS0___ZL37PyvtkQuadraticWedge_InterpolateDerivsP7_objectS0___ZL32PyvtkQuadraticWedge_GetEdgeArrayP7_objectS0___ZL32PyvtkQuadraticWedge_GetFaceArrayP7_objectS0___ZL41PyvtkQuadratureSchemeDefinition_StaticNewv__ZL40PyvtkQuadratureSchemeDefinition_IsTypeOfP7_objectS0___ZL35PyvtkQuadratureSchemeDefinition_IsAP7_objectS0___ZL44PyvtkQuadratureSchemeDefinition_SafeDownCastP7_objectS0___ZL43PyvtkQuadratureSchemeDefinition_NewInstanceP7_objectS0___ZL42PyvtkQuadratureSchemeDefinition_DICTIONARYP7_objectS0___ZL60PyvtkQuadratureSchemeDefinition_QUADRATURE_OFFSET_ARRAY_NAMEP7_objectS0___ZL40PyvtkQuadratureSchemeDefinition_DeepCopyP7_objectS0___ZL41PyvtkQuadratureSchemeDefinition_SaveStateP7_objectS0___ZL44PyvtkQuadratureSchemeDefinition_RestoreStateP7_objectS0___ZL37PyvtkQuadratureSchemeDefinition_ClearP7_objectS0___ZL42PyvtkQuadratureSchemeDefinition_InitializeP7_objectS0___ZL43PyvtkQuadratureSchemeDefinition_GetCellTypeP7_objectS0___ZL48PyvtkQuadratureSchemeDefinition_GetQuadratureKeyP7_objectS0___ZL48PyvtkQuadratureSchemeDefinition_GetNumberOfNodesP7_objectS0___ZL59PyvtkQuadratureSchemeDefinition_GetNumberOfQuadraturePointsP7_objectS0___ZL55PyvtkQuadratureSchemeDefinition_GetShapeFunctionWeightsP7_objectS0___ZL52PyvtkQuadratureSchemeDefinition_GetQuadratureWeightsP7_objectS0___ZL22PyvtkQuadric_StaticNewv__ZL21PyvtkQuadric_IsTypeOfP7_objectS0___ZL16PyvtkQuadric_IsAP7_objectS0___ZL25PyvtkQuadric_SafeDownCastP7_objectS0___ZL24PyvtkQuadric_NewInstanceP7_objectS0___ZL29PyvtkQuadric_EvaluateFunctionP7_objectS0___ZL29PyvtkQuadric_EvaluateGradientP7_objectS0___ZL28PyvtkQuadric_SetCoefficientsP7_objectS0___ZL28PyvtkQuadric_GetCoefficientsP7_objectS0___ZL30PyvtkRectilinearGrid_StaticNewv__ZL29PyvtkRectilinearGrid_IsTypeOfP7_objectS0___ZL24PyvtkRectilinearGrid_IsAP7_objectS0___ZL33PyvtkRectilinearGrid_SafeDownCastP7_objectS0___ZL32PyvtkRectilinearGrid_NewInstanceP7_objectS0___ZL38PyvtkRectilinearGrid_GetDataObjectTypeP7_objectS0___ZL34PyvtkRectilinearGrid_CopyStructureP7_objectS0___ZL31PyvtkRectilinearGrid_InitializeP7_objectS0___ZL37PyvtkRectilinearGrid_GetNumberOfCellsP7_objectS0___ZL38PyvtkRectilinearGrid_GetNumberOfPointsP7_objectS0___ZL29PyvtkRectilinearGrid_GetPointP7_objectS0___ZL28PyvtkRectilinearGrid_GetCellP7_objectS0___ZL34PyvtkRectilinearGrid_GetCellBoundsP7_objectS0___ZL30PyvtkRectilinearGrid_FindPointP7_objectS0___ZL29PyvtkRectilinearGrid_FindCellP7_objectS0___ZL35PyvtkRectilinearGrid_FindAndGetCellP7_objectS0___ZL32PyvtkRectilinearGrid_GetCellTypeP7_objectS0___ZL34PyvtkRectilinearGrid_GetCellPointsP7_objectS0___ZL34PyvtkRectilinearGrid_GetPointCellsP7_objectS0___ZL34PyvtkRectilinearGrid_ComputeBoundsP7_objectS0___ZL35PyvtkRectilinearGrid_GetMaxCellSizeP7_objectS0___ZL37PyvtkRectilinearGrid_GetCellNeighborsP7_objectS0___ZL30PyvtkRectilinearGrid_GetPointsP7_objectS0___ZL34PyvtkRectilinearGrid_SetDimensionsP7_objectS0___ZL34PyvtkRectilinearGrid_GetDimensionsP7_objectS0___ZL37PyvtkRectilinearGrid_GetDataDimensionP7_objectS0___ZL49PyvtkRectilinearGrid_ComputeStructuredCoordinatesP7_objectS0___ZL35PyvtkRectilinearGrid_ComputePointIdP7_objectS0___ZL34PyvtkRectilinearGrid_ComputeCellIdP7_objectS0___ZL36PyvtkRectilinearGrid_SetXCoordinatesP7_objectS0___ZL36PyvtkRectilinearGrid_GetXCoordinatesP7_objectS0___ZL36PyvtkRectilinearGrid_SetYCoordinatesP7_objectS0___ZL36PyvtkRectilinearGrid_GetYCoordinatesP7_objectS0___ZL36PyvtkRectilinearGrid_SetZCoordinatesP7_objectS0___ZL36PyvtkRectilinearGrid_GetZCoordinatesP7_objectS0___ZL30PyvtkRectilinearGrid_SetExtentP7_objectS0___ZL30PyvtkRectilinearGrid_GetExtentP7_objectS0___ZL40PyvtkRectilinearGrid_GetActualMemorySizeP7_objectS0___ZL32PyvtkRectilinearGrid_ShallowCopyP7_objectS0___ZL29PyvtkRectilinearGrid_DeepCopyP7_objectS0___ZL34PyvtkRectilinearGrid_GetExtentTypeP7_objectS0___ZL25PyvtkRectilinearGrid_CropP7_objectS0___ZL28PyvtkRectilinearGrid_GetDataP7_objectS0___ZL31PyvtkRectilinearGrid_GetData_s2P7_objectS0___ZL31PyvtkRectilinearGrid_GetData_s1P7_objectS0___ZL24PyvtkReebGraph_StaticNewv__ZL23PyvtkReebGraph_IsTypeOfP7_objectS0___ZL18PyvtkReebGraph_IsAP7_objectS0___ZL27PyvtkReebGraph_SafeDownCastP7_objectS0___ZL26PyvtkReebGraph_NewInstanceP7_objectS0___ZL32PyvtkReebGraph_GetDataObjectTypeP7_objectS0___ZL20PyvtkReebGraph_BuildP7_objectS0___ZL29PyvtkReebGraph_StreamTriangleP7_objectS0___ZL32PyvtkReebGraph_StreamTetrahedronP7_objectS0___ZL26PyvtkReebGraph_CloseStreamP7_objectS0___ZL23PyvtkReebGraph_DeepCopyP7_objectS0___ZL23PyvtkReebGraph_SimplifyP7_objectS0___ZL18PyvtkReebGraph_SetP7_objectS0___ZL23PyvtkReebGraph_Build_s1P7_objectS0___ZL23PyvtkReebGraph_Build_s2P7_objectS0___ZL23PyvtkReebGraph_Build_s3P7_objectS0___ZL23PyvtkReebGraph_Build_s4P7_objectS0___ZL23PyvtkReebGraph_Build_s5P7_objectS0___ZL23PyvtkReebGraph_Build_s6P7_objectS0___ZL44PyvtkReebGraphSimplificationMetric_StaticNewv__ZL43PyvtkReebGraphSimplificationMetric_IsTypeOfP7_objectS0___ZL38PyvtkReebGraphSimplificationMetric_IsAP7_objectS0___ZL47PyvtkReebGraphSimplificationMetric_SafeDownCastP7_objectS0___ZL46PyvtkReebGraphSimplificationMetric_NewInstanceP7_objectS0___ZL48PyvtkReebGraphSimplificationMetric_SetLowerBoundP7_objectS0___ZL48PyvtkReebGraphSimplificationMetric_GetLowerBoundP7_objectS0___ZL48PyvtkReebGraphSimplificationMetric_SetUpperBoundP7_objectS0___ZL48PyvtkReebGraphSimplificationMetric_GetUpperBoundP7_objectS0___ZL48PyvtkReebGraphSimplificationMetric_ComputeMetricP7_objectS0___ZL24PyvtkSelection_StaticNewv__ZL23PyvtkSelection_IsTypeOfP7_objectS0___ZL18PyvtkSelection_IsAP7_objectS0___ZL27PyvtkSelection_SafeDownCastP7_objectS0___ZL26PyvtkSelection_NewInstanceP7_objectS0___ZL25PyvtkSelection_InitializeP7_objectS0___ZL32PyvtkSelection_GetDataObjectTypeP7_objectS0___ZL31PyvtkSelection_GetNumberOfNodesP7_objectS0___ZL22PyvtkSelection_GetNodeP7_objectS0___ZL22PyvtkSelection_AddNodeP7_objectS0___ZL25PyvtkSelection_RemoveNodeP7_objectS0___ZL29PyvtkSelection_RemoveAllNodesP7_objectS0___ZL23PyvtkSelection_DeepCopyP7_objectS0___ZL26PyvtkSelection_ShallowCopyP7_objectS0___ZL20PyvtkSelection_UnionP7_objectS0___ZL23PyvtkSelection_SubtractP7_objectS0___ZL23PyvtkSelection_GetMTimeP7_objectS0___ZL19PyvtkSelection_DumpP7_objectS0___ZL22PyvtkSelection_GetDataP7_objectS0___ZL28PyvtkSelection_RemoveNode_s1P7_objectS0___ZL28PyvtkSelection_RemoveNode_s2P7_objectS0___ZL23PyvtkSelection_Union_s1P7_objectS0___ZL23PyvtkSelection_Union_s2P7_objectS0___ZL26PyvtkSelection_Subtract_s1P7_objectS0___ZL26PyvtkSelection_Subtract_s2P7_objectS0___ZL25PyvtkSelection_GetData_s2P7_objectS0___ZL25PyvtkSelection_GetData_s1P7_objectS0___ZL28PyvtkSelectionNode_StaticNewv__ZL27PyvtkSelectionNode_IsTypeOfP7_objectS0___ZL22PyvtkSelectionNode_IsAP7_objectS0___ZL31PyvtkSelectionNode_SafeDownCastP7_objectS0___ZL30PyvtkSelectionNode_NewInstanceP7_objectS0___ZL29PyvtkSelectionNode_InitializeP7_objectS0___ZL35PyvtkSelectionNode_SetSelectionListP7_objectS0___ZL35PyvtkSelectionNode_GetSelectionListP7_objectS0___ZL35PyvtkSelectionNode_SetSelectionDataP7_objectS0___ZL35PyvtkSelectionNode_GetSelectionDataP7_objectS0___ZL32PyvtkSelectionNode_GetPropertiesP7_objectS0___ZL27PyvtkSelectionNode_DeepCopyP7_objectS0___ZL30PyvtkSelectionNode_ShallowCopyP7_objectS0___ZL27PyvtkSelectionNode_GetMTimeP7_objectS0___ZL31PyvtkSelectionNode_CONTENT_TYPEP7_objectS0___ZL33PyvtkSelectionNode_SetContentTypeP7_objectS0___ZL33PyvtkSelectionNode_GetContentTypeP7_objectS0___ZL29PyvtkSelectionNode_FIELD_TYPEP7_objectS0___ZL31PyvtkSelectionNode_SetFieldTypeP7_objectS0___ZL31PyvtkSelectionNode_GetFieldTypeP7_objectS0___ZL55PyvtkSelectionNode_ConvertSelectionFieldToAttributeTypeP7_objectS0___ZL55PyvtkSelectionNode_ConvertAttributeTypeToSelectionFieldP7_objectS0___ZL33PyvtkSelectionNode_SetQueryStringP7_objectS0___ZL33PyvtkSelectionNode_GetQueryStringP7_objectS0___ZL26PyvtkSelectionNode_EPSILONP7_objectS0___ZL35PyvtkSelectionNode_CONTAINING_CELLSP7_objectS0___ZL35PyvtkSelectionNode_COMPONENT_NUMBERP7_objectS0___ZL26PyvtkSelectionNode_INVERSEP7_objectS0___ZL30PyvtkSelectionNode_PIXEL_COUNTP7_objectS0___ZL25PyvtkSelectionNode_SOURCEP7_objectS0___ZL28PyvtkSelectionNode_SOURCE_IDP7_objectS0___ZL23PyvtkSelectionNode_PROPP7_objectS0___ZL26PyvtkSelectionNode_PROP_IDP7_objectS0___ZL29PyvtkSelectionNode_PROCESS_IDP7_objectS0___ZL34PyvtkSelectionNode_COMPOSITE_INDEXP7_objectS0___ZL37PyvtkSelectionNode_HIERARCHICAL_LEVELP7_objectS0___ZL37PyvtkSelectionNode_HIERARCHICAL_INDEXP7_objectS0___ZL35PyvtkSelectionNode_INDEXED_VERTICESP7_objectS0___ZL37PyvtkSelectionNode_UnionSelectionListP7_objectS0___ZL40PyvtkSelectionNode_SubtractSelectionListP7_objectS0___ZL34PyvtkSelectionNode_EqualPropertiesP7_objectS0___ZL36PyvtkSimpleCellTessellator_StaticNewv__ZL35PyvtkSimpleCellTessellator_IsTypeOfP7_objectS0___ZL30PyvtkSimpleCellTessellator_IsAP7_objectS0___ZL39PyvtkSimpleCellTessellator_SafeDownCastP7_objectS0___ZL38PyvtkSimpleCellTessellator_NewInstanceP7_objectS0___ZL41PyvtkSimpleCellTessellator_GetGenericCellP7_objectS0___ZL41PyvtkSimpleCellTessellator_TessellateFaceP7_objectS0___ZL37PyvtkSimpleCellTessellator_TessellateP7_objectS0___ZL38PyvtkSimpleCellTessellator_TriangulateP7_objectS0___ZL32PyvtkSimpleCellTessellator_ResetP7_objectS0___ZL37PyvtkSimpleCellTessellator_InitializeP7_objectS0___ZL47PyvtkSimpleCellTessellator_GetFixedSubdivisionsP7_objectS0___ZL49PyvtkSimpleCellTessellator_GetMaxSubdivisionLevelP7_objectS0___ZL53PyvtkSimpleCellTessellator_GetMaxAdaptiveSubdivisionsP7_objectS0___ZL47PyvtkSimpleCellTessellator_SetFixedSubdivisionsP7_objectS0___ZL49PyvtkSimpleCellTessellator_SetMaxSubdivisionLevelP7_objectS0___ZL47PyvtkSimpleCellTessellator_SetSubdivisionLevelsP7_objectS0___ZL32PyvtkSmoothErrorMetric_StaticNewv__ZL31PyvtkSmoothErrorMetric_IsTypeOfP7_objectS0___ZL26PyvtkSmoothErrorMetric_IsAP7_objectS0___ZL35PyvtkSmoothErrorMetric_SafeDownCastP7_objectS0___ZL34PyvtkSmoothErrorMetric_NewInstanceP7_objectS0___ZL40PyvtkSmoothErrorMetric_GetAngleToleranceP7_objectS0___ZL40PyvtkSmoothErrorMetric_SetAngleToleranceP7_objectS0___ZL46PyvtkSmoothErrorMetric_RequiresEdgeSubdivisionP7_objectS0___ZL31PyvtkSmoothErrorMetric_GetErrorP7_objectS0___ZL28PyvtkSortFieldData_StaticNewv__ZL27PyvtkSortFieldData_IsTypeOfP7_objectS0___ZL22PyvtkSortFieldData_IsAP7_objectS0___ZL31PyvtkSortFieldData_SafeDownCastP7_objectS0___ZL30PyvtkSortFieldData_NewInstanceP7_objectS0___ZL23PyvtkSortFieldData_SortP7_objectS0___ZL21PyvtkSphere_StaticNewv__ZL20PyvtkSphere_IsTypeOfP7_objectS0___ZL15PyvtkSphere_IsAP7_objectS0___ZL24PyvtkSphere_SafeDownCastP7_objectS0___ZL23PyvtkSphere_NewInstanceP7_objectS0___ZL28PyvtkSphere_EvaluateFunctionP7_objectS0___ZL28PyvtkSphere_EvaluateGradientP7_objectS0___ZL21PyvtkSphere_SetRadiusP7_objectS0___ZL21PyvtkSphere_GetRadiusP7_objectS0___ZL21PyvtkSphere_SetCenterP7_objectS0___ZL21PyvtkSphere_GetCenterP7_objectS0___ZL33PyvtkSphere_ComputeBoundingSphereP7_objectS0___ZL20PyvtkSpline_IsTypeOfP7_objectS0___ZL15PyvtkSpline_IsAP7_objectS0___ZL24PyvtkSpline_SafeDownCastP7_objectS0___ZL23PyvtkSpline_NewInstanceP7_objectS0___ZL30PyvtkSpline_SetParametricRangeP7_objectS0___ZL30PyvtkSpline_GetParametricRangeP7_objectS0___ZL25PyvtkSpline_SetClampValueP7_objectS0___ZL25PyvtkSpline_GetClampValueP7_objectS0___ZL24PyvtkSpline_ClampValueOnP7_objectS0___ZL25PyvtkSpline_ClampValueOffP7_objectS0___ZL19PyvtkSpline_ComputeP7_objectS0___ZL20PyvtkSpline_EvaluateP7_objectS0___ZL29PyvtkSpline_GetNumberOfPointsP7_objectS0___ZL20PyvtkSpline_AddPointP7_objectS0___ZL23PyvtkSpline_RemovePointP7_objectS0___ZL27PyvtkSpline_RemoveAllPointsP7_objectS0___ZL21PyvtkSpline_SetClosedP7_objectS0___ZL21PyvtkSpline_GetClosedP7_objectS0___ZL20PyvtkSpline_ClosedOnP7_objectS0___ZL21PyvtkSpline_ClosedOffP7_objectS0___ZL29PyvtkSpline_SetLeftConstraintP7_objectS0___ZL37PyvtkSpline_GetLeftConstraintMinValueP7_objectS0___ZL37PyvtkSpline_GetLeftConstraintMaxValueP7_objectS0___ZL29PyvtkSpline_GetLeftConstraintP7_objectS0___ZL30PyvtkSpline_SetRightConstraintP7_objectS0___ZL38PyvtkSpline_GetRightConstraintMinValueP7_objectS0___ZL38PyvtkSpline_GetRightConstraintMaxValueP7_objectS0___ZL30PyvtkSpline_GetRightConstraintP7_objectS0___ZL24PyvtkSpline_SetLeftValueP7_objectS0___ZL24PyvtkSpline_GetLeftValueP7_objectS0___ZL25PyvtkSpline_SetRightValueP7_objectS0___ZL25PyvtkSpline_GetRightValueP7_objectS0___ZL20PyvtkSpline_GetMTimeP7_objectS0___ZL20PyvtkSpline_DeepCopyP7_objectS0___ZL30PyvtkStaticCellLinks_StaticNewv__ZL29PyvtkStaticCellLinks_IsTypeOfP7_objectS0___ZL24PyvtkStaticCellLinks_IsAP7_objectS0___ZL33PyvtkStaticCellLinks_SafeDownCastP7_objectS0___ZL32PyvtkStaticCellLinks_NewInstanceP7_objectS0___ZL31PyvtkStaticCellLinks_BuildLinksP7_objectS0___ZL37PyvtkStaticCellLinks_GetNumberOfCellsP7_objectS0___ZL30PyvtkStaticCellLinks_GetNcellsP7_objectS0___ZL29PyvtkStaticCellLinks_GetCellsP7_objectS0___ZL31PyvtkStaticCellLinks_InitializeP7_objectS0___GLOBAL__sub_I_vtkStaticCellLinksPython.cxx__GLOBAL__sub_I_vtkStaticCellLinksTemplatePython.cxx__ZL32PyvtkStaticCellLocator_StaticNewv__ZL31PyvtkStaticCellLocator_IsTypeOfP7_objectS0___ZL26PyvtkStaticCellLocator_IsAP7_objectS0___ZL35PyvtkStaticCellLocator_SafeDownCastP7_objectS0___ZL34PyvtkStaticCellLocator_NewInstanceP7_objectS0___ZL35PyvtkStaticCellLocator_SetDivisionsP7_objectS0___ZL35PyvtkStaticCellLocator_GetDivisionsP7_objectS0___ZL31PyvtkStaticCellLocator_FindCellP7_objectS0___ZL44PyvtkStaticCellLocator_FindCellsWithinBoundsP7_objectS0___ZL40PyvtkStaticCellLocator_IntersectWithLineP7_objectS0___ZL45PyvtkStaticCellLocator_GenerateRepresentationP7_objectS0___ZL42PyvtkStaticCellLocator_FreeSearchStructureP7_objectS0___ZL35PyvtkStaticCellLocator_BuildLocatorP7_objectS0___ZL44PyvtkStaticCellLocator_SetMaxNumberOfBucketsP7_objectS0___ZL52PyvtkStaticCellLocator_GetMaxNumberOfBucketsMinValueP7_objectS0___ZL52PyvtkStaticCellLocator_GetMaxNumberOfBucketsMaxValueP7_objectS0___ZL44PyvtkStaticCellLocator_GetMaxNumberOfBucketsP7_objectS0___ZL34PyvtkStaticCellLocator_GetLargeIdsP7_objectS0___ZL33PyvtkStaticPointLocator_StaticNewv__ZL32PyvtkStaticPointLocator_IsTypeOfP7_objectS0___ZL27PyvtkStaticPointLocator_IsAP7_objectS0___ZL36PyvtkStaticPointLocator_SafeDownCastP7_objectS0___ZL35PyvtkStaticPointLocator_NewInstanceP7_objectS0___ZL50PyvtkStaticPointLocator_SetNumberOfPointsPerBucketP7_objectS0___ZL58PyvtkStaticPointLocator_GetNumberOfPointsPerBucketMinValueP7_objectS0___ZL58PyvtkStaticPointLocator_GetNumberOfPointsPerBucketMaxValueP7_objectS0___ZL50PyvtkStaticPointLocator_GetNumberOfPointsPerBucketP7_objectS0___ZL36PyvtkStaticPointLocator_SetDivisionsP7_objectS0___ZL36PyvtkStaticPointLocator_GetDivisionsP7_objectS0___ZL40PyvtkStaticPointLocator_FindClosestPointP7_objectS0___ZL52PyvtkStaticPointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL42PyvtkStaticPointLocator_FindClosestNPointsP7_objectS0___ZL46PyvtkStaticPointLocator_FindPointsWithinRadiusP7_objectS0___ZL34PyvtkStaticPointLocator_InitializeP7_objectS0___ZL43PyvtkStaticPointLocator_FreeSearchStructureP7_objectS0___ZL36PyvtkStaticPointLocator_BuildLocatorP7_objectS0___ZL46PyvtkStaticPointLocator_GenerateRepresentationP7_objectS0___ZL49PyvtkStaticPointLocator_GetNumberOfPointsInBucketP7_objectS0___ZL36PyvtkStaticPointLocator_GetBucketIdsP7_objectS0___ZL45PyvtkStaticPointLocator_SetMaxNumberOfBucketsP7_objectS0___ZL53PyvtkStaticPointLocator_GetMaxNumberOfBucketsMinValueP7_objectS0___ZL53PyvtkStaticPointLocator_GetMaxNumberOfBucketsMaxValueP7_objectS0___ZL45PyvtkStaticPointLocator_GetMaxNumberOfBucketsP7_objectS0___ZL35PyvtkStaticPointLocator_GetLargeIdsP7_objectS0___ZL33PyvtkStaticPointLocator_GetBoundsP7_objectS0___ZL28PyvtkStructuredData_IsTypeOfP7_objectS0___ZL23PyvtkStructuredData_IsAP7_objectS0___ZL32PyvtkStructuredData_SafeDownCastP7_objectS0___ZL31PyvtkStructuredData_NewInstanceP7_objectS0___ZL33PyvtkStructuredData_SetDimensionsP7_objectS0___ZL29PyvtkStructuredData_SetExtentP7_objectS0___ZL38PyvtkStructuredData_GetDataDescriptionP7_objectS0___ZL48PyvtkStructuredData_GetDataDescriptionFromExtentP7_objectS0___ZL36PyvtkStructuredData_GetDataDimensionP7_objectS0___ZL37PyvtkStructuredData_GetNumberOfPointsP7_objectS0___ZL36PyvtkStructuredData_GetNumberOfCellsP7_objectS0___ZL48PyvtkStructuredData_GetCellExtentFromPointExtentP7_objectS0___ZL43PyvtkStructuredData_GetDimensionsFromExtentP7_objectS0___ZL47PyvtkStructuredData_GetCellDimensionsFromExtentP7_objectS0___ZL56PyvtkStructuredData_GetCellDimensionsFromPointDimensionsP7_objectS0___ZL49PyvtkStructuredData_GetLocalStructuredCoordinatesP7_objectS0___ZL50PyvtkStructuredData_GetGlobalStructuredCoordinatesP7_objectS0___ZL33PyvtkStructuredData_GetCellPointsP7_objectS0___ZL33PyvtkStructuredData_GetPointCellsP7_objectS0___ZL36PyvtkStructuredData_GetCellNeighborsP7_objectS0___ZL43PyvtkStructuredData_ComputePointIdForExtentP7_objectS0___ZL42PyvtkStructuredData_ComputeCellIdForExtentP7_objectS0___ZL34PyvtkStructuredData_ComputePointIdP7_objectS0___ZL33PyvtkStructuredData_ComputeCellIdP7_objectS0___ZL56PyvtkStructuredData_ComputeCellStructuredCoordsForExtentP7_objectS0___ZL47PyvtkStructuredData_ComputeCellStructuredCoordsP7_objectS0___ZL57PyvtkStructuredData_ComputePointStructuredCoordsForExtentP7_objectS0___ZL48PyvtkStructuredData_ComputePointStructuredCoordsP7_objectS0___ZL39PyvtkStructuredData_GetDataDimension_s1P7_objectS0___ZL39PyvtkStructuredData_GetDataDimension_s2P7_objectS0___ZL31PyvtkStructuredExtent_StaticNewv__ZL30PyvtkStructuredExtent_IsTypeOfP7_objectS0___ZL25PyvtkStructuredExtent_IsAP7_objectS0___ZL34PyvtkStructuredExtent_SafeDownCastP7_objectS0___ZL33PyvtkStructuredExtent_NewInstanceP7_objectS0___ZL27PyvtkStructuredExtent_ClampP7_objectS0___ZL37PyvtkStructuredExtent_StrictlySmallerP7_objectS0___ZL29PyvtkStructuredExtent_SmallerP7_objectS0___ZL26PyvtkStructuredExtent_GrowP7_objectS0___ZL31PyvtkStructuredExtent_TransformP7_objectS0___ZL35PyvtkStructuredExtent_GetDimensionsP7_objectS0___ZL29PyvtkStructuredGrid_StaticNewv__ZL28PyvtkStructuredGrid_IsTypeOfP7_objectS0___ZL23PyvtkStructuredGrid_IsAP7_objectS0___ZL32PyvtkStructuredGrid_SafeDownCastP7_objectS0___ZL31PyvtkStructuredGrid_NewInstanceP7_objectS0___ZL37PyvtkStructuredGrid_GetDataObjectTypeP7_objectS0___ZL33PyvtkStructuredGrid_CopyStructureP7_objectS0___ZL37PyvtkStructuredGrid_GetNumberOfPointsP7_objectS0___ZL28PyvtkStructuredGrid_GetPointP7_objectS0___ZL27PyvtkStructuredGrid_GetCellP7_objectS0___ZL33PyvtkStructuredGrid_GetCellBoundsP7_objectS0___ZL31PyvtkStructuredGrid_GetCellTypeP7_objectS0___ZL36PyvtkStructuredGrid_GetNumberOfCellsP7_objectS0___ZL33PyvtkStructuredGrid_GetCellPointsP7_objectS0___ZL33PyvtkStructuredGrid_GetPointCellsP7_objectS0___ZL30PyvtkStructuredGrid_InitializeP7_objectS0___ZL34PyvtkStructuredGrid_GetMaxCellSizeP7_objectS0___ZL36PyvtkStructuredGrid_GetCellNeighborsP7_objectS0___ZL33PyvtkStructuredGrid_SetDimensionsP7_objectS0___ZL33PyvtkStructuredGrid_GetDimensionsP7_objectS0___ZL36PyvtkStructuredGrid_GetDataDimensionP7_objectS0___ZL29PyvtkStructuredGrid_SetExtentP7_objectS0___ZL29PyvtkStructuredGrid_GetExtentP7_objectS0___ZL39PyvtkStructuredGrid_GetActualMemorySizeP7_objectS0___ZL31PyvtkStructuredGrid_ShallowCopyP7_objectS0___ZL28PyvtkStructuredGrid_DeepCopyP7_objectS0___ZL33PyvtkStructuredGrid_GetExtentTypeP7_objectS0___ZL30PyvtkStructuredGrid_BlankPointP7_objectS0___ZL32PyvtkStructuredGrid_UnBlankPointP7_objectS0___ZL29PyvtkStructuredGrid_BlankCellP7_objectS0___ZL31PyvtkStructuredGrid_UnBlankCellP7_objectS0___ZL34PyvtkStructuredGrid_IsPointVisibleP7_objectS0___ZL33PyvtkStructuredGrid_IsCellVisibleP7_objectS0___ZL37PyvtkStructuredGrid_HasAnyBlankPointsP7_objectS0___ZL36PyvtkStructuredGrid_HasAnyBlankCellsP7_objectS0___ZL31PyvtkStructuredGrid_GetCellDimsP7_objectS0___ZL24PyvtkStructuredGrid_CropP7_objectS0___ZL27PyvtkStructuredGrid_GetDataP7_objectS0___ZN17vtkStructuredGrid8IsTypeOfEPKc__ZL30PyvtkStructuredGrid_GetData_s2P7_objectS0___ZL30PyvtkStructuredGrid_GetData_s1P7_objectS0___ZL41PyvtkStructuredPointsCollection_StaticNewv__ZL40PyvtkStructuredPointsCollection_IsTypeOfP7_objectS0___ZL35PyvtkStructuredPointsCollection_IsAP7_objectS0___ZL44PyvtkStructuredPointsCollection_SafeDownCastP7_objectS0___ZL43PyvtkStructuredPointsCollection_NewInstanceP7_objectS0___ZL39PyvtkStructuredPointsCollection_AddItemP7_objectS0___ZL43PyvtkStructuredPointsCollection_GetNextItemP7_objectS0___ZL31PyvtkStructuredPoints_StaticNewv__ZL30PyvtkStructuredPoints_IsTypeOfP7_objectS0___ZL25PyvtkStructuredPoints_IsAP7_objectS0___ZL34PyvtkStructuredPoints_SafeDownCastP7_objectS0___ZL33PyvtkStructuredPoints_NewInstanceP7_objectS0___ZL39PyvtkStructuredPoints_GetDataObjectTypeP7_objectS0___ZN19vtkStructuredPoints8IsTypeOfEPKc__ZL27PyvtkSuperquadric_StaticNewv__ZL26PyvtkSuperquadric_IsTypeOfP7_objectS0___ZL21PyvtkSuperquadric_IsAP7_objectS0___ZL30PyvtkSuperquadric_SafeDownCastP7_objectS0___ZL29PyvtkSuperquadric_NewInstanceP7_objectS0___ZL34PyvtkSuperquadric_EvaluateFunctionP7_objectS0___ZL34PyvtkSuperquadric_EvaluateGradientP7_objectS0___ZL27PyvtkSuperquadric_SetCenterP7_objectS0___ZL27PyvtkSuperquadric_GetCenterP7_objectS0___ZL26PyvtkSuperquadric_SetScaleP7_objectS0___ZL26PyvtkSuperquadric_GetScaleP7_objectS0___ZL30PyvtkSuperquadric_GetThicknessP7_objectS0___ZL30PyvtkSuperquadric_SetThicknessP7_objectS0___ZL38PyvtkSuperquadric_GetThicknessMinValueP7_objectS0___ZL38PyvtkSuperquadric_GetThicknessMaxValueP7_objectS0___ZL33PyvtkSuperquadric_GetPhiRoundnessP7_objectS0___ZL33PyvtkSuperquadric_SetPhiRoundnessP7_objectS0___ZL35PyvtkSuperquadric_GetThetaRoundnessP7_objectS0___ZL35PyvtkSuperquadric_SetThetaRoundnessP7_objectS0___ZL25PyvtkSuperquadric_SetSizeP7_objectS0___ZL25PyvtkSuperquadric_GetSizeP7_objectS0___ZL28PyvtkSuperquadric_ToroidalOnP7_objectS0___ZL29PyvtkSuperquadric_ToroidalOffP7_objectS0___ZL29PyvtkSuperquadric_GetToroidalP7_objectS0___ZL29PyvtkSuperquadric_SetToroidalP7_objectS0___ZL20PyvtkTable_StaticNewv__ZL19PyvtkTable_IsTypeOfP7_objectS0___ZL14PyvtkTable_IsAP7_objectS0___ZL23PyvtkTable_SafeDownCastP7_objectS0___ZL22PyvtkTable_NewInstanceP7_objectS0___ZL15PyvtkTable_DumpP7_objectS0___ZL28PyvtkTable_GetDataObjectTypeP7_objectS0___ZL30PyvtkTable_GetActualMemorySizeP7_objectS0___ZL21PyvtkTable_GetRowDataP7_objectS0___ZL21PyvtkTable_SetRowDataP7_objectS0___ZL26PyvtkTable_GetNumberOfRowsP7_objectS0___ZL26PyvtkTable_SetNumberOfRowsP7_objectS0___ZL17PyvtkTable_GetRowP7_objectS0___ZL17PyvtkTable_SetRowP7_objectS0___ZL29PyvtkTable_InsertNextBlankRowP7_objectS0___ZL24PyvtkTable_InsertNextRowP7_objectS0___ZL20PyvtkTable_RemoveRowP7_objectS0___ZL29PyvtkTable_GetNumberOfColumnsP7_objectS0___ZL24PyvtkTable_GetColumnNameP7_objectS0___ZL26PyvtkTable_GetColumnByNameP7_objectS0___ZL20PyvtkTable_GetColumnP7_objectS0___ZL20PyvtkTable_AddColumnP7_objectS0___ZL29PyvtkTable_RemoveColumnByNameP7_objectS0___ZL23PyvtkTable_RemoveColumnP7_objectS0___ZL19PyvtkTable_GetValueP7_objectS0___ZL25PyvtkTable_GetValueByNameP7_objectS0___ZL19PyvtkTable_SetValueP7_objectS0___ZL25PyvtkTable_SetValueByNameP7_objectS0___ZL21PyvtkTable_InitializeP7_objectS0___ZL18PyvtkTable_GetDataP7_objectS0___ZL22PyvtkTable_ShallowCopyP7_objectS0___ZL19PyvtkTable_DeepCopyP7_objectS0___ZL35PyvtkTable_GetAttributesAsFieldDataP7_objectS0___ZL30PyvtkTable_GetNumberOfElementsP7_objectS0___ZL21PyvtkTable_GetData_s2P7_objectS0___ZL21PyvtkTable_GetData_s1P7_objectS0___ZL20PyvtkTetra_StaticNewv__ZL19PyvtkTetra_IsTypeOfP7_objectS0___ZL14PyvtkTetra_IsAP7_objectS0___ZL23PyvtkTetra_SafeDownCastP7_objectS0___ZL22PyvtkTetra_NewInstanceP7_objectS0___ZL24PyvtkTetra_GetEdgePointsP7_objectS0___ZL24PyvtkTetra_GetFacePointsP7_objectS0___ZL22PyvtkTetra_GetCellTypeP7_objectS0___ZL27PyvtkTetra_GetNumberOfEdgesP7_objectS0___ZL27PyvtkTetra_GetNumberOfFacesP7_objectS0___ZL18PyvtkTetra_GetEdgeP7_objectS0___ZL18PyvtkTetra_GetFaceP7_objectS0___ZL18PyvtkTetra_ContourP7_objectS0___ZL15PyvtkTetra_ClipP7_objectS0___ZL27PyvtkTetra_EvaluatePositionP7_objectS0___ZL27PyvtkTetra_EvaluateLocationP7_objectS0___ZL28PyvtkTetra_IntersectWithLineP7_objectS0___ZL22PyvtkTetra_TriangulateP7_objectS0___ZL22PyvtkTetra_DerivativesP7_objectS0___ZL30PyvtkTetra_GetParametricCoordsP7_objectS0___ZL23PyvtkTetra_CellBoundaryP7_objectS0___ZL30PyvtkTetra_GetParametricCenterP7_objectS0___ZL32PyvtkTetra_GetParametricDistanceP7_objectS0___ZL22PyvtkTetra_TetraCenterP7_objectS0___ZL23PyvtkTetra_CircumsphereP7_objectS0___ZL19PyvtkTetra_InsphereP7_objectS0___ZL28PyvtkTetra_BarycentricCoordsP7_objectS0___ZL24PyvtkTetra_ComputeVolumeP7_objectS0___ZL33PyvtkTetra_InterpolationFunctionsP7_objectS0___ZL30PyvtkTetra_InterpolationDerivsP7_objectS0___ZL31PyvtkTetra_InterpolateFunctionsP7_objectS0___ZL28PyvtkTetra_InterpolateDerivsP7_objectS0___ZL23PyvtkTetra_GetEdgeArrayP7_objectS0___ZL23PyvtkTetra_GetFaceArrayP7_objectS0___ZL30PyvtkTreeBFSIterator_StaticNewv__ZL29PyvtkTreeBFSIterator_IsTypeOfP7_objectS0___ZL24PyvtkTreeBFSIterator_IsAP7_objectS0___ZL33PyvtkTreeBFSIterator_SafeDownCastP7_objectS0___ZL32PyvtkTreeBFSIterator_NewInstanceP7_objectS0___ZL19PyvtkTree_StaticNewv__ZL18PyvtkTree_IsTypeOfP7_objectS0___ZL13PyvtkTree_IsAP7_objectS0___ZL22PyvtkTree_SafeDownCastP7_objectS0___ZL21PyvtkTree_NewInstanceP7_objectS0___ZL27PyvtkTree_GetDataObjectTypeP7_objectS0___ZL17PyvtkTree_GetRootP7_objectS0___ZL29PyvtkTree_GetNumberOfChildrenP7_objectS0___ZL18PyvtkTree_GetChildP7_objectS0___ZL21PyvtkTree_GetChildrenP7_objectS0___ZL19PyvtkTree_GetParentP7_objectS0___ZL23PyvtkTree_GetParentEdgeP7_objectS0___ZL18PyvtkTree_GetLevelP7_objectS0___ZL16PyvtkTree_IsLeafP7_objectS0___ZL17PyvtkTree_GetDataP7_objectS0___ZL25PyvtkTree_ReorderChildrenP7_objectS0___ZL20PyvtkTree_GetData_s2P7_objectS0___ZL20PyvtkTree_GetData_s1P7_objectS0___ZL30PyvtkTreeDFSIterator_StaticNewv__ZL29PyvtkTreeDFSIterator_IsTypeOfP7_objectS0___ZL24PyvtkTreeDFSIterator_IsAP7_objectS0___ZL33PyvtkTreeDFSIterator_SafeDownCastP7_objectS0___ZL32PyvtkTreeDFSIterator_NewInstanceP7_objectS0___ZL28PyvtkTreeDFSIterator_SetModeP7_objectS0___ZL28PyvtkTreeDFSIterator_GetModeP7_objectS0___ZL23PyvtkTriangle_StaticNewv__ZL22PyvtkTriangle_IsTypeOfP7_objectS0___ZL17PyvtkTriangle_IsAP7_objectS0___ZL26PyvtkTriangle_SafeDownCastP7_objectS0___ZL25PyvtkTriangle_NewInstanceP7_objectS0___ZL21PyvtkTriangle_GetEdgeP7_objectS0___ZL25PyvtkTriangle_GetCellTypeP7_objectS0___ZL30PyvtkTriangle_GetCellDimensionP7_objectS0___ZL30PyvtkTriangle_GetNumberOfEdgesP7_objectS0___ZL30PyvtkTriangle_GetNumberOfFacesP7_objectS0___ZL21PyvtkTriangle_GetFaceP7_objectS0___ZL26PyvtkTriangle_CellBoundaryP7_objectS0___ZL21PyvtkTriangle_ContourP7_objectS0___ZL30PyvtkTriangle_EvaluatePositionP7_objectS0___ZL30PyvtkTriangle_EvaluateLocationP7_objectS0___ZL25PyvtkTriangle_TriangulateP7_objectS0___ZL25PyvtkTriangle_DerivativesP7_objectS0___ZL33PyvtkTriangle_GetParametricCoordsP7_objectS0___ZL25PyvtkTriangle_ComputeAreaP7_objectS0___ZL18PyvtkTriangle_ClipP7_objectS0___ZL36PyvtkTriangle_InterpolationFunctionsP7_objectS0___ZL33PyvtkTriangle_InterpolationDerivsP7_objectS0___ZL34PyvtkTriangle_InterpolateFunctionsP7_objectS0___ZL31PyvtkTriangle_InterpolateDerivsP7_objectS0___ZL26PyvtkTriangle_GetEdgeArrayP7_objectS0___ZL31PyvtkTriangle_IntersectWithLineP7_objectS0___ZL33PyvtkTriangle_GetParametricCenterP7_objectS0___ZL35PyvtkTriangle_GetParametricDistanceP7_objectS0___ZL28PyvtkTriangle_TriangleCenterP7_objectS0___ZL26PyvtkTriangle_TriangleAreaP7_objectS0___ZL26PyvtkTriangle_CircumcircleP7_objectS0___ZL31PyvtkTriangle_BarycentricCoordsP7_objectS0___ZL25PyvtkTriangle_ProjectTo2DP7_objectS0___ZL27PyvtkTriangle_ComputeNormalP7_objectS0___ZL36PyvtkTriangle_ComputeNormalDirectionP7_objectS0___ZL32PyvtkTriangle_TrianglesIntersectP7_objectS0___ZL29PyvtkTriangle_PointInTriangleP7_objectS0___ZL28PyvtkTriangle_ComputeQuadricP7_objectS0___ZL30PyvtkTriangle_ComputeNormal_s1P7_objectS0___ZL30PyvtkTriangle_ComputeNormal_s2P7_objectS0___ZL31PyvtkTriangle_ComputeQuadric_s1P7_objectS0___ZL31PyvtkTriangle_ComputeQuadric_s2P7_objectS0___ZL28PyvtkTriangleStrip_StaticNewv__ZL27PyvtkTriangleStrip_IsTypeOfP7_objectS0___ZL22PyvtkTriangleStrip_IsAP7_objectS0___ZL31PyvtkTriangleStrip_SafeDownCastP7_objectS0___ZL30PyvtkTriangleStrip_NewInstanceP7_objectS0___ZL30PyvtkTriangleStrip_GetCellTypeP7_objectS0___ZL35PyvtkTriangleStrip_GetCellDimensionP7_objectS0___ZL35PyvtkTriangleStrip_GetNumberOfEdgesP7_objectS0___ZL35PyvtkTriangleStrip_GetNumberOfFacesP7_objectS0___ZL26PyvtkTriangleStrip_GetEdgeP7_objectS0___ZL26PyvtkTriangleStrip_GetFaceP7_objectS0___ZL31PyvtkTriangleStrip_CellBoundaryP7_objectS0___ZL26PyvtkTriangleStrip_ContourP7_objectS0___ZL23PyvtkTriangleStrip_ClipP7_objectS0___ZL35PyvtkTriangleStrip_EvaluatePositionP7_objectS0___ZL35PyvtkTriangleStrip_EvaluateLocationP7_objectS0___ZL36PyvtkTriangleStrip_IntersectWithLineP7_objectS0___ZL30PyvtkTriangleStrip_TriangulateP7_objectS0___ZL30PyvtkTriangleStrip_DerivativesP7_objectS0___ZL32PyvtkTriangleStrip_IsPrimaryCellP7_objectS0___ZL38PyvtkTriangleStrip_GetParametricCenterP7_objectS0___ZL33PyvtkTriangleStrip_DecomposeStripP7_objectS0___ZL37PyvtkTriQuadraticHexahedron_StaticNewv__ZL36PyvtkTriQuadraticHexahedron_IsTypeOfP7_objectS0___ZL31PyvtkTriQuadraticHexahedron_IsAP7_objectS0___ZL40PyvtkTriQuadraticHexahedron_SafeDownCastP7_objectS0___ZL39PyvtkTriQuadraticHexahedron_NewInstanceP7_objectS0___ZL39PyvtkTriQuadraticHexahedron_GetCellTypeP7_objectS0___ZL44PyvtkTriQuadraticHexahedron_GetCellDimensionP7_objectS0___ZL44PyvtkTriQuadraticHexahedron_GetNumberOfEdgesP7_objectS0___ZL44PyvtkTriQuadraticHexahedron_GetNumberOfFacesP7_objectS0___ZL35PyvtkTriQuadraticHexahedron_GetEdgeP7_objectS0___ZL35PyvtkTriQuadraticHexahedron_GetFaceP7_objectS0___ZL40PyvtkTriQuadraticHexahedron_CellBoundaryP7_objectS0___ZL35PyvtkTriQuadraticHexahedron_ContourP7_objectS0___ZL44PyvtkTriQuadraticHexahedron_EvaluatePositionP7_objectS0___ZL44PyvtkTriQuadraticHexahedron_EvaluateLocationP7_objectS0___ZL39PyvtkTriQuadraticHexahedron_TriangulateP7_objectS0___ZL39PyvtkTriQuadraticHexahedron_DerivativesP7_objectS0___ZL47PyvtkTriQuadraticHexahedron_GetParametricCoordsP7_objectS0___ZL32PyvtkTriQuadraticHexahedron_ClipP7_objectS0___ZL45PyvtkTriQuadraticHexahedron_IntersectWithLineP7_objectS0___ZL50PyvtkTriQuadraticHexahedron_InterpolationFunctionsP7_objectS0___ZL47PyvtkTriQuadraticHexahedron_InterpolationDerivsP7_objectS0___ZL48PyvtkTriQuadraticHexahedron_InterpolateFunctionsP7_objectS0___ZL45PyvtkTriQuadraticHexahedron_InterpolateDerivsP7_objectS0___ZL40PyvtkTriQuadraticHexahedron_GetEdgeArrayP7_objectS0___ZL40PyvtkTriQuadraticHexahedron_GetFaceArrayP7_objectS0___ZL30PyvtkUndirectedGraph_StaticNewv__ZL29PyvtkUndirectedGraph_IsTypeOfP7_objectS0___ZL24PyvtkUndirectedGraph_IsAP7_objectS0___ZL33PyvtkUndirectedGraph_SafeDownCastP7_objectS0___ZL32PyvtkUndirectedGraph_NewInstanceP7_objectS0___ZL38PyvtkUndirectedGraph_GetDataObjectTypeP7_objectS0___ZL32PyvtkUndirectedGraph_GetInDegreeP7_objectS0___ZL30PyvtkUndirectedGraph_GetInEdgeP7_objectS0___ZL28PyvtkUndirectedGraph_GetDataP7_objectS0___ZL31PyvtkUndirectedGraph_GetInEdgesP7_objectS0___ZL37PyvtkUndirectedGraph_IsStructureValidP7_objectS0___ZL31PyvtkUndirectedGraph_GetData_s2P7_objectS0___ZL31PyvtkUndirectedGraph_GetData_s1P7_objectS0___ZL26PyvtkUniformGrid_StaticNewv__ZL25PyvtkUniformGrid_IsTypeOfP7_objectS0___ZL20PyvtkUniformGrid_IsAP7_objectS0___ZL29PyvtkUniformGrid_SafeDownCastP7_objectS0___ZL28PyvtkUniformGrid_NewInstanceP7_objectS0___ZL30PyvtkUniformGrid_CopyStructureP7_objectS0___ZL34PyvtkUniformGrid_GetDataObjectTypeP7_objectS0___ZL24PyvtkUniformGrid_GetCellP7_objectS0___ZL25PyvtkUniformGrid_FindCellP7_objectS0___ZL31PyvtkUniformGrid_FindAndGetCellP7_objectS0___ZL28PyvtkUniformGrid_GetCellTypeP7_objectS0___ZL30PyvtkUniformGrid_GetCellPointsP7_objectS0___ZL30PyvtkUniformGrid_GetPointCellsP7_objectS0___ZL27PyvtkUniformGrid_InitializeP7_objectS0___ZL31PyvtkUniformGrid_GetMaxCellSizeP7_objectS0___ZL35PyvtkUniformGrid_GetGridDescriptionP7_objectS0___ZL27PyvtkUniformGrid_BlankPointP7_objectS0___ZL29PyvtkUniformGrid_UnBlankPointP7_objectS0___ZL26PyvtkUniformGrid_BlankCellP7_objectS0___ZL28PyvtkUniformGrid_UnBlankCellP7_objectS0___ZL33PyvtkUniformGrid_HasAnyBlankCellsP7_objectS0___ZL34PyvtkUniformGrid_HasAnyBlankPointsP7_objectS0___ZL31PyvtkUniformGrid_IsPointVisibleP7_objectS0___ZL30PyvtkUniformGrid_IsCellVisibleP7_objectS0___ZL33PyvtkUniformGrid_NewImageDataCopyP7_objectS0___ZL24PyvtkUniformGrid_GetDataP7_objectS0___ZN14vtkUniformGrid8IsTypeOfEPKc__ZL27PyvtkUniformGrid_GetData_s2P7_objectS0___ZL27PyvtkUniformGrid_GetData_s1P7_objectS0___ZL31PyvtkUnstructuredGrid_StaticNewv__ZL30PyvtkUnstructuredGrid_IsTypeOfP7_objectS0___ZL25PyvtkUnstructuredGrid_IsAP7_objectS0___ZL34PyvtkUnstructuredGrid_SafeDownCastP7_objectS0___ZL33PyvtkUnstructuredGrid_NewInstanceP7_objectS0___ZL39PyvtkUnstructuredGrid_GetDataObjectTypeP7_objectS0___ZL30PyvtkUnstructuredGrid_AllocateP7_objectS0___ZL36PyvtkUnstructuredGrid_InsertNextCellP7_objectS0___ZL27PyvtkUnstructuredGrid_ResetP7_objectS0___ZL35PyvtkUnstructuredGrid_CopyStructureP7_objectS0___ZL38PyvtkUnstructuredGrid_GetNumberOfCellsP7_objectS0___ZL29PyvtkUnstructuredGrid_GetCellP7_objectS0___ZL35PyvtkUnstructuredGrid_GetCellBoundsP7_objectS0___ZL35PyvtkUnstructuredGrid_GetCellPointsP7_objectS0___ZL35PyvtkUnstructuredGrid_GetPointCellsP7_objectS0___ZL37PyvtkUnstructuredGrid_NewCellIteratorP7_objectS0___ZL33PyvtkUnstructuredGrid_GetCellTypeP7_objectS0___ZL39PyvtkUnstructuredGrid_GetCellTypesArrayP7_objectS0___ZL43PyvtkUnstructuredGrid_GetCellLocationsArrayP7_objectS0___ZL29PyvtkUnstructuredGrid_SqueezeP7_objectS0___ZL32PyvtkUnstructuredGrid_InitializeP7_objectS0___ZL36PyvtkUnstructuredGrid_GetMaxCellSizeP7_objectS0___ZL32PyvtkUnstructuredGrid_BuildLinksP7_objectS0___ZL34PyvtkUnstructuredGrid_GetCellLinksP7_objectS0___ZL35PyvtkUnstructuredGrid_GetFaceStreamP7_objectS0___ZL30PyvtkUnstructuredGrid_SetCellsP7_objectS0___ZL30PyvtkUnstructuredGrid_GetCellsP7_objectS0___ZL33PyvtkUnstructuredGrid_ReplaceCellP7_objectS0___ZL42PyvtkUnstructuredGrid_InsertNextLinkedCellP7_objectS0___ZL43PyvtkUnstructuredGrid_RemoveReferenceToCellP7_objectS0___ZL40PyvtkUnstructuredGrid_AddReferenceToCellP7_objectS0___ZL36PyvtkUnstructuredGrid_ResizeCellListP7_objectS0___ZL38PyvtkUnstructuredGrid_GetCellNeighborsP7_objectS0___ZL30PyvtkUnstructuredGrid_GetPieceP7_objectS0___ZL39PyvtkUnstructuredGrid_GetNumberOfPiecesP7_objectS0___ZL35PyvtkUnstructuredGrid_GetGhostLevelP7_objectS0___ZL41PyvtkUnstructuredGrid_GetActualMemorySizeP7_objectS0___ZL33PyvtkUnstructuredGrid_ShallowCopyP7_objectS0___ZL30PyvtkUnstructuredGrid_DeepCopyP7_objectS0___ZL41PyvtkUnstructuredGrid_GetIdsOfCellsOfTypeP7_objectS0___ZL35PyvtkUnstructuredGrid_IsHomogeneousP7_objectS0___ZL38PyvtkUnstructuredGrid_RemoveGhostCellsP7_objectS0___ZL29PyvtkUnstructuredGrid_GetDataP7_objectS0___ZL30PyvtkUnstructuredGrid_GetFacesP7_objectS0___ZL38PyvtkUnstructuredGrid_GetFaceLocationsP7_objectS0___ZL51PyvtkUnstructuredGrid_InitializeFacesRepresentationP7_objectS0___ZL34PyvtkUnstructuredGrid_GetMeshMTimeP7_objectS0___ZL46PyvtkUnstructuredGrid_DecomposeAPolyhedronCellP7_objectS0___ZL47PyvtkUnstructuredGrid_ConvertFaceStreamPointIdsP7_objectS0___ZN23vtkUnstructuredGridBase8IsTypeOfEPKc__ZL33PyvtkUnstructuredGrid_SetCells_s1P7_objectS0___ZL33PyvtkUnstructuredGrid_SetCells_s2P7_objectS0___ZL32PyvtkUnstructuredGrid_GetData_s2P7_objectS0___ZL32PyvtkUnstructuredGrid_GetData_s1P7_objectS0___ZL49PyvtkUnstructuredGrid_DecomposeAPolyhedronCell_s1P7_objectS0___ZL49PyvtkUnstructuredGrid_DecomposeAPolyhedronCell_s2P7_objectS0___ZL49PyvtkUnstructuredGrid_DecomposeAPolyhedronCell_s3P7_objectS0___ZL34PyvtkUnstructuredGridBase_IsTypeOfP7_objectS0___ZL29PyvtkUnstructuredGridBase_IsAP7_objectS0___ZL38PyvtkUnstructuredGridBase_SafeDownCastP7_objectS0___ZL37PyvtkUnstructuredGridBase_NewInstanceP7_objectS0___ZL43PyvtkUnstructuredGridBase_GetDataObjectTypeP7_objectS0___ZL34PyvtkUnstructuredGridBase_AllocateP7_objectS0___ZL34PyvtkUnstructuredGridBase_DeepCopyP7_objectS0___ZL40PyvtkUnstructuredGridBase_InsertNextCellP7_objectS0___ZL37PyvtkUnstructuredGridBase_ReplaceCellP7_objectS0___ZL45PyvtkUnstructuredGridBase_GetIdsOfCellsOfTypeP7_objectS0___ZL39PyvtkUnstructuredGridBase_IsHomogeneousP7_objectS0___ZL33PyvtkUnstructuredGridBase_GetDataP7_objectS0___ZL36PyvtkUnstructuredGridBase_GetData_s2P7_objectS0___ZL36PyvtkUnstructuredGridBase_GetData_s1P7_objectS0___ZL43PyvtkUnstructuredGridCellIterator_StaticNewv__ZL42PyvtkUnstructuredGridCellIterator_IsTypeOfP7_objectS0___ZL37PyvtkUnstructuredGridCellIterator_IsAP7_objectS0___ZL46PyvtkUnstructuredGridCellIterator_SafeDownCastP7_objectS0___ZL45PyvtkUnstructuredGridCellIterator_NewInstanceP7_objectS0___ZL53PyvtkUnstructuredGridCellIterator_IsDoneWithTraversalP7_objectS0___ZL43PyvtkUnstructuredGridCellIterator_GetCellIdP7_objectS0___ZL21PyvtkVertex_StaticNewv__ZL20PyvtkVertex_IsTypeOfP7_objectS0___ZL15PyvtkVertex_IsAP7_objectS0___ZL24PyvtkVertex_SafeDownCastP7_objectS0___ZL23PyvtkVertex_NewInstanceP7_objectS0___ZL23PyvtkVertex_GetCellTypeP7_objectS0___ZL28PyvtkVertex_GetCellDimensionP7_objectS0___ZL28PyvtkVertex_GetNumberOfEdgesP7_objectS0___ZL28PyvtkVertex_GetNumberOfFacesP7_objectS0___ZL19PyvtkVertex_GetEdgeP7_objectS0___ZL19PyvtkVertex_GetFaceP7_objectS0___ZL16PyvtkVertex_ClipP7_objectS0___ZL28PyvtkVertex_EvaluatePositionP7_objectS0___ZL28PyvtkVertex_EvaluateLocationP7_objectS0___ZL31PyvtkVertex_GetParametricCoordsP7_objectS0___ZL24PyvtkVertex_CellBoundaryP7_objectS0___ZL19PyvtkVertex_ContourP7_objectS0___ZL31PyvtkVertex_GetParametricCenterP7_objectS0___ZL29PyvtkVertex_IntersectWithLineP7_objectS0___ZL23PyvtkVertex_TriangulateP7_objectS0___ZL23PyvtkVertex_DerivativesP7_objectS0___ZL34PyvtkVertex_InterpolationFunctionsP7_objectS0___ZL31PyvtkVertex_InterpolationDerivsP7_objectS0___ZL32PyvtkVertex_InterpolateFunctionsP7_objectS0___ZL29PyvtkVertex_InterpolateDerivsP7_objectS0___ZL33PyvtkVertexListIterator_StaticNewv__ZL32PyvtkVertexListIterator_IsTypeOfP7_objectS0___ZL27PyvtkVertexListIterator_IsAP7_objectS0___ZL36PyvtkVertexListIterator_SafeDownCastP7_objectS0___ZL35PyvtkVertexListIterator_NewInstanceP7_objectS0___ZL32PyvtkVertexListIterator_SetGraphP7_objectS0___ZL32PyvtkVertexListIterator_GetGraphP7_objectS0___ZL28PyvtkVertexListIterator_NextP7_objectS0___ZL31PyvtkVertexListIterator_HasNextP7_objectS0___ZL20PyvtkVoxel_StaticNewv__ZL19PyvtkVoxel_IsTypeOfP7_objectS0___ZL14PyvtkVoxel_IsAP7_objectS0___ZL23PyvtkVoxel_SafeDownCastP7_objectS0___ZL22PyvtkVoxel_NewInstanceP7_objectS0___ZL24PyvtkVoxel_GetEdgePointsP7_objectS0___ZL24PyvtkVoxel_GetFacePointsP7_objectS0___ZL30PyvtkVoxel_GetParametricCoordsP7_objectS0___ZL22PyvtkVoxel_GetCellTypeP7_objectS0___ZL27PyvtkVoxel_GetCellDimensionP7_objectS0___ZL27PyvtkVoxel_GetNumberOfEdgesP7_objectS0___ZL27PyvtkVoxel_GetNumberOfFacesP7_objectS0___ZL18PyvtkVoxel_GetEdgeP7_objectS0___ZL18PyvtkVoxel_GetFaceP7_objectS0___ZL23PyvtkVoxel_CellBoundaryP7_objectS0___ZL18PyvtkVoxel_ContourP7_objectS0___ZL27PyvtkVoxel_EvaluatePositionP7_objectS0___ZL27PyvtkVoxel_EvaluateLocationP7_objectS0___ZL28PyvtkVoxel_IntersectWithLineP7_objectS0___ZL22PyvtkVoxel_TriangulateP7_objectS0___ZL22PyvtkVoxel_DerivativesP7_objectS0___ZL30PyvtkVoxel_InterpolationDerivsP7_objectS0___ZL31PyvtkVoxel_InterpolateFunctionsP7_objectS0___ZL28PyvtkVoxel_InterpolateDerivsP7_objectS0___ZL33PyvtkVoxel_InterpolationFunctionsP7_objectS0___ZL23PyvtkVoxel_GetEdgeArrayP7_objectS0___ZL23PyvtkVoxel_GetFaceArrayP7_objectS0___ZL20PyvtkWedge_StaticNewv__ZL19PyvtkWedge_IsTypeOfP7_objectS0___ZL14PyvtkWedge_IsAP7_objectS0___ZL23PyvtkWedge_SafeDownCastP7_objectS0___ZL22PyvtkWedge_NewInstanceP7_objectS0___ZL24PyvtkWedge_GetEdgePointsP7_objectS0___ZL24PyvtkWedge_GetFacePointsP7_objectS0___ZL22PyvtkWedge_GetCellTypeP7_objectS0___ZL27PyvtkWedge_GetCellDimensionP7_objectS0___ZL27PyvtkWedge_GetNumberOfEdgesP7_objectS0___ZL27PyvtkWedge_GetNumberOfFacesP7_objectS0___ZL18PyvtkWedge_GetEdgeP7_objectS0___ZL18PyvtkWedge_GetFaceP7_objectS0___ZL23PyvtkWedge_CellBoundaryP7_objectS0___ZL18PyvtkWedge_ContourP7_objectS0___ZL27PyvtkWedge_EvaluatePositionP7_objectS0___ZL27PyvtkWedge_EvaluateLocationP7_objectS0___ZL28PyvtkWedge_IntersectWithLineP7_objectS0___ZL22PyvtkWedge_TriangulateP7_objectS0___ZL22PyvtkWedge_DerivativesP7_objectS0___ZL30PyvtkWedge_GetParametricCoordsP7_objectS0___ZL30PyvtkWedge_GetParametricCenterP7_objectS0___ZL33PyvtkWedge_InterpolationFunctionsP7_objectS0___ZL30PyvtkWedge_InterpolationDerivsP7_objectS0___ZL31PyvtkWedge_InterpolateFunctionsP7_objectS0___ZL28PyvtkWedge_InterpolateDerivsP7_objectS0___ZL23PyvtkWedge_GetEdgeArrayP7_objectS0___ZL23PyvtkWedge_GetFaceArrayP7_objectS0___ZL29PyvtkXMLDataElement_StaticNewv__ZL28PyvtkXMLDataElement_IsTypeOfP7_objectS0___ZL23PyvtkXMLDataElement_IsAP7_objectS0___ZL32PyvtkXMLDataElement_SafeDownCastP7_objectS0___ZL31PyvtkXMLDataElement_NewInstanceP7_objectS0___ZL27PyvtkXMLDataElement_GetNameP7_objectS0___ZL27PyvtkXMLDataElement_SetNameP7_objectS0___ZL25PyvtkXMLDataElement_GetIdP7_objectS0___ZL25PyvtkXMLDataElement_SetIdP7_objectS0___ZL32PyvtkXMLDataElement_GetAttributeP7_objectS0___ZL32PyvtkXMLDataElement_SetAttributeP7_objectS0___ZL36PyvtkXMLDataElement_SetCharacterDataP7_objectS0___ZL36PyvtkXMLDataElement_AddCharacterDataP7_objectS0___ZL36PyvtkXMLDataElement_GetCharacterDataP7_objectS0___ZL38PyvtkXMLDataElement_GetScalarAttributeP7_objectS0___ZL35PyvtkXMLDataElement_SetIntAttributeP7_objectS0___ZL37PyvtkXMLDataElement_SetFloatAttributeP7_objectS0___ZL38PyvtkXMLDataElement_SetDoubleAttributeP7_objectS0___ZL44PyvtkXMLDataElement_SetUnsignedLongAttributeP7_objectS0___ZL38PyvtkXMLDataElement_GetVectorAttributeP7_objectS0___ZL38PyvtkXMLDataElement_SetVectorAttributeP7_objectS0___ZL40PyvtkXMLDataElement_GetWordTypeAttributeP7_objectS0___ZL41PyvtkXMLDataElement_GetNumberOfAttributesP7_objectS0___ZL36PyvtkXMLDataElement_GetAttributeNameP7_objectS0___ZL37PyvtkXMLDataElement_GetAttributeValueP7_objectS0___ZL35PyvtkXMLDataElement_RemoveAttributeP7_objectS0___ZL39PyvtkXMLDataElement_RemoveAllAttributesP7_objectS0___ZL29PyvtkXMLDataElement_GetParentP7_objectS0___ZL29PyvtkXMLDataElement_SetParentP7_objectS0___ZL27PyvtkXMLDataElement_GetRootP7_objectS0___ZL45PyvtkXMLDataElement_GetNumberOfNestedElementsP7_objectS0___ZL36PyvtkXMLDataElement_GetNestedElementP7_objectS0___ZL36PyvtkXMLDataElement_AddNestedElementP7_objectS0___ZL39PyvtkXMLDataElement_RemoveNestedElementP7_objectS0___ZL43PyvtkXMLDataElement_RemoveAllNestedElementsP7_objectS0___ZL37PyvtkXMLDataElement_FindNestedElementP7_objectS0___ZL45PyvtkXMLDataElement_FindNestedElementWithNameP7_objectS0___ZL50PyvtkXMLDataElement_FindNestedElementWithNameAndIdP7_objectS0___ZL57PyvtkXMLDataElement_FindNestedElementWithNameAndAttributeP7_objectS0___ZL41PyvtkXMLDataElement_LookupElementWithNameP7_objectS0___ZL33PyvtkXMLDataElement_LookupElementP7_objectS0___ZL35PyvtkXMLDataElement_GetXMLByteIndexP7_objectS0___ZL35PyvtkXMLDataElement_SetXMLByteIndexP7_objectS0___ZL29PyvtkXMLDataElement_IsEqualToP7_objectS0___ZL28PyvtkXMLDataElement_DeepCopyP7_objectS0___ZL40PyvtkXMLDataElement_SetAttributeEncodingP7_objectS0___ZL48PyvtkXMLDataElement_GetAttributeEncodingMinValueP7_objectS0___ZL48PyvtkXMLDataElement_GetAttributeEncodingMaxValueP7_objectS0___ZL40PyvtkXMLDataElement_GetAttributeEncodingP7_objectS0___ZL28PyvtkXMLDataElement_PrintXMLP7_objectS0___ZL41PyvtkXMLDataElement_GetCharacterDataWidthP7_objectS0___ZL41PyvtkXMLDataElement_SetCharacterDataWidthP7_objectS0___ZL41PyvtkXMLDataElement_GetScalarAttribute_s1P7_objectS0___ZL41PyvtkXMLDataElement_GetScalarAttribute_s2P7_objectS0___ZL41PyvtkXMLDataElement_GetScalarAttribute_s3P7_objectS0___ZL41PyvtkXMLDataElement_GetScalarAttribute_s4P7_objectS0___ZL41PyvtkXMLDataElement_GetVectorAttribute_s1P7_objectS0___ZL41PyvtkXMLDataElement_GetVectorAttribute_s2P7_objectS0___ZL41PyvtkXMLDataElement_GetVectorAttribute_s3P7_objectS0___ZL41PyvtkXMLDataElement_GetVectorAttribute_s4P7_objectS0___ZL41PyvtkXMLDataElement_SetVectorAttribute_s1P7_objectS0___ZL41PyvtkXMLDataElement_SetVectorAttribute_s2P7_objectS0___ZL41PyvtkXMLDataElement_SetVectorAttribute_s3P7_objectS0___ZL41PyvtkXMLDataElement_SetVectorAttribute_s4P7_objectS0___ZL26PyvtkTreeIterator_IsTypeOfP7_objectS0___ZL21PyvtkTreeIterator_IsAP7_objectS0___ZL30PyvtkTreeIterator_SafeDownCastP7_objectS0___ZL29PyvtkTreeIterator_NewInstanceP7_objectS0___ZL25PyvtkTreeIterator_SetTreeP7_objectS0___ZL25PyvtkTreeIterator_GetTreeP7_objectS0___ZL32PyvtkTreeIterator_SetStartVertexP7_objectS0___ZL32PyvtkTreeIterator_GetStartVertexP7_objectS0___ZL22PyvtkTreeIterator_NextP7_objectS0___ZL25PyvtkTreeIterator_HasNextP7_objectS0___ZL25PyvtkTreeIterator_RestartP7_objectS0___ZL22PyvtkBoundingBox_CCopyPKv__ZL23PyvtkBoundingBox_DeleteP7_object__ZL21PyvtkBoundingBox_HashP7_object__ZL28PyvtkBoundingBox_RichCompareP7_objectS0_i__ZL20PyvtkBoundingBox_NewP11_typeobjectP7_objectS2___ZL26PyvtkBoundingBox_SetBoundsP7_objectS0___ZL28PyvtkBoundingBox_SetMinPointP7_objectS0___ZL28PyvtkBoundingBox_SetMaxPointP7_objectS0___ZL24PyvtkBoundingBox_IsValidP7_objectS0___ZL25PyvtkBoundingBox_AddPointP7_objectS0___ZL23PyvtkBoundingBox_AddBoxP7_objectS0___ZL26PyvtkBoundingBox_AddBoundsP7_objectS0___ZL29PyvtkBoundingBox_IntersectBoxP7_objectS0___ZL27PyvtkBoundingBox_IntersectsP7_objectS0___ZL31PyvtkBoundingBox_IntersectPlaneP7_objectS0___ZL25PyvtkBoundingBox_ContainsP7_objectS0___ZL26PyvtkBoundingBox_GetBoundsP7_objectS0___ZL25PyvtkBoundingBox_GetBoundP7_objectS0___ZL28PyvtkBoundingBox_GetMinPointP7_objectS0___ZL28PyvtkBoundingBox_GetMaxPointP7_objectS0___ZL30PyvtkBoundingBox_ContainsPointP7_objectS0___ZL26PyvtkBoundingBox_GetCenterP7_objectS0___ZL27PyvtkBoundingBox_GetLengthsP7_objectS0___ZL26PyvtkBoundingBox_GetLengthP7_objectS0___ZL29PyvtkBoundingBox_GetMaxLengthP7_objectS0___ZL34PyvtkBoundingBox_GetDiagonalLengthP7_objectS0___ZL24PyvtkBoundingBox_InflateP7_objectS0___ZL22PyvtkBoundingBox_ScaleP7_objectS0___ZL33PyvtkBoundingBox_ComputeDivisionsP7_objectS0___ZL22PyvtkBoundingBox_ResetP7_objectS0___ZL34PyvtkBoundingBox_vtkBoundingBox_s2P7_objectS0___ZL34PyvtkBoundingBox_vtkBoundingBox_s4P7_objectS0___ZL15PyvtkAtom_CCopyPKv__ZL16PyvtkAtom_DeleteP7_object__ZL14PyvtkAtom_HashP7_object__ZL13PyvtkAtom_NewP11_typeobjectP7_objectS2___ZL17PyvtkAtom_vtkAtomP7_objectS0___ZL15PyvtkAtom_GetIdP7_objectS0___ZL21PyvtkAtom_GetMoleculeP7_objectS0___ZL25PyvtkAtom_GetAtomicNumberP7_objectS0___ZL25PyvtkAtom_SetAtomicNumberP7_objectS0___ZL21PyvtkAtom_GetPositionP7_objectS0___ZL21PyvtkAtom_SetPositionP7_objectS0___ZL24PyvtkAtom_SetPosition_s1P7_objectS0___ZL24PyvtkAtom_SetPosition_s3P7_objectS0___ZL15PyvtkBond_CCopyPKv__ZL16PyvtkBond_DeleteP7_object__ZL14PyvtkBond_HashP7_object__ZL13PyvtkBond_NewP11_typeobjectP7_objectS2___ZL17PyvtkBond_vtkBondP7_objectS0___ZL15PyvtkBond_GetIdP7_objectS0___ZL21PyvtkBond_GetMoleculeP7_objectS0___ZL24PyvtkBond_GetBeginAtomIdP7_objectS0___ZL22PyvtkBond_GetEndAtomIdP7_objectS0___ZL22PyvtkBond_GetBeginAtomP7_objectS0___ZL20PyvtkBond_GetEndAtomP7_objectS0___ZL18PyvtkBond_GetOrderP7_objectS0___ZL19PyvtkBond_GetLengthP7_objectS0___ZL23PyvtkMolecule_StaticNewv__ZL22PyvtkMolecule_IsTypeOfP7_objectS0___ZL17PyvtkMolecule_IsAP7_objectS0___ZL26PyvtkMolecule_SafeDownCastP7_objectS0___ZL25PyvtkMolecule_NewInstanceP7_objectS0___ZL24PyvtkMolecule_InitializeP7_objectS0___ZL31PyvtkMolecule_GetDataObjectTypeP7_objectS0___ZL24PyvtkMolecule_AppendAtomP7_objectS0___ZL21PyvtkMolecule_GetAtomP7_objectS0___ZL30PyvtkMolecule_GetNumberOfAtomsP7_objectS0___ZL24PyvtkMolecule_AppendBondP7_objectS0___ZL21PyvtkMolecule_GetBondP7_objectS0___ZL30PyvtkMolecule_GetNumberOfBondsP7_objectS0___ZL33PyvtkMolecule_GetAtomAtomicNumberP7_objectS0___ZL33PyvtkMolecule_SetAtomAtomicNumberP7_objectS0___ZL29PyvtkMolecule_SetAtomPositionP7_objectS0___ZL29PyvtkMolecule_GetAtomPositionP7_objectS0___ZL26PyvtkMolecule_SetBondOrderP7_objectS0___ZL26PyvtkMolecule_GetBondOrderP7_objectS0___ZL27PyvtkMolecule_GetBondLengthP7_objectS0___ZL36PyvtkMolecule_GetAtomicPositionArrayP7_objectS0___ZL34PyvtkMolecule_GetAtomicNumberArrayP7_objectS0___ZL31PyvtkMolecule_GetElectronicDataP7_objectS0___ZL31PyvtkMolecule_SetElectronicDataP7_objectS0___ZL32PyvtkMolecule_CheckedShallowCopyP7_objectS0___ZL29PyvtkMolecule_CheckedDeepCopyP7_objectS0___ZL25PyvtkMolecule_ShallowCopyP7_objectS0___ZL22PyvtkMolecule_DeepCopyP7_objectS0___ZL34PyvtkMolecule_ShallowCopyStructureP7_objectS0___ZL31PyvtkMolecule_DeepCopyStructureP7_objectS0___ZL35PyvtkMolecule_ShallowCopyAttributesP7_objectS0___ZL32PyvtkMolecule_DeepCopyAttributesP7_objectS0___ZL30PyvtkMolecule_GetPlaneFromBondP7_objectS0___ZL24PyvtkMolecule_HasLatticeP7_objectS0___ZL26PyvtkMolecule_ClearLatticeP7_objectS0___ZL24PyvtkMolecule_SetLatticeP7_objectS0___ZL24PyvtkMolecule_GetLatticeP7_objectS0___ZL30PyvtkMolecule_GetLatticeOriginP7_objectS0___ZL30PyvtkMolecule_SetLatticeOriginP7_objectS0___ZN11vtkMolecule8IsTypeOfEPKc__ZL27PyvtkMolecule_AppendBond_s1P7_objectS0___ZL27PyvtkMolecule_AppendBond_s2P7_objectS0___ZL36PyvtkAbstractElectronicData_IsTypeOfP7_objectS0___ZL31PyvtkAbstractElectronicData_IsAP7_objectS0___ZL40PyvtkAbstractElectronicData_SafeDownCastP7_objectS0___ZL39PyvtkAbstractElectronicData_NewInstanceP7_objectS0___ZL42PyvtkAbstractElectronicData_GetNumberOfMOsP7_objectS0___ZL48PyvtkAbstractElectronicData_GetNumberOfElectronsP7_objectS0___ZL33PyvtkAbstractElectronicData_GetMOP7_objectS0___ZL46PyvtkAbstractElectronicData_GetElectronDensityP7_objectS0___ZL35PyvtkAbstractElectronicData_GetHOMOP7_objectS0___ZL35PyvtkAbstractElectronicData_GetLUMOP7_objectS0___ZL48PyvtkAbstractElectronicData_GetHOMOOrbitalNumberP7_objectS0___ZL48PyvtkAbstractElectronicData_GetLUMOOrbitalNumberP7_objectS0___ZL34PyvtkAbstractElectronicData_IsHOMOP7_objectS0___ZL34PyvtkAbstractElectronicData_IsLUMOP7_objectS0___ZL36PyvtkAbstractElectronicData_DeepCopyP7_objectS0___ZL38PyvtkAbstractElectronicData_GetPaddingP7_objectS0___ZL25PyvtkVector_IdLi4EE_CCopyPKv__ZL25PyvtkVector_IfLi4EE_CCopyPKv__ZL25PyvtkVector_IiLi4EE_CCopyPKv__ZL25PyvtkVector_IdLi2EE_CCopyPKv__ZL25PyvtkVector_IfLi2EE_CCopyPKv__ZL25PyvtkVector_IiLi2EE_CCopyPKv__ZL25PyvtkVector_IdLi3EE_CCopyPKv__ZL25PyvtkVector_IfLi3EE_CCopyPKv__ZL25PyvtkVector_IiLi3EE_CCopyPKv__ZL22PyvtkVector2_IdE_CCopyPKv__ZL22PyvtkVector2_IfE_CCopyPKv__ZL22PyvtkVector2_IiE_CCopyPKv__ZL22PyvtkVector3_IdE_CCopyPKv__ZL22PyvtkVector3_IfE_CCopyPKv__ZL22PyvtkVector3_IiE_CCopyPKv__ZL19PyvtkVector2i_CCopyPKv__ZL19PyvtkVector2f_CCopyPKv__ZL19PyvtkVector2d_CCopyPKv__ZL19PyvtkVector3i_CCopyPKv__ZL19PyvtkVector3f_CCopyPKv__ZL19PyvtkVector3d_CCopyPKv__ZL26PyvtkVector_IdLi4EE_DeleteP7_object__ZL24PyvtkVector_IdLi4EE_HashP7_object__ZL23PyvtkVector_IdLi4EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IdLi4EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IdLi4EE_NormP7_objectS0___ZL29PyvtkVector_IdLi4EE_NormalizeP7_objectS0___ZL30PyvtkVector_IdLi4EE_NormalizedP7_objectS0___ZL23PyvtkVector_IdLi4EE_DotP7_objectS0___ZL32PyvtkVector_IdLi4EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IdLi4EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IdLi4EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IfLi4EE_DeleteP7_object__ZL24PyvtkVector_IfLi4EE_HashP7_object__ZL23PyvtkVector_IfLi4EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IfLi4EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IfLi4EE_NormP7_objectS0___ZL29PyvtkVector_IfLi4EE_NormalizeP7_objectS0___ZL30PyvtkVector_IfLi4EE_NormalizedP7_objectS0___ZL23PyvtkVector_IfLi4EE_DotP7_objectS0___ZL32PyvtkVector_IfLi4EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IfLi4EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IfLi4EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IiLi4EE_DeleteP7_object__ZL24PyvtkVector_IiLi4EE_HashP7_object__ZL23PyvtkVector_IiLi4EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IiLi4EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IiLi4EE_NormP7_objectS0___ZL29PyvtkVector_IiLi4EE_NormalizeP7_objectS0___ZL30PyvtkVector_IiLi4EE_NormalizedP7_objectS0___ZL23PyvtkVector_IiLi4EE_DotP7_objectS0___ZL32PyvtkVector_IiLi4EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IiLi4EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IiLi4EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IdLi2EE_DeleteP7_object__ZL24PyvtkVector_IdLi2EE_HashP7_object__ZL23PyvtkVector_IdLi2EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IdLi2EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IdLi2EE_NormP7_objectS0___ZL29PyvtkVector_IdLi2EE_NormalizeP7_objectS0___ZL30PyvtkVector_IdLi2EE_NormalizedP7_objectS0___ZL23PyvtkVector_IdLi2EE_DotP7_objectS0___ZL32PyvtkVector_IdLi2EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IdLi2EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IdLi2EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IfLi2EE_DeleteP7_object__ZL24PyvtkVector_IfLi2EE_HashP7_object__ZL23PyvtkVector_IfLi2EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IfLi2EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IfLi2EE_NormP7_objectS0___ZL29PyvtkVector_IfLi2EE_NormalizeP7_objectS0___ZL30PyvtkVector_IfLi2EE_NormalizedP7_objectS0___ZL23PyvtkVector_IfLi2EE_DotP7_objectS0___ZL32PyvtkVector_IfLi2EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IfLi2EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IfLi2EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IiLi2EE_DeleteP7_object__ZL24PyvtkVector_IiLi2EE_HashP7_object__ZL23PyvtkVector_IiLi2EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IiLi2EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IiLi2EE_NormP7_objectS0___ZL29PyvtkVector_IiLi2EE_NormalizeP7_objectS0___ZL30PyvtkVector_IiLi2EE_NormalizedP7_objectS0___ZL23PyvtkVector_IiLi2EE_DotP7_objectS0___ZL32PyvtkVector_IiLi2EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IiLi2EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IiLi2EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IdLi3EE_DeleteP7_object__ZL24PyvtkVector_IdLi3EE_HashP7_object__ZL23PyvtkVector_IdLi3EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IdLi3EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IdLi3EE_NormP7_objectS0___ZL29PyvtkVector_IdLi3EE_NormalizeP7_objectS0___ZL30PyvtkVector_IdLi3EE_NormalizedP7_objectS0___ZL23PyvtkVector_IdLi3EE_DotP7_objectS0___ZL32PyvtkVector_IdLi3EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IdLi3EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IdLi3EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IfLi3EE_DeleteP7_object__ZL24PyvtkVector_IfLi3EE_HashP7_object__ZL23PyvtkVector_IfLi3EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IfLi3EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IfLi3EE_NormP7_objectS0___ZL29PyvtkVector_IfLi3EE_NormalizeP7_objectS0___ZL30PyvtkVector_IfLi3EE_NormalizedP7_objectS0___ZL23PyvtkVector_IfLi3EE_DotP7_objectS0___ZL32PyvtkVector_IfLi3EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IfLi3EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IfLi3EE_vtkVector_s4P7_objectS0___ZL26PyvtkVector_IiLi3EE_DeleteP7_object__ZL24PyvtkVector_IiLi3EE_HashP7_object__ZL23PyvtkVector_IiLi3EE_NewP11_typeobjectP7_objectS2___ZL31PyvtkVector_IiLi3EE_SquaredNormP7_objectS0___ZL24PyvtkVector_IiLi3EE_NormP7_objectS0___ZL29PyvtkVector_IiLi3EE_NormalizeP7_objectS0___ZL30PyvtkVector_IiLi3EE_NormalizedP7_objectS0___ZL23PyvtkVector_IiLi3EE_DotP7_objectS0___ZL32PyvtkVector_IiLi3EE_vtkVector_s2P7_objectS0___ZL32PyvtkVector_IiLi3EE_vtkVector_s3P7_objectS0___ZL32PyvtkVector_IiLi3EE_vtkVector_s4P7_objectS0___ZL23PyvtkVector2_IdE_DeleteP7_object__ZL21PyvtkVector2_IdE_HashP7_object__ZL28PyvtkVector2_IdE_RichCompareP7_objectS0_i__ZL20PyvtkVector2_IdE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector2_IdE_SetP7_objectS0___ZL21PyvtkVector2_IdE_SetXP7_objectS0___ZL21PyvtkVector2_IdE_GetXP7_objectS0___ZL21PyvtkVector2_IdE_SetYP7_objectS0___ZL21PyvtkVector2_IdE_GetYP7_objectS0___ZL30PyvtkVector2_IdE_vtkVector2_s2P7_objectS0___ZL30PyvtkVector2_IdE_vtkVector2_s3P7_objectS0___ZL30PyvtkVector2_IdE_vtkVector2_s5P7_objectS0___ZL23PyvtkVector2_IfE_DeleteP7_object__ZL21PyvtkVector2_IfE_HashP7_object__ZL28PyvtkVector2_IfE_RichCompareP7_objectS0_i__ZL20PyvtkVector2_IfE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector2_IfE_SetP7_objectS0___ZL21PyvtkVector2_IfE_SetXP7_objectS0___ZL21PyvtkVector2_IfE_GetXP7_objectS0___ZL21PyvtkVector2_IfE_SetYP7_objectS0___ZL21PyvtkVector2_IfE_GetYP7_objectS0___ZL30PyvtkVector2_IfE_vtkVector2_s2P7_objectS0___ZL30PyvtkVector2_IfE_vtkVector2_s3P7_objectS0___ZL30PyvtkVector2_IfE_vtkVector2_s5P7_objectS0___ZL23PyvtkVector2_IiE_DeleteP7_object__ZL21PyvtkVector2_IiE_HashP7_object__ZL28PyvtkVector2_IiE_RichCompareP7_objectS0_i__ZL20PyvtkVector2_IiE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector2_IiE_SetP7_objectS0___ZL21PyvtkVector2_IiE_SetXP7_objectS0___ZL21PyvtkVector2_IiE_GetXP7_objectS0___ZL21PyvtkVector2_IiE_SetYP7_objectS0___ZL21PyvtkVector2_IiE_GetYP7_objectS0___ZL30PyvtkVector2_IiE_vtkVector2_s2P7_objectS0___ZL30PyvtkVector2_IiE_vtkVector2_s3P7_objectS0___ZL30PyvtkVector2_IiE_vtkVector2_s5P7_objectS0___ZL23PyvtkVector3_IdE_DeleteP7_object__ZL21PyvtkVector3_IdE_HashP7_object__ZL28PyvtkVector3_IdE_RichCompareP7_objectS0_i__ZL20PyvtkVector3_IdE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector3_IdE_SetP7_objectS0___ZL21PyvtkVector3_IdE_SetXP7_objectS0___ZL21PyvtkVector3_IdE_GetXP7_objectS0___ZL21PyvtkVector3_IdE_SetYP7_objectS0___ZL21PyvtkVector3_IdE_GetYP7_objectS0___ZL21PyvtkVector3_IdE_SetZP7_objectS0___ZL21PyvtkVector3_IdE_GetZP7_objectS0___ZL22PyvtkVector3_IdE_CrossP7_objectS0___ZL30PyvtkVector3_IdE_vtkVector3_s2P7_objectS0___ZL30PyvtkVector3_IdE_vtkVector3_s3P7_objectS0___ZL30PyvtkVector3_IdE_vtkVector3_s5P7_objectS0___ZL23PyvtkVector3_IfE_DeleteP7_object__ZL21PyvtkVector3_IfE_HashP7_object__ZL28PyvtkVector3_IfE_RichCompareP7_objectS0_i__ZL20PyvtkVector3_IfE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector3_IfE_SetP7_objectS0___ZL21PyvtkVector3_IfE_SetXP7_objectS0___ZL21PyvtkVector3_IfE_GetXP7_objectS0___ZL21PyvtkVector3_IfE_SetYP7_objectS0___ZL21PyvtkVector3_IfE_GetYP7_objectS0___ZL21PyvtkVector3_IfE_SetZP7_objectS0___ZL21PyvtkVector3_IfE_GetZP7_objectS0___ZL22PyvtkVector3_IfE_CrossP7_objectS0___ZL30PyvtkVector3_IfE_vtkVector3_s2P7_objectS0___ZL30PyvtkVector3_IfE_vtkVector3_s3P7_objectS0___ZL30PyvtkVector3_IfE_vtkVector3_s5P7_objectS0___ZL23PyvtkVector3_IiE_DeleteP7_object__ZL21PyvtkVector3_IiE_HashP7_object__ZL28PyvtkVector3_IiE_RichCompareP7_objectS0_i__ZL20PyvtkVector3_IiE_NewP11_typeobjectP7_objectS2___ZL20PyvtkVector3_IiE_SetP7_objectS0___ZL21PyvtkVector3_IiE_SetXP7_objectS0___ZL21PyvtkVector3_IiE_GetXP7_objectS0___ZL21PyvtkVector3_IiE_SetYP7_objectS0___ZL21PyvtkVector3_IiE_GetYP7_objectS0___ZL21PyvtkVector3_IiE_SetZP7_objectS0___ZL21PyvtkVector3_IiE_GetZP7_objectS0___ZL22PyvtkVector3_IiE_CrossP7_objectS0___ZL30PyvtkVector3_IiE_vtkVector3_s2P7_objectS0___ZL30PyvtkVector3_IiE_vtkVector3_s3P7_objectS0___ZL30PyvtkVector3_IiE_vtkVector3_s5P7_objectS0___ZL20PyvtkVector2i_DeleteP7_object__ZL18PyvtkVector2i_HashP7_object__ZL17PyvtkVector2i_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector2i_NormalizedP7_objectS0___ZL28PyvtkVector2i_vtkVector2i_s3P7_objectS0___ZL28PyvtkVector2i_vtkVector2i_s4P7_objectS0___ZL28PyvtkVector2i_vtkVector2i_s5P7_objectS0___ZL28PyvtkVector2i_vtkVector2i_s6P7_objectS0___ZL28PyvtkVector2i_vtkVector2i_s7P7_objectS0___ZL20PyvtkVector2f_DeleteP7_object__ZL18PyvtkVector2f_HashP7_object__ZL17PyvtkVector2f_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector2f_NormalizedP7_objectS0___ZL28PyvtkVector2f_vtkVector2f_s3P7_objectS0___ZL28PyvtkVector2f_vtkVector2f_s4P7_objectS0___ZL28PyvtkVector2f_vtkVector2f_s5P7_objectS0___ZL28PyvtkVector2f_vtkVector2f_s6P7_objectS0___ZL28PyvtkVector2f_vtkVector2f_s7P7_objectS0___ZL20PyvtkVector2d_DeleteP7_object__ZL18PyvtkVector2d_HashP7_object__ZL17PyvtkVector2d_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector2d_NormalizedP7_objectS0___ZL28PyvtkVector2d_vtkVector2d_s3P7_objectS0___ZL28PyvtkVector2d_vtkVector2d_s4P7_objectS0___ZL28PyvtkVector2d_vtkVector2d_s5P7_objectS0___ZL28PyvtkVector2d_vtkVector2d_s6P7_objectS0___ZL28PyvtkVector2d_vtkVector2d_s7P7_objectS0___ZL20PyvtkVector3i_DeleteP7_object__ZL18PyvtkVector3i_HashP7_object__ZL17PyvtkVector3i_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector3i_NormalizedP7_objectS0___ZL19PyvtkVector3i_CrossP7_objectS0___ZL28PyvtkVector3i_vtkVector3i_s3P7_objectS0___ZL28PyvtkVector3i_vtkVector3i_s4P7_objectS0___ZL28PyvtkVector3i_vtkVector3i_s5P7_objectS0___ZL28PyvtkVector3i_vtkVector3i_s6P7_objectS0___ZL28PyvtkVector3i_vtkVector3i_s7P7_objectS0___ZL20PyvtkVector3f_DeleteP7_object__ZL18PyvtkVector3f_HashP7_object__ZL17PyvtkVector3f_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector3f_NormalizedP7_objectS0___ZL19PyvtkVector3f_CrossP7_objectS0___ZL28PyvtkVector3f_vtkVector3f_s3P7_objectS0___ZL28PyvtkVector3f_vtkVector3f_s4P7_objectS0___ZL28PyvtkVector3f_vtkVector3f_s5P7_objectS0___ZL28PyvtkVector3f_vtkVector3f_s6P7_objectS0___ZL28PyvtkVector3f_vtkVector3f_s7P7_objectS0___ZL20PyvtkVector3d_DeleteP7_object__ZL18PyvtkVector3d_HashP7_object__ZL17PyvtkVector3d_NewP11_typeobjectP7_objectS2___ZL24PyvtkVector3d_NormalizedP7_objectS0___ZL19PyvtkVector3d_CrossP7_objectS0___ZL28PyvtkVector3d_vtkVector3d_s3P7_objectS0___ZL28PyvtkVector3d_vtkVector3d_s4P7_objectS0___ZL28PyvtkVector3d_vtkVector3d_s5P7_objectS0___ZL28PyvtkVector3d_vtkVector3d_s6P7_objectS0___ZL28PyvtkVector3d_vtkVector3d_s7P7_objectS0___ZL21PyvtkColor3_IdE_CCopyPKv__ZL21PyvtkColor3_IfE_CCopyPKv__ZL21PyvtkColor3_IhE_CCopyPKv__ZL21PyvtkColor4_IdE_CCopyPKv__ZL21PyvtkColor4_IfE_CCopyPKv__ZL21PyvtkColor4_IhE_CCopyPKv__ZL19PyvtkColor3ub_CCopyPKv__ZL18PyvtkColor3f_CCopyPKv__ZL18PyvtkColor3d_CCopyPKv__ZL19PyvtkColor4ub_CCopyPKv__ZL18PyvtkColor4f_CCopyPKv__ZL18PyvtkColor4d_CCopyPKv__ZL22PyvtkColor3_IdE_DeleteP7_object__ZL20PyvtkColor3_IdE_HashP7_object__ZL19PyvtkColor3_IdE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor3_IdE_SetP7_objectS0___ZL22PyvtkColor3_IdE_SetRedP7_objectS0___ZL22PyvtkColor3_IdE_GetRedP7_objectS0___ZL24PyvtkColor3_IdE_SetGreenP7_objectS0___ZL24PyvtkColor3_IdE_GetGreenP7_objectS0___ZL23PyvtkColor3_IdE_SetBlueP7_objectS0___ZL23PyvtkColor3_IdE_GetBlueP7_objectS0___ZL28PyvtkColor3_IdE_vtkColor3_s2P7_objectS0___ZL28PyvtkColor3_IdE_vtkColor3_s3P7_objectS0___ZL28PyvtkColor3_IdE_vtkColor3_s5P7_objectS0___ZL22PyvtkColor3_IfE_DeleteP7_object__ZL20PyvtkColor3_IfE_HashP7_object__ZL19PyvtkColor3_IfE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor3_IfE_SetP7_objectS0___ZL22PyvtkColor3_IfE_SetRedP7_objectS0___ZL22PyvtkColor3_IfE_GetRedP7_objectS0___ZL24PyvtkColor3_IfE_SetGreenP7_objectS0___ZL24PyvtkColor3_IfE_GetGreenP7_objectS0___ZL23PyvtkColor3_IfE_SetBlueP7_objectS0___ZL23PyvtkColor3_IfE_GetBlueP7_objectS0___ZL28PyvtkColor3_IfE_vtkColor3_s2P7_objectS0___ZL28PyvtkColor3_IfE_vtkColor3_s3P7_objectS0___ZL28PyvtkColor3_IfE_vtkColor3_s5P7_objectS0___ZL22PyvtkColor3_IhE_DeleteP7_object__ZL20PyvtkColor3_IhE_HashP7_object__ZL19PyvtkColor3_IhE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor3_IhE_SetP7_objectS0___ZL22PyvtkColor3_IhE_SetRedP7_objectS0___ZL22PyvtkColor3_IhE_GetRedP7_objectS0___ZL24PyvtkColor3_IhE_SetGreenP7_objectS0___ZL24PyvtkColor3_IhE_GetGreenP7_objectS0___ZL23PyvtkColor3_IhE_SetBlueP7_objectS0___ZL23PyvtkColor3_IhE_GetBlueP7_objectS0___ZL28PyvtkColor3_IhE_vtkColor3_s2P7_objectS0___ZL28PyvtkColor3_IhE_vtkColor3_s3P7_objectS0___ZL28PyvtkColor3_IhE_vtkColor3_s5P7_objectS0___ZL22PyvtkColor4_IdE_DeleteP7_object__ZL20PyvtkColor4_IdE_HashP7_object__ZL19PyvtkColor4_IdE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor4_IdE_SetP7_objectS0___ZL22PyvtkColor4_IdE_SetRedP7_objectS0___ZL22PyvtkColor4_IdE_GetRedP7_objectS0___ZL24PyvtkColor4_IdE_SetGreenP7_objectS0___ZL24PyvtkColor4_IdE_GetGreenP7_objectS0___ZL23PyvtkColor4_IdE_SetBlueP7_objectS0___ZL23PyvtkColor4_IdE_GetBlueP7_objectS0___ZL24PyvtkColor4_IdE_SetAlphaP7_objectS0___ZL24PyvtkColor4_IdE_GetAlphaP7_objectS0___ZL28PyvtkColor4_IdE_vtkColor4_s2P7_objectS0___ZL28PyvtkColor4_IdE_vtkColor4_s3P7_objectS0___ZL28PyvtkColor4_IdE_vtkColor4_s5P7_objectS0___ZL22PyvtkColor4_IfE_DeleteP7_object__ZL20PyvtkColor4_IfE_HashP7_object__ZL19PyvtkColor4_IfE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor4_IfE_SetP7_objectS0___ZL22PyvtkColor4_IfE_SetRedP7_objectS0___ZL22PyvtkColor4_IfE_GetRedP7_objectS0___ZL24PyvtkColor4_IfE_SetGreenP7_objectS0___ZL24PyvtkColor4_IfE_GetGreenP7_objectS0___ZL23PyvtkColor4_IfE_SetBlueP7_objectS0___ZL23PyvtkColor4_IfE_GetBlueP7_objectS0___ZL24PyvtkColor4_IfE_SetAlphaP7_objectS0___ZL24PyvtkColor4_IfE_GetAlphaP7_objectS0___ZL28PyvtkColor4_IfE_vtkColor4_s2P7_objectS0___ZL28PyvtkColor4_IfE_vtkColor4_s3P7_objectS0___ZL28PyvtkColor4_IfE_vtkColor4_s5P7_objectS0___ZL22PyvtkColor4_IhE_DeleteP7_object__ZL20PyvtkColor4_IhE_HashP7_object__ZL19PyvtkColor4_IhE_NewP11_typeobjectP7_objectS2___ZL19PyvtkColor4_IhE_SetP7_objectS0___ZL22PyvtkColor4_IhE_SetRedP7_objectS0___ZL22PyvtkColor4_IhE_GetRedP7_objectS0___ZL24PyvtkColor4_IhE_SetGreenP7_objectS0___ZL24PyvtkColor4_IhE_GetGreenP7_objectS0___ZL23PyvtkColor4_IhE_SetBlueP7_objectS0___ZL23PyvtkColor4_IhE_GetBlueP7_objectS0___ZL24PyvtkColor4_IhE_SetAlphaP7_objectS0___ZL24PyvtkColor4_IhE_GetAlphaP7_objectS0___ZL28PyvtkColor4_IhE_vtkColor4_s2P7_objectS0___ZL28PyvtkColor4_IhE_vtkColor4_s3P7_objectS0___ZL28PyvtkColor4_IhE_vtkColor4_s5P7_objectS0___ZL20PyvtkColor3ub_DeleteP7_object__ZL18PyvtkColor3ub_HashP7_object__ZL17PyvtkColor3ub_NewP11_typeobjectP7_objectS2___ZL28PyvtkColor3ub_vtkColor3ub_s2P7_objectS0___ZL28PyvtkColor3ub_vtkColor3ub_s3P7_objectS0___ZL28PyvtkColor3ub_vtkColor3ub_s5P7_objectS0___ZL19PyvtkColor3f_DeleteP7_object__ZL17PyvtkColor3f_HashP7_object__ZL16PyvtkColor3f_NewP11_typeobjectP7_objectS2___ZL26PyvtkColor3f_vtkColor3f_s2P7_objectS0___ZL26PyvtkColor3f_vtkColor3f_s3P7_objectS0___ZL26PyvtkColor3f_vtkColor3f_s5P7_objectS0___ZL19PyvtkColor3d_DeleteP7_object__ZL17PyvtkColor3d_HashP7_object__ZL16PyvtkColor3d_NewP11_typeobjectP7_objectS2___ZL26PyvtkColor3d_vtkColor3d_s2P7_objectS0___ZL26PyvtkColor3d_vtkColor3d_s3P7_objectS0___ZL26PyvtkColor3d_vtkColor3d_s5P7_objectS0___ZL20PyvtkColor4ub_DeleteP7_object__ZL18PyvtkColor4ub_HashP7_object__ZL17PyvtkColor4ub_NewP11_typeobjectP7_objectS2___ZL28PyvtkColor4ub_vtkColor4ub_s2P7_objectS0___ZL28PyvtkColor4ub_vtkColor4ub_s3P7_objectS0___ZL28PyvtkColor4ub_vtkColor4ub_s5P7_objectS0___ZL28PyvtkColor4ub_vtkColor4ub_s6P7_objectS0___ZL19PyvtkColor4f_DeleteP7_object__ZL17PyvtkColor4f_HashP7_object__ZL16PyvtkColor4f_NewP11_typeobjectP7_objectS2___ZL26PyvtkColor4f_vtkColor4f_s2P7_objectS0___ZL26PyvtkColor4f_vtkColor4f_s3P7_objectS0___ZL26PyvtkColor4f_vtkColor4f_s5P7_objectS0___ZL19PyvtkColor4d_DeleteP7_object__ZL17PyvtkColor4d_HashP7_object__ZL16PyvtkColor4d_NewP11_typeobjectP7_objectS2___ZL26PyvtkColor4d_vtkColor4d_s2P7_objectS0___ZL26PyvtkColor4d_vtkColor4d_s3P7_objectS0___ZL26PyvtkColor4d_vtkColor4d_s5P7_objectS0___ZL19PyvtkRect_IdE_CCopyPKv__ZL19PyvtkRect_IfE_CCopyPKv__ZL19PyvtkRect_IiE_CCopyPKv__ZL16PyvtkRecti_CCopyPKv__ZL16PyvtkRectf_CCopyPKv__ZL16PyvtkRectd_CCopyPKv__ZL20PyvtkRect_IdE_DeleteP7_object__ZL18PyvtkRect_IdE_HashP7_object__ZL17PyvtkRect_IdE_NewP11_typeobjectP7_objectS2___ZL17PyvtkRect_IdE_SetP7_objectS0___ZL18PyvtkRect_IdE_SetXP7_objectS0___ZL18PyvtkRect_IdE_GetXP7_objectS0___ZL18PyvtkRect_IdE_SetYP7_objectS0___ZL18PyvtkRect_IdE_GetYP7_objectS0___ZL22PyvtkRect_IdE_SetWidthP7_objectS0___ZL22PyvtkRect_IdE_GetWidthP7_objectS0___ZL23PyvtkRect_IdE_SetHeightP7_objectS0___ZL23PyvtkRect_IdE_GetHeightP7_objectS0___ZL21PyvtkRect_IdE_GetLeftP7_objectS0___ZL22PyvtkRect_IdE_GetRightP7_objectS0___ZL20PyvtkRect_IdE_GetTopP7_objectS0___ZL23PyvtkRect_IdE_GetBottomP7_objectS0___ZL27PyvtkRect_IdE_GetBottomLeftP7_objectS0___ZL24PyvtkRect_IdE_GetTopLeftP7_objectS0___ZL28PyvtkRect_IdE_GetBottomRightP7_objectS0___ZL25PyvtkRect_IdE_GetTopRightP7_objectS0___ZL22PyvtkRect_IdE_AddPointP7_objectS0___ZL21PyvtkRect_IdE_AddRectP7_objectS0___ZL28PyvtkRect_IdE_IntersectsWithP7_objectS0___ZL24PyvtkRect_IdE_vtkRect_s3P7_objectS0___ZL24PyvtkRect_IdE_vtkRect_s4P7_objectS0___ZL20PyvtkRect_IfE_DeleteP7_object__ZL18PyvtkRect_IfE_HashP7_object__ZL17PyvtkRect_IfE_NewP11_typeobjectP7_objectS2___ZL17PyvtkRect_IfE_SetP7_objectS0___ZL18PyvtkRect_IfE_SetXP7_objectS0___ZL18PyvtkRect_IfE_GetXP7_objectS0___ZL18PyvtkRect_IfE_SetYP7_objectS0___ZL18PyvtkRect_IfE_GetYP7_objectS0___ZL22PyvtkRect_IfE_SetWidthP7_objectS0___ZL22PyvtkRect_IfE_GetWidthP7_objectS0___ZL23PyvtkRect_IfE_SetHeightP7_objectS0___ZL23PyvtkRect_IfE_GetHeightP7_objectS0___ZL21PyvtkRect_IfE_GetLeftP7_objectS0___ZL22PyvtkRect_IfE_GetRightP7_objectS0___ZL20PyvtkRect_IfE_GetTopP7_objectS0___ZL23PyvtkRect_IfE_GetBottomP7_objectS0___ZL27PyvtkRect_IfE_GetBottomLeftP7_objectS0___ZL24PyvtkRect_IfE_GetTopLeftP7_objectS0___ZL28PyvtkRect_IfE_GetBottomRightP7_objectS0___ZL25PyvtkRect_IfE_GetTopRightP7_objectS0___ZL22PyvtkRect_IfE_AddPointP7_objectS0___ZL21PyvtkRect_IfE_AddRectP7_objectS0___ZL28PyvtkRect_IfE_IntersectsWithP7_objectS0___ZL24PyvtkRect_IfE_vtkRect_s3P7_objectS0___ZL24PyvtkRect_IfE_vtkRect_s4P7_objectS0___ZL20PyvtkRect_IiE_DeleteP7_object__ZL18PyvtkRect_IiE_HashP7_object__ZL17PyvtkRect_IiE_NewP11_typeobjectP7_objectS2___ZL17PyvtkRect_IiE_SetP7_objectS0___ZL18PyvtkRect_IiE_SetXP7_objectS0___ZL18PyvtkRect_IiE_GetXP7_objectS0___ZL18PyvtkRect_IiE_SetYP7_objectS0___ZL18PyvtkRect_IiE_GetYP7_objectS0___ZL22PyvtkRect_IiE_SetWidthP7_objectS0___ZL22PyvtkRect_IiE_GetWidthP7_objectS0___ZL23PyvtkRect_IiE_SetHeightP7_objectS0___ZL23PyvtkRect_IiE_GetHeightP7_objectS0___ZL21PyvtkRect_IiE_GetLeftP7_objectS0___ZL22PyvtkRect_IiE_GetRightP7_objectS0___ZL20PyvtkRect_IiE_GetTopP7_objectS0___ZL23PyvtkRect_IiE_GetBottomP7_objectS0___ZL27PyvtkRect_IiE_GetBottomLeftP7_objectS0___ZL24PyvtkRect_IiE_GetTopLeftP7_objectS0___ZL28PyvtkRect_IiE_GetBottomRightP7_objectS0___ZL25PyvtkRect_IiE_GetTopRightP7_objectS0___ZL22PyvtkRect_IiE_AddPointP7_objectS0___ZL21PyvtkRect_IiE_AddRectP7_objectS0___ZL28PyvtkRect_IiE_IntersectsWithP7_objectS0___ZL24PyvtkRect_IiE_vtkRect_s3P7_objectS0___ZL24PyvtkRect_IiE_vtkRect_s4P7_objectS0___ZL17PyvtkRecti_DeleteP7_object__ZL15PyvtkRecti_HashP7_object__ZL14PyvtkRecti_NewP11_typeobjectP7_objectS2___ZL22PyvtkRecti_vtkRecti_s3P7_objectS0___ZL22PyvtkRecti_vtkRecti_s4P7_objectS0___ZL17PyvtkRectf_DeleteP7_object__ZL15PyvtkRectf_HashP7_object__ZL14PyvtkRectf_NewP11_typeobjectP7_objectS2___ZL22PyvtkRectf_vtkRectf_s3P7_objectS0___ZL22PyvtkRectf_vtkRectf_s4P7_objectS0___ZL17PyvtkRectd_DeleteP7_object__ZL15PyvtkRectd_HashP7_object__ZL14PyvtkRectd_NewP11_typeobjectP7_objectS2___ZL22PyvtkRectd_vtkRectd_s3P7_objectS0___ZL22PyvtkRectd_vtkRectd_s4P7_objectS0___ZL32PyvtkNonOverlappingAMR_StaticNewv__ZL31PyvtkNonOverlappingAMR_IsTypeOfP7_objectS0___ZL26PyvtkNonOverlappingAMR_IsAP7_objectS0___ZL35PyvtkNonOverlappingAMR_SafeDownCastP7_objectS0___ZL34PyvtkNonOverlappingAMR_NewInstanceP7_objectS0___ZL40PyvtkNonOverlappingAMR_GetDataObjectTypeP7_objectS0___ZL30PyvtkNonOverlappingAMR_GetDataP7_objectS0___ZN20vtkNonOverlappingAMR8IsTypeOfEPKc__ZL33PyvtkNonOverlappingAMR_GetData_s2P7_objectS0___ZL33PyvtkNonOverlappingAMR_GetData_s1P7_objectS0___ZL29PyvtkOverlappingAMR_StaticNewv__ZL37PyvtkOverlappingAMR_GetDataObjectTypeP7_objectS0___ZL28PyvtkOverlappingAMR_IsTypeOfP7_objectS0___ZL23PyvtkOverlappingAMR_IsAP7_objectS0___ZL32PyvtkOverlappingAMR_SafeDownCastP7_objectS0___ZL31PyvtkOverlappingAMR_NewInstanceP7_objectS0___ZL31PyvtkOverlappingAMR_NewIteratorP7_objectS0___ZL29PyvtkOverlappingAMR_SetOriginP7_objectS0___ZL29PyvtkOverlappingAMR_GetOriginP7_objectS0___ZL30PyvtkOverlappingAMR_SetSpacingP7_objectS0___ZL30PyvtkOverlappingAMR_GetSpacingP7_objectS0___ZL29PyvtkOverlappingAMR_SetAMRBoxP7_objectS0___ZL29PyvtkOverlappingAMR_GetAMRBoxP7_objectS0___ZL29PyvtkOverlappingAMR_GetBoundsP7_objectS0___ZL44PyvtkOverlappingAMR_NUMBER_OF_BLANKED_POINTSP7_objectS0___ZL27PyvtkOverlappingAMR_GetDataP7_objectS0___ZL38PyvtkOverlappingAMR_SetRefinementRatioP7_objectS0___ZL38PyvtkOverlappingAMR_GetRefinementRatioP7_objectS0___ZL42PyvtkOverlappingAMR_SetAMRBlockSourceIndexP7_objectS0___ZL42PyvtkOverlappingAMR_GetAMRBlockSourceIndexP7_objectS0___ZL42PyvtkOverlappingAMR_HasChildrenInformationP7_objectS0___ZL50PyvtkOverlappingAMR_GenerateParentChildInformationP7_objectS0___ZL30PyvtkOverlappingAMR_GetParentsP7_objectS0___ZL31PyvtkOverlappingAMR_GetChildrenP7_objectS0___ZL40PyvtkOverlappingAMR_PrintParentChildInfoP7_objectS0___ZL28PyvtkOverlappingAMR_FindGridP7_objectS0___ZL30PyvtkOverlappingAMR_GetAMRInfoP7_objectS0___ZL30PyvtkOverlappingAMR_SetAMRInfoP7_objectS0___ZL25PyvtkOverlappingAMR_AuditP7_objectS0___ZL30PyvtkOverlappingAMR_GetData_s2P7_objectS0___ZL30PyvtkOverlappingAMR_GetData_s1P7_objectS0___ZL41PyvtkOverlappingAMR_GetRefinementRatio_s1P7_objectS0___ZL41PyvtkOverlappingAMR_GetRefinementRatio_s2P7_objectS0___ZL29PyvtkAMRInformation_StaticNewv__ZL28PyvtkAMRInformation_IsTypeOfP7_objectS0___ZL23PyvtkAMRInformation_IsAP7_objectS0___ZL32PyvtkAMRInformation_SafeDownCastP7_objectS0___ZL31PyvtkAMRInformation_NewInstanceP7_objectS0___ZL30PyvtkAMRInformation_InitializeP7_objectS0___ZL38PyvtkAMRInformation_GetGridDescriptionP7_objectS0___ZL38PyvtkAMRInformation_SetGridDescriptionP7_objectS0___ZL29PyvtkAMRInformation_GetOriginP7_objectS0___ZL29PyvtkAMRInformation_SetOriginP7_objectS0___ZL37PyvtkAMRInformation_GetNumberOfLevelsP7_objectS0___ZL39PyvtkAMRInformation_GetNumberOfDataSetsP7_objectS0___ZL42PyvtkAMRInformation_GetTotalNumberOfBlocksP7_objectS0___ZL28PyvtkAMRInformation_GetIndexP7_objectS0___ZL36PyvtkAMRInformation_ComputeIndexPairP7_objectS0___ZL29PyvtkAMRInformation_GetBoundsP7_objectS0___ZL30PyvtkAMRInformation_GetSpacingP7_objectS0___ZL30PyvtkAMRInformation_HasSpacingP7_objectS0___ZL29PyvtkAMRInformation_SetAMRBoxP7_objectS0___ZL29PyvtkAMRInformation_GetAMRBoxP7_objectS0___ZL38PyvtkAMRInformation_GetCoarsenedAMRBoxP7_objectS0___ZL42PyvtkAMRInformation_GetAMRBlockSourceIndexP7_objectS0___ZL42PyvtkAMRInformation_SetAMRBlockSourceIndexP7_objectS0___ZL43PyvtkAMRInformation_GenerateRefinementRatioP7_objectS0___ZL38PyvtkAMRInformation_HasRefinementRatioP7_objectS0___ZL38PyvtkAMRInformation_SetRefinementRatioP7_objectS0___ZL38PyvtkAMRInformation_GetRefinementRatioP7_objectS0___ZL30PyvtkAMRInformation_SetSpacingP7_objectS0___ZL42PyvtkAMRInformation_HasChildrenInformationP7_objectS0___ZL30PyvtkAMRInformation_GetParentsP7_objectS0___ZL31PyvtkAMRInformation_GetChildrenP7_objectS0___ZL40PyvtkAMRInformation_PrintParentChildInfoP7_objectS0___ZL50PyvtkAMRInformation_GenerateParentChildInformationP7_objectS0___ZL25PyvtkAMRInformation_AuditP7_objectS0___ZL28PyvtkAMRInformation_FindCellP7_objectS0___ZL28PyvtkAMRInformation_FindGridP7_objectS0___ZL28PyvtkAMRInformation_DeepCopyP7_objectS0___ZL31PyvtkAMRInformation_FindGrid_s1P7_objectS0___ZL31PyvtkAMRInformation_FindGrid_s2P7_objectS0___ZL31PyvtkAMRDataInternals_StaticNewv__ZL30PyvtkAMRDataInternals_IsTypeOfP7_objectS0___ZL25PyvtkAMRDataInternals_IsAP7_objectS0___ZL34PyvtkAMRDataInternals_SafeDownCastP7_objectS0___ZL33PyvtkAMRDataInternals_NewInstanceP7_objectS0___ZL32PyvtkAMRDataInternals_InitializeP7_objectS0___ZL28PyvtkAMRDataInternals_InsertP7_objectS0___ZL32PyvtkAMRDataInternals_GetDataSetP7_objectS0___ZL33PyvtkAMRDataInternals_ShallowCopyP7_objectS0___ZL27PyvtkAMRDataInternals_EmptyP7_objectS0___ZL39PyvtkAMRDataInternals_GetNumberOfBlocksP7_objectS0___ZL29PyvtkUniformGridAMR_StaticNewv__ZL28PyvtkUniformGridAMR_IsTypeOfP7_objectS0___ZL23PyvtkUniformGridAMR_IsAP7_objectS0___ZL32PyvtkUniformGridAMR_SafeDownCastP7_objectS0___ZL31PyvtkUniformGridAMR_NewInstanceP7_objectS0___ZL31PyvtkUniformGridAMR_NewIteratorP7_objectS0___ZL37PyvtkUniformGridAMR_GetDataObjectTypeP7_objectS0___ZL30PyvtkUniformGridAMR_InitializeP7_objectS0___ZL38PyvtkUniformGridAMR_SetGridDescriptionP7_objectS0___ZL38PyvtkUniformGridAMR_GetGridDescriptionP7_objectS0___ZL37PyvtkUniformGridAMR_GetNumberOfLevelsP7_objectS0___ZL42PyvtkUniformGridAMR_GetTotalNumberOfBlocksP7_objectS0___ZL39PyvtkUniformGridAMR_GetNumberOfDataSetsP7_objectS0___ZL29PyvtkUniformGridAMR_GetBoundsP7_objectS0___ZL26PyvtkUniformGridAMR_GetMinP7_objectS0___ZL26PyvtkUniformGridAMR_GetMaxP7_objectS0___ZL30PyvtkUniformGridAMR_SetDataSetP7_objectS0___ZL30PyvtkUniformGridAMR_GetDataSetP7_objectS0___ZL37PyvtkUniformGridAMR_GetCompositeIndexP7_objectS0___ZL36PyvtkUniformGridAMR_GetLevelAndIndexP7_objectS0___ZL31PyvtkUniformGridAMR_ShallowCopyP7_objectS0___ZL28PyvtkUniformGridAMR_DeepCopyP7_objectS0___ZL33PyvtkUniformGridAMR_CopyStructureP7_objectS0___ZL27PyvtkUniformGridAMR_GetDataP7_objectS0___ZL30PyvtkUniformGridAMR_GetData_s2P7_objectS0___ZL30PyvtkUniformGridAMR_GetData_s1P7_objectS0___ZL41PyvtkUniformGridAMRDataIterator_StaticNewv__ZL40PyvtkUniformGridAMRDataIterator_IsTypeOfP7_objectS0___ZL35PyvtkUniformGridAMRDataIterator_IsAP7_objectS0___ZL44PyvtkUniformGridAMRDataIterator_SafeDownCastP7_objectS0___ZL43PyvtkUniformGridAMRDataIterator_NewInstanceP7_objectS0___ZL50PyvtkUniformGridAMRDataIterator_GetCurrentMetaDataP7_objectS0___ZL50PyvtkUniformGridAMRDataIterator_HasCurrentMetaDataP7_objectS0___ZL52PyvtkUniformGridAMRDataIterator_GetCurrentDataObjectP7_objectS0___ZL51PyvtkUniformGridAMRDataIterator_GetCurrentFlatIndexP7_objectS0___ZL47PyvtkUniformGridAMRDataIterator_GetCurrentLevelP7_objectS0___ZL47PyvtkUniformGridAMRDataIterator_GetCurrentIndexP7_objectS0___ZL45PyvtkUniformGridAMRDataIterator_GoToFirstItemP7_objectS0___ZL44PyvtkUniformGridAMRDataIterator_GoToNextItemP7_objectS0___ZL51PyvtkUniformGridAMRDataIterator_IsDoneWithTraversalP7_objectS0___ZL26PyvtkHyperOctree_StaticNewv__ZL39PyvtkHyperOctreeLightWeightCursor_CCopyPKv__ZL23PyvtkHyperOctree_LEVELSP7_objectS0___ZL26PyvtkHyperOctree_DIMENSIONP7_objectS0___ZL22PyvtkHyperOctree_SIZESP7_objectS0___ZL25PyvtkHyperOctree_IsTypeOfP7_objectS0___ZL20PyvtkHyperOctree_IsAP7_objectS0___ZL29PyvtkHyperOctree_SafeDownCastP7_objectS0___ZL28PyvtkHyperOctree_NewInstanceP7_objectS0___ZL34PyvtkHyperOctree_GetDataObjectTypeP7_objectS0___ZL30PyvtkHyperOctree_CopyStructureP7_objectS0___ZL29PyvtkHyperOctree_GetDimensionP7_objectS0___ZL29PyvtkHyperOctree_SetDimensionP7_objectS0___ZL33PyvtkHyperOctree_GetNumberOfCellsP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfLeavesP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfPointsP7_objectS0___ZL37PyvtkHyperOctree_GetMaxNumberOfPointsP7_objectS0___ZL47PyvtkHyperOctree_GetMaxNumberOfPointsOnBoundaryP7_objectS0___ZL46PyvtkHyperOctree_GetMaxNumberOfCellsOnBoundaryP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfLevelsP7_objectS0___ZL24PyvtkHyperOctree_SetSizeP7_objectS0___ZL24PyvtkHyperOctree_GetSizeP7_objectS0___ZL26PyvtkHyperOctree_SetOriginP7_objectS0___ZL26PyvtkHyperOctree_GetOriginP7_objectS0___ZL30PyvtkHyperOctree_NewCellCursorP7_objectS0___ZL30PyvtkHyperOctree_SubdivideLeafP7_objectS0___ZL37PyvtkHyperOctree_CollapseTerminalNodeP7_objectS0___ZL25PyvtkHyperOctree_GetPointP7_objectS0___ZL24PyvtkHyperOctree_GetCellP7_objectS0___ZL28PyvtkHyperOctree_GetCellTypeP7_objectS0___ZL30PyvtkHyperOctree_GetCellPointsP7_objectS0___ZL30PyvtkHyperOctree_GetPointCellsP7_objectS0___ZL33PyvtkHyperOctree_GetCellNeighborsP7_objectS0___ZL26PyvtkHyperOctree_FindPointP7_objectS0___ZL25PyvtkHyperOctree_FindCellP7_objectS0___ZL27PyvtkHyperOctree_InitializeP7_objectS0___ZL31PyvtkHyperOctree_GetMaxCellSizeP7_objectS0___ZL28PyvtkHyperOctree_ShallowCopyP7_objectS0___ZL25PyvtkHyperOctree_DeepCopyP7_objectS0___ZL32PyvtkHyperOctree_GetPointsOnFaceP7_objectS0___ZL39PyvtkHyperOctree_GetPointsOnParentFacesP7_objectS0___ZL32PyvtkHyperOctree_GetPointsOnEdgeP7_objectS0___ZL38PyvtkHyperOctree_GetPointsOnParentEdgeP7_objectS0___ZL34PyvtkHyperOctree_GetPointsOnEdge2DP7_objectS0___ZL40PyvtkHyperOctree_GetPointsOnParentEdge2DP7_objectS0___ZL28PyvtkHyperOctree_GetLeafDataP7_objectS0___ZL32PyvtkHyperOctree_SetDualGridFlagP7_objectS0___ZL32PyvtkHyperOctree_GetDualGridFlagP7_objectS0___ZL36PyvtkHyperOctree_GetActualMemorySizeP7_objectS0___ZL24PyvtkHyperOctree_GetDataP7_objectS0___ZL27PyvtkHyperOctree_GetData_s2P7_objectS0___ZL27PyvtkHyperOctree_GetData_s1P7_objectS0___ZL40PyvtkHyperOctreeLightWeightCursor_DeleteP7_object__ZL38PyvtkHyperOctreeLightWeightCursor_HashP7_object__ZL37PyvtkHyperOctreeLightWeightCursor_NewP11_typeobjectP7_objectS2___ZL68PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_s2P7_objectS0___ZL44PyvtkHyperOctreeLightWeightCursor_InitializeP7_objectS0___ZL40PyvtkHyperOctreeLightWeightCursor_ToRootP7_objectS0___ZL41PyvtkHyperOctreeLightWeightCursor_ToChildP7_objectS0___ZL43PyvtkHyperOctreeLightWeightCursor_GetIsLeafP7_objectS0___ZL46PyvtkHyperOctreeLightWeightCursor_GetLeafIndexP7_objectS0___ZL41PyvtkHyperOctreeLightWeightCursor_GetTreeP7_objectS0___ZL42PyvtkHyperOctreeLightWeightCursor_GetLevelP7_objectS0___ZL31PyvtkHyperOctreeCursor_IsTypeOfP7_objectS0___ZL26PyvtkHyperOctreeCursor_IsAP7_objectS0___ZL35PyvtkHyperOctreeCursor_SafeDownCastP7_objectS0___ZL34PyvtkHyperOctreeCursor_NewInstanceP7_objectS0___ZL32PyvtkHyperOctreeCursor_GetLeafIdP7_objectS0___ZL36PyvtkHyperOctreeCursor_CurrentIsLeafP7_objectS0___ZL36PyvtkHyperOctreeCursor_CurrentIsRootP7_objectS0___ZL38PyvtkHyperOctreeCursor_GetCurrentLevelP7_objectS0___ZL36PyvtkHyperOctreeCursor_GetChildIndexP7_objectS0___ZL44PyvtkHyperOctreeCursor_CurrentIsTerminalNodeP7_objectS0___ZL29PyvtkHyperOctreeCursor_ToRootP7_objectS0___ZL31PyvtkHyperOctreeCursor_ToParentP7_objectS0___ZL30PyvtkHyperOctreeCursor_ToChildP7_objectS0___ZL33PyvtkHyperOctreeCursor_ToSameNodeP7_objectS0___ZL30PyvtkHyperOctreeCursor_IsEqualP7_objectS0___ZL28PyvtkHyperOctreeCursor_CloneP7_objectS0___ZL31PyvtkHyperOctreeCursor_SameTreeP7_objectS0___ZL31PyvtkHyperOctreeCursor_GetIndexP7_objectS0___ZL42PyvtkHyperOctreeCursor_GetNumberOfChildrenP7_objectS0___ZL35PyvtkHyperOctreeCursor_GetDimensionP7_objectS0___ZL33PyvtkHyperOctreeCursor_MoveToNodeP7_objectS0___ZL28PyvtkHyperOctreeCursor_FoundP7_objectS0___ZL38PyvtkHyperOctreePointsGrabber_IsTypeOfP7_objectS0___ZL33PyvtkHyperOctreePointsGrabber_IsAP7_objectS0___ZL42PyvtkHyperOctreePointsGrabber_SafeDownCastP7_objectS0___ZL41PyvtkHyperOctreePointsGrabber_NewInstanceP7_objectS0___ZL42PyvtkHyperOctreePointsGrabber_GetDimensionP7_objectS0___ZL42PyvtkHyperOctreePointsGrabber_SetDimensionP7_objectS0___ZL48PyvtkHyperOctreePointsGrabber_InitPointInsertionP7_objectS0___ZL41PyvtkHyperOctreePointsGrabber_InsertPointP7_objectS0___ZL50PyvtkHyperOctreePointsGrabber_InsertPointWithMergeP7_objectS0___ZL43PyvtkHyperOctreePointsGrabber_InsertPoint2DP7_objectS0___ZN22vtkVertexAdjacencyListC2ERKS_.cold.1GCC_except_table29GCC_except_table31GCC_except_table10GCC_except_table1GCC_except_table6GCC_except_table19GCC_except_table20GCC_except_table42GCC_except_table43GCC_except_table11GCC_except_table12GCC_except_table14GCC_except_table15GCC_except_table17GCC_except_table16GCC_except_table18GCC_except_table7GCC_except_table9GCC_except_table13GCC_except_table21GCC_except_table24GCC_except_table26GCC_except_table27GCC_except_table32GCC_except_table39GCC_except_table40GCC_except_table8GCC_except_table28GCC_except_table38GCC_except_table82GCC_except_table87GCC_except_table22GCC_except_table53GCC_except_table23GCC_except_table25GCC_except_table45GCC_except_table46GCC_except_table30GCC_except_table34GCC_except_table35GCC_except_table78GCC_except_table79GCC_except_table61GCC_except_table65GCC_except_table48GCC_except_table69GCC_except_table41GCC_except_table44GCC_except_table36GCC_except_table37GCC_except_table63GCC_except_table64GCC_except_table66GCC_except_table71GCC_except_table83GCC_except_table33GCC_except_table5GCC_except_table47GCC_except_table51GCC_except_table52GCC_except_table50GCC_except_table54GCC_except_table58GCC_except_table59GCC_except_table60GCC_except_table62__ZZ31PyvtkDataSetAttributes_ClassNewE9constants__ZTVNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZTTNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZTCNSt3__119basic_ostringstreamIcNS_11char_traitsIcEENS_9allocatorIcEEEE0_NS_13basic_ostreamIcS2_EE__ZTVNSt3__115basic_stringbufIcNS_11char_traitsIcEENS_9allocatorIcEEEE__ZZ27PyvtkSelectionNode_ClassNewE9constants__ZZ24PyVTKAddFile_vtkCellTypeE9constants__dyld_private__ZL27PyvtkAbstractCellLinks_Type__ZL30PyvtkAbstractCellLinks_Methods__ZL29PyvtkAbstractCellLocator_Type__ZL32PyvtkAbstractCellLocator_Methods__ZL30PyvtkAbstractPointLocator_Type__ZL33PyvtkAbstractPointLocator_Methods__ZL32PyvtkAdjacentVertexIterator_Type__ZL35PyvtkAdjacentVertexIterator_Methods__ZL16PyvtkAMRBox_Type__ZL19PyvtkAMRBox_Methods__ZL29PyvtkAMRBox_vtkAMRBox_Methods__ZL33PyvtkAMRBox_SetDimensions_Methods__ZL28PyvtkAMRBox_Contains_Methods__ZL22PyvtkAMRUtilities_Type__ZL25PyvtkAMRUtilities_Methods__ZL34PyvtkAnimationScene_PlayModes_Type__ZL24PyvtkAnimationScene_Type__ZL27PyvtkAnimationScene_Methods__ZL20PyvtkAnnotation_Type__ZL23PyvtkAnnotation_Methods__ZL31PyvtkAnnotation_GetData_Methods__ZL26PyvtkAnnotationLayers_Type__ZL29PyvtkAnnotationLayers_Methods__ZL37PyvtkAnnotationLayers_GetData_Methods__ZL19PyvtkArrayData_Type__ZL22PyvtkArrayData_Methods__ZL30PyvtkArrayData_GetData_Methods__ZL31PyvtkAttributesErrorMetric_Type__ZL34PyvtkAttributesErrorMetric_Methods__ZL25PyvtkBiQuadraticQuad_Type__ZL28PyvtkBiQuadraticQuad_Methods__ZL40PyvtkBiQuadraticQuadraticHexahedron_Type__ZL43PyvtkBiQuadraticQuadraticHexahedron_Methods__ZL35PyvtkBiQuadraticQuadraticWedge_Type__ZL38PyvtkBiQuadraticQuadraticWedge_Methods__ZL29PyvtkBiQuadraticTriangle_Type__ZL32PyvtkBiQuadraticTriangle_Methods__ZL13PyvtkBox_Type__ZL16PyvtkBox_Methods__ZL17PyvtkBSPCuts_Type__ZL20PyvtkBSPCuts_Methods__ZL28PyvtkBSPCuts_GetData_Methods__ZL26PyvtkBSPIntersections_Type__ZL29PyvtkBSPIntersections_Methods__ZL44PyvtkBSPIntersections_IntersectsCell_Methods__ZL16PyvtkCell3D_Type__ZL19PyvtkCell3D_Methods__ZL22PyvtkCellArray_Methods__ZL37PyvtkCellArray_InsertNextCell_Methods__ZL14PyvtkCell_Type__ZL17PyvtkCell_Methods__ZL18PyvtkCellData_Type__ZL21PyvtkCellData_Methods__ZL22PyvtkCellIterator_Type__ZL25PyvtkCellIterator_Methods__ZL19PyvtkCellLinks_Type__ZL22PyvtkCellLinks_Methods__ZL21PyvtkCellLocator_Type__ZL24PyvtkCellLocator_Methods__ZL22PyvtkCellTypes_Methods__ZL35PyvtkCellTypes_SetCellTypes_Methods__ZL26PyvtkCompositeDataSet_Type__ZL29PyvtkCompositeDataSet_Methods__ZL37PyvtkCompositeDataSet_GetData_Methods__ZL31PyvtkCompositeDataIterator_Type__ZL34PyvtkCompositeDataIterator_Methods__ZL14PyvtkCone_Type__ZL17PyvtkCone_Methods__ZL24PyvtkConvexPointSet_Type__ZL27PyvtkConvexPointSet_Methods__ZL19PyvtkCubicLine_Type__ZL22PyvtkCubicLine_Methods__ZL18PyvtkCylinder_Type__ZL21PyvtkCylinder_Methods__ZL29PyvtkDataSetCellIterator_Type__ZL32PyvtkDataSetCellIterator_Methods__ZL30PyvtkDataObjectCollection_Type__ZL33PyvtkDataObjectCollection_Methods__ZL38PyvtkDataObject_FieldAssociations_Type__ZL35PyvtkDataObject_AttributeTypes_Type__ZL36PyvtkDataObject_FieldOperations_Type__ZL20PyvtkDataObject_Type__ZL23PyvtkDataObject_Methods__ZL31PyvtkDataObject_GetData_Methods__ZL25PyvtkDataObjectTypes_Type__ZL28PyvtkDataObjectTypes_Methods__ZL42PyvtkDataObjectTypes_NewDataObject_Methods__ZL24PyvtkDataObjectTree_Type__ZL27PyvtkDataObjectTree_Methods__ZL35PyvtkDataObjectTree_GetData_Methods__ZL32PyvtkDataObjectTreeIterator_Type__ZL35PyvtkDataObjectTreeIterator_Methods__ZL42PyvtkDataSetAttributes_AttributeTypes_Type__ZL47PyvtkDataSetAttributes_AttributeLimitTypes_Type__ZL42PyvtkDataSetAttributes_CellGhostTypes_Type__ZL43PyvtkDataSetAttributes_PointGhostTypes_Type__ZL51PyvtkDataSetAttributes_AttributeCopyOperations_Type__ZL27PyvtkDataSetAttributes_Type__ZL30PyvtkDataSetAttributes_Methods__ZL49PyvtkDataSetAttributes_SetActiveAttribute_Methods__ZL42PyvtkDataSetAttributes_RemoveArray_Methods__ZL39PyvtkDataSetAttributes_CopyData_Methods__ZL27PyvtkDataSetCollection_Type__ZL30PyvtkDataSetCollection_Methods__ZL31PyvtkDataSet_FieldDataType_Type__ZL17PyvtkDataSet_Type__ZL20PyvtkDataSet_Methods__ZL28PyvtkDataSet_GetData_Methods__ZL30PyvtkDirectedAcyclicGraph_Type__ZL33PyvtkDirectedAcyclicGraph_Methods__ZL41PyvtkDirectedAcyclicGraph_GetData_Methods__ZL23PyvtkDirectedGraph_Type__ZL26PyvtkDirectedGraph_Methods__ZL34PyvtkDirectedGraph_GetData_Methods__ZL32PyvtkDistributedGraphHelper_Type__ZL35PyvtkDistributedGraphHelper_Methods__ZL26PyvtkEdgeListIterator_Type__ZL29PyvtkEdgeListIterator_Methods__ZL19PyvtkEdgeTable_Type__ZL22PyvtkEdgeTable_Methods__ZL33PyvtkEdgeTable_InsertEdge_Methods__ZL19PyvtkEmptyCell_Type__ZL22PyvtkEmptyCell_Methods__ZL37PyvtkExtractStructuredGridHelper_Type__ZL40PyvtkExtractStructuredGridHelper_Methods__ZL19PyvtkFieldData_Type__ZL22PyvtkFieldData_Methods__ZL34PyvtkFieldData_RemoveArray_Methods__ZL31PyvtkFieldData_GetArray_Methods__ZL39PyvtkFieldData_GetAbstractArray_Methods__ZL28PyvtkGenericAdaptorCell_Type__ZL31PyvtkGenericAdaptorCell_Methods__ZL48PyvtkGenericAdaptorCell_InterpolateTuple_Methods__ZL36PyvtkGenericAttributeCollection_Type__ZL39PyvtkGenericAttributeCollection_Methods__ZL26PyvtkGenericAttribute_Type__ZL29PyvtkGenericAttribute_Methods__ZL38PyvtkGenericAttribute_GetTuple_Methods__ZL21PyvtkGenericCell_Type__ZL24PyvtkGenericCell_Methods__ZL29PyvtkGenericCellIterator_Type__ZL32PyvtkGenericCellIterator_Methods__ZL32PyvtkGenericCellTessellator_Type__ZL35PyvtkGenericCellTessellator_Methods__ZL24PyvtkGenericDataSet_Type__ZL27PyvtkGenericDataSet_Methods__ZL35PyvtkGenericDataSet_GetData_Methods__ZL26PyvtkGenericEdgeTable_Type__ZL29PyvtkGenericEdgeTable_Methods__ZL42PyvtkGenericInterpolatedVelocityField_Type__ZL45PyvtkGenericInterpolatedVelocityField_Methods__ZL30PyvtkGenericPointIterator_Type__ZL33PyvtkGenericPointIterator_Methods__ZL39PyvtkGenericSubdivisionErrorMetric_Type__ZL42PyvtkGenericSubdivisionErrorMetric_Methods__ZL30PyvtkGeometricErrorMetric_Type__ZL33PyvtkGeometricErrorMetric_Methods__ZL18PyvtkEdgeBase_Type__ZL21PyvtkOutEdgeType_Type__ZL39PyvtkOutEdgeType_vtkOutEdgeType_Methods__ZL20PyvtkInEdgeType_Type__ZL37PyvtkInEdgeType_vtkInEdgeType_Methods__ZL18PyvtkEdgeType_Type__ZL33PyvtkEdgeType_vtkEdgeType_Methods__ZL15PyvtkGraph_Type__ZL18PyvtkGraph_Methods__ZL26PyvtkGraph_GetData_Methods__ZL19PyvtkGraphEdge_Type__ZL22PyvtkGraphEdge_Methods__ZL29PyvtkVertexAdjacencyList_Type__ZL55PyvtkVertexAdjacencyList_vtkVertexAdjacencyList_Methods__ZL24PyvtkGraphInternals_Type__ZL27PyvtkGraphInternals_Methods__ZL24PyvtkHexagonalPrism_Type__ZL27PyvtkHexagonalPrism_Methods__ZL20PyvtkHexahedron_Type__ZL23PyvtkHexahedron_Methods__ZL37PyvtkHierarchicalBoxDataIterator_Type__ZL40PyvtkHierarchicalBoxDataIterator_Methods__ZL32PyvtkHierarchicalBoxDataSet_Type__ZL35PyvtkHierarchicalBoxDataSet_Methods__ZL43PyvtkHierarchicalBoxDataSet_GetData_Methods__ZL19PyvtkHyperTree_Type__ZL22PyvtkHyperTree_Methods__ZL31PyvtkHyperTree_GetScale_Methods__ZL25PyvtkHyperTreeCursor_Type__ZL28PyvtkHyperTreeCursor_Methods__ZL23PyvtkHyperTreeGrid_Type__ZL26PyvtkHyperTreeGrid_Methods__ZL34PyvtkHyperTreeGrid_GetData_Methods__ZL29PyvtkHyperTreeGridCursor_Type__ZL32PyvtkHyperTreeGridCursor_Methods__ZL19PyvtkImageData_Type__ZL22PyvtkImageData_Methods__ZL36PyvtkImageData_GetIncrements_Methods__ZL36PyvtkImageData_GetScalarType_Methods__ZL50PyvtkImageData_GetNumberOfScalarComponents_Methods__ZL30PyvtkImageData_GetData_Methods__ZL39PyvtkImplicitBoolean_OperationType_Type__ZL25PyvtkImplicitBoolean_Type__ZL28PyvtkImplicitBoolean_Methods__ZL25PyvtkImplicitDataSet_Type__ZL28PyvtkImplicitDataSet_Methods__ZL36PyvtkImplicitFunctionCollection_Type__ZL39PyvtkImplicitFunctionCollection_Methods__ZL26PyvtkImplicitFunction_Type__ZL29PyvtkImplicitFunction_Methods__ZL42PyvtkImplicitFunction_SetTransform_Methods__ZL22PyvtkImplicitHalo_Type__ZL25PyvtkImplicitHalo_Methods__ZL31PyvtkImplicitSelectionLoop_Type__ZL34PyvtkImplicitSelectionLoop_Methods__ZL21PyvtkImplicitSum_Type__ZL24PyvtkImplicitSum_Methods__ZL24PyvtkImplicitVolume_Type__ZL27PyvtkImplicitVolume_Methods__ZL32PyvtkImplicitWindowFunction_Type__ZL35PyvtkImplicitWindowFunction_Methods__ZL31PyvtkIncrementalOctreeNode_Type__ZL34PyvtkIncrementalOctreeNode_Methods__ZL39PyvtkIncrementalOctreePointLocator_Type__ZL42PyvtkIncrementalOctreePointLocator_Methods__ZL33PyvtkIncrementalPointLocator_Type__ZL36PyvtkIncrementalPointLocator_Methods__ZL24PyvtkInEdgeIterator_Type__ZL27PyvtkInEdgeIterator_Methods__ZL59PyvtkInformationQuadratureSchemeDefinitionVectorKey_Methods__ZL40PyvtkIterativeClosestPointTransform_Type__ZL43PyvtkIterativeClosestPointTransform_Methods__ZL16PyvtkKdNode_Type__ZL19PyvtkKdNode_Methods__ZL16PyvtkKdTree_Type__ZL19PyvtkKdTree_Methods__ZL33PyvtkKdTree_RemoveDataSet_Methods__ZL35PyvtkKdTree_CreateCellLists_Methods__ZL32PyvtkKdTree_GetCellLists_Methods__ZL43PyvtkKdTree_GetRegionContainingCell_Methods__ZL42PyvtkKdTree_BuildLocatorFromPoints_Methods__ZL28PyvtkKdTreePointLocator_Type__ZL31PyvtkKdTreePointLocator_Methods__ZL23PyvtkLagrangeCurve_Type__ZL26PyvtkLagrangeCurve_Methods__ZL51PyvtkLagrangeCurve_SubCellCoordinatesFromId_Methods__ZL28PyvtkLagrangeHexahedron_Type__ZL31PyvtkLagrangeHexahedron_Methods__ZL49PyvtkLagrangeHexahedron_PointIndexFromIJK_Methods__ZL41PyvtkLagrangeInterpolation_Constants_Type__ZL31PyvtkLagrangeInterpolation_Type__ZL34PyvtkLagrangeInterpolation_Methods__ZL31PyvtkLagrangeQuadrilateral_Type__ZL34PyvtkLagrangeQuadrilateral_Methods__ZL52PyvtkLagrangeQuadrilateral_PointIndexFromIJK_Methods__ZL23PyvtkLagrangeTetra_Type__ZL26PyvtkLagrangeTetra_Methods__ZL26PyvtkLagrangeTriangle_Type__ZL29PyvtkLagrangeTriangle_Methods__ZL23PyvtkLagrangeWedge_Type__ZL26PyvtkLagrangeWedge_Methods__ZL44PyvtkLagrangeWedge_PointIndexFromIJK_Methods__ZL57PyvtkLagrangeWedge_GetNumberOfApproximatingWedges_Methods__ZL14PyvtkLine_Type__ZL17PyvtkLine_Methods__ZL17PyvtkLocator_Type__ZL20PyvtkLocator_Methods__ZL34PyvtkMarchingSquaresLineCases_Type__ZL65PyvtkMarchingSquaresLineCases_vtkMarchingSquaresLineCases_Methods__ZL36PyvtkMarchingCubesTriangleCases_Type__ZL69PyvtkMarchingCubesTriangleCases_vtkMarchingCubesTriangleCases_Methods__ZL42PyvtkMeanValueCoordinatesInterpolator_Type__ZL45PyvtkMeanValueCoordinatesInterpolator_Methods__ZL73PyvtkMeanValueCoordinatesInterpolator_ComputeInterpolationWeights_Methods__ZL21PyvtkMergePoints_Type__ZL24PyvtkMergePoints_Methods__ZL27PyvtkMultiBlockDataSet_Type__ZL30PyvtkMultiBlockDataSet_Methods__ZL42PyvtkMultiBlockDataSet_HasMetaData_Methods__ZL42PyvtkMultiBlockDataSet_GetMetaData_Methods__ZL38PyvtkMultiBlockDataSet_GetData_Methods__ZL27PyvtkMultiPieceDataSet_Type__ZL30PyvtkMultiPieceDataSet_Methods__ZL42PyvtkMultiPieceDataSet_HasMetaData_Methods__ZL42PyvtkMultiPieceDataSet_GetMetaData_Methods__ZL38PyvtkMultiPieceDataSet_GetData_Methods__ZL30PyvtkMutableDirectedGraph_Type__ZL33PyvtkMutableDirectedGraph_Methods__ZL43PyvtkMutableDirectedGraph_AddVertex_Methods__ZL41PyvtkMutableDirectedGraph_AddEdge_Methods__ZL47PyvtkMutableDirectedGraph_LazyAddVertex_Methods__ZL45PyvtkMutableDirectedGraph_LazyAddEdge_Methods__ZL32PyvtkMutableUndirectedGraph_Type__ZL35PyvtkMutableUndirectedGraph_Methods__ZL45PyvtkMutableUndirectedGraph_AddVertex_Methods__ZL43PyvtkMutableUndirectedGraph_AddEdge_Methods__ZL49PyvtkMutableUndirectedGraph_LazyAddVertex_Methods__ZL47PyvtkMutableUndirectedGraph_LazyAddEdge_Methods__ZL23PyvtkNonLinearCell_Type__ZL26PyvtkNonLinearCell_Methods__ZL32PyvtkNonMergingPointLocator_Type__ZL35PyvtkNonMergingPointLocator_Methods__ZL28PyvtkOctreePointLocator_Type__ZL31PyvtkOctreePointLocator_Methods__ZL32PyvtkOctreePointLocatorNode_Type__ZL35PyvtkOctreePointLocatorNode_Methods__ZL29PyvtkOrderedTriangulator_Type__ZL32PyvtkOrderedTriangulator_Methods__ZL42PyvtkOrderedTriangulator_AddTetras_Methods__ZL25PyvtkOutEdgeIterator_Type__ZL28PyvtkOutEdgeIterator_Methods__ZL31PyvtkPath_ControlPointType_Type__ZL14PyvtkPath_Type__ZL17PyvtkPath_Methods__ZL25PyvtkPath_GetData_Methods__ZL25PyvtkPentagonalPrism_Type__ZL28PyvtkPentagonalPrism_Methods__ZL21PyvtkPerlinNoise_Type__ZL24PyvtkPerlinNoise_Methods__ZL27PyvtkPiecewiseFunction_Type__ZL30PyvtkPiecewiseFunction_Methods__ZL38PyvtkPiecewiseFunction_GetData_Methods__ZL15PyvtkPixel_Type__ZL18PyvtkPixel_Methods__ZL21PyvtkPixelExtent_Type__ZL24PyvtkPixelExtent_Methods__ZL39PyvtkPixelExtent_vtkPixelExtent_Methods__ZL29PyvtkPixelExtent_Grow_Methods__ZL31PyvtkPixelExtent_Shrink_Methods__ZL30PyvtkPixelExtent_Shift_Methods__ZL23PyvtkPixelTransfer_Type__ZL26PyvtkPixelTransfer_Methods__ZL43PyvtkPixelTransfer_vtkPixelTransfer_Methods__ZL25PyvtkPlaneCollection_Type__ZL28PyvtkPlaneCollection_Methods__ZL15PyvtkPlane_Type__ZL18PyvtkPlane_Methods__ZL16PyvtkPlanes_Type__ZL19PyvtkPlanes_Methods__ZL28PyvtkPlanesIntersection_Type__ZL31PyvtkPlanesIntersection_Methods__ZL19PyvtkPointData_Type__ZL22PyvtkPointData_Methods__ZL22PyvtkPointLocator_Type__ZL25PyvtkPointLocator_Methods__ZL18PyvtkPointSet_Type__ZL21PyvtkPointSet_Methods__ZL29PyvtkPointSet_GetData_Methods__ZL30PyvtkPointSetCellIterator_Type__ZL33PyvtkPointSetCellIterator_Methods__ZL29PyvtkPointsProjectedHull_Type__ZL32PyvtkPointsProjectedHull_Methods__ZL31PyvtkPolyDataCollection_Methods__ZL21PyvtkPolyData_Methods__ZL29PyvtkPolyData_GetCell_Methods__ZL30PyvtkPolyData_Allocate_Methods__ZL29PyvtkPolyData_GetData_Methods__ZL49PyvtkPolyData_GetScalarFieldCriticalIndex_Methods__ZL17PyvtkPolygon_Type__ZL20PyvtkPolygon_Methods__ZL34PyvtkPolygon_ComputeNormal_Methods__ZL20PyvtkPolyhedron_Type__ZL23PyvtkPolyhedron_Methods__ZL18PyvtkPolyLine_Type__ZL21PyvtkPolyLine_Methods__ZL19PyvtkPolyPlane_Type__ZL22PyvtkPolyPlane_Methods__ZL20PyvtkPolyVertex_Type__ZL23PyvtkPolyVertex_Methods__ZL17PyvtkPyramid_Type__ZL20PyvtkPyramid_Methods__ZL14PyvtkQuad_Type__ZL17PyvtkQuad_Methods__ZL23PyvtkQuadraticEdge_Type__ZL26PyvtkQuadraticEdge_Methods__ZL29PyvtkQuadraticHexahedron_Type__ZL32PyvtkQuadraticHexahedron_Methods__ZL29PyvtkQuadraticLinearQuad_Type__ZL32PyvtkQuadraticLinearQuad_Methods__ZL30PyvtkQuadraticLinearWedge_Type__ZL33PyvtkQuadraticLinearWedge_Methods__ZL26PyvtkQuadraticPolygon_Type__ZL29PyvtkQuadraticPolygon_Methods__ZL26PyvtkQuadraticPyramid_Type__ZL29PyvtkQuadraticPyramid_Methods__ZL23PyvtkQuadraticQuad_Type__ZL26PyvtkQuadraticQuad_Methods__ZL24PyvtkQuadraticTetra_Type__ZL27PyvtkQuadraticTetra_Methods__ZL27PyvtkQuadraticTriangle_Type__ZL30PyvtkQuadraticTriangle_Methods__ZL24PyvtkQuadraticWedge_Type__ZL27PyvtkQuadraticWedge_Methods__ZL36PyvtkQuadratureSchemeDefinition_Type__ZL39PyvtkQuadratureSchemeDefinition_Methods__ZL17PyvtkQuadric_Type__ZL20PyvtkQuadric_Methods__ZL25PyvtkRectilinearGrid_Type__ZL28PyvtkRectilinearGrid_Methods__ZL36PyvtkRectilinearGrid_GetData_Methods__ZL19PyvtkReebGraph_Type__ZL22PyvtkReebGraph_Methods__ZL28PyvtkReebGraph_Build_Methods__ZL39PyvtkReebGraphSimplificationMetric_Type__ZL42PyvtkReebGraphSimplificationMetric_Methods__ZL19PyvtkSelection_Type__ZL22PyvtkSelection_Methods__ZL33PyvtkSelection_RemoveNode_Methods__ZL28PyvtkSelection_Union_Methods__ZL31PyvtkSelection_Subtract_Methods__ZL30PyvtkSelection_GetData_Methods__ZL40PyvtkSelectionNode_SelectionContent_Type__ZL38PyvtkSelectionNode_SelectionField_Type__ZL23PyvtkSelectionNode_Type__ZL26PyvtkSelectionNode_Methods__ZL31PyvtkSimpleCellTessellator_Type__ZL34PyvtkSimpleCellTessellator_Methods__ZL27PyvtkSmoothErrorMetric_Type__ZL30PyvtkSmoothErrorMetric_Methods__ZL23PyvtkSortFieldData_Type__ZL26PyvtkSortFieldData_Methods__ZL16PyvtkSphere_Type__ZL19PyvtkSphere_Methods__ZL16PyvtkSpline_Type__ZL19PyvtkSpline_Methods__ZL28PyvtkStaticCellLinks_Methods__ZL27PyvtkStaticCellLocator_Type__ZL30PyvtkStaticCellLocator_Methods__ZL28PyvtkStaticPointLocator_Type__ZL31PyvtkStaticPointLocator_Methods__ZL24PyvtkStructuredData_Type__ZL27PyvtkStructuredData_Methods__ZL44PyvtkStructuredData_GetDataDimension_Methods__ZL26PyvtkStructuredExtent_Type__ZL29PyvtkStructuredExtent_Methods__ZL24PyvtkStructuredGrid_Type__ZL27PyvtkStructuredGrid_Methods__ZL35PyvtkStructuredGrid_GetData_Methods__ZL36PyvtkStructuredPointsCollection_Type__ZL39PyvtkStructuredPointsCollection_Methods__ZL26PyvtkStructuredPoints_Type__ZL29PyvtkStructuredPoints_Methods__ZL22PyvtkSuperquadric_Type__ZL25PyvtkSuperquadric_Methods__ZL15PyvtkTable_Type__ZL18PyvtkTable_Methods__ZL26PyvtkTable_GetData_Methods__ZL15PyvtkTetra_Type__ZL18PyvtkTetra_Methods__ZL25PyvtkTreeBFSIterator_Type__ZL28PyvtkTreeBFSIterator_Methods__ZL14PyvtkTree_Type__ZL17PyvtkTree_Methods__ZL25PyvtkTree_GetData_Methods__ZL34PyvtkTreeDFSIterator_ModeType_Type__ZL25PyvtkTreeDFSIterator_Type__ZL28PyvtkTreeDFSIterator_Methods__ZL18PyvtkTriangle_Type__ZL21PyvtkTriangle_Methods__ZL35PyvtkTriangle_ComputeNormal_Methods__ZL36PyvtkTriangle_ComputeQuadric_Methods__ZZL31PyvtkTriangle_ComputeQuadric_s1P7_objectS0_E5size3__ZL23PyvtkTriangleStrip_Type__ZL26PyvtkTriangleStrip_Methods__ZL32PyvtkTriQuadraticHexahedron_Type__ZL35PyvtkTriQuadraticHexahedron_Methods__ZL25PyvtkUndirectedGraph_Type__ZL28PyvtkUndirectedGraph_Methods__ZL36PyvtkUndirectedGraph_GetData_Methods__ZL21PyvtkUniformGrid_Type__ZL24PyvtkUniformGrid_Methods__ZL32PyvtkUniformGrid_GetData_Methods__ZL26PyvtkUnstructuredGrid_Type__ZL29PyvtkUnstructuredGrid_Methods__ZL38PyvtkUnstructuredGrid_SetCells_Methods__ZL37PyvtkUnstructuredGrid_GetData_Methods__ZL54PyvtkUnstructuredGrid_DecomposeAPolyhedronCell_Methods__ZL30PyvtkUnstructuredGridBase_Type__ZL33PyvtkUnstructuredGridBase_Methods__ZL41PyvtkUnstructuredGridBase_GetData_Methods__ZL38PyvtkUnstructuredGridCellIterator_Type__ZL41PyvtkUnstructuredGridCellIterator_Methods__ZL16PyvtkVertex_Type__ZL19PyvtkVertex_Methods__ZL28PyvtkVertexListIterator_Type__ZL31PyvtkVertexListIterator_Methods__ZL15PyvtkVoxel_Type__ZL18PyvtkVoxel_Methods__ZL15PyvtkWedge_Type__ZL18PyvtkWedge_Methods__ZL24PyvtkXMLDataElement_Type__ZL27PyvtkXMLDataElement_Methods__ZL46PyvtkXMLDataElement_GetScalarAttribute_Methods__ZL46PyvtkXMLDataElement_GetVectorAttribute_Methods__ZL46PyvtkXMLDataElement_SetVectorAttribute_Methods__ZL22PyvtkTreeIterator_Type__ZL25PyvtkTreeIterator_Methods__ZL21PyvtkBoundingBox_Type__ZL24PyvtkBoundingBox_Methods__ZL39PyvtkBoundingBox_vtkBoundingBox_Methods__ZL14PyvtkAtom_Type__ZL17PyvtkAtom_Methods__ZL25PyvtkAtom_vtkAtom_Methods__ZL29PyvtkAtom_SetPosition_Methods__ZL14PyvtkBond_Type__ZL17PyvtkBond_Methods__ZL25PyvtkBond_vtkBond_Methods__ZL18PyvtkMolecule_Type__ZL21PyvtkMolecule_Methods__ZL32PyvtkMolecule_AppendBond_Methods__ZL32PyvtkAbstractElectronicData_Type__ZL35PyvtkAbstractElectronicData_Methods__ZL24PyvtkVector_IdLi4EE_Type__ZL27PyvtkVector_IdLi4EE_Methods__ZL37PyvtkVector_IdLi4EE_vtkVector_Methods__ZL24PyvtkVector_IfLi4EE_Type__ZL27PyvtkVector_IfLi4EE_Methods__ZL37PyvtkVector_IfLi4EE_vtkVector_Methods__ZL24PyvtkVector_IiLi4EE_Type__ZL27PyvtkVector_IiLi4EE_Methods__ZL37PyvtkVector_IiLi4EE_vtkVector_Methods__ZL24PyvtkVector_IdLi2EE_Type__ZL27PyvtkVector_IdLi2EE_Methods__ZL37PyvtkVector_IdLi2EE_vtkVector_Methods__ZL24PyvtkVector_IfLi2EE_Type__ZL27PyvtkVector_IfLi2EE_Methods__ZL37PyvtkVector_IfLi2EE_vtkVector_Methods__ZL24PyvtkVector_IiLi2EE_Type__ZL27PyvtkVector_IiLi2EE_Methods__ZL37PyvtkVector_IiLi2EE_vtkVector_Methods__ZL24PyvtkVector_IdLi3EE_Type__ZL27PyvtkVector_IdLi3EE_Methods__ZL37PyvtkVector_IdLi3EE_vtkVector_Methods__ZL24PyvtkVector_IfLi3EE_Type__ZL27PyvtkVector_IfLi3EE_Methods__ZL37PyvtkVector_IfLi3EE_vtkVector_Methods__ZL24PyvtkVector_IiLi3EE_Type__ZL27PyvtkVector_IiLi3EE_Methods__ZL37PyvtkVector_IiLi3EE_vtkVector_Methods__ZL21PyvtkVector2_IdE_Type__ZL24PyvtkVector2_IdE_Methods__ZL35PyvtkVector2_IdE_vtkVector2_Methods__ZL21PyvtkVector2_IfE_Type__ZL24PyvtkVector2_IfE_Methods__ZL35PyvtkVector2_IfE_vtkVector2_Methods__ZL21PyvtkVector2_IiE_Type__ZL24PyvtkVector2_IiE_Methods__ZL35PyvtkVector2_IiE_vtkVector2_Methods__ZL21PyvtkVector3_IdE_Type__ZL24PyvtkVector3_IdE_Methods__ZL35PyvtkVector3_IdE_vtkVector3_Methods__ZL21PyvtkVector3_IfE_Type__ZL24PyvtkVector3_IfE_Methods__ZL35PyvtkVector3_IfE_vtkVector3_Methods__ZL21PyvtkVector3_IiE_Type__ZL24PyvtkVector3_IiE_Methods__ZL35PyvtkVector3_IiE_vtkVector3_Methods__ZL18PyvtkVector2i_Type__ZL21PyvtkVector2i_Methods__ZL33PyvtkVector2i_vtkVector2i_Methods__ZL18PyvtkVector2f_Type__ZL21PyvtkVector2f_Methods__ZL33PyvtkVector2f_vtkVector2f_Methods__ZL18PyvtkVector2d_Type__ZL21PyvtkVector2d_Methods__ZL33PyvtkVector2d_vtkVector2d_Methods__ZL18PyvtkVector3i_Type__ZL21PyvtkVector3i_Methods__ZL33PyvtkVector3i_vtkVector3i_Methods__ZL18PyvtkVector3f_Type__ZL21PyvtkVector3f_Methods__ZL33PyvtkVector3f_vtkVector3f_Methods__ZL18PyvtkVector3d_Type__ZL21PyvtkVector3d_Methods__ZL33PyvtkVector3d_vtkVector3d_Methods__ZL20PyvtkColor3_IdE_Type__ZL23PyvtkColor3_IdE_Methods__ZL33PyvtkColor3_IdE_vtkColor3_Methods__ZL20PyvtkColor3_IfE_Type__ZL23PyvtkColor3_IfE_Methods__ZL33PyvtkColor3_IfE_vtkColor3_Methods__ZL20PyvtkColor3_IhE_Type__ZL23PyvtkColor3_IhE_Methods__ZL33PyvtkColor3_IhE_vtkColor3_Methods__ZL20PyvtkColor4_IdE_Type__ZL23PyvtkColor4_IdE_Methods__ZL33PyvtkColor4_IdE_vtkColor4_Methods__ZL20PyvtkColor4_IfE_Type__ZL23PyvtkColor4_IfE_Methods__ZL33PyvtkColor4_IfE_vtkColor4_Methods__ZL20PyvtkColor4_IhE_Type__ZL23PyvtkColor4_IhE_Methods__ZL33PyvtkColor4_IhE_vtkColor4_Methods__ZL18PyvtkColor3ub_Type__ZL33PyvtkColor3ub_vtkColor3ub_Methods__ZL17PyvtkColor3f_Type__ZL31PyvtkColor3f_vtkColor3f_Methods__ZL17PyvtkColor3d_Type__ZL31PyvtkColor3d_vtkColor3d_Methods__ZL18PyvtkColor4ub_Type__ZL33PyvtkColor4ub_vtkColor4ub_Methods__ZL17PyvtkColor4f_Type__ZL31PyvtkColor4f_vtkColor4f_Methods__ZL17PyvtkColor4d_Type__ZL31PyvtkColor4d_vtkColor4d_Methods__ZL18PyvtkRect_IdE_Type__ZL21PyvtkRect_IdE_Methods__ZL29PyvtkRect_IdE_vtkRect_Methods__ZL18PyvtkRect_IfE_Type__ZL21PyvtkRect_IfE_Methods__ZL29PyvtkRect_IfE_vtkRect_Methods__ZL18PyvtkRect_IiE_Type__ZL21PyvtkRect_IiE_Methods__ZL29PyvtkRect_IiE_vtkRect_Methods__ZL15PyvtkRecti_Type__ZL27PyvtkRecti_vtkRecti_Methods__ZL15PyvtkRectf_Type__ZL27PyvtkRectf_vtkRectf_Methods__ZL15PyvtkRectd_Type__ZL27PyvtkRectd_vtkRectd_Methods__ZL27PyvtkNonOverlappingAMR_Type__ZL30PyvtkNonOverlappingAMR_Methods__ZL38PyvtkNonOverlappingAMR_GetData_Methods__ZL24PyvtkOverlappingAMR_Type__ZL27PyvtkOverlappingAMR_Methods__ZL35PyvtkOverlappingAMR_GetData_Methods__ZL46PyvtkOverlappingAMR_GetRefinementRatio_Methods__ZL24PyvtkAMRInformation_Type__ZL27PyvtkAMRInformation_Methods__ZL36PyvtkAMRInformation_FindGrid_Methods__ZL26PyvtkAMRDataInternals_Type__ZL29PyvtkAMRDataInternals_Methods__ZL24PyvtkUniformGridAMR_Type__ZL27PyvtkUniformGridAMR_Methods__ZL35PyvtkUniformGridAMR_GetData_Methods__ZL36PyvtkUniformGridAMRDataIterator_Type__ZL39PyvtkUniformGridAMRDataIterator_Methods__ZL21PyvtkHyperOctree_Type__ZL24PyvtkHyperOctree_Methods__ZL38PyvtkHyperOctreeLightWeightCursor_Type__ZL41PyvtkHyperOctreeLightWeightCursor_Methods__ZL73PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_Methods__ZL32PyvtkHyperOctree_GetData_Methods__ZL27PyvtkHyperOctreeCursor_Type__ZL30PyvtkHyperOctreeCursor_Methods__ZL34PyvtkHyperOctreePointsGrabber_Type__ZL37PyvtkHyperOctreePointsGrabber_Methods__ZL33PyvtkCommonDataModelPython_Module__ZL28vtkDebugLeaksManagerInstance__ZL39vtkObjectFactoryRegistryCleanupInstance__ZL19PyvtkCellArray_Type__ZL19PyvtkCellTypes_Type__ZL21PyvtkEdgeBase_Methods__ZL24PyvtkOutEdgeType_Methods__ZL23PyvtkInEdgeType_Methods__ZL21PyvtkEdgeType_Methods__ZL32PyvtkVertexAdjacencyList_Methods__ZL38vtkCommonInformationKeyManagerInstance__ZL56PyvtkInformationQuadratureSchemeDefinitionVectorKey_Type__ZL37PyvtkMarchingSquaresLineCases_Methods__ZL39PyvtkMarchingCubesTriangleCases_Methods__ZL28PyvtkPolyDataCollection_Type__ZL18PyvtkPolyData_Type__ZL25PyvtkStaticCellLinks_Type__ZL21PyvtkColor3ub_Methods__ZL20PyvtkColor3f_Methods__ZL20PyvtkColor3d_Methods__ZL21PyvtkColor4ub_Methods__ZL20PyvtkColor4f_Methods__ZL20PyvtkColor4d_Methods__ZL18PyvtkRecti_Methods__ZL18PyvtkRectf_Methods__ZL18PyvtkRectd_Methods__ZL34PyvtkCommonDataModelPython_Methods