Struct CompactTreeNode 

pub struct CompactTreeNode {
    pub packed_data: u64,
    pub value: f32,
    pub left_child: u32,
    pub right_child: u32,
}

Compact tree node representation for memory efficiency

Fields

packed_data: u64

Compact node data packed into a single u64 Bits 0-15: feature index (16 bits, max 65535 features) Bits 16-47: threshold as f32 bits (32 bits) Bits 48-63: node flags and metadata (16 bits)

value: f32

Prediction value for leaf nodes or impurity for split nodes

left_child: u32

Left child index (0 means no left child)

right_child: u32

Right child index (0 means no right child)

Implementations

impl CompactTreeNode

pub fn new_leaf(prediction: f64) -> Self

Create a new leaf node

pub fn new_split(feature_idx: u16, threshold: f32, impurity: f64) -> Self

Create a new split node

pub fn is_leaf(&self) -> bool

Check if this is a leaf node

pub fn feature_idx(&self) -> u16

Get feature index for split nodes

pub fn threshold(&self) -> f32

Get threshold for split nodes

pub fn prediction(&self) -> f64

Get prediction value for leaf nodes

pub fn impurity(&self) -> f64

Get impurity value for split nodes

pub fn set_left_child(&mut self, child_idx: u32)

Set left child index

pub fn set_right_child(&mut self, child_idx: u32)

Set right child index

Trait Implementations

impl Clone for CompactTreeNode

fn clone(&self) -> CompactTreeNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompactTreeNode

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

Formats the value using the given formatter.