# 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 .vtkTreeMapLayoutStrategy import vtkTreeMapLayoutStrategy class vtkSliceAndDiceLayoutStrategy(vtkTreeMapLayoutStrategy): """ vtkSliceAndDiceLayoutStrategy - a horizontal and vertical slicing tree map layout Superclass: vtkTreeMapLayoutStrategy Lays out a tree-map alternating between horizontal and vertical slices, taking into account the relative size of each vertex. @par Thanks: Slice and dice algorithm comes from: Shneiderman, B. 1992. Tree visualization with tree-maps: 2-d space-filling approach. ACM Trans. Graph. 11, 1 (Jan. 1992), 92-99. """ 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 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, coordsArray, sizeArray): # real signature unknown; restored from __doc__ """ Layout(self, inputTree:vtkTree, coordsArray:vtkDataArray, sizeArray:vtkDataArray) -> None C++: void Layout(vtkTree *inputTree, vtkDataArray *coordsArray, vtkDataArray *sizeArray) override; Perform the layout of a tree and place the results as 4-tuples in coordsArray (Xmin, Xmax, Ymin, Ymax). """ pass def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkSliceAndDiceLayoutStrategy C++: vtkSliceAndDiceLayoutStrategy *NewInstance() """ return vtkSliceAndDiceLayoutStrategy def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkSliceAndDiceLayoutStrategy C++: static vtkSliceAndDiceLayoutStrategy *SafeDownCast( vtkObjectBase *o) """ return vtkSliceAndDiceLayoutStrategy 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__': 'vtkSliceAndDiceLayoutStrategy', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'Layout': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkSliceAndDiceLayoutStrategy - a horizontal and vertical slicing\\ntree map layout\\n\\nSuperclass: vtkTreeMapLayoutStrategy\\n\\nLays out a tree-map alternating between horizontal and vertical\\nslices, taking into account the relative size of each vertex.\\n\\n@par Thanks: Slice and dice algorithm comes from: Shneiderman, B.\\n1992. Tree visualization with tree-maps: 2-d space-filling approach.\\nACM Trans. Graph. 11, 1 (Jan. 1992), 92-99.\\n\\n'})" __vtkname__ = 'vtkSliceAndDiceLayoutStrategy'