Struct CacheEntry 

pub struct CacheEntry { /* private fields */ }

What the search knows about one subproblem.

error is the best error found so far, an upper bound on the optimum; lower_bound is a proven lower bound. The two meet when the subproblem is solved.

Implementations

impl CacheEntry

pub fn new(item: usize) -> Self

An unsolved entry reached by item.

pub fn item(&self) -> usize

The item leading to this entry from its parent in the trie.

pub fn test(&self) -> usize

The feature tested at this node, usize::MAX if none.

pub fn error(&self) -> f64

Best error found so far.

pub fn upper_bound(&self) -> f64

Upper bound the subproblem was last solved under.

pub fn lower_bound(&self) -> f64

Proven lower bound on the error.

pub fn metric(&self) -> f64

Score used by searches that optimise another metric.

pub fn size(&self) -> usize

Number of instances in the subproblem.

pub fn leaf_error(&self) -> f64

Error of the subproblem as a leaf.

pub fn out(&self) -> f64

Prediction of the subproblem as a leaf.

pub fn is_optimal(&self) -> bool

Whether the subproblem is solved.

pub fn is_leaf(&self) -> bool

Whether the best subtree is a leaf.

pub fn has_valid_test(&self) -> bool

pub fn has_finite_error(&self) -> bool

pub fn has_finite_upper_bound(&self) -> bool

pub fn has_finite_leaf_error(&self) -> bool

Trait Implementations

impl Clone for CacheEntry

fn clone(&self) -> CacheEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for CacheEntry

impl Debug for CacheEntry

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

Formats the value using the given formatter.

impl Default for CacheEntry

fn default() -> Self

Returns the “default value” for a type.