Public Member Functions | |
| bool | __eq__ (self, ConstUndirectedEdgeMap b) |
| ConstUndirectedEdgeId | __getitem__ (self, ConstUndirectedEdgeId i) |
| __init__ (self, *args, **kwargs) | |
| typing.Iterator[ConstUndirectedEdgeId] | __iter__ (self) |
| int | __len__ (self) |
| bool | __ne__ (self, ConstUndirectedEdgeMap b) |
| ConstUndirectedEdgeId | back (self) |
| UndirectedEdgeId | backId (self) |
| UndirectedEdgeId | beginId (self) |
| int | capacity (self) |
| ConstUndirectedEdgeId | data (self) |
| bool | empty (self) |
| UndirectedEdgeId | endId (self) |
| ConstUndirectedEdgeId | front (self) |
| int | heapBytes (self) |
| int | max_size (self) |
| int | size (self) |
| Const_std_vector_Id_UndirectedEdgeTag_Allocator_Id_UndirectedEdgeTag | vec (self) |
Static Protected Attributes | |
| typing | _offsetof_vec = 0 |
Generated from: MR::UndirectedEdgeMap Aliases: MapOrHashMap_UndirectedEdgeId_UndirectedEdgeId.Dense Vector<T> is indexed by size_t
| mrmeshpy.ConstUndirectedEdgeMap.__init__ | ( | self, | |
| * | args, | ||
| ** | kwargs ) |
__init__(*args, **kwargs) Overloaded function. 1. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap) -> None creates empty vector 2. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap, size: int) -> None creates a vector with \\p size elements with default value 3. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap, size: int, val: meshlib.mrmeshpy.ConstUndirectedEdgeId) -> None creates a vector with \\p size elements with the given value 4. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap, arg0: list) -> None 5. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap, arg0: meshlib.mrmeshpy.ConstUndirectedEdgeMap) -> None Implicit copy constructor. 6. __init__(self: meshlib.mrmeshpy.ConstUndirectedEdgeMap, : meshlib.mrmeshpy.ConstUndirectedEdgeMap) -> None
| bool mrmeshpy.ConstUndirectedEdgeMap.__eq__ | ( | self, | |
| ConstUndirectedEdgeMap | b ) |
| ConstUndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.__getitem__ | ( | self, | |
| ConstUndirectedEdgeId | i ) |
| typing.Iterator[ConstUndirectedEdgeId] mrmeshpy.ConstUndirectedEdgeMap.__iter__ | ( | self | ) |
| int mrmeshpy.ConstUndirectedEdgeMap.__len__ | ( | self | ) |
| bool mrmeshpy.ConstUndirectedEdgeMap.__ne__ | ( | self, | |
| ConstUndirectedEdgeMap | b ) |
| ConstUndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.back | ( | self | ) |
Reimplemented in mrmeshpy.UndirectedEdgeMap, and mrmeshpy.UndirectedEdgeMap.
| UndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.backId | ( | self | ) |
returns the identifier of the back() element
| UndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.beginId | ( | self | ) |
returns the identifier of the first element
| int mrmeshpy.ConstUndirectedEdgeMap.capacity | ( | self | ) |
| ConstUndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.data | ( | self | ) |
Reimplemented in mrmeshpy.UndirectedEdgeMap, and mrmeshpy.UndirectedEdgeMap.
| bool mrmeshpy.ConstUndirectedEdgeMap.empty | ( | self | ) |
| UndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.endId | ( | self | ) |
returns backId() + 1
| ConstUndirectedEdgeId mrmeshpy.ConstUndirectedEdgeMap.front | ( | self | ) |
Reimplemented in mrmeshpy.UndirectedEdgeMap, and mrmeshpy.UndirectedEdgeMap.
| int mrmeshpy.ConstUndirectedEdgeMap.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
| int mrmeshpy.ConstUndirectedEdgeMap.max_size | ( | self | ) |
| int mrmeshpy.ConstUndirectedEdgeMap.size | ( | self | ) |
| Const_std_vector_Id_UndirectedEdgeTag_Allocator_Id_UndirectedEdgeTag mrmeshpy.ConstUndirectedEdgeMap.vec | ( | self | ) |
The user can directly manipulate the vector, they can't break anything anyway.
Reimplemented in mrmeshpy.UndirectedEdgeMap, and mrmeshpy.UndirectedEdgeMap.
|
staticprotected |