(H'H'__text__TEXT *__gcc_except_tab__TEXT 4__data__DATA@@/1__cstring__TEXT8 H__compact_unwind__LD"%0__eh_frame__TEXT$`' 1 h2  (1Dh5 P1UHH=H5HgH uHH=H]ÐUH]fDUHSPHH=H5HH uHH=H5HHt H tH[]H=H[]fUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H=7HAtDH=!Ht1H=!HtH= Ht HLcHuL1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=LAtuH=LtbH=LtOH=LtH}111-HHHuHHxHHH [A^]I8mHD5A0  H!W!!!vtkTreeMapLayoutvtkInfovisLayoutPython.vtkTreeMapLayoutvtkTreeMapLayout - layout a vtkTree into a tree map Superclass: vtkTreeAlgorithm vtkTreeMapLayout assigns rectangular regions to each vertex in the tree, creating a tree map. The data is added as a data array with four components per tuple representing the location and size of the rectangle using the format (Xmin, Xmax, Ymin, Ymax). This algorithm relies on a helper class to perform the actual layout. This helper class is a subclass of vtkTreeMapLayoutStrategy. @par Thanks: Thanks to Brian Wylie and Ken Moreland from Sandia National Laboratories for help developing this class. @par Thanks: Tree map concept comes from: Shneiderman, B. 1992. Tree visualization with tree-maps: 2-d space-filling approach. ACM Trans. Graph. 11, 1 (Jan. 1992), 92-99. 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) -> vtkTreeMapLayout C++: static vtkTreeMapLayout *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkTreeMapLayout C++: vtkTreeMapLayout *NewInstance() GetRectanglesFieldNameV.GetRectanglesFieldName() -> string C++: virtual char *GetRectanglesFieldName() The field name to use for storing the rectangles for each vertex. The rectangles are stored in a quadruple float array (minX, maxX, minY, maxY). SetRectanglesFieldNameV.SetRectanglesFieldName(string) C++: virtual void SetRectanglesFieldName(const char *_arg) The field name to use for storing the rectangles for each vertex. The rectangles are stored in a quadruple float array (minX, maxX, minY, maxY). SetSizeArrayNameV.SetSizeArrayName(string) C++: virtual void SetSizeArrayName(const char *name) The array to use for the size of each vertex. GetLayoutStrategyV.GetLayoutStrategy() -> vtkTreeMapLayoutStrategy C++: virtual vtkTreeMapLayoutStrategy *GetLayoutStrategy() The strategy to use when laying out the tree map. SetLayoutStrategyV.SetLayoutStrategy(vtkTreeMapLayoutStrategy) C++: void SetLayoutStrategy(vtkTreeMapLayoutStrategy *strategy) The strategy to use when laying out the tree map. FindVertexV.FindVertex([float, float], [float, ...]) -> int C++: vtkIdType FindVertex(float pnt[2], float *binfo=nullptr) Returns the vertex id that contains pnt (or -1 if no one contains it) GetBoundingBoxV.GetBoundingBox(int, [float, ...]) C++: void GetBoundingBox(vtkIdType id, float *binfo) Return the min and max 2D points of the vertex's bounding box GetMTimeV.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Get the modification time of the layout algorithm. vtkTreeAlgorithmvtkAlgorithmvtkObjectvtkObjectBasevtkTreeMapLayoutStrategyOP `!:a!!aaa !P a XA ZXA(P!zRx $HOAC $Dp AC $lXAC B$AC G$x:AC I$AC G$ AC G$4AC I$\AC I$AC I$XAC G$AC I$AC GzPLRx 4$0AC M4\ZAC M---1-->-3-bD.-<?--=?--8--;-1-5-7-a4-N0-03-.-?--?-y-t8-[-&8- - :- :- 5- 5- 1- 4-n 0-P 3-(  1- -= - <- 2-  3-d ; 9-. - 1- - 3-  -=x -T 1-8 - 6-3--=|- -1-@-C-|?-gB-)6-3--=--|-nC-\-=1-%-3-(-$-"-s9-f-\1-F-23-9--1-y-eM2-@"--1-/-B-B-B-wfB-^E6-3-1---/-B-yB-qfB-^MB-E26-,---+- -zslV=-IB-=6/+-'! -   xh `XH@8( @8&%*!)X'0#AA`@ `@ 3AM;@PLV HP   (zP+`u4v$GYVnJ^J^fi5Us  __ZN16vtkTreeMapLayout17SetLayoutStrategyEP24vtkTreeMapLayoutStrategy_PyType_Ready__ZN13vtkPythonArgs8GetValueERx_PyvtkTreeMapLayout_ClassNew_PyvtkTreeAlgorithm_ClassNew_PyVTKObject_New__ZL28PyvtkTreeMapLayout_StaticNewv__ZdaPv__ZN16vtkTreeMapLayout3NewEv__ZN16vtkTreeMapLayout8GetMTimeEv_PyVTKAddFile_vtkTreeMapLayout_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL26PyvtkTreeMapLayout_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_PyErr_Clear_strcmp_strlen__Znam_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIfEC1El_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetArrayEPfi__ZN13vtkPythonArgs8SetArrayEiPKfi__ZN13vtkPythonArgs10GetArgSizeEi_PyLong_FromLong_PyLong_FromLongLong_PyLong_FromUnsignedLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag__ZN16vtkTreeMapLayout14GetBoundingBoxExPf_PyBytes_FromStringAndSize_PyUnicode_FromStringAndSize_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL23PyvtkTreeMapLayout_Type_PyType_Type__Unwind_Resume_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL36PyvtkTreeMapLayout_SetLayoutStrategyP7_objectS0___ZL36PyvtkTreeMapLayout_GetLayoutStrategyP7_objectS0___ZL33PyvtkTreeMapLayout_GetBoundingBoxP7_objectS0___ZL29PyvtkTreeMapLayout_FindVertexP7_objectS0___ZL31PyvtkTreeMapLayout_SafeDownCastP7_objectS0___ZL27PyvtkTreeMapLayout_IsTypeOfP7_objectS0___ZL27PyvtkTreeMapLayout_GetMTimeP7_objectS0___ZL35PyvtkTreeMapLayout_SetSizeArrayNameP7_objectS0___ZL41PyvtkTreeMapLayout_SetRectanglesFieldNameP7_objectS0___ZL41PyvtkTreeMapLayout_GetRectanglesFieldNameP7_objectS0___ZL30PyvtkTreeMapLayout_NewInstanceP7_objectS0___ZL22PyvtkTreeMapLayout_IsAP7_objectS0___ZN16vtkTreeMapLayout10FindVertexEPfS0_GCC_except_table13GCC_except_table12___gxx_personality_v0