Public Member Functions | |
None | __init__ (self) |
None | __init__ (self, int size) |
None | __init__ (self, int size, Dipole val) |
None | __init__ (self, std_vector_Dipole vec) |
None | __init__ (self, Dipoles arg0) |
typing.Iterator[Dipole] | __iter__ (self) |
Dipole | autoResizeAt (self, NodeId i) |
None | autoResizeSet (self, NodeId pos, int len, Dipole val) |
None | autoResizeSet (self, NodeId i, Dipole val) |
Dipole | back (self) |
Dipole | back (self) |
NodeId | backId (self) |
NodeId | beginId (self) |
int | capacity (self) |
None | clear (self) |
Dipole | data (self) |
Dipole | data (self) |
bool | empty (self) |
NodeId | endId (self) |
Dipole | front (self) |
Dipole | front (self) |
int | heapBytes (self) |
None | pop_back (self) |
None | push_back (self, Dipole t) |
None | push_back (self, Dipole t) |
None | reserve (self, int capacity) |
None | resize (self, int newSize) |
None | resize (self, int newSize, Dipole t) |
None | resizeWithReserve (self, int newSize) |
None | resizeWithReserve (self, int newSize, Dipole value) |
int | size (self) |
None | swap (self, Dipoles b) |
std_vector_Dipole | vec_ (self) |
None | vec_ (self, std_vector_Dipole arg1) |
Protected Member Functions | |
Dipole | _Subscript (self, NodeId i) |
Dipole | _Subscript (self, NodeId i) |
Static Protected Member Functions | |
_pybind11_conduit_v1_ (*args, **kwargs) | |
Generated from: MR::Dipoles \\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.Dipoles.__init__ | ( | self | ) |
None mrmeshpy.Dipoles.__init__ | ( | self, | |
int | size ) |
None mrmeshpy.Dipoles.__init__ | ( | self, | |
int | size, | ||
Dipole | val ) |
None mrmeshpy.Dipoles.__init__ | ( | self, | |
std_vector_Dipole | vec ) |
None mrmeshpy.Dipoles.__init__ | ( | self, | |
Dipoles | arg0 ) |
Implicit copy constructor.
typing.Iterator[Dipole] mrmeshpy.Dipoles.__iter__ | ( | self | ) |
|
staticprotected |
this accessor automatically adjusts the size of the vector
sets elements [pos, pos+len) to given value, adjusting the size of the vector to include new elements
Dipole mrmeshpy.Dipoles.back | ( | self | ) |
Dipole mrmeshpy.Dipoles.back | ( | self | ) |
NodeId mrmeshpy.Dipoles.backId | ( | self | ) |
returns the identifier of the back() element
NodeId mrmeshpy.Dipoles.beginId | ( | self | ) |
returns the identifier of the first element
int mrmeshpy.Dipoles.capacity | ( | self | ) |
None mrmeshpy.Dipoles.clear | ( | self | ) |
Dipole mrmeshpy.Dipoles.data | ( | self | ) |
Dipole mrmeshpy.Dipoles.data | ( | self | ) |
bool mrmeshpy.Dipoles.empty | ( | self | ) |
NodeId mrmeshpy.Dipoles.endId | ( | self | ) |
returns backId() + 1
Dipole mrmeshpy.Dipoles.front | ( | self | ) |
Dipole mrmeshpy.Dipoles.front | ( | self | ) |
int mrmeshpy.Dipoles.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
None mrmeshpy.Dipoles.pop_back | ( | self | ) |
None mrmeshpy.Dipoles.push_back | ( | self, | |
Dipole | t ) |
None mrmeshpy.Dipoles.push_back | ( | self, | |
Dipole | t ) |
None mrmeshpy.Dipoles.reserve | ( | self, | |
int | capacity ) |
None mrmeshpy.Dipoles.resize | ( | self, | |
int | newSize ) |
None mrmeshpy.Dipoles.resize | ( | self, | |
int | newSize, | ||
Dipole | t ) |
None mrmeshpy.Dipoles.resizeWithReserve | ( | self, | |
int | newSize ) |
doubles reserved memory until resize(newSize) can be done without reallocation
None mrmeshpy.Dipoles.resizeWithReserve | ( | self, | |
int | newSize, | ||
Dipole | value ) |
doubles reserved memory until resize(newSize) can be done without reallocation
int mrmeshpy.Dipoles.size | ( | self | ) |
None mrmeshpy.Dipoles.swap | ( | self, | |
Dipoles | b ) |
std_vector_Dipole mrmeshpy.Dipoles.vec_ | ( | self | ) |
the user can directly manipulate the vector, anyway she cannot break anything
None mrmeshpy.Dipoles.vec_ | ( | self, | |
std_vector_Dipole | arg1 ) |