Public Member Functions | |
| bool | __eq__ (self, Vector_VertId_EdgeId b) |
| VertId | __getitem__ (self, EdgeId i) |
| VertId | __getitem__ (self, EdgeId i) |
| None | __init__ (self) |
| None | __init__ (self, int size) |
| None | __init__ (self, int size, VertId val) |
| None | __init__ (self, std_vector_Id_VertTag vec) |
| None | __init__ (self, Vector_VertId_EdgeId arg0) |
| typing.Iterator[VertId] | __iter__ (self) |
| bool | __ne__ (self, Vector_VertId_EdgeId b) |
| None | __setitem__ (self, EdgeId arg0, VertId arg1) |
| VertId | autoResizeAt (self, EdgeId i) |
| None | autoResizeSet (self, EdgeId pos, int len, VertId val) |
| None | autoResizeSet (self, EdgeId i, VertId val) |
| VertId | back (self) |
| VertId | back (self) |
| EdgeId | backId (self) |
| EdgeId | beginId (self) |
| int | capacity (self) |
| None | clear (self) |
| VertId | data (self) |
| VertId | data (self) |
| VertId | emplace_back (self) |
| bool | empty (self) |
| EdgeId | endId (self) |
| VertId | front (self) |
| VertId | front (self) |
| int | heapBytes (self) |
| None | pop_back (self) |
| None | push_back (self, VertId t) |
| None | push_back (self, VertId t) |
| None | reserve (self, int capacity) |
| None | resize (self, int newSize) |
| None | resize (self, int newSize, VertId t) |
| None | resizeNoInit (self, int targetSize) |
| None | resizeWithReserve (self, int newSize) |
| None | resizeWithReserve (self, int newSize, VertId value) |
| int | size (self) |
| None | swap (self, Vector_VertId_EdgeId b) |
| std_vector_Id_VertTag | vec_ (self) |
| None | vec_ (self, std_vector_Id_VertTag arg1) |
Static Public Member Functions | |
| None | __init__ (*args, **kwargs) |
| Vector_VertId_EdgeId | operator (*args, **kwargs) |
| Vector_VertId_EdgeId | operator (*args, **kwargs) |
Static Protected Attributes | |
| typing | _offsetof_vec_ = 0 |
Generated from: MR::Vector<MR::VertId, MR::EdgeId> \\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)
|
static |
| None mrmeshpy.Vector_VertId_EdgeId.__init__ | ( | self | ) |
creates empty vector
| None mrmeshpy.Vector_VertId_EdgeId.__init__ | ( | self, | |
| int | size ) |
creates a vector with \\p size elements with default value
| None mrmeshpy.Vector_VertId_EdgeId.__init__ | ( | self, | |
| int | size, | ||
| VertId | val ) |
creates a vector with \\p size elements with the given value
| None mrmeshpy.Vector_VertId_EdgeId.__init__ | ( | self, | |
| std_vector_Id_VertTag | vec ) |
moves data from the given std::vector<T>
| None mrmeshpy.Vector_VertId_EdgeId.__init__ | ( | self, | |
| Vector_VertId_EdgeId | arg0 ) |
Implicit copy constructor.
| bool mrmeshpy.Vector_VertId_EdgeId.__eq__ | ( | self, | |
| Vector_VertId_EdgeId | b ) |
| typing.Iterator[VertId] mrmeshpy.Vector_VertId_EdgeId.__iter__ | ( | self | ) |
| bool mrmeshpy.Vector_VertId_EdgeId.__ne__ | ( | self, | |
| Vector_VertId_EdgeId | b ) |
this accessor automatically adjusts the size of the vector
sets the element #i to the given value, adjusting the size of the vector to include new element
sets elements [pos, pos+len) to the given value, adjusting the size of the vector to include new elements; the elements in between old size and \\p pos are also set to \\p val (for faster implementation)
| VertId mrmeshpy.Vector_VertId_EdgeId.back | ( | self | ) |
| VertId mrmeshpy.Vector_VertId_EdgeId.back | ( | self | ) |
| EdgeId mrmeshpy.Vector_VertId_EdgeId.backId | ( | self | ) |
returns the identifier of the back() element
| EdgeId mrmeshpy.Vector_VertId_EdgeId.beginId | ( | self | ) |
returns the identifier of the first element
| int mrmeshpy.Vector_VertId_EdgeId.capacity | ( | self | ) |
| None mrmeshpy.Vector_VertId_EdgeId.clear | ( | self | ) |
| VertId mrmeshpy.Vector_VertId_EdgeId.data | ( | self | ) |
| VertId mrmeshpy.Vector_VertId_EdgeId.data | ( | self | ) |
| VertId mrmeshpy.Vector_VertId_EdgeId.emplace_back | ( | self | ) |
| bool mrmeshpy.Vector_VertId_EdgeId.empty | ( | self | ) |
| EdgeId mrmeshpy.Vector_VertId_EdgeId.endId | ( | self | ) |
returns backId() + 1
| VertId mrmeshpy.Vector_VertId_EdgeId.front | ( | self | ) |
| VertId mrmeshpy.Vector_VertId_EdgeId.front | ( | self | ) |
| int mrmeshpy.Vector_VertId_EdgeId.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
|
static |
|
static |
| None mrmeshpy.Vector_VertId_EdgeId.pop_back | ( | self | ) |
| None mrmeshpy.Vector_VertId_EdgeId.push_back | ( | self, | |
| VertId | t ) |
| None mrmeshpy.Vector_VertId_EdgeId.push_back | ( | self, | |
| VertId | t ) |
| None mrmeshpy.Vector_VertId_EdgeId.reserve | ( | self, | |
| int | capacity ) |
| None mrmeshpy.Vector_VertId_EdgeId.resize | ( | self, | |
| int | newSize ) |
| None mrmeshpy.Vector_VertId_EdgeId.resize | ( | self, | |
| int | newSize, | ||
| VertId | t ) |
| None mrmeshpy.Vector_VertId_EdgeId.resizeNoInit | ( | self, | |
| int | targetSize ) |
resizes the vector skipping initialization of its elements (more precisely initializing them using ( noInit ) constructor )
| None mrmeshpy.Vector_VertId_EdgeId.resizeWithReserve | ( | self, | |
| int | newSize ) |
doubles reserved memory until resize(newSize) can be done without reallocation
| None mrmeshpy.Vector_VertId_EdgeId.resizeWithReserve | ( | self, | |
| int | newSize, | ||
| VertId | value ) |
doubles reserved memory until resize(newSize, value) can be done without reallocation
| int mrmeshpy.Vector_VertId_EdgeId.size | ( | self | ) |
| None mrmeshpy.Vector_VertId_EdgeId.swap | ( | self, | |
| Vector_VertId_EdgeId | b ) |
| std_vector_Id_VertTag mrmeshpy.Vector_VertId_EdgeId.vec_ | ( | self | ) |
the user can directly manipulate the vector, anyway she cannot break anything
| None mrmeshpy.Vector_VertId_EdgeId.vec_ | ( | self, | |
| std_vector_Id_VertTag | arg1 ) |
|
staticprotected |