pub(crate) struct Compensated {
pub(crate) p: [f64; 4],
pub(crate) s: [f64; 4],
pub(crate) e: [f64; 4],
}Expand description
The state of Algorithm C: the lanes p_k, s_k, e_k.
Fields§
§p: [f64; 4]§s: [f64; 4]§e: [f64; 4]Implementations§
Source§impl Compensated
impl Compensated
Sourcepub(crate) fn push(&mut self, i: usize, h: f64, r: f64)
pub(crate) fn push(&mut self, i: usize, h: f64, r: f64)
Step C2 for the term h + r (r = 0 for a sum) of element i.
Sourcepub(crate) fn result(&self) -> DoubleDouble
pub(crate) fn result(&self) -> DoubleDouble
Steps C3 and C4: the result r.
Sourcepub(crate) fn result_with_bound(&self, n: usize) -> (DoubleDouble, f64)
pub(crate) fn result_with_bound(&self, n: usize) -> (DoubleDouble, f64)
Steps C3–C5 for n elements: the result r and the bound β.
Trait Implementations§
Source§impl Clone for Compensated
impl Clone for Compensated
impl Copy for Compensated
Auto Trait Implementations§
impl Freeze for Compensated
impl RefUnwindSafe for Compensated
impl Send for Compensated
impl Sync for Compensated
impl Unpin for Compensated
impl UnsafeUnpin for Compensated
impl UnwindSafe for Compensated
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