Protected Member Functions | |
Id_EdgeTag | _Subscript (self, UndirectedEdgeId i) |
Id_EdgeTag | _Subscript (self, UndirectedEdgeId i) |
Generated from: MR::WholeEdgeMap \\brief std::vector<T>-like container that requires specific indexing type, \\tparam T type of stored elements \\tparam I type of index (shall be convertible to size_t) \\ingroup BasicGroup
None mrmeshpy.WholeEdgeMap.__init__ | ( | self | ) |
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
int | size ) |
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
int | size, | ||
Id_EdgeTag | val ) |
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
std_vector_Id_EdgeTag | vec ) |
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
WholeEdgeMap | arg0 ) |
Implicit copy constructor.
bool mrmeshpy.WholeEdgeMap.__eq__ | ( | self, | |
WholeEdgeMap | b ) |
typing.Iterator[Id_EdgeTag] mrmeshpy.WholeEdgeMap.__iter__ | ( | self | ) |
bool mrmeshpy.WholeEdgeMap.__ne__ | ( | self, | |
WholeEdgeMap | b ) |
|
protected |
|
protected |
Id_EdgeTag mrmeshpy.WholeEdgeMap.autoResizeAt | ( | self, | |
UndirectedEdgeId | i ) |
this accessor automatically adjusts the size of the vector
None mrmeshpy.WholeEdgeMap.autoResizeSet | ( | self, | |
UndirectedEdgeId | i, | ||
Id_EdgeTag | val ) |
None mrmeshpy.WholeEdgeMap.autoResizeSet | ( | self, | |
UndirectedEdgeId | pos, | ||
int | len, | ||
Id_EdgeTag | val ) |
sets elements [pos, pos+len) to given value, adjusting the size of the vector to include new elements
Id_EdgeTag mrmeshpy.WholeEdgeMap.back | ( | self | ) |
Id_EdgeTag mrmeshpy.WholeEdgeMap.back | ( | self | ) |
UndirectedEdgeId mrmeshpy.WholeEdgeMap.backId | ( | self | ) |
returns the identifier of the back() element
UndirectedEdgeId mrmeshpy.WholeEdgeMap.beginId | ( | self | ) |
returns the identifier of the first element
int mrmeshpy.WholeEdgeMap.capacity | ( | self | ) |
None mrmeshpy.WholeEdgeMap.clear | ( | self | ) |
Id_EdgeTag mrmeshpy.WholeEdgeMap.data | ( | self | ) |
Id_EdgeTag mrmeshpy.WholeEdgeMap.data | ( | self | ) |
Id_EdgeTag mrmeshpy.WholeEdgeMap.emplace_back | ( | self | ) |
bool mrmeshpy.WholeEdgeMap.empty | ( | self | ) |
UndirectedEdgeId mrmeshpy.WholeEdgeMap.endId | ( | self | ) |
returns backId() + 1
Id_EdgeTag mrmeshpy.WholeEdgeMap.front | ( | self | ) |
Id_EdgeTag mrmeshpy.WholeEdgeMap.front | ( | self | ) |
int mrmeshpy.WholeEdgeMap.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
None mrmeshpy.WholeEdgeMap.pop_back | ( | self | ) |
None mrmeshpy.WholeEdgeMap.push_back | ( | self, | |
Id_EdgeTag | t ) |
None mrmeshpy.WholeEdgeMap.push_back | ( | self, | |
Id_EdgeTag | t ) |
None mrmeshpy.WholeEdgeMap.reserve | ( | self, | |
int | capacity ) |
None mrmeshpy.WholeEdgeMap.resize | ( | self, | |
int | newSize ) |
None mrmeshpy.WholeEdgeMap.resize | ( | self, | |
int | newSize, | ||
Id_EdgeTag | t ) |
None mrmeshpy.WholeEdgeMap.resizeNoInit | ( | self, | |
int | targetSize ) |
resizes the vector skipping initialization of its elements (more precisely initializing them using ( noInit ) constructor )
None mrmeshpy.WholeEdgeMap.resizeWithReserve | ( | self, | |
int | newSize ) |
doubles reserved memory until resize(newSize) can be done without reallocation
None mrmeshpy.WholeEdgeMap.resizeWithReserve | ( | self, | |
int | newSize, | ||
Id_EdgeTag | value ) |
doubles reserved memory until resize(newSize) can be done without reallocation
int mrmeshpy.WholeEdgeMap.size | ( | self | ) |
None mrmeshpy.WholeEdgeMap.swap | ( | self, | |
WholeEdgeMap | b ) |
std_vector_Id_EdgeTag mrmeshpy.WholeEdgeMap.vec_ | ( | self | ) |
the user can directly manipulate the vector, anyway she cannot break anything
None mrmeshpy.WholeEdgeMap.vec_ | ( | self, | |
std_vector_Id_EdgeTag | arg1 ) |