Struct SmallSplitMonitor 

struct SmallSplitMonitor<'a, const N: usize> {
    kambe: Option<SmallSplitKambe>,
    largest: Cell<Rounding<N>>,
    early: bool,
    running: Cell<Rounding<N>>,
    automatic_sum: OnceCell<Option<Jet<N>>>,
    automatic_split: AutomaticSplit<'a>,
    checked: &'a Checked<N>,
}

The real-space terms below every automatic split: the Kambe integrals that keep their rounding below that of the largest term so far, and the early failure of complete sums (EARLY_FAILURE_LOSS).

Fields

kambe: Option<SmallSplitKambe>

The Kambe integrals of the real-space terms below every automatic split, except for the split derivative.

largest: Cell<Rounding<N>>

The largest moduli of the value and derivatives of a real-space term so far, whose rounding the closed forms of the later terms may reach.

early: bool

Whether the sum fails early once the rounding its real-space terms predict is hopeless.

running: Cell<Rounding<N>>

The rounding the real-space terms predict so far.

automatic_sum: OnceCell<Option<Jet<N>>>

The sum at the automatic split, on whose scales the sum fails early, evaluated once; None where it fails.

automatic_split: AutomaticSplit<'a>

checked: &'a Checked<N>

Implementations

impl<'a, const N: usize> SmallSplitMonitor<'a, N>

fn new( kambe: Option<SmallSplitKambe>, early: bool, automatic_split: AutomaticSplit<'a>, checked: &'a Checked<N>, ) -> Self

fn add_to_running(&self, term: &Jet<N>, bound: Rounding<N>) -> Result<()>

With Self::early, adds the rounding of the real-space term term and its bound bound to the running rounding and checks whether it is hopeless.

fn hopeless(&self, bound: &Rounding<N>) -> Result<()>

Fails where the rounding bound exceeds EARLY_FAILURE_LOSS of the scale of a checked component of the sum at the automatic split.