ELF>n@@21 UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tH@ATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_THuHcDHH(H;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_PHuHcDHHHH;tЉfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19uPtHEuPHHuHHDHEH@H;u;uPtˉuPHfH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19uTtHEuTHHuHHDHEH H;u;uTtˉuTHfH@H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAH@H;uIGPt GPHuHHfDHXH;t@1DH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAH@H;uIPt GPHuHHHPH;t@fH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAH H;uIGTt GTHuHHfDH8H;t@1DH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAH H;uITt GTHuHHH0H;t@fATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$uXHELH@H;ulH=tLH=u)HeHcZfDLLH=tL븐HЉfATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uMH0[fDHHuӐu$HHufDf.SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uMH0[fDHHuӐu$HHuHcDf.UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uNH0]fDHHuӐu$HHHuH@HfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uNH0]fDHHuӐu$HHHuH@HfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uMH0[fDHHuӐu$HHuHcDf.H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$HHuHH@ff.H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$HHuHH@9wTtHwTGT9wPtHwPGPSafeDownCastvtkObjectBasevtkDataObjectTreeIteratorIsTypeOfNewInstanceGetVisitOnlyLeavesGetTraverseSubTreeSetTraverseSubTreeSetVisitOnlyLeavesTraverseSubTreeOffTraverseSubTreeOnVisitOnlyLeavesOffVisitOnlyLeavesOnIsAGetCurrentFlatIndexHasCurrentMetaDataGetCurrentMetaDataGetCurrentDataObjectIsDoneWithTraversalGoToNextItemGoToFirstItemvtkCompositeDataIteratorvtkObjectUH=Hu]ÐHH=tHH=tH]HH@H;u!WPtGPD1HH H;u!WTtGTD1HH@H;u!PtGPfDHH H;u!TtGTfDvtkDataObjectTreeIterator - superclass for composite data iterators Superclass: vtkCompositeDataIterator vtkDataObjectTreeIterator provides an interface for accessing datasets in a collection (vtkDataObjectTreeIterator). vtkCommonDataModelPython.vtkDataObjectTreeIteratorV.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) -> 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. V.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. V.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. V.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. V.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. V.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. V.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. V.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. V.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. UH-HH=HHH]HHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx 0DXl  EDPa AE OEY B j<<??((EAD`n AAF TgFD@ EE xED@ AG ED@ AG <EDP AG <EDP AG  H@ E $H@ E @ H@ E \H@ E 0xnFAA D`  AABH MFF0OFDD n ABA DDB:Em ED@ AG <ED@ AG `ED@ AG ED@ AG ED@ AG H@ I H@ I c  - g  g ` @V < `<   U   n&+(!"T":   W  p P 0&(OT Y^5chm>rJw]|p 3GT!" "?"t"" *Ve"O"<3I"<~"?"?  K ] s     P M     OA V b z      L     $ 7 H [ s      _ZL37PyvtkDataObjectTreeIterator_StaticNewv_ZL40PyvtkDataObjectTreeIterator_SafeDownCastP7_objectS0__ZL36PyvtkDataObjectTreeIterator_IsTypeOfP7_objectS0__ZL39PyvtkDataObjectTreeIterator_NewInstanceP7_objectS0__ZL46PyvtkDataObjectTreeIterator_GetVisitOnlyLeavesP7_objectS0__ZL46PyvtkDataObjectTreeIterator_GetTraverseSubTreeP7_objectS0__ZL46PyvtkDataObjectTreeIterator_SetTraverseSubTreeP7_objectS0__ZL46PyvtkDataObjectTreeIterator_SetVisitOnlyLeavesP7_objectS0__ZL46PyvtkDataObjectTreeIterator_TraverseSubTreeOffP7_objectS0__ZL45PyvtkDataObjectTreeIterator_TraverseSubTreeOnP7_objectS0__ZL46PyvtkDataObjectTreeIterator_VisitOnlyLeavesOffP7_objectS0__ZL45PyvtkDataObjectTreeIterator_VisitOnlyLeavesOnP7_objectS0__ZL31PyvtkDataObjectTreeIterator_IsAP7_objectS0__ZL32PyvtkDataObjectTreeIterator_Type_ZL35PyvtkDataObjectTreeIterator_Methods_GLOBAL__sub_I_vtkDataObjectTreeIteratorPython.cxx_ZStL8__ioinit_ZL47PyvtkDataObjectTreeIterator_GetCurrentFlatIndexP7_objectS0__ZL46PyvtkDataObjectTreeIterator_HasCurrentMetaDataP7_objectS0__ZL46PyvtkDataObjectTreeIterator_GetCurrentMetaDataP7_objectS0__ZL48PyvtkDataObjectTreeIterator_GetCurrentDataObjectP7_objectS0__ZL47PyvtkDataObjectTreeIterator_IsDoneWithTraversalP7_objectS0__ZL40PyvtkDataObjectTreeIterator_GoToNextItemP7_objectS0__ZL41PyvtkDataObjectTreeIterator_GoToFirstItemP7_objectS0_.LC0.LC1.LC2.LC5.LC3.LC4.LC6.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC16_ZN25vtkDataObjectTreeIterator18SetVisitOnlyLeavesEi_ZN25vtkDataObjectTreeIterator18GetVisitOnlyLeavesEv_ZN25vtkDataObjectTreeIterator18SetTraverseSubTreeEi_ZN25vtkDataObjectTreeIterator18GetTraverseSubTreeEv_ZN25vtkDataObjectTreeIterator3NewEv_ZNK25vtkDataObjectTreeIterator19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN25vtkDataObjectTreeIterator3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN25vtkDataObjectTreeIterator18TraverseSubTreeOffEv_GLOBAL_OFFSET_TABLE__ZN25vtkDataObjectTreeIterator18VisitOnlyLeavesOffEv_ZN25vtkDataObjectTreeIterator17TraverseSubTreeOnEv_ZN25vtkDataObjectTreeIterator17VisitOnlyLeavesOnEv_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1_PyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN13vtkPythonArgs8GetValueERi_Py_NoneStructPyvtkDataObjectTreeIterator_ClassNewPyVTKClass_AddPyvtkCompositeDataIterator_ClassNewPyType_ReadyPyVTKAddFile_vtkDataObjectTreeIteratorPyDict_SetItemString_Py_Dealloc_ZNSt8ios_base4InitC1Ev_ZNSt8ios_base4InitD1Ev__dso_handle__cxa_atexit_ZN25vtkDataObjectTreeIterator19GetCurrentFlatIndexEv_ZN25vtkDataObjectTreeIterator18HasCurrentMetaDataEv_ZN25vtkDataObjectTreeIterator18GetCurrentMetaDataEv_ZN25vtkDataObjectTreeIterator20GetCurrentDataObjectEv_ZN25vtkDataObjectTreeIterator19IsDoneWithTraversalEv_ZN25vtkDataObjectTreeIterator12GoToNextItemEv_ZN25vtkDataObjectTreeIterator13GoToFirstItemEvPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,+`I,J-KLKM .JI}V-O/OKW0OPM1_IX*HG-KLYZ%[4KSM2IXKW-*D:Ma3IXKW *FMA4IX\K*].*EXM5IX\EKQ*]n*CM6 I1XQ*ElKx*]*QM7 IA Xa *E{ K *] *T M 8- IQ Xq *C K *] *S M 9= Ia X *C K *] *U M :f I X V *N - O / O K W& 0+ O7 PJ MY )g -n *v _| ) ` ) a ^ - c;^IXKWiM<>IaXKWjM=IAXaKnLykM>I!XAKNLYlcM?IX K-W9mBMp@IXK *]n MPAIXK*]oMG dG-O&/+O90>OKP*E*C*E*Ce*f!g&h-B5)p0qXrstuvwx8y@z 5   ( 8(@ HX ` >hx T0 GPx 3p    (8@ H X` h`x  J`   8  x p  ]@  (8@ HXp 4H\p   ,X|`@ ` (D ` | P   @dpP0.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN25vtkDataObjectTreeIterator18SetVisitOnlyLeavesEi.text._ZN25vtkDataObjectTreeIterator18GetVisitOnlyLeavesEv.text._ZN25vtkDataObjectTreeIterator18SetTraverseSubTreeEi.text._ZN25vtkDataObjectTreeIterator18GetTraverseSubTreeEv.rela.text._ZNK25vtkDataObjectTreeIterator19NewInstanceInternalEv.rodata.str1.1.rodata._ZN25vtkDataObjectTreeIterator3IsAEPKc.str1.1.rela.text._ZN25vtkDataObjectTreeIterator3IsAEPKc.rela.text._ZN25vtkDataObjectTreeIterator18TraverseSubTreeOffEv.rela.text._ZN25vtkDataObjectTreeIterator18VisitOnlyLeavesOffEv.rela.text._ZN25vtkDataObjectTreeIterator17TraverseSubTreeOnEv.rela.text._ZN25vtkDataObjectTreeIterator17VisitOnlyLeavesOnEv.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.groupf@/CfH/DfP/EfX/Ff` /Hfl /Nfx /Qf /Sf /Tf /U @OP/ &,1l"  @_/_2)bn2#O@_/<@`/@<@`/[?V@`/?@`/2NP.:@`/".@a/$ . @a /&@0 @bX/(+02,42D2 \3W@(h/-7 0C B @km