Struct CARTree

Source

pub struct CARTree { /* private fields */ }

Expand description

The model for a decision tree backed by the CART algorithm. A binary tree.

Implementations§

Source §

impl CARTree

Source

pub fn predict(&self, x: &[f64]) -> u64

Given a vector of x values, predict the corresponding category. Requires that the decision tree has already been fit.

§In Review

Should this method potentially take a reference as opposed to ownership?

Source

pub fn fit(x: &[Vec<f64>], y: &[u64], params: DTParameters) -> CARTree

let x1 = vec![0.0, 1.0, 2.0];
let x2 = vec![2.0, 1.0, 0.0];
let x = vec![x1, x2];
// In this case, x[0] == x1 && x[0][2] == 2.0

Auto Trait Implementations§

§

impl UnwindSafe for CARTree

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §