((,(,__text__TEXT:.__gcc_except_tab__TEXT<__data__DATA`(h4=__cstring__TEXT h__compact_unwind__LD&`P)P6__eh_frame__TEXT(@+6 h2  7I; P3UHH=H5HH uHH=H]ÐUH]fDUHSPHH=H5HH uHH=H5nHHt H tH[]H=H[]fUHAVSH0HuHHEЋFEHEHEH}ȃHuH]H=HAtDH=$Ht1H=$HtH=$Ht HLcHuL1H0[A^]UHAWAVSH(HuHHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=LAtuH=#LtbH=#LtOH=#Lt1+E1#ILHuHHH([A^A_]UHAVSH HuH!HEDvDuHG]]y HHt+H(Ht"D9u!Et-HHt(1.H}111HHuHHHH [A^]f.DUHAVSH HuH*HEDvDuHG]]y HHt(H(HtD9uEt*H1Ht(1.H}111HHuHHHH [A^]fUHAVSH HuHFHEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAWAVSH(HuHAHED~D}HG]ԉ]؅y HHt`Lw(MtWA)Au;H5H}HU}t4LHHuHHH}1H([A^A_]fUHAVSH HuH1HEDvDuHG]]y HHt%H(HtD9uEt'HHt+1>H}111-HHHuHHxHHH [A^]DUHAWAVSH8HuHHED~D}HG]̉]Ѕy HHt~Lw(MtuA)H}AuYHutVHEHEHuLHE.Euz E.Eu{ Ht(Hu:1H8[A^A_]H}HU1HuHUHAWAVAUATSHHHuHHEFEHGM̉MЅyHHhL(H}AC6HcH}Le1EIcM,LDMbE+ẼH}HuH}LDDEArII9IDI91HHHHHtfA4AtHHuHnDA ALALALALALAL AL ALALALALALALALALHH9u H}1H}HEH9NSE1؃HpHHH‰уHs1qHH)1AALADALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpH HuHt8HHf.ADA ADALH HuH9cHuLLE~;1AA.Du z HH9uHuH}LDHt+1H}HEH9t HtHHH[A\A]A^A_]HHH}HEH9uHH}HEH9t HtH m.HDS#hyQb  w!!@"U" ####g$p$$$%%vtkAreaLayoutvtkInfovisLayoutPython.vtkAreaLayoutvtkAreaLayout - layout a vtkTree into a tree map Superclass: vtkTreeAlgorithm vtkAreaLayout assigns sector regions to each vertex in the tree, creating a tree ring. The data is added as a data array with four components per tuple representing the location and size of the sector using the format (StartAngle, EndAngle, innerRadius, outerRadius). This algorithm relies on a helper class to perform the actual layout. This helper class is a subclass of vtkAreaLayoutStrategy. @par Thanks: Thanks to Jason Shepherd from Sandia National Laboratories for help developing this class. 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) -> vtkAreaLayout C++: static vtkAreaLayout *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkAreaLayout C++: vtkAreaLayout *NewInstance() SetSizeArrayNameV.SetSizeArrayName(string) C++: virtual void SetSizeArrayName(const char *name) The array name to use for retrieving the relative size of each vertex. If this array is not found, use constant size for each vertex. GetAreaArrayNameV.GetAreaArrayName() -> string C++: virtual char *GetAreaArrayName() The name for the array created for the area for each vertex. The rectangles are stored in a quadruple float array (startAngle, endAngle, innerRadius, outerRadius). For rectangular layouts, this is (minx, maxx, miny, maxy). SetAreaArrayNameV.SetAreaArrayName(string) C++: virtual void SetAreaArrayName(const char *_arg) The name for the array created for the area for each vertex. The rectangles are stored in a quadruple float array (startAngle, endAngle, innerRadius, outerRadius). For rectangular layouts, this is (minx, maxx, miny, maxy). GetEdgeRoutingPointsV.GetEdgeRoutingPoints() -> bool C++: virtual bool GetEdgeRoutingPoints() Whether to output a second output tree with vertex locations appropriate for routing bundled edges. Default is on. SetEdgeRoutingPointsV.SetEdgeRoutingPoints(bool) C++: virtual void SetEdgeRoutingPoints(bool _arg) Whether to output a second output tree with vertex locations appropriate for routing bundled edges. Default is on. EdgeRoutingPointsOnV.EdgeRoutingPointsOn() C++: virtual void EdgeRoutingPointsOn() Whether to output a second output tree with vertex locations appropriate for routing bundled edges. Default is on. EdgeRoutingPointsOffV.EdgeRoutingPointsOff() C++: virtual void EdgeRoutingPointsOff() Whether to output a second output tree with vertex locations appropriate for routing bundled edges. Default is on. GetLayoutStrategyV.GetLayoutStrategy() -> vtkAreaLayoutStrategy C++: virtual vtkAreaLayoutStrategy *GetLayoutStrategy() The strategy to use when laying out the tree map. SetLayoutStrategyV.SetLayoutStrategy(vtkAreaLayoutStrategy) C++: void SetLayoutStrategy(vtkAreaLayoutStrategy *strategy) The strategy to use when laying out the tree map. GetMTimeV.GetMTime() -> int C++: vtkMTimeType GetMTime() override; Get the modification time of the layout algorithm. FindVertexV.FindVertex([float, float]) -> int C++: vtkIdType FindVertex(float pnt[2]) Get the vertex whose area contains the point, or return -1 if no vertex area covers the point. GetBoundingAreaV.GetBoundingArea(int, [float, ...]) C++: void GetBoundingArea(vtkIdType id, float *sinfo) The bounding area information for a certain vertex id. vtkTreeAlgorithmvtkAlgorithmvtkObjectvtkObjectBasevtkAreaLayoutStrategyOP `!:a!!aaa !P a@ ! ! !` a !aZXA<zRx $OAC $D AC $lAC B$pAC G$(:AC I$@AC G$ AC G$4AC I$\xAC I$@AC I$AC G$AC I$XAC G$$AC G$LxAC G$tAC I$AC G$0AC IzPLRx 4$Z3AC M42-,D-1=D--B--4-|:->-A-Q=->9- <---B-:---b3-J>-<----:--|7-\<-2:- 1= - 5- ;-  <-t K C-> -+ :- - <-  1= - :-g -< <-  1= - :- -| <-R + 1= - :- - @- <-d = -0 - :- - <-  1=| - -:-E-H-|D-gG-)?-<-1=--|#-nH-\-=:-%-<-1=-t:-X--?-<-,-(-&-sC-f-\:-F-2<-C--:-y-eM;-@"--:-8-G-G-G-wfG-^E?-<-:---8-G-yG-qfG-^MG-E2?-0--!-/-$-zslV6-IB!-=6//-'!$-xh`XH@8(     xh `XH@8( @8*).% -X+0'"XPF@ `@ `@ FMU`pPm tz CP @   ` I ;<`o- Ap>Y5WCI}lQIw)O__ZN13vtkAreaLayout17SetLayoutStrategyEP21vtkAreaLayoutStrategy_PyType_Ready__ZN13vtkPythonArgs8GetValueERx_PyvtkAreaLayout_ClassNew_PyvtkTreeAlgorithm_ClassNew_PyVTKObject_New__ZL25PyvtkAreaLayout_StaticNewv__ZdaPv__ZN13vtkAreaLayout3NewEv__ZN13vtkAreaLayout8GetMTimeEv_PyVTKAddFile_vtkAreaLayout_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL23PyvtkAreaLayout_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKObject_AsBuffer_PyErr_Clear_strcmp_strlen__Znam_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIfEC1El_PyVTKObject_Check__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetArrayEPfi__ZN13vtkPythonArgs8SetArrayEiPKfi__ZN13vtkPythonArgs10GetArgSizeEi_PyBool_FromLong_PyLong_FromLong_PyLong_FromLongLong_PyLong_FromUnsignedLong_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag__ZN13vtkAreaLayout15GetBoundingAreaExPf__ZN13vtkAreaLayout10FindVertexEPf_PyBytes_FromStringAndSize_PyUnicode_FromStringAndSize_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL20PyvtkAreaLayout_Type_PyType_Type__Unwind_Resume_PyErr_Occurred_PyVTKClass_Add__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN13vtkPythonArgs8GetValueERb__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL33PyvtkAreaLayout_SetLayoutStrategyP7_objectS0___ZL33PyvtkAreaLayout_GetLayoutStrategyP7_objectS0___ZL26PyvtkAreaLayout_FindVertexP7_objectS0___ZL28PyvtkAreaLayout_SafeDownCastP7_objectS0___ZL36PyvtkAreaLayout_SetEdgeRoutingPointsP7_objectS0___ZL36PyvtkAreaLayout_GetEdgeRoutingPointsP7_objectS0___ZL35PyvtkAreaLayout_EdgeRoutingPointsOnP7_objectS0___ZL36PyvtkAreaLayout_EdgeRoutingPointsOffP7_objectS0___ZL24PyvtkAreaLayout_IsTypeOfP7_objectS0___ZL24PyvtkAreaLayout_GetMTimeP7_objectS0___ZL32PyvtkAreaLayout_SetSizeArrayNameP7_objectS0___ZL32PyvtkAreaLayout_SetAreaArrayNameP7_objectS0___ZL32PyvtkAreaLayout_GetAreaArrayNameP7_objectS0___ZL27PyvtkAreaLayout_NewInstanceP7_objectS0___ZL31PyvtkAreaLayout_GetBoundingAreaP7_objectS0___ZL19PyvtkAreaLayout_IsAP7_objectS0_GCC_except_table18___gxx_personality_v0