# encoding: utf-8 # module vtkmodules.vtkCommonDataModel # from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkCommonDataModel.cp311-win_amd64.pyd # by generator 1.147 # no doc # imports import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore import vtkmodules.vtkCommonMath as __vtkmodules_vtkCommonMath import vtkmodules.vtkCommonTransforms as __vtkmodules_vtkCommonTransforms class vtkAdjacentVertexIterator(__vtkmodules_vtkCommonCore.vtkObject): """ vtkAdjacentVertexIterator - Iterates through adjacent vertices in a graph. Superclass: vtkObject vtkAdjacentVertexIterator iterates through all vertices adjacent to a vertex, i.e. the vertices which may be reached by traversing an out edge of the source vertex. Use graph->GetAdjacentVertices(v, it) to initialize the iterator. """ def GetGraph(self): # real signature unknown; restored from __doc__ """ GetGraph(self) -> vtkGraph C++: virtual vtkGraph *GetGraph() Get the graph and vertex associated with this iterator. """ return vtkGraph 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 GetVertex(self): # real signature unknown; restored from __doc__ """ GetVertex(self) -> int C++: virtual vtkIdType GetVertex() """ return 0 def HasNext(self): # real signature unknown; restored from __doc__ """ HasNext(self) -> bool C++: bool HasNext() Whether this iterator has more edges. """ return False def Initialize(self, g, v): # real signature unknown; restored from __doc__ """ Initialize(self, g:vtkGraph, v:int) -> None C++: void Initialize(vtkGraph *g, vtkIdType v) Initialize the iterator with a graph and vertex. """ pass 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 NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkAdjacentVertexIterator C++: vtkAdjacentVertexIterator *NewInstance() """ return vtkAdjacentVertexIterator def Next(self): # real signature unknown; restored from __doc__ """ Next(self) -> int C++: vtkIdType Next() Returns the next edge in the graph. """ return 0 def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkAdjacentVertexIterator C++: static vtkAdjacentVertexIterator *SafeDownCast( vtkObjectBase *o) """ return vtkAdjacentVertexIterator 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__': 'vtkAdjacentVertexIterator', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'Initialize': , 'GetGraph': , 'GetVertex': , 'Next': , 'HasNext': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkAdjacentVertexIterator - Iterates through adjacent vertices in a\\ngraph.\\n\\nSuperclass: vtkObject\\n\\nvtkAdjacentVertexIterator iterates through all vertices adjacent to a\\nvertex, i.e. the vertices which may be reached by traversing an out\\nedge of the source vertex. Use graph->GetAdjacentVertices(v, it) to\\ninitialize the iterator.\\n\\n'})" __vtkname__ = 'vtkAdjacentVertexIterator'