pub trait DTrees_SplitTraitConst {
// Required method
fn as_raw_DTrees_Split(&self) -> *const c_void;
// Provided methods
fn var_idx(&self) -> i32 { ... }
fn inversed(&self) -> bool { ... }
fn quality(&self) -> f32 { ... }
fn next(&self) -> i32 { ... }
fn c(&self) -> f32 { ... }
fn subset_ofs(&self) -> i32 { ... }
}
Expand description
Constant methods for crate::ml::DTrees_Split
Required Methods§
fn as_raw_DTrees_Split(&self) -> *const c_void
Provided Methods§
Sourcefn inversed(&self) -> bool
fn inversed(&self) -> bool
If true, then the inverse split rule is used (i.e. left and right branches are exchanged in the rule expressions below).
Sourcefn quality(&self) -> f32
fn quality(&self) -> f32
The split quality, a positive number. It is used to choose the best split.
Sourcefn c(&self) -> f32
fn c(&self) -> f32
< The threshold value in case of split on an ordered variable. The rule is:
if var_value < c
then next_node <- left
else next_node <- right
Sourcefn subset_ofs(&self) -> i32
fn subset_ofs(&self) -> i32
< Offset of the bitset used by the split on a categorical variable. The rule is:
if bitset[var_value] == 1
then next_node <- left
else next_node <- right