| Static Public Member Functions | |
| None | __init__ (*args, **kwargs) | 
| Vector_Graph_EndVertices_GraphEdgeId | operator (*args, **kwargs) | 
| Vector_Graph_EndVertices_GraphEdgeId | operator (*args, **kwargs) | 
| Static Public Attributes | |
| const_reference = Graph.EndVertices | |
| reference = Graph.EndVertices | |
| value_type = Graph.EndVertices | |
| Static Protected Attributes | |
| typing | _offsetof_vec_ = 0 | 
Generated from: MR::Vector<MR::Graph::EndVertices, MR::GraphEdgeId> Aliases: Graph.EndsPerEdge \\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_Graph_EndVertices_GraphEdgeId.__init__ | ( | self | ) | 
creates empty vector
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__init__ | ( | self, | |
| int | size ) | 
creates a vector with \\p size elements with default value
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__init__ | ( | self, | |
| int | size, | ||
| Graph.EndVertices | val ) | 
creates a vector with \\p size elements with the given value
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__init__ | ( | self, | |
| std_vector_Graph_EndVertices | vec ) | 
moves data from the given std::vector<T>
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__init__ | ( | self, | |
| Vector_Graph_EndVertices_GraphEdgeId | arg0 ) | 
Implicit copy constructor.
| bool mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__eq__ | ( | self, | |
| Vector_Graph_EndVertices_GraphEdgeId | b ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__getitem__ | ( | self, | |
| GraphEdgeId | i ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__getitem__ | ( | self, | |
| GraphEdgeId | i ) | 
| typing.Iterator[Graph.EndVertices] mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__iter__ | ( | self | ) | 
| bool mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__ne__ | ( | self, | |
| Vector_Graph_EndVertices_GraphEdgeId | b ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.__setitem__ | ( | self, | |
| GraphEdgeId | arg0, | ||
| Graph.EndVertices | arg1 ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.autoResizeAt | ( | self, | |
| GraphEdgeId | i ) | 
this accessor automatically adjusts the size of the vector
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.autoResizeSet | ( | self, | |
| GraphEdgeId | i, | ||
| Graph.EndVertices | val ) | 
sets the element #i to the given value, adjusting the size of the vector to include new element
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.autoResizeSet | ( | self, | |
| GraphEdgeId | pos, | ||
| int | len, | ||
| Graph.EndVertices | 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)
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.back | ( | self | ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.back | ( | self | ) | 
| GraphEdgeId mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.backId | ( | self | ) | 
returns the identifier of the back() element
| GraphEdgeId mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.beginId | ( | self | ) | 
returns the identifier of the first element
| int mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.capacity | ( | self | ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.clear | ( | self | ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.data | ( | self | ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.data | ( | self | ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.emplace_back | ( | self | ) | 
| bool mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.empty | ( | self | ) | 
| GraphEdgeId mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.endId | ( | self | ) | 
returns backId() + 1
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.front | ( | self | ) | 
| Graph.EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.front | ( | self | ) | 
| int mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.heapBytes | ( | self | ) | 
returns the amount of memory this object occupies on heap
| 
 | static | 
| 
 | static | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.pop_back | ( | self | ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.push_back | ( | self, | |
| Graph.EndVertices | t ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.push_back | ( | self, | |
| Graph.EndVertices | t ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.reserve | ( | self, | |
| int | capacity ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.resize | ( | self, | |
| int | newSize ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.resize | ( | self, | |
| int | newSize, | ||
| Graph.EndVertices | t ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.resizeWithReserve | ( | self, | |
| int | newSize ) | 
doubles reserved memory until resize(newSize) can be done without reallocation
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.resizeWithReserve | ( | self, | |
| int | newSize, | ||
| Graph.EndVertices | value ) | 
doubles reserved memory until resize(newSize, value) can be done without reallocation
| int mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.size | ( | self | ) | 
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.swap | ( | self, | |
| Vector_Graph_EndVertices_GraphEdgeId | b ) | 
| std_vector_Graph_EndVertices mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.vec_ | ( | self | ) | 
the user can directly manipulate the vector, anyway she cannot break anything
| None mrmeshpy.Vector_Graph_EndVertices_GraphEdgeId.vec_ | ( | self, | |
| std_vector_Graph_EndVertices | arg1 ) | 
| 
 | staticprotected | 
| 
 | static | 
| 
 | static | 
| 
 | static |