pub enum Skipping {
Auto,
On,
Off,
}Expand description
Whether the search skips thresholds: the interval pruner, and the skipping and early stops of the depth-2 solver’s scan.
Skipping assumes what misclassification guarantees: moving n instances
into a leaf never lowers its cost and raises it by at most n, and
removing them never raises it and lowers it by at most n. A custom loss
may not, so Auto turns skipping off for one. On forces it, and the
depth-2 solver then counts the moves that break the assumption.
With a minimum support above 1 the interval pruner stays off whatever the
setting, since its rules do not hold there for any loss; On then forces
only the depth-2 solver’s skipping, whose argument does not involve the
support.
Variants§
Implementations§
Trait Implementations§
impl Copy for Skipping
impl Eq for Skipping
impl StructuralPartialEq for Skipping
Auto Trait Implementations§
impl Freeze for Skipping
impl RefUnwindSafe for Skipping
impl Send for Skipping
impl Sync for Skipping
impl Unpin for Skipping
impl UnsafeUnpin for Skipping
impl UnwindSafe for Skipping
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more