(@t@t__text__TEXT4w__gcc_except_tab__TEXT4t7__cstring__TEXTp5*88__data__DATA0`b }__compact_unwind__LDh@j0__eh_frame__TEXT@mp h2  P P++0\UHAVSH=`51HHH=H18IH uHL[A^]DUHAWAVATSH=H5H5H HL5HHH4HH54LHtH u H=H=411HL%H=H1A$8IH uHMtH5`4LLIuLH=41HH=H1A$8IH uHMtH5 4LLIuLH=31HH=H1A$8IH uHMtH53LLIuLH=b31HH=H1A$8IH uHMtH5b3LLIuLH=H[A\A^A_]f.DUH]fDUHSPHH52HHt H tH[]H=H[]fDUHSH(HuH6;HE؋FEHEHEH}Ѓu1Hut3H}HuHcH([]þ1H([]UHAWAVSH(HuH;HED~D}HG]ԉ]؅y HHtdLw(HEMt8A)Au3HuH}t}Hut;HHt<1@H}1)HE1ILPHuHcH([A^A_]f.@UHAVSH0HuH;HEЋFEHEuGH5gZH}HU}t@HHtCHH50HPE1LEHu+H}Ⱦ1H0[A^]E1HuLUHAVSH HuH;HEDvDuHG]]yHHH(HD9u3HPxHt9HHH5/HPE1LEHucH}111RE1HuCLHt6HHt)HHH1Q@H߾1HH [A^]UHAWAVSH(HuH:HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5XH}HU}t0}t7LHHu9H}1H([A^A_]ILH HuHHUHAVSH HuH:HEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111H0HuHHHH [A^]UHAWAVSH(HuHl:HED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}tD}utHA9tAILHu6H}1H([A^A_]IL8HuHHUHAVSH HuH\:HEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 H@HuHcHHH [A^]@UHAWAVSH(HuHs:HED~D}HG]ԉ]؅y HHtgLw(Mt^A)AuBHuH}tD}utHA9tAILHu6H}1H([A^A_]ILHHuHHUHAVSH HuH :HEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HPHuHcHHH [A^]@UHAWAVSH(HuH9HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5SH}HU}t0}t7LHHu9H}1H([A^A_]ILHXHuHHUHAVSH HuH9HEDvDuHG]]y HHt$H(HtD9uEt&H@Ht+12H}111!H`HHuHHHH [A^]fUHAWAVSH(HuH9HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5pRH}HU}t0}t7LHHu9H}1H([A^A_]ILHhHuHHUHAVSH HuH[9HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HpHHuHHHH [A^]fUHAWAVSH(HuHL9HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5PH}HU}t0}t7LHHu9H}1H([A^A_]ILHxHuHHUHAVSH HuH9HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH8HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5POH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAVSH HuH8HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH8HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5MH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAVSH HuHM8HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH48HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H50LH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAVSH HuH7HEDvDuHG]]y HHt$H(HtD9uEt&H Ht+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuH7HED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5JH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAVSH HuH7HEDvDuHG]]y HHt$H(HtD9uEt&H(Ht+12H}111!HHHuHHHH [A^]fUHAWAVAUATSHHHHEHH7H DvD(HG,0yHHvLo(ƅOM;A)HAH<H5HHHIH5HHHIHHHHOHL@LaHPHHH@HHhH #HhH(HhHuHhHuHhLDE0E@EPE8EHEDHXE.A1HXH501MHhHh1HHH9t HtHHH;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{!HuHhHU1HuUHhEf.0u$z"Ef.@uzEf.Pu{$HuHhHUE~A1AfA.uzHH9`u!HuHhLDHmLHH)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{!HuHhHU1HuUHhEf.8u$z"Ef.HuzEf.u{$HuHhHUE~A1AfA.uzHH9Xu!HuHhLDHLHHHH9HHHH9t HtH f.UHAVSH HuH+HEDvDuHG]]y HHt$H(HtD9uEt&Ht*11H}111 HHuHcHHH [A^]UHAVSH HuHD+HEDvDuHG]]y HHt$H(HtD9uEt&H8Ht+12H}111!HHHuHHHH [A^]fUHAVSH HuH,+HEDvDuHG]]y HHt$H(HtD9uEt&H0Ht+12H}111!HHHuHHHH [A^]fUHSPHH=4HtZH=y+HtGH=r+Ht4H=j+Ht!H=e+HtHH[]H[]f.@UHAVSH IH]HH5+HHǾsH5+HMt=LH}HH5+HHLH5+HH5+H}H5+HMt0H5+LtH}H5w+LHH}HH}H1H}1H [A^]HH}H P> T''*(i)vtkLabelHierarchyIteratorTypeFULL_SORTQUEUEDEPTH_FIRSTFRUSTUMvtkRenderingLabelPython.vtkLabelHierarchy.IteratorTypevtkRenderingLabelPython.vtkLabelHierarchyvtkLabelHierarchy - contains an octree of labels Superclass: vtkPointSet This class represents labels in a hierarchy used to denote rendering priority. A binary tree of labels is maintained that subdivides the bounds of the of the label anchors spatially. Which level of the tree a label occupies determines its priority; those at higher levels of the tree will be more likely to render than those at lower levels of the tree. Pass vtkLabelHierarchy objects to a vtkLabelPlacementMapper filter for dynamic, non-overlapping, per-frame placement of labels. Note that if we have a d-dimensional binary tree and we want a fixed number $n $ of labels in each node (all nodes, not just leaves), we can compute the depth of tree required assuming a uniform distribution of points. Given a total of $N $ points we know that$\frac{N}{|T|} = n $, where $|T| $ is the cardinality of the tree (i.e., the number of nodes it contains). Because we have a uniform distribution, the tree will be uniformly subdivided and thus $|T| = 1 + 2^d + \left(2^d\right)^2 + \cdots + \left(2^d\right)^k $, where $d $ is the dimensionality of the input points (fixed at 3 for now). As $k $ becomes large, $|T|\approx 2 \left(2^d\right)^k $. Using this approximation, we can solve for $k $:\[ k = \frac{\log{\frac{N}{2n}}}{\log{2^d}} \] Given a set of $N $ input label anchors, we'll compute $k $ and then bin the anchors into tree nodes at level $k $ of the tree. After this, all the nodes will be in the leaves of the tree and those leaves will be at the $k $-th level; no anchors will be in levels $1, 2, \ldots, k-1 $. To fix that, we'll choose to move some anchors upwards. The exact number to move upwards depends on TargetLabelCount. We'll move as many up as required to have TargetLabelCount at each node. You should avoid situations where MaximumDepth does not allow forTargetLabelCount or fewer entries at each node. The MaximumDepth is a hard limit while TargetLabelCount is a suggested optimum. You will end up with many more than TargetLabelCount entries per node and things will be sloooow. 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) -> vtkLabelHierarchy C++: static vtkLabelHierarchy *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkLabelHierarchy C++: vtkLabelHierarchy *NewInstance() SetPointsV.SetPoints(vtkPoints) C++: void SetPoints(vtkPoints *) override; Override SetPoints so we can reset the hierarchy when the points change. ComputeHierarchyV.ComputeHierarchy() C++: virtual void ComputeHierarchy() Fill the hierarchy with the input labels. SetTargetLabelCountV.SetTargetLabelCount(int) C++: virtual void SetTargetLabelCount(int _arg) The number of labels that is ideally present at any octree node. It is best if this is a multiple of $2^d $. GetTargetLabelCountV.GetTargetLabelCount() -> int C++: virtual int GetTargetLabelCount() The number of labels that is ideally present at any octree node. It is best if this is a multiple of $2^d $. SetMaximumDepthV.SetMaximumDepth(int) C++: virtual void SetMaximumDepth(int _arg) The maximum depth of the octree. GetMaximumDepthV.GetMaximumDepth() -> int C++: virtual int GetMaximumDepth() The maximum depth of the octree. SetTextPropertyV.SetTextProperty(vtkTextProperty) C++: virtual void SetTextProperty(vtkTextProperty *tprop) The default text property assigned to labels in this hierarchy. GetTextPropertyV.GetTextProperty() -> vtkTextProperty C++: virtual vtkTextProperty *GetTextProperty() The default text property assigned to labels in this hierarchy. SetPrioritiesV.SetPriorities(vtkDataArray) C++: virtual void SetPriorities(vtkDataArray *arr) Set/get the array specifying the importance (priority) of each label. GetPrioritiesV.GetPriorities() -> vtkDataArray C++: virtual vtkDataArray *GetPriorities() Set/get the array specifying the importance (priority) of each label. SetLabelsV.SetLabels(vtkAbstractArray) C++: virtual void SetLabels(vtkAbstractArray *arr) Set/get the array specifying the text of each label. GetLabelsV.GetLabels() -> vtkAbstractArray C++: virtual vtkAbstractArray *GetLabels() Set/get the array specifying the text of each label. SetOrientationsV.SetOrientations(vtkDataArray) C++: virtual void SetOrientations(vtkDataArray *arr) Set/get the array specifying the orientation of each label. GetOrientationsV.GetOrientations() -> vtkDataArray C++: virtual vtkDataArray *GetOrientations() Set/get the array specifying the orientation of each label. SetIconIndicesV.SetIconIndices(vtkIntArray) C++: virtual void SetIconIndices(vtkIntArray *arr) Set/get the array specifying the icon index of each label. GetIconIndicesV.GetIconIndices() -> vtkIntArray C++: virtual vtkIntArray *GetIconIndices() Set/get the array specifying the icon index of each label. SetSizesV.SetSizes(vtkDataArray) C++: virtual void SetSizes(vtkDataArray *arr) Set/get the array specifying the size of each label. GetSizesV.GetSizes() -> vtkDataArray C++: virtual vtkDataArray *GetSizes() Set/get the array specifying the size of each label. SetBoundedSizesV.SetBoundedSizes(vtkDataArray) C++: virtual void SetBoundedSizes(vtkDataArray *arr) Set/get the array specifying the maximum width and height in world coordinates of each label. GetBoundedSizesV.GetBoundedSizes() -> vtkDataArray C++: virtual vtkDataArray *GetBoundedSizes() Set/get the array specifying the maximum width and height in world coordinates of each label. NewIteratorV.NewIterator(int, vtkRenderer, vtkCamera, [float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float], bool, [float, float]) -> vtkLabelHierarchyIterator C++: vtkLabelHierarchyIterator *NewIterator(int type, vtkRenderer *ren, vtkCamera *cam, double frustumPlanes[24], bool positionsAsNormals, float bucketSize[2]) Returns an iterator for this data object. positionsAsNormals should only be true when labels are on a sphere centered at the origin (3D world). @param type - the type should be one of FULL_SORT, QUEUE, DEPTH_FIRST, or FRUSTUM. @param ren - the current renderer (used for viewport information) @param cam - the current camera. @param frustumPlanes - should be the output of the camera's frustum planes. @param positionsAsNormals - throws out octree nodes on the opposite side of the origin. @param bucketSize - an array of 2 integers describing the width and height of label placer buckets. GetDiscreteNodeCoordinatesFromWorldPointV.GetDiscreteNodeCoordinatesFromWorldPoint([int, int, int], [float, float, float], int) C++: void GetDiscreteNodeCoordinatesFromWorldPoint(int ijk[3], double pt[3], int level) Given a depth in the hierarchy ( level) and a point pt in world space, compute ijk. This is used to find other octree nodes at the same level that are within the search radius for candidate labels to be placed. It is called with pt set to the camera eye point and pythagorean quadruples increasingly distant from the origin are added to ijk to identify octree nodes whose labels should be placed. @param[out] ijk - discrete coordinates of the octree node at level containing pt. @param[in] pt - input world point coordinates @param[in] level - input octree level to be considered GetPathForNodalCoordinatesV.GetPathForNodalCoordinates([int, ...], [int, int, int], int) -> bool C++: static bool GetPathForNodalCoordinates(int *path, int ijk[3], int level) Given a level of the tree and ijk coordinates in a lattice, compute a path down the tree to reach the corresponding lattice node. If the lattice coordinates are outside the tree, this returns false. Otherwise it returns true. This does notguarantee that the path exists in the hierarchy. @param[out] path - a vector of level integers specifying which child to descend at each level to reach ijk @param[in] ijk - discrete coordinates of the octree node at level @param[in] level - input octree level to be considered GetNumberOfCellsV.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Inherited members (from vtkDataSet) GetCellV.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) Inherited members (from vtkDataSet) GetCellTypeV.GetCellType(int) -> int C++: int GetCellType(vtkIdType) override; Inherited members (from vtkDataSet) GetCellPointsV.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType, vtkIdList *) override; Inherited members (from vtkDataSet) GetPointCellsV.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType, vtkIdList *) override; Inherited members (from vtkDataSet) FindCellV.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double *, vtkCell *, vtkIdType, double, int &, double *, double *) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double *, vtkCell *, vtkGenericCell *, vtkIdType, double, int &, double *, double *) override; Inherited members (from vtkDataSet) GetMaxCellSizeV.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Inherited members (from vtkDataSet) GetCenterPtsV.GetCenterPts() -> vtkPoints C++: virtual vtkPoints *GetCenterPts() Provide access to original coordinates of sets of coincident points GetCoincidentPointsV.GetCoincidentPoints() -> vtkCoincidentPoints C++: virtual vtkCoincidentPoints *GetCoincidentPoints() Provide access to the set of coincident points that have been perturbed by the hierarchy in order to render labels for each without overlap. vtkPointSetvtkDataSetvtkDataObjectvtkObjectvtkObjectBasevtkPointsvtkTextPropertyvtkDataArrayvtkAbstractArrayvtkIntArrayvtkRenderervtkCameravtkGenericCellERROR: In /Volumes/Data/workspace/med-macos-free/ExtProjs/VTK/Common/DataModel/vtkDataSet.h, line (): ijk indices are only valid with structured data! ErrorEventvtkIdListvtkCell5 5HD6:>C>D?H?=@J@@@A AAA$B8BBCCC1DADDDQEaEEFFFDGNGGGdHtHIIIICJRJJJcKlKKKLLlMxMQQTTWWXX*Y6YYY.Z%S-%$J=$2-$Q-$2-$e-$R-$u$]-N$S-$$ $3-#2-#Q-#2-#c-#]-~#S-T#3#b-&#2-#J="2-"2-"P-""2-"s-"R-u"j"]-L"S-6""2-".-!\-!\-!\-!S-!s!2-k!r-M!]-'!S-! 4- 2- Q- 2-| n-\ S-2  K- --0-2-`-2-z`-d2-Bo-E=>-Q-m\-XX->X- U-N-=-y=pQ-\J=P2-K^-,2-`-2-q-\-sV-VX-S-=-v=mQ-\D-?@-3>-#b-2-_-2-^-2-Xd-'-W-Z-V-R-tR-aR\-S-=b-2-{Q-c2-<S-J=2-Q-2-j-R-^S-4 b-2-Q-2-S-_J=S2-2Q-2-v-R-S-{b-n2-[Q-C2-S-J=2-Q-2-i-lR-_>S-b-2-Q-2-S-b?J=32-Q-2-k-R-S-[b-N2-;Q-#2-S-J=2-Q-h2-cw-LR-?S-  b- 2- Q- 2-l S-B  J= 2- Q- 2- g- R-  S-d ; b-. 2- Q- 2- S-  J= 2-b Q-H 2-C l-, R-  S-  3- 2- Q-r 2-L S-"  J= 2- Q- 2- \-n S-D  3- 2-Q-2-S-wJ=k2-MQ-32-\-S-J=y2-iQ-Q2-Lm-,S-J=2-Q-2-x-|R-oNS-$D-@->-b-2-Q-2-LS-"b-2-Q-2-R-rC3-62-Q-2-/-Y-S-cQ-M3-@2-9/-,Y-I-1-,-p-tm:-haI-T1-I=I- G- I-1-I-G-I-1-I-dZG-NGI-:1-/#I-5=G-I-1-a-:-H-~x<-sle^?I-$5=G- )x(phX'PH8%0($#"! xphXPH80(xphXPH80(xphX PH8 0(   xphXPH807BAPFH8=09(8 EC?;@65;80 `@ `@ `@ `@ `@ SMg 0`. ah`cjp- `] `  0    6P j0  p*P+Zp  4 : g@#$`%h%t52 11#2\5E#P3 036   ! M  1eZ   #Y` L   A  3  N[ ( T cBr 4  } u fsJJB,,: vG(  =__ZN17vtkLabelHierarchy15SetTextPropertyEP15vtkTextProperty_memcpy_PyVTKAddFile_vtkLabelHierarchy_PyType_Ready__ZN17vtkLabelHierarchy14SetIconIndicesEP11vtkIntArray__ZN17vtkLabelHierarchy9SetLabelsEP16vtkAbstractArray__ZN17vtkLabelHierarchy15SetOrientationsEP12vtkDataArray__ZN17vtkLabelHierarchy8SetSizesEP12vtkDataArray__ZN17vtkLabelHierarchy15SetBoundedSizesEP12vtkDataArray__ZN17vtkLabelHierarchy13SetPrioritiesEP12vtkDataArray__ZN13vtkPythonArgs8GetValueERx__ZN17vtkLabelHierarchy7GetCellEx__ZN17vtkLabelHierarchy11GetCellTypeEx_PyvtkLabelHierarchy_ClassNew_PyvtkPointSet_ClassNew_PyVTKObject_New__ZL29PyvtkLabelHierarchy_StaticNewv__ZN9vtkObject11InvokeEventEPKcPv__ZdaPv__ZN17vtkOStreamWrapperlsEPv__ZN17vtkLabelHierarchy16ComputeHierarchyEv__ZN9vtkObject23GetGlobalWarningDisplayEv__ZN17vtkLabelHierarchy3NewEv__ZN17vtkLabelHierarchy16GetNumberOfCellsEv__ZN20vtkOStrStreamWrapper3strEv__ZN9vtkObject12BreakOnErrorEv__ZN20vtkOStrStreamWrapper5rdbufEv__ZN17vtkLabelHierarchy14GetMaxCellSizeEv__ZNK13vtkObjectBase12GetClassNameEv__ZN20vtkOStrStreamWrapperD1Ev__ZN20vtkOStrStreamWrapperC1Ev__ZN17vtkLabelHierarchy13GetCellPointsExP9vtkIdList__ZN17vtkLabelHierarchy13GetPointCellsExP9vtkIdList_PyVTKObject_GetSet__Py_NoneStruct__ZN13vtkPythonUtil12AddEnumToMapEP11_typeobject_PyVTKObject_GetObject__ZN17vtkLabelHierarchy9SetPointsEP9vtkPoints__ZL27PyvtkLabelHierarchy_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_strcmp__ZN17vtkLabelHierarchy7GetCellExP14vtkGenericCell___stack_chk_fail_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIiEC1El__ZN13vtkPythonArgs5ArrayIdEC1El_PyVTKObject_Check__Z41PyvtkLabelHierarchy_IteratorType_FromEnumi__ZN10vtkDataSet7GetCellEiii__ZN13vtkPythonArgs8GetArrayEPii__ZN13vtkPythonArgs8SetArrayEiPKii__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs11SetArgValueEii__ZN13vtkPythonArgs8GetArrayEPfi__ZN13vtkPythonArgs8SetArrayEiPKfi__ZN17vtkLabelHierarchy40GetDiscreteNodeCoordinatesFromWorldPointEPiPdi__ZN13vtkPythonArgs8GetArrayEPdi__ZN13vtkPythonArgs8SetArrayEiPKdi__ZN17vtkLabelHierarchy26GetPathForNodalCoordinatesEPiS0_i__ZN13vtkPythonArgs8GetValueERi__ZN17vtkOStreamWrapperlsEi__ZN13vtkPythonArgs10GetArgSizeEi__ZN20vtkOStrStreamWrapper6freezeEi_PyBool_FromLong_PyLong_FromLong_PyLong_FromLongLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag__ZN17vtkLabelHierarchy11NewIteratorEiP11vtkRendererP9vtkCameraPdbPf_Py_BuildValue_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL24PyvtkLabelHierarchy_Type_PyLong_Type_PyType_Type__ZL37PyvtkLabelHierarchy_IteratorType_Type__Unwind_Resume_PyObject_Free___stack_chk_guard_PyErr_Occurred_PyVTKClass_Add__ZN13vtkPythonArgs8GetValueERd__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__Z31vtkOutputWindowDisplayErrorTextPKc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN17vtkOStreamWrapperlsEPKc__ZN9vtkObject11HasObserverEPKc__ZN17vtkLabelHierarchy8IsTypeOfEPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs8GetValueERb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL35PyvtkLabelHierarchy_SetTextPropertyP7_objectS0___ZL35PyvtkLabelHierarchy_GetTextPropertyP7_objectS0___ZL36PyvtkLabelHierarchy_ComputeHierarchyP7_objectS0___ZL32PyvtkLabelHierarchy_SafeDownCastP7_objectS0___ZL39PyvtkLabelHierarchy_SetTargetLabelCountP7_objectS0___ZL39PyvtkLabelHierarchy_GetTargetLabelCountP7_objectS0___ZL60PyvtkLabelHierarchy_GetDiscreteNodeCoordinatesFromWorldPointP7_objectS0___ZL39PyvtkLabelHierarchy_GetCoincidentPointsP7_objectS0___ZL29PyvtkLabelHierarchy_SetPointsP7_objectS0___ZL33PyvtkLabelHierarchy_GetCellPointsP7_objectS0___ZL32PyvtkLabelHierarchy_GetCenterPtsP7_objectS0___ZL35PyvtkLabelHierarchy_SetOrientationsP7_objectS0___ZL35PyvtkLabelHierarchy_GetOrientationsP7_objectS0___ZL33PyvtkLabelHierarchy_GetPointCellsP7_objectS0___ZL36PyvtkLabelHierarchy_GetNumberOfCellsP7_objectS0___ZL29PyvtkLabelHierarchy_SetLabelsP7_objectS0___ZL29PyvtkLabelHierarchy_GetLabelsP7_objectS0___ZL28PyvtkLabelHierarchy_SetSizesP7_objectS0___ZL28PyvtkLabelHierarchy_GetSizesP7_objectS0___ZL35PyvtkLabelHierarchy_SetBoundedSizesP7_objectS0___ZL35PyvtkLabelHierarchy_GetBoundedSizesP7_objectS0___ZL46PyvtkLabelHierarchy_GetPathForNodalCoordinatesP7_objectS0___ZL33PyvtkLabelHierarchy_SetPrioritiesP7_objectS0___ZL33PyvtkLabelHierarchy_GetPrioritiesP7_objectS0___ZL34PyvtkLabelHierarchy_SetIconIndicesP7_objectS0___ZL34PyvtkLabelHierarchy_GetIconIndicesP7_objectS0___ZL31PyvtkLabelHierarchy_NewIteratorP7_objectS0___ZL27PyvtkLabelHierarchy_GetCellP7_objectS0___ZL28PyvtkLabelHierarchy_FindCellP7_objectS0___ZL35PyvtkLabelHierarchy_SetMaximumDepthP7_objectS0___ZL35PyvtkLabelHierarchy_GetMaximumDepthP7_objectS0___ZL28PyvtkLabelHierarchy_IsTypeOfP7_objectS0___ZL34PyvtkLabelHierarchy_GetMaxCellSizeP7_objectS0___ZL31PyvtkLabelHierarchy_GetCellTypeP7_objectS0___ZL31PyvtkLabelHierarchy_NewInstanceP7_objectS0___ZL23PyvtkLabelHierarchy_IsAP7_objectS0___ZN17vtkLabelHierarchy8FindCellEPdP7vtkCellxdRiS0_S0___ZN17vtkLabelHierarchy8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_GCC_except_table36GCC_except_table41___gxx_personality_v0GCC_except_table30