Enum GenericConTree 

pub enum GenericConTree {
    Normal(ConTree),
    LDS(ConTreeLds),
}

Either search behind one interface, chosen at run time.

Variants

Normal(ConTree)

The exhaustive search.

LDS(ConTreeLds)

The anytime search.

Implementations

impl GenericConTree

pub fn new( min_sup: usize, max_depth: usize, max_time: f64, max_error: usize, split_selection_strategy: PointSelector, max_gap: usize, use_heuristic: bool, fast_d2: bool, use_lds: bool, ) -> Self

Builds the anytime search when use_lds is set, the exhaustive one otherwise. The other arguments are those of ConTree::new.

pub fn with_budget_schedule(self, schedule: ScheduleKind) -> Self

Chooses the anytime search’s budget schedule. No effect on the exhaustive search, which has no budget.

pub fn fit(&mut self, dataset: &Dataset) -> Result<FitOutcome, SearchError>

Runs the search on dataset.

pub fn partial_fit(&mut self, view: &DataView<'_>) -> Result<bool, SearchError>

Runs one pass of the anytime search, returning whether it is done.

The exhaustive solver has no notion of a partial fit, so it runs to completion and reports that it is done.

pub fn stats(&self) -> Statistics

Counters of the last search.

pub fn status(&self) -> SearchStatus

Why the last search stopped.

pub fn tree(&mut self) -> Tree

The tree found by the last fit. Empty if fit has not run.