Struct KdNode 

#[repr(C)]
pub struct KdNode {
    pub split_axis: u8,
    pub _pad: [u8; 3],
    pub point_index: u32,
    pub left: u32,
    pub right: u32,
    pub parent: u32,
    pub bbox_min: [f32; 3],
}

kd-tree node: 32 bytes, repr(C), naturally aligned.

offset  size  field
0       4     split_axis:u8 + padding[3]
4       4     point_index:u32      (index into the original point array)
8       4     left:u32             (left child node index, or INVALID_INDEX)
12      4     right:u32            (right child node index, or INVALID_INDEX)
16      4     parent:u32
20      12    bbox_min:[f32;3]     (tight bbox of this subtree)

For 2D trees, z components are zero.

Fields

split_axis: u8

_pad: [u8; 3]

point_index: u32

left: u32

right: u32

parent: u32

bbox_min: [f32; 3]

Trait Implementations

impl Clone for KdNode

fn clone(&self) -> KdNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for KdNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for KdNode

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for KdNode

fn eq(&self, other: &KdNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Zeroable for KdNode

fn zeroed() -> Self

Calls zeroed.

impl Copy for KdNode

impl Pod for KdNode

impl StructuralPartialEq for KdNode