Public Member Functions | |
bool | __eq__ (self, WholeEdgeMap b) |
EdgeId | __getitem__ (self, UndirectedEdgeId i) |
EdgeId | __getitem__ (self, UndirectedEdgeId i) |
None | __init__ (self) |
None | __init__ (self, int size) |
None | __init__ (self, int size, EdgeId val) |
None | __init__ (self, std_vector_Id_EdgeTag vec) |
typing.Iterator[EdgeId] | __iter__ (self) |
bool | __ne__ (self, WholeEdgeMap b) |
None | __setitem__ (self, UndirectedEdgeId arg0, EdgeId arg1) |
EdgeId | autoResizeAt (self, UndirectedEdgeId i) |
None | autoResizeSet (self, UndirectedEdgeId pos, int len, EdgeId val) |
None | autoResizeSet (self, UndirectedEdgeId i, EdgeId val) |
EdgeId | back (self) |
EdgeId | back (self) |
UndirectedEdgeId | backId (self) |
UndirectedEdgeId | beginId (self) |
int | capacity (self) |
None | clear (self) |
EdgeId | data (self) |
EdgeId | data (self) |
EdgeId | emplace_back (self) |
bool | empty (self) |
UndirectedEdgeId | endId (self) |
EdgeId | front (self) |
EdgeId | front (self) |
int | heapBytes (self) |
None | pop_back (self) |
None | push_back (self, EdgeId t) |
None | push_back (self, EdgeId t) |
None | reserve (self, int capacity) |
None | resize (self, int newSize) |
None | resize (self, int newSize, EdgeId t) |
None | resizeNoInit (self, int targetSize) |
None | resizeWithReserve (self, int newSize) |
None | resizeWithReserve (self, int newSize, EdgeId value) |
int | size (self) |
None | swap (self, WholeEdgeMap b) |
std_vector_Id_EdgeTag | vec_ (self) |
None | vec_ (self, std_vector_Id_EdgeTag arg1) |
Static Public Member Functions | |
None | __init__ (*args, **kwargs) |
WholeEdgeMap | operator (*args, **kwargs) |
WholeEdgeMap | operator (*args, **kwargs) |
Static Protected Attributes | |
typing | _offsetof_vec_ = 0 |
Generated from: MR::WholeEdgeMap Aliases: MapOrHashMap_UndirectedEdgeId_Id_EdgeTag_Dense \\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.WholeEdgeMap.__init__ | ( | self | ) |
creates empty vector
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
int | size ) |
creates a vector with \\p size elements with default value
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
int | size, | ||
EdgeId | val ) |
creates a vector with \\p size elements with the given value
None mrmeshpy.WholeEdgeMap.__init__ | ( | self, | |
std_vector_Id_EdgeTag | vec ) |
moves data from the given std::vector<T>
bool mrmeshpy.WholeEdgeMap.__eq__ | ( | self, | |
WholeEdgeMap | b ) |
EdgeId mrmeshpy.WholeEdgeMap.__getitem__ | ( | self, | |
UndirectedEdgeId | i ) |
EdgeId mrmeshpy.WholeEdgeMap.__getitem__ | ( | self, | |
UndirectedEdgeId | i ) |
typing.Iterator[EdgeId] mrmeshpy.WholeEdgeMap.__iter__ | ( | self | ) |
bool mrmeshpy.WholeEdgeMap.__ne__ | ( | self, | |
WholeEdgeMap | b ) |
None mrmeshpy.WholeEdgeMap.__setitem__ | ( | self, | |
UndirectedEdgeId | arg0, | ||
EdgeId | arg1 ) |
EdgeId mrmeshpy.WholeEdgeMap.autoResizeAt | ( | self, | |
UndirectedEdgeId | i ) |
this accessor automatically adjusts the size of the vector
None mrmeshpy.WholeEdgeMap.autoResizeSet | ( | self, | |
UndirectedEdgeId | i, | ||
EdgeId | val ) |
sets the element #i to the given value, adjusting the size of the vector to include new element
None mrmeshpy.WholeEdgeMap.autoResizeSet | ( | self, | |
UndirectedEdgeId | pos, | ||
int | len, | ||
EdgeId | val ) |
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)
EdgeId mrmeshpy.WholeEdgeMap.back | ( | self | ) |
EdgeId 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 | ) |
EdgeId mrmeshpy.WholeEdgeMap.data | ( | self | ) |
EdgeId mrmeshpy.WholeEdgeMap.data | ( | self | ) |
EdgeId mrmeshpy.WholeEdgeMap.emplace_back | ( | self | ) |
bool mrmeshpy.WholeEdgeMap.empty | ( | self | ) |
UndirectedEdgeId mrmeshpy.WholeEdgeMap.endId | ( | self | ) |
returns backId() + 1
EdgeId mrmeshpy.WholeEdgeMap.front | ( | self | ) |
EdgeId mrmeshpy.WholeEdgeMap.front | ( | self | ) |
int mrmeshpy.WholeEdgeMap.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
|
static |
|
static |
None mrmeshpy.WholeEdgeMap.pop_back | ( | self | ) |
None mrmeshpy.WholeEdgeMap.push_back | ( | self, | |
EdgeId | t ) |
None mrmeshpy.WholeEdgeMap.push_back | ( | self, | |
EdgeId | t ) |
None mrmeshpy.WholeEdgeMap.reserve | ( | self, | |
int | capacity ) |
None mrmeshpy.WholeEdgeMap.resize | ( | self, | |
int | newSize ) |
None mrmeshpy.WholeEdgeMap.resize | ( | self, | |
int | newSize, | ||
EdgeId | 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, | ||
EdgeId | value ) |
doubles reserved memory until resize(newSize, value) 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 ) |
|
staticprotected |