ELF>X\@@#"   UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uFH@]@H|$HT$H5|$HtHHuHff.@ATUHHdH%(HD$81HHt$HD$HFHD$$D$ D$ wcLd$HT$ H5L|$ Ht#D$ 9D$(|Vt$ HHHtU1HT$8dH+%(uMHH]A\H|$f.Ht$ LuDHfUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tHH=tHH=tHH=tHff.ATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$u`HELH@H;H=tLH=u-HaHcVf.LLH=tLH=tLH=tLH=tLxDHЉgSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uVH0]fDHHuӐtHHuH뵐HHH;tHUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uWH@]f.HHuϐHt$H|$tHt$HHu@@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uWH@]f.HHuϐHt$H|$tHt$HHHuH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uWH@]f.HHuϐHt$H|$tHt$HHHuH@ATUHhfnFdH%(HD$X1HHt$0HD$8HGfnȉD$HfbfD$@uJHo(Ht!D$@+D$DtDH|$01HT$XdH+%(ufHh]A\fDHHuѐHt$H|$0tHT$Ld$HLI1MuLH=UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(u_H@]f.HHuϐHt$H|$tHEHHt$H`HHuHff.ATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uJHo(Ht!D$ +D$$tDH|$1HT$8dH+%(ukHH]A\fDHHuѐLd$HLtHt$LtHT$H4$HHHuHff.ATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uJHo(Ht!D$ +D$$tDH|$1HT$8dH+%(HH]A\fHHuѐLd$Ht$LtHT$H5L|$HtHEHt$HHHyHHk@ATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATUHHdH%(HD$8HFLd$Ht$HHD$HHT$ LH5D$(HD$ D$ |$ Ht9D$ 9D$(}Ht$ Ltt$ HHHtmD1HT$8dH+%(u`HH]A\fDHD$8dH+%(uBHHHH]H=A\H5HATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\ATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uJHo(Ht!D$ +D$$tDH|$1HT$8dH+%(HH]A\fHHuѐLd$Ht$LtHT$H5L|$HtD$$Ht$u/HEHHtHHf@HHSafeDownCastvtkObjectBasevtkTreeGetDatavtkInformationvtkInformationVectorIsTypeOfIsAGetDataObjectTypeGetRootIsLeafGetParentGetLevelGetParentEdgevtkEdgeTypeGetNumberOfChildrenGetChildGetChildrenvtkAdjacentVertexIteratorNewInstanceReorderChildrenvtkIdTypeArrayV *vtkInformationV|i *vtkInformationVectorvtkDirectedAcyclicGraphvtkDirectedGraphvtkGraphvtkDataObjectvtkObjectUH=Hu]ÐHH=tHH=tHH=tHH=tHH=tH]vtkTree - 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 vtkCommonDataModelPython.vtkTreeV.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) -> vtkTree C++: static vtkTree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkTree C++: vtkTree *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. V.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. V.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. V.GetParent(int) -> int C++: vtkIdType GetParent(vtkIdType v) Get the parent of a vertex. V.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. V.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. HHHD!!GCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx  0 D X lEDPa AE EDPa AE (FAD` ABD EY B c(5EAD`n AAF 0,FAA D`  AABH `ED@ AG ED@ AG EDP AK EDP AK EDP AK (FAD ABG @EDP AK (dFAD` ABG (FAD` ABC gFD@ EE 4/FAD` ABG T GIL MFF04OFDD n ABA DDBh,|/FAD` ABC      Ci5"Dpi` P P P  ` 0gW/z`/    #$ +) :. O49>)C2H@N XT \Z n` vf }l r x ~       " " " !Fr>"RYy'<Ld{T{ MpO3?Rcv_ZL19PyvtkTree_StaticNewv_ZL22PyvtkTree_SafeDownCastP7_objectS0__ZL20PyvtkTree_GetData_s1P7_objectS0__ZL20PyvtkTree_GetData_s2P7_objectS0__ZL18PyvtkTree_IsTypeOfP7_objectS0__ZL13PyvtkTree_IsAP7_objectS0__ZL27PyvtkTree_GetDataObjectTypeP7_objectS0__ZL17PyvtkTree_GetRootP7_objectS0__ZL16PyvtkTree_IsLeafP7_objectS0__ZL19PyvtkTree_GetParentP7_objectS0__ZL18PyvtkTree_GetLevelP7_objectS0__ZL23PyvtkTree_GetParentEdgeP7_objectS0__ZL29PyvtkTree_GetNumberOfChildrenP7_objectS0__ZL18PyvtkTree_GetChildP7_objectS0__ZL21PyvtkTree_GetChildrenP7_objectS0__ZL21PyvtkTree_NewInstanceP7_objectS0__ZL17PyvtkTree_GetDataP7_objectS0__ZL25PyvtkTree_GetData_Methods_ZL14PyvtkTree_Type_ZL17PyvtkTree_Methods_GLOBAL__sub_I_vtkTreePython.cxx_ZL25PyvtkTree_ReorderChildrenP7_objectS0_.LC0.LC1.LC2.LC3.LC4.LC5.LC11.LC6.LC7.LC8.LC9.LC10.LC12.LC13.LC14.LC15.LC16.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC25.LC27.LC28.LC26_ZN7vtkTree17GetDataObjectTypeEv_ZN7vtkTree7GetRootEv_ZN7vtkTree3NewEv_ZNK7vtkTree19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN7vtkTree7GetDataEP14vtkInformation_ZN7vtkTree7GetDataEP20vtkInformationVectori_ZN13vtkPythonArgs8GetValueERi_ZN7vtkTree3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__GLOBAL_OFFSET_TABLE_PyLong_FromLongLong_ZN13vtkPythonArgs8GetValueERx_ZN7vtkTree6IsLeafExPyBool_FromLong_ZN7vtkTree9GetParentEx_ZN7vtkTree8GetLevelEx_ZN7vtkTree13GetParentEdgeExPyVTKSpecialObject_CopyNew_ZN7vtkTree8GetChildExx_Py_NoneStructPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3__ZN13vtkPythonArgs13ArgCountErrorEiPKcPyvtkTree_ClassNewPyVTKClass_AddPyvtkDirectedAcyclicGraph_ClassNewPyType_ReadyPyVTKAddFile_vtkTreePyDict_SetItemString_Py_Dealloc_ZN7vtkTree15ReorderChildrenExP14vtkIdTypeArrayPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,"`C#D$EFEG %@Cm&rDHEFG% 'D2I:EpCJFG( C=NM$ULc)hLqE~O*L+L,L-LMG.vCPN*K$L)L EO>*CLQ+VLd,iLw-|LMG/CAPZEgO*?G0C1PLEYRm*@{G1C!P;SLTSEaUhG2C P+ S< VD EQ RX G 3 C P S, W4 EA RH Gs 4 C P S$ X) E= 5B YI Gq 6 C P S, E9 R@ Gs 7 C P S S2 Z: EG RN G 8 CPS.96DZEj*[xG:CP:*BEAX$gEtF\]^EG,%8;G'aDJIE!%`FG) 7$>!FbL Tc^ cda$f<<CaP~S=DE*[hGA_gA$L&)+L9*>LL+QL_,dLr-wLM> i0jXklmnopq8r@sO X(8 @HX`hxx\n(P P ` x }(p8` @HP X `h` xH v( #  (8* 4H\p 0dp` P DP hP `  8pl.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN7vtkTree17GetDataObjectTypeEv.text._ZN7vtkTree7GetRootEv.rela.text._ZNK7vtkTree19NewInstanceInternalEv.rodata.str1.1.rodata._ZN7vtkTree3IsAEPKc.str1.1.rela.text._ZN7vtkTree3IsAEPKc.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.rodata.cst8.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@ ?H @P B\ K p@? &_,_1` Xp y t@Q 2D2J @(Q8 2 #@`R0 #@R ,# '@R  ;@%` 6@S K'X0',a'q' '@`XX + !? 6 Z