Generated from class MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>. Base classes: Direct: (non-virtual) MR.AABBTreeChildEncoding This is the const half of the class.
More...
|
| virtual unsafe void | Dispose (bool disposing) |
|
| unsafe ref readonly MR.Box2f | box [get] |
| | bounding box of whole subtree
|
| unsafe ref readonly MR.NodeId | l [get] |
| | two children: each is either another node (non-negative id) or a leaf (encoded as negative number ~leafIndex)
|
| unsafe ref readonly MR.NodeId | r [get] |
| | two children: each is either another node (non-negative id) or a leaf (encoded as negative number ~leafIndex)
|
Generated from class MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>. Base classes: Direct: (non-virtual) MR.AABBTreeChildEncoding This is the const half of the class.
◆ Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f() [1/4]
| unsafe MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f |
( |
| ) |
|
|
inline |
Constructs an empty (default-constructed) instance.
◆ Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f() [2/4]
Generated from constructor MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>::AABBTreeNode.
◆ Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f() [3/4]
Generated from constructor MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>::AABBTreeNode.
◆ Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f() [4/4]
| unsafe MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f |
( |
MR.Const_NoInit | _1 | ) |
|
|
inline |
Generated from constructor MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>::AABBTreeNode.
◆ Dispose() [1/2]
| virtual void MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.Dispose |
( |
| ) |
|
|
inlinevirtual |
◆ Dispose() [2/2]
| virtual unsafe void MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.Dispose |
( |
bool | disposing | ) |
|
|
inlineprotectedvirtual |
◆ isLeaf()
| bool MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.isLeaf |
( |
MR.NodeId | child | ) |
|
|
inlinestatic |
returns true if given child of a node is a leaf rather than another node Generated from method MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>isLeaf.
◆ leafChild()
| MR.NodeId MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.leafChild |
( |
nuint | leafIndex | ) |
|
|
inlinestatic |
encodes given index in the vector of leaves as a child of a node Generated from method MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>leafChild.
◆ leafIndex()
| nuint MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.leafIndex |
( |
MR.NodeId | child | ) |
|
|
inlinestatic |
returns the index in the vector of leaves of the leaf encoded in given child of a node Generated from method MR::AABBTreeNode<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR.Box2f>>leafIndex.
◆ operator MR.Const_AABBTreeChildEncoding()
◆ __ref_storage_box
| unsafe MR.Box2f* MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.__ref_storage_box |
|
protected |
◆ __ref_storage_l
| unsafe MR.NodeId* MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.__ref_storage_l |
|
protected |
◆ __ref_storage_r
| unsafe MR.NodeId* MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.__ref_storage_r |
|
protected |
◆ box
| unsafe ref readonly MR.Box2f MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.box |
|
get |
bounding box of whole subtree
| unsafe ref readonly MR.NodeId MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.l |
|
get |
two children: each is either another node (non-negative id) or a leaf (encoded as negative number ~leafIndex)
| unsafe ref readonly MR.NodeId MR.Const_AABBTreeNode_MRAABBTreeTraitsMRUndirectedEdgeTagMRBox2f.r |
|
get |
two children: each is either another node (non-negative id) or a leaf (encoded as negative number ~leafIndex)
The documentation for this class was generated from the following file: