# encoding: utf-8 # module vtkmodules.vtkInfovisLayout # from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkInfovisLayout.cp311-win_amd64.pyd # by generator 1.147 # no doc # imports import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore import vtkmodules.vtkCommonExecutionModel as __vtkmodules_vtkCommonExecutionModel from .vtkCirclePackLayoutStrategy import vtkCirclePackLayoutStrategy class vtkCirclePackFrontChainLayoutStrategy(vtkCirclePackLayoutStrategy): """ vtkCirclePackFrontChainLayoutStrategy - layout a vtkTree into packed circles using the front chain algorithm. Superclass: vtkCirclePackLayoutStrategy vtkCirclePackFrontChainLayoutStrategy assigns circles to each node of the input vtkTree using the front chain algorithm. The algorithm packs circles by searching a "front chain" of circles around the perimeter of the circles that have already been packed for the current level in the tree hierarchy. Searching the front chain is in general faster than searching all of the circles that have been packed at the current level. WARNING: The algorithm tends to break down and produce packings with overlapping circles when there is a large difference in the radii of the circles at a given level of the tree hierarchy. Roughly on the order a 1000:1 ratio of circle radii. Please see the following reference for more details on the algorithm. Title: "Visualization of large hierarchical data by circle packing" Authors: Weixin Wang, Hui Wang, Guozhong Dai, Hongan Wang Conference: Proceedings of the SIGCHI conference on Human Factors in computing systems Year: 2006 """ def GetHeight(self): # real signature unknown; restored from __doc__ """ GetHeight(self) -> int C++: virtual int GetHeight() """ return 0 def GetNumberOfGenerationsFromBase(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBase(self, type:str) -> int C++: vtkIdType GetNumberOfGenerationsFromBase(const char *type) override; Given the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetNumberOfGenerationsFromBaseType(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBaseType(type:str) -> int C++: static vtkIdType GetNumberOfGenerationsFromBaseType( const char *type) Given a the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetWidth(self): # real signature unknown; restored from __doc__ """ GetWidth(self) -> int C++: virtual int GetWidth() Width and Height define the size of the output window that the circle packing is placed inside. Defaults to Width 1, Height 1 """ return 0 def IsA(self, type): # real signature unknown; restored from __doc__ """ IsA(self, type:str) -> 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. """ return 0 def IsTypeOf(self, type): # real signature unknown; restored from __doc__ """ IsTypeOf(type:str) -> 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. """ return 0 def Layout(self, inputTree, areaArray, sizeArray): # real signature unknown; restored from __doc__ """ Layout(self, inputTree:vtkTree, areaArray:vtkDataArray, sizeArray:vtkDataArray) -> None C++: void Layout(vtkTree *inputTree, vtkDataArray *areaArray, vtkDataArray *sizeArray) override; Perform the layout of the input tree, and store the circle bounds of each vertex as a tuple in a data array. (Xcenter, Ycenter, Radius). """ pass def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkCirclePackFrontChainLayoutStrategy C++: vtkCirclePackFrontChainLayoutStrategy *NewInstance() """ return vtkCirclePackFrontChainLayoutStrategy def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkCirclePackFrontChainLayoutStrategy C++: static vtkCirclePackFrontChainLayoutStrategy *SafeDownCast( vtkObjectBase *o) """ return vtkCirclePackFrontChainLayoutStrategy def SetHeight(self, _arg): # real signature unknown; restored from __doc__ """ SetHeight(self, _arg:int) -> None C++: virtual void SetHeight(int _arg) """ pass def SetWidth(self, _arg): # real signature unknown; restored from __doc__ """ SetWidth(self, _arg:int) -> None C++: virtual void SetWidth(int _arg) """ pass def __delattr__(self, *args, **kwargs): # real signature unknown """ Implement delattr(self, name). """ pass def __getattribute__(self, *args, **kwargs): # real signature unknown """ Return getattr(self, name). """ pass def __init__(self, *args, **kwargs): # real signature unknown pass @staticmethod # known case of __new__ def __new__(*args, **kwargs): # real signature unknown """ Create and return a new object. See help(type) for accurate signature. """ pass def __repr__(self, *args, **kwargs): # real signature unknown """ Return repr(self). """ pass def __setattr__(self, *args, **kwargs): # real signature unknown """ Implement setattr(self, name, value). """ pass def __str__(self, *args, **kwargs): # real signature unknown """ Return str(self). """ pass __this__ = property(lambda self: object(), lambda self, v: None, lambda self: None) # default """Pointer to the C++ object.""" __dict__ = None # (!) real value is 'mappingproxy({\'__vtkname__\': \'vtkCirclePackFrontChainLayoutStrategy\', \'IsTypeOf\': , \'IsA\': , \'SafeDownCast\': , \'NewInstance\': , \'GetNumberOfGenerationsFromBaseType\': , \'GetNumberOfGenerationsFromBase\': , \'Layout\': , \'GetWidth\': , \'SetWidth\': , \'GetHeight\': , \'SetHeight\': , \'__new__\': , \'__repr__\': , \'__str__\': , \'__getattribute__\': , \'__setattr__\': , \'__delattr__\': , \'__dict__\': , \'__this__\': , \'__doc__\': \'vtkCirclePackFrontChainLayoutStrategy - layout a vtkTree into packed\\ncircles using the front chain algorithm.\\n\\nSuperclass: vtkCirclePackLayoutStrategy\\n\\nvtkCirclePackFrontChainLayoutStrategy assigns circles to each node of\\nthe input vtkTree using the front chain algorithm. The algorithm\\npacks circles by searching a "front chain" of circles around the\\nperimeter of the circles that have already been packed for the\\ncurrent level in the tree hierarchy. Searching the front chain is in\\ngeneral faster than searching all of the circles that have been\\npacked at the current level.\\n\\nWARNING: The algorithm tends to break down and produce packings with\\noverlapping circles when there is a large difference in the radii of\\nthe circles at a given level of the tree hierarchy. Roughly on the\\norder a 1000:1 ratio of circle radii.\\n\\nPlease see the following reference for more details on the algorithm.\\n\\nTitle: "Visualization of large hierarchical data by circle packing"\\nAuthors: Weixin Wang, Hui Wang, Guozhong Dai, Hongan Wang\\nConference: Proceedings of the SIGCHI conference on Human Factors in\\ncomputing systems Year: 2006\\n\\n\'})' __vtkname__ = 'vtkCirclePackFrontChainLayoutStrategy'