Struct LeafData 

pub struct LeafData {
    pub point_idx: usize,
    pub parent: Option<NodeRef>,
    pub mass: u64,
}

Raw leaf-node record. Lives inline in the crate::NodeStore leaf arena — one entry per live leaf. Kept small (no bounding box, no cut) so the leaf arena fits many entries per cache line. Before the v4 split the leaf arena stored the full Node<D> enum with its internal-variant shape, wasting ~300 bytes per leaf at D = 16.

Fields

point_idx: usize

Index into the forest point store.

parent: Option<NodeRef>

Parent reference (None only when the tree contains a single leaf at the root).

mass: u64

Number of stored copies of this point. Always >= 1.

Trait Implementations

impl Clone for LeafData

fn clone(&self) -> LeafData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LeafData

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LeafData

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for LeafData

fn eq(&self, other: &LeafData) -> 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 Serialize for LeafData

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for LeafData

impl Eq for LeafData

impl StructuralPartialEq for LeafData