Static Public Member Functions | |
| None | __init__ (*args, **kwargs) |
Additional Inherited Members | |
| Static Public Attributes inherited from mrmeshpy.ConstVector_AABBTreeWideLeafTri | |
| ConstStdVector = Const_std_vector_AABBTreeWideLeafTri_Allocator_AABBTreeWideLeafTri | |
| Const_const_pointer = ConstAABBTreeWideLeafTri | |
| Const_const_reference = ConstAABBTreeWideLeafTri | |
| Const_pointer = ConstAABBTreeWideLeafTri | |
| Const_reference = ConstAABBTreeWideLeafTri | |
| Const_value_type = ConstAABBTreeWideLeafTri | |
| StdVector = std_vector_AABBTreeWideLeafTri_Allocator_AABBTreeWideLeafTri | |
| const_pointer = AABBTreeWideLeafTri | |
| const_reference = AABBTreeWideLeafTri | |
| pointer = AABBTreeWideLeafTri | |
| reference = AABBTreeWideLeafTri | |
| value_type = AABBTreeWideLeafTri | |
| Static Protected Attributes inherited from mrmeshpy.ConstVector_AABBTreeWideLeafTri | |
| typing | _offsetof_vec = 0 |
Generated from: MR::Vector<MR::AABBTreeWideLeafTri> Aliases: Vector_AABBTree_LeafTri Vector<T> is indexed by size_t
|
static |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__init__ | ( | self | ) |
creates empty vector
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__init__ | ( | self, | |
| int | size ) |
creates a vector with \\p size elements with default value
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__init__ | ( | self, | |
| int | size, | ||
| ConstAABBTreeWideLeafTri | val ) |
creates a vector with \\p size elements with the given value
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__init__ | ( | self, | |
| list | arg0 ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__init__ | ( | self, | |
| ConstVector_AABBTreeWideLeafTri | arg0 ) |
Implicit copy constructor.
| ConstAABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.__getitem__ | ( | ConstVector_AABBTreeWideLeafTri | self, |
| int | i ) |
| AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.__getitem__ | ( | self, | |
| int | i ) |
| typing.Iterator[ConstAABBTreeWideLeafTri] mrmeshpy.Vector_AABBTreeWideLeafTri.__iter__ | ( | ConstVector_AABBTreeWideLeafTri | self | ) |
| typing.Iterator[AABBTreeWideLeafTri] mrmeshpy.Vector_AABBTreeWideLeafTri.__iter__ | ( | self | ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.__setitem__ | ( | self, | |
| int | arg0, | ||
| ConstAABBTreeWideLeafTri | arg1 ) |
| Vector_AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.assign | ( | self, | |
| ConstVector_AABBTreeWideLeafTri | other ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.assign | ( | self, | |
| int | count, | ||
| ConstAABBTreeWideLeafTri | val ) |
replaces the contents with \\p count copies of \\p val
| AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.autoResizeAt | ( | self, | |
| int | i ) |
this accessor automatically adjusts the size of the vector
| None mrmeshpy.Vector_AABBTreeWideLeafTri.autoResizeSet | ( | self, | |
| int | i, | ||
| ConstAABBTreeWideLeafTri | val ) |
sets the element i to the given value, adjusting the size of the vector to include new element
| None mrmeshpy.Vector_AABBTreeWideLeafTri.autoResizeSet | ( | self, | |
| int | pos, | ||
| int | len, | ||
| ConstAABBTreeWideLeafTri | 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)
| ConstAABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.back | ( | ConstVector_AABBTreeWideLeafTri | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.back | ( | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| None mrmeshpy.Vector_AABBTreeWideLeafTri.clear | ( | self | ) |
| ConstAABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.data | ( | ConstVector_AABBTreeWideLeafTri | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.data | ( | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| ConstAABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.front | ( | ConstVector_AABBTreeWideLeafTri | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.front | ( | self | ) |
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| None mrmeshpy.Vector_AABBTreeWideLeafTri.pop_back | ( | self | ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.push_back | ( | self, | |
| AABBTreeWideLeafTri | t ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.push_back | ( | self, | |
| ConstAABBTreeWideLeafTri | t ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.reserve | ( | self, | |
| int | capacity ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.resize | ( | self, | |
| int | newSize ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.resize | ( | self, | |
| int | newSize, | ||
| ConstAABBTreeWideLeafTri | t ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.resizeWithReserve | ( | self, | |
| int | newSize ) |
same as resize(newSize), which already grows the capacity geometrically
| None mrmeshpy.Vector_AABBTreeWideLeafTri.resizeWithReserve | ( | self, | |
| int | newSize, | ||
| ConstAABBTreeWideLeafTri | value ) |
same as resize(newSize, value), which already grows the capacity geometrically
| None mrmeshpy.Vector_AABBTreeWideLeafTri.shrink_to_fit | ( | self | ) |
| None mrmeshpy.Vector_AABBTreeWideLeafTri.swap | ( | self, | |
| Vector_AABBTreeWideLeafTri | b ) |
| std_vector_AABBTreeWideLeafTri_Allocator_AABBTreeWideLeafTri mrmeshpy.Vector_AABBTreeWideLeafTri.vec | ( | self | ) |
The user can directly manipulate the vector, they can't break anything anyway.
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.
| None mrmeshpy.Vector_AABBTreeWideLeafTri.vec | ( | self, | |
| Const_std_vector_AABBTreeWideLeafTri_Allocator_AABBTreeWideLeafTri | arg1 ) |
The user can directly manipulate the vector, they can't break anything anyway.
Reimplemented from mrmeshpy.ConstVector_AABBTreeWideLeafTri.