Enum RootKind

pub enum RootKind {
    Simple,
    Unresolved {
        max_count: usize,
    },
}

How certain a reported root is.

Variants

Simple

The polynomial is monotone on [lower, upper] and its sign certifiably changes across it: exactly one simple root lies inside.

Unresolved

|p| is within its rounding bound near x. Between zero and max_count roots, counted with multiplicity, lie in [lower, upper]: a multiple root, a cluster, or a near-touch that f64 evaluation cannot tell apart. A root at an end of the searched interval is reported this way, with max_count 1, since it may lie just outside.

Fields

max_count: usize

Most roots the region can hold (by Rolle’s theorem: one more than the critical points inside it).

Trait Implementations

impl Clone for RootKind

fn clone(&self) -> RootKind

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for RootKind

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

Formats the value using the given formatter.

impl PartialEq for RootKind

fn eq(&self, other: &RootKind) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for RootKind

impl Eq for RootKind

impl StructuralPartialEq for RootKind