Struct TreeNode

pub struct TreeNode<F, L> { /* private fields */ }

A node in the decision tree

Implementations

impl<F: Float, L: Label + Debug> TreeNode<F, L>

pub fn is_leaf(&self) -> bool

Returns true if the node has no children

pub fn depth(&self) -> usize

Returns the depth of the node in the decision tree

pub fn prediction(&self) -> Option<L>

Returns Some(prediction) for leaf nodes and None for internal nodes.

pub fn children(&self) -> Vec<&Option<Box<TreeNode<F, L>>>>

Returns both children, first left then right

pub fn split(&self) -> (usize, F, F)

Return the split (feature index, value) and its impurity decrease

pub fn feature_name(&self) -> Option<&String>

Returns the name of the feature used in the split if the node is internal, None otherwise

Trait Implementations

impl<F: Clone, L: Clone> Clone for TreeNode<F, L>

fn clone(&self) -> TreeNode<F, L>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Debug, L: Debug> Debug for TreeNode<F, L>

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

Formats the value using the given formatter.

impl<F: Float, L: Label> Hash for TreeNode<F, L>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<F, L> PartialEq for TreeNode<F, L>

fn eq(&self, other: &Self) -> 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<F, L> Eq for TreeNode<F, L>