X X1xX1__text__TEXTnx3__data__DATAp  9F__cstring__TEXTy__compact_unwind__LD+-P;__eh_frame__TEXT-H0 h2  <>? P&UHH=H5HwH uHH=H]ÐUH]fDUHSPHH=H5HH uHH=H5HHt H tH[]H=H[]fUHAVSH0HuHHEЋFEHEHEH}ȃuoHutqH]H=OHAt1H=~)HtH=)Ht HLcHuL1H0[A^]f.@UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)AuhHuH}}L}tlH=>LAtbH=m(LtOH=s(Lt}utBA9vTtAvTILHu6H}1H([A^A_]IL HuHHfDUHAVSH HuHHEDvDuHG]]y HHt H(HtD9uEt"_THt*11H}111 H(HuHcHHH [A^]UHAVSH HuHWHEDvDuHG]]y HHt+H(Ht"D9u!Et-H Ht(1.H}111H0HuHHHH [A^]f.DUHAVSH HuHHEDvDuHG]]y HHt(H(HtD9uEt*H1 Ht(1.H}111H8HuHHHH [A^]fUHAWAVSH(HuH~HED~D}HG]ԉ]؅y HHtaLw(MtXA)Au}utBA9vPtAvPILHu6H}1H([A^A_]IL@HuHHfDUHAVSH HuHHEDvDuHG]]y HHt H(HtD9uEt"_PHt*11H}111 HHHuHcHHH [A^]UHAVSH HuHHEDvDuHG]]y HHt+H(Ht"D9u!Et-H@Ht(1.H}111HPHuHHHH [A^]f.DUHAVSH HuHHEDvDuHG]]y HHt(H(HtD9uEt*H1@Ht(1.H}111HXHuHHHH [A^]HDVb;H , m""$$''((( )))vtkDataObjectTreeIteratorvtkCommonDataModelPython.vtkDataObjectTreeIteratorvtkDataObjectTreeIterator - superclass for composite data iterators Superclass: vtkCompositeDataIterator vtkDataObjectTreeIterator provides an interface for accessing datasets in a collection (vtkDataObjectTreeIterator). IsTypeOfV.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. IsAV.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. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkDataObjectTreeIterator C++: static vtkDataObjectTreeIterator *SafeDownCast( vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkDataObjectTreeIterator C++: vtkDataObjectTreeIterator *NewInstance() GoToFirstItemV.GoToFirstItem() C++: void GoToFirstItem() override; Move the iterator to the beginning of the collection. GoToNextItemV.GoToNextItem() C++: void GoToNextItem() override; Move the iterator to the next item in the collection. IsDoneWithTraversalV.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. GetCurrentDataObjectV.GetCurrentDataObject() -> vtkDataObject C++: vtkDataObject *GetCurrentDataObject() override; Returns the current item. Valid only when IsDoneWithTraversal() returns 0. GetCurrentMetaDataV.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. HasCurrentMetaDataV.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. GetCurrentFlatIndexV.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. vtkCompositeDataIteratorvtkObjectvtkObjectBaseOP `!'a!!!P!!!`!!!p aP ! ! !p aP !!!zRx $OAC $D8 AC $l AC B$AC G$0'AC I$8AC G$ AC G$4AC G$\ AC G$AC G$0AC G$AC G$@AC G$$AC G$LPAC I$tAC G$AC G$(AC G$AC I$hAC G$<AC G$dAC G[-=O-?/-'-1--=-/-j-<1- - - /- - 1-b A -=5 - /- - 3- 1- [ -=O -? /-' - 1-  -= - /-j -< 1-  - - /- - 1-b A -=5 - /- - 3- 1- Y -M -; /-# - 9-1---/-s-l8-L1-"4--/--7-1-rL4-?-,/-- ;-1---{/-c-\:-<1--=-/--5-1-b5-=)-/--6-1-(-o$-c"-S4-F-</-&-1-4--s/-Y-E-0- --/-.-=-zo=-gV=-N52-1-/---}.-q=-i^=-VE=-=.2-,---+- -zslV<-IB-=6/+-'! -xh`XH@8(     xh `XH@8( @8&%*!)X'0#`@ `@ `@ ?plkPB BP~5 `v Ep FP   yp P `s f1U1Z5EDj-]_PyType_Ready_PyvtkDataObjectTreeIterator_ClassNew_PyvtkCompositeDataIterator_ClassNew_PyVTKObject_New__ZL37PyvtkDataObjectTreeIterator_StaticNewv__ZN25vtkDataObjectTreeIterator19GetCurrentFlatIndexEv__ZN25vtkDataObjectTreeIterator3NewEv__ZN25vtkDataObjectTreeIterator20GetCurrentDataObjectEv__ZN25vtkDataObjectTreeIterator12GoToNextItemEv__ZN25vtkDataObjectTreeIterator13GoToFirstItemEv__ZN25vtkDataObjectTreeIterator19IsDoneWithTraversalEv__ZN25vtkDataObjectTreeIterator18GetCurrentMetaDataEv__ZN25vtkDataObjectTreeIterator18HasCurrentMetaDataEv_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL35PyvtkDataObjectTreeIterator_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKAddFile_vtkDataObjectTreeIterator_PyVTKObject_AsBuffer_strcmp_PyObject_GC_Del_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetValueERi_PyLong_FromLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL32PyvtkDataObjectTreeIterator_Type_PyType_Type_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL47PyvtkDataObjectTreeIterator_GetCurrentFlatIndexP7_objectS0___ZL40PyvtkDataObjectTreeIterator_SafeDownCastP7_objectS0___ZL48PyvtkDataObjectTreeIterator_GetCurrentDataObjectP7_objectS0___ZL46PyvtkDataObjectTreeIterator_SetVisitOnlyLeavesP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetVisitOnlyLeavesP7_objectS0___ZL45PyvtkDataObjectTreeIterator_VisitOnlyLeavesOnP7_objectS0___ZL45PyvtkDataObjectTreeIterator_TraverseSubTreeOnP7_objectS0___ZL40PyvtkDataObjectTreeIterator_GoToNextItemP7_objectS0___ZL41PyvtkDataObjectTreeIterator_GoToFirstItemP7_objectS0___ZL47PyvtkDataObjectTreeIterator_IsDoneWithTraversalP7_objectS0___ZL46PyvtkDataObjectTreeIterator_VisitOnlyLeavesOffP7_objectS0___ZL46PyvtkDataObjectTreeIterator_TraverseSubTreeOffP7_objectS0___ZL36PyvtkDataObjectTreeIterator_IsTypeOfP7_objectS0___ZL46PyvtkDataObjectTreeIterator_SetTraverseSubTreeP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetTraverseSubTreeP7_objectS0___ZL39PyvtkDataObjectTreeIterator_NewInstanceP7_objectS0___ZL46PyvtkDataObjectTreeIterator_GetCurrentMetaDataP7_objectS0___ZL46PyvtkDataObjectTreeIterator_HasCurrentMetaDataP7_objectS0___ZL31PyvtkDataObjectTreeIterator_IsAP7_objectS0_