Struct CompactTree 

pub struct CompactTree {
    pub nodes: Vec<CompactTreeNode>,
    pub feature_importances: Vec<f32>,
    pub n_features: usize,
    pub depth: usize,
}

Compact tree representation for memory efficiency

Fields

nodes: Vec<CompactTreeNode>

Array of compact tree nodes

feature_importances: Vec<f32>

Feature importance scores

n_features: usize

Number of features

depth: usize

Tree depth

Implementations

impl CompactTree

pub fn new(n_features: usize) -> Self

Create a new compact tree

pub fn add_node(&mut self, node: CompactTreeNode) -> u32

Add a new node and return its index

pub fn predict_single(&self, sample: &[f64]) -> Result<f64>

Predict a single sample

pub fn predict(&self, x: &Array2<f64>) -> Result<Array1<f64>>

Predict multiple samples

pub fn memory_usage(&self) -> usize

Calculate memory usage in bytes

pub fn n_nodes(&self) -> usize

Get the number of nodes in the tree

pub fn n_leaves(&self) -> usize

Get the number of leaves in the tree

Trait Implementations

impl Clone for CompactTree

fn clone(&self) -> CompactTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompactTree

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

Formats the value using the given formatter.